Coding for interactive communication
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao,et al. The entropic limitations on VLSI computations(Extended Abstract) , 1981, STOC '81.
[2] 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.
[3] Péter Gács,et al. Reliable computation with cellular automata , 1983, J. Comput. Syst. Sci..
[4] E. T.. An Introduction to the Theory of Numbers , 1946, Nature.
[5] Leonard J. Y. Schulman,et al. Communication in the presence of noise , 1992 .
[6] C. Thomborson,et al. Area-time complexity for VLSI , 1979, STOC.
[7] Leonard J. Schulman,et al. A coding theorem for distributed computation , 1994, STOC '94.
[8] 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.
[9] Leonard J. Schulman,et al. Signal propagation, with application to a lower bound on the depth of noisy formulas , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[10] Nicholas Pippenger,et al. On networks of noisy gates , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[11] Jørn Justesen,et al. Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.
[12] J. von Neumann,et al. Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .
[13] Axthonv G. Oettinger,et al. IEEE Transactions on Information Theory , 1998 .
[14] W. W. Peterson,et al. On Codes for Checking Logical Operations , 1959, IBM J. Res. Dev..
[15] Barney. Reiffen,et al. Sequential encoding and decoding for the discrete memoryless channel , 1960 .
[16] L. Schulman. Coding for interactive communication , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[17] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[18] Péter Gács,et al. A Simple Three-Dimensional Real-Time Reliable Cellular Array , 1988, J. Comput. Syst. Sci..
[19] John M. Wozencraft,et al. Sequential decoding for reliable communication , 1957 .
[20] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .
[21] Leonard J. Schulman,et al. Communication on noisy channels: a coding theorem for computation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[22] Nicholas Pippenger,et al. Reliable computation by formulas in the presence of noise , 1988, IEEE Trans. Inf. Theory.
[23] Claude E. Shannon,et al. Two-way Communication Channels , 1961 .
[24] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[25] Richard J. Lipton,et al. Lower bounds for VLSI , 1981, STOC '81.
[26] Robert G. Gallager,et al. Finding parity in a simple broadcast network , 1988, IEEE Trans. Inf. Theory.
[27] Michael G. Taylor. Reliable information storage in memories designed from unreliable components , 1968 .
[28] Tomás Feder,et al. Reliable computation by networks in the presence of noise , 1989, IEEE Trans. Inf. Theory.
[29] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[30] Robert Mario Fano,et al. A heuristic discussion of probabilistic decoding , 1963, IEEE Trans. Inf. Theory.
[31] Leonard J. Schulman,et al. Deterministic coding for interactive communication , 1993, STOC.