Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="MacKenzie, Philip D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Contention resolution with constant expected delay
Leslie Ann Goldberg
,
Philip D. Mackenzie
,
Mike Paterson
,
Aravind Srinivasan
Journal of the ACM
47
(6), 2000, pp. 1048-1096
Analysis of practical backoff protocols for contention resolution with multiple servers
Leslie Ann Goldberg
,
Philip D. MacKenzie
Journal of Computer and System Sciences
58
(1), 1999, pp. 232-258
Robust efficient distributed RSA-key generation
Yair Frankel
,
Philip D. MacKenzie
,
Moti Yung
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 663-672
An
\Omega(\sqrt{\log\log n})
lower bound for routing in optical networks
Leslie Ann Goldberg
,
Mark Jerrum
,
Philip D. MacKenzie
SIAM Journal on Computing
27
(4), 1998, pp. 1083-1098
Computational bounds for fundamental problems on general-purpose parallel models
Philip D. MacKenzie
,
Vijaya Ramachandran
Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'98 (Puerto Vallarta, Mexico, June 28 - July 2, 1998)
, 1998, pp. 152-163
ERCW PRAMs and optical communication
Philip D. MacKenzie
,
Vijaya Ramachandran
Theoretical Computer Science
196
(1-2), 1998, pp. 153-180
Ultrafast expected time parallel algorithms
Philip D. MacKenzie
,
Quentin F. Stout
Journal of Algorithms
26
(1), 1998, pp. 1-33
Optimal-resilience proactive public-key cryptosystems
Yair Frankel
,
Peter Gemmell
,
Philip D. MacKenzie
,
Moti Yung
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 384-393
Contention resolution with guaranteed constant expected delay
Leslie Ann Goldberg
,
Philip D. MacKenzie
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97 (Miami Beach, Florida, October 20-22, 1997)
, 1997, pp. 213-222
The random adversary: A lower-bound technique for randomized parallel algorithms
Philip D. MacKenzie
SIAM Journal on Computing
26
(6), 1997, pp. 1559-1580
Analysis of practical backoff protocols for contention resolution with multiple servers
Leslie Ann Goldberg
,
Philip D. MacKenzie
Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96 (Atlanta, Georgia, January 28-30, 1996)
, 1996, pp. 554-563
ERCW PRAMs and optical communication
Philip D. MacKenzie
,
Vijaya Ramachandran
Lecture Notes in Computer Science
1124
, 1996, pp. 293-302
A separation between reconfigurable mesh models
Philip D. MacKenzie
Parallel Processing Letters
5
(1), 1995, pp. 15-22
Lower bounds for randomized exclusive write PRAMs
Philip D. MacKenzie
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'95 (Santa Barbara, California, July 17-19, 1995)
, 1995, pp. 254-263
A lower bound for the QRQW PRAM
Philip D. MacKenzie
Proceedings of the seventh IEEE Symposium on Parallel and Distributed Processing (San Antonio, Texas, October 25 - 28, 1995)
, 1995, pp. 231-237
An
\Omega (\sqrt {\log \log n})
lower bound for routing in optical networks
Leslie Ann Goldberg
,
Mark Jerrum
,
Philip D. MacKenzie
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'94 (Cape May, New Jersey, June 27-29, 1994)
, 1994, pp. 147-156
Optimal parallel construction of hamiltonian cycles and spanning trees in random graphs (preliminary version)
Philip D. MacKenzie
,
Quentin F. Stout
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'93 (Velen, Germany, June 30 - July 2, 1993)
, 1993, pp. 224-229
A separation between reconfigurable mesh models
Philip D. MacKenzie
Proceedings of the 7th International Parallel Processing Symposium, IPPS'93 (Newport Beach, California, April 13-16, 1993)
, 1993, pp. 84-88
A lower bound for order-preserving broadcast in the postal model
Philip D. Mackenzie
Parallel Processing Letters
3
(4), 1993, pp. 313-320
Load balancing requires
\Omega(log^*n)
expected time
Philip D. MacKenzie
Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92 (Orlando, Florida, January 27-29, 1992)
, 1992, pp. 94-99
Ultra-fast expected time parallel algorithms
Philip D. MacKenzie
,
Quentin F. Stout
Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91 (San Francisco, California, January 28-30, 1991)
, 1991, pp. 414-424