Percolation theory and computing with faulty arrays of processors

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn Part F129721, Issue , 1992, Pages 100-103

  Mathies, Thomas R ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESH GENERATION; PERCOLATION (SOLID STATE); PROBABILITY; SOLVENTS;

CONNECTED ARRAYS; HIGH PROBABILITY; PERCOLATION THEORY; ZERO-ONE;

COMPUTATION THEORY;

EID: 85031727532     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. M. Aizenman, J. T. Chaves, L. Chayes, J. Fröhlich, and L. Russe On a sharp transition from area law to perimeter law in a system of random surfaces. Communications in Mathematical Physics, 92:19-69, 1983.
2. Geoffrey Grimmett. Percolation. Springer-Verlag, 1989.
3. C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, and A. Tsantilas. Asymptotically tight bounds for computing with faulty arrays of processors. In Twenty Second Annual Symp. on Theory of Computing, pages 285-296, 1990.
4. H.Kesten. The critical probability of bond percolation on the square lattice equals j. Communications in Mathematical Physics, 71:41-59, 1980.
5. Prabhakar Raghavan. Robust algorithms for packet routing in a mesh. In 1989 ACM Symp. on Parallel Algorithms and Architectures, pages 344-350, 1989.
6. L. Russo. On the critical percolation probabilities. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete, 56:229-237, 1981.
7. D. Stauffer. Introduction to Percolation Theory. Taylor and Francis, 1985.