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
[1]
Hilfe
Suche: Author="Gemmell, Peter"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
Symmetry breaking in anonymous networks: Characterizations
Paolo Boldi
,
Shella Shammah
,
Sebastiano Vigna
,
Bruno Codenotti
,
Peter Gemmell
,
Janos Simon
Proceedings of the 4th Israel Symposium on Theory of Computing and Systems, ISTCS'96 (Jerusalem, Israel, June 10-12, 1996)
, 1996, pp. 16-26
Witness-based cryptographic program checking and robust function sharing
Yair Frankel
,
Peter Gemmell
,
Moti Yung
Proceedings of the 28th Annual ACM Symposium on Theory of Computing (Philadelphia, Pennsylvania, May 22-24, 1996)
, 1996, pp. 499-508
Self-correcting for function fields of finite transcendental degree
Manuel Blum
,
Bruno Codenotti
,
Peter Gemmell
,
Troy Shahoumian
Lecture Notes in Computer Science
944
, 1995, pp. 547-557
Trustee-based tracing extensions to anonymous cash and the making of anonymous change
Ernie Brickell
,
Peter Gemmell
,
David Kravitz
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 457-466
Average circuit depth and average communication complexity
Bruno Codenotti
,
Peter Gemmell
,
Janos Simon
Lecture Notes in Computer Science
979
, 1995, pp. 102-112
Selection in the presence of noise: The design of playoff systems
Micah Adler
,
Peter Gemmell
,
Mor Harchol-Balter
,
Richard M. Karp
,
Claire Kenyon
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 564-572
Tight bounds on expected time to add correctly and add mostly correctly
Peter Gemmell
,
Mor Harchol
Information Processing Letters
49
, 1994, pp. 77-83
Highly resilient correctors for polynomials
Peter Gemmell
,
Madhu Sudan
Information Processing Letters
43
, 1992, pp. 169-174
Checking the correctness of memories
Manuel Blum
,
Will Evans
,
Peter Gemmell
,
Sampath Kannan
,
Moni Naor
Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'91 (San Juan, Puerto Rico, October 1-4, 1991)
, 1991, pp. 90-99