 | 2009 |
|---|
| 31 |       | Rachid Guerraoui,
Eric Ruppert:
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures.
ICALP (2) 2009: 484-495 |
| 2008 |
|---|
| 30 | | Hagit Attiya,
Rachid Guerraoui,
Eric Ruppert:
Partial snapshot objects.
SPAA 2008: 336-343 |
| 29 | | Eric Ruppert:
Implementing Shared Registers in Asynchronous Message-Passing Systems.
Encyclopedia of Algorithms 2008 |
| 28 | | Eric Ruppert:
Snapshots in Shared Memory.
Encyclopedia of Algorithms 2008 |
| 27 | | Faith Ellen,
Panagiota Fatourou,
Eric Ruppert:
The space complexity of unbounded timestamps.
Distributed Computing 21(2): 103-115 (2008) |
| 2007 |
|---|
| 26 | | Faith Ellen,
Panagiota Fatourou,
Eric Ruppert:
The Space Complexity of Unbounded Timestamps.
DISC 2007: 223-237 |
| 25 | | Carole Delporte-Gallet,
Hugues Fauconnier,
Rachid Guerraoui,
Eric Ruppert:
Secretive Birds: Privacy in Population Protocols.
OPODIS 2007: 329-342 |
| 24 | | Eric Ruppert:
The Anonymous Consensus Hierarchy and Naming Problems.
OPODIS 2007: 386-400 |
| 23 | | Rachid Guerraoui,
Eric Ruppert:
Anonymous and fault-tolerant shared-memory computing.
Distributed Computing 20(3): 165-177 (2007) |
| 22 | | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols.
Distributed Computing 20(4): 279-304 (2007) |
| 21 | | Faith Ellen,
Panagiota Fatourou,
Eric Ruppert:
Time lower bounds for implementations of multi-writer snapshots.
J. ACM 54(6): (2007) |
| 2006 |
|---|
| 20 |  | Eric Ruppert,
Dahlia Malkhi:
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006
ACM 2006 |
| 19 | | Carole Delporte-Gallet,
Hugues Fauconnier,
Rachid Guerraoui,
Eric Ruppert:
When Birds Die: Making Population Protocols Fault-Tolerant.
DCOSS 2006: 51-66 |
| 18 | | Panagiota Fatourou,
Faith Ellen Fich,
Eric Ruppert:
Time-space tradeoffs for implementations of snapshots.
STOC 2006: 169-178 |
| 17 | | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
The computational power of population protocols
CoRR abs/cs/0608084: (2006) |
| 16 | | James Aspnes,
Faith Ellen Fich,
Eric Ruppert:
Relationships between broadcast and shared memory in reliable anonymous distributed systems.
Distributed Computing 18(3): 209-219 (2006) |
| 2005 |
|---|
| 15 | | Rachid Guerraoui,
Eric Ruppert:
What Can Be Implemented Anonymously?
DISC 2005: 244-259 |
| 14 | | Dana Angluin,
James Aspnes,
David Eisenstat,
Eric Ruppert:
On the Power of Anonymous One-Way Communication.
OPODIS 2005: 396-411 |
| 2004 |
|---|
| 13 | | James Aspnes,
Faith Ellen Fich,
Eric Ruppert:
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems.
DISC 2004: 260-274 |
| 12 | | Mikhail Fomitchev,
Eric Ruppert:
Lock-free linked lists and skip lists.
PODC 2004: 50-59 |
| 2003 |
|---|
| 11 | | Panagiota Fatourou,
Faith Ellen Fich,
Eric Ruppert:
A tight time lower bound for space-optimal implementations of multi-writer snapshots.
STOC 2003: 259-268 |
| 10 | | Faith E. Fich,
Eric Ruppert:
Hundreds of impossibility results for distributed computing.
Distributed Computing 16(2-3): 121-163 (2003) |
| 2002 |
|---|
| 9 | | Panagiota Fatourou,
Faith Ellen Fich,
Eric Ruppert:
Space-optimal multi-writer snapshot objects are slow.
PODC 2002: 13-20 |
| 2000 |
|---|
| 8 | | Faith Ellen Fich,
Eric Ruppert:
Lower Bounds in Distributed Computing.
DISC 2000: 1-28 |
| 7 | | Maurice Herlihy,
Eric Ruppert:
On the Existence of Booster Types.
FOCS 2000: 653-663 |
| 6 | | Eric Ruppert:
Finding the k Shortest Paths in Parallel.
Algorithmica 28(2): 242-254 (2000) |
| 5 | | Eric Ruppert:
Determining Consensus Numbers.
SIAM J. Comput. 30(4): 1156-1168 (2000) |
| 1999 |
|---|
| 4 | | Eric Ruppert:
Consensus Numbers of Transactional Objects.
DISC 1999: 312-326 |
| 1998 |
|---|
| 3 | | Eric Ruppert:
Consensus Numbers of Multi-Objects.
PODC 1998: 211-217 |
| 1997 |
|---|
| 2 | | Eric Ruppert:
Determining Consensus Numbers.
PODC 1997: 93-99 |
| 1 | | Eric Ruppert:
Finding the k Shortest Paths in Parallel.
STACS 1997: 475-486 |
