Author of the publication

LogP: Towards a Realistic Model of Parallel Computation

, , , , , , , and . Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, page 1--12. (May 1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A scalable content-addressable network, , , , and . SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, page 161--172. New York, NY, USA, ACM, (2001)A Scalable Content Addressable Network, , , , and . TR-00-010. University of California, Berkeley, Berkeley, CA, (2000)LogP: Towards a Realistic Model of Parallel Computation, , , , , , , and . Proceedings of the Fourth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, page 1--12. (May 1993)Near-Optimal Solutions to a 2-Dimensional Placement Problem., , and . SIAM J. Comput., 4 (3): 271-286 (1975)Physical Mapping of Chromosomes Using Unique Probes., , , and . SODA, page 489-500. ACM/SIAM, (1994)A Randomized Parallel Branch-and-Bound Procedure, and . STOC, page 290-300. ACM, (1988)Rapid Identification of Repeated Patterns in Strings, Trees and Arrays, , and . STOC, page 125-136. ACM, (1972)Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines.. J. ACM, 14 (3): 478-489 (1967)On Parallel Evaluation of Game Trees., and . J. ACM, 45 (6): 1050-1075 (1998)Probabilistic Recurrence Relations.. J. ACM, 41 (6): 1136-1150 (1994)