Computation in noisy radio networks
暂无分享,去创建一个
[1] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .
[2] J. von Neumann,et al. Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .
[3] S. M. Samuels,et al. Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation , 1968 .
[4] Michael G. Taylor. Reliable information storage in memories designed from unreliable components , 1968 .
[5] L. Gleser. On the Distribution of the Number of Successes in Independent Trials , 1975 .
[6] Nicholas Pippenger,et al. On networks of noisy gates , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[7] Imrich Chlamtac,et al. On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.
[8] Péter Gács,et al. Reliable computation with cellular automata , 1983, J. Comput. Syst. Sci..
[9] Imrich Chlamtac,et al. Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.
[10] Robert G. Gallager,et al. Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.
[11] Eli Upfal,et al. Computing with unreliable information , 1990, STOC '90.
[12] Noga Alon,et al. A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..
[13] Anna Gál,et al. Lower bounds for the complexity of reliable Boolean circuits with noisy gates , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[14] Rüdiger Reischuk,et al. Reliable computation with noisy circuits and decision trees-a general n log n lower bound , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[15] Imrich Chlamtac,et al. The wave expansion approach to broadcasting in multihop radio networks , 1991, IEEE Trans. Commun..
[16] Leonard J. Schulman,et al. Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[17] Reuven Bar-Yehuda,et al. On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..
[18] Noga Alon,et al. Single Round Simulation on Radio Networks , 1992, J. Algorithms.
[19] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.
[20] Philippe Flajolet,et al. An introduction to the analysis of algorithms , 1995 .
[21] Yishay Mansour,et al. Broadcast in radio networks , 1995, SODA '95.
[22] William S. Evans,et al. Lower bounds for noisy Boolean decision trees , 1996, STOC '96.
[23] Daniel A. Spielman,et al. Highly fault-tolerant parallel computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[24] C. SIAMJ.. AN Ω(D log(N/D)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS∗ , 1998 .
[25] Eyal Kushilevitz,et al. An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..