☰

Eric Ruppert, Ph.D. - Publications

Affiliations: 
2000 University of Toronto, Toronto, ON, Canada 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

15 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2011 Delporte-Gallet C, Fauconnier H, Guerraoui R, Kermarrec AM, Ruppert E, Tran-The H. Byzantine agreement with homonyms Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 21-30. DOI: 10.1007/S00446-013-0190-3  0.364
2007 Ellen F, Fatourou P, Ruppert E. Time lower bounds for implementations of multi-writer snapshots Journal of the Acm. 54. DOI: 10.1145/1314690.1314694  0.503
2007 Ellen F, Fatourou P, Ruppert E. The space complexity of unbounded timestamps Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4731: 223-237. DOI: 10.1007/S00446-008-0060-6  0.376
2007 Guerraoui R, Ruppert E. Anonymous and fault-tolerant shared-memory computing Distributed Computing. 20: 165-177. DOI: 10.1007/S00446-007-0042-0  0.477
2007 Angluin D, Aspnes J, Eisenstat D, Ruppert E. The computational power of population protocols Distributed Computing. 20: 279-304. DOI: 10.1007/S00446-007-0040-2  0.351
2006 Aspnes J, Fich F, Ruppert E. Relationships between broadcast and shared memory in reliable anonymous distributed systems Distributed Computing. 18: 209-219. DOI: 10.1007/S00446-005-0145-4  0.596
2006 Fatourou P, Fich FE, Ruppert E. Time-space tradeoffs for implementations of snapshots Proceedings of the Annual Acm Symposium On Theory of Computing. 2006: 169-178.  0.646
2005 Guerraoui R, Ruppert E. What can be implemented anonymously? Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3724: 244-259. DOI: 10.1007/11561927_19  0.38
2003 Fich F, Ruppert E. Hundreds of impossibility results for distributed computing Distributed Computing. 16: 121-163. DOI: 10.1007/S00446-003-0091-Y  0.612
2003 Fatourou P, Fich F, Ruppert E. A tight time lower bound for space-optimal implementations of multi-writer snapshots Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 259-268.  0.634
2002 Fatourou P, Fich F, Ruppert E. Space-optimal multi-writer snapshot objects are slow Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 13-20.  0.616
2000 Ruppert E. Determining consensus numbers Siam Journal On Computing. 30: 1156-1168. DOI: 10.1137/S0097539797329439  0.357
2000 Fich F, Ruppert E. Lower bounds in distributed computing Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1914: 1-28. DOI: 10.1007/3-540-40026-5_1  0.576
1999 Ruppert E. Consensus numbers of transactional objects Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1693: 312-326.  0.31
1997 Ruppert E. Finding the k shortest paths in parallel Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1200: 475-486. DOI: 10.1007/S004530010038  0.313
Show low-probability matches.