The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eric Ruppert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Eric Ruppert
    When Birds Die: Making Population Protocols Fault-Tolerant. [Citation Graph (0, 0)][DBLP]
    DCOSS, 2006, pp:51-66 [Conf]
  2. Maurice Herlihy, Eric Ruppert
    On the Existence of Booster Types. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:653-663 [Conf]
  3. Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
    On the Power of Anonymous One-Way Communication. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:396-411 [Conf]
  4. Mikhail Fomitchev, Eric Ruppert
    Lock-free linked lists and skip lists. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:50-59 [Conf]
  5. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    Space-optimal multi-writer snapshot objects are slow. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:13-20 [Conf]
  6. Eric Ruppert
    Determining Consensus Numbers. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:93-99 [Conf]
  7. Eric Ruppert
    Consensus Numbers of Multi-Objects. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:211-217 [Conf]
  8. Eric Ruppert
    Finding the k Shortest Paths in Parallel. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:475-486 [Conf]
  9. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    A tight time lower bound for space-optimal implementations of multi-writer snapshots. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:259-268 [Conf]
  10. Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert
    Time-space tradeoffs for implementations of snapshots. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:169-178 [Conf]
  11. James Aspnes, Faith Ellen Fich, Eric Ruppert
    Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:260-274 [Conf]
  12. Rachid Guerraoui, Eric Ruppert
    What Can Be Implemented Anonymously? [Citation Graph (0, 0)][DBLP]
    DISC, 2005, pp:244-259 [Conf]
  13. Faith Ellen Fich, Eric Ruppert
    Lower Bounds in Distributed Computing. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:1-28 [Conf]
  14. Eric Ruppert
    Consensus Numbers of Transactional Objects. [Citation Graph (0, 0)][DBLP]
    DISC, 1999, pp:312-326 [Conf]
  15. Eric Ruppert
    Finding the k Shortest Paths in Parallel. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:28, n:2, pp:242-254 [Journal]
  16. James Aspnes, Faith Ellen Fich, Eric Ruppert
    Relationships between broadcast and shared memory in reliable anonymous distributed systems. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:3, pp:209-219 [Journal]
  17. Faith E. Fich, Eric Ruppert
    Hundreds of impossibility results for distributed computing. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2003, v:16, n:2-3, pp:121-163 [Journal]
  18. Eric Ruppert
    Determining Consensus Numbers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1156-1168 [Journal]
  19. Faith Ellen, Panagiota Fatourou, Eric Ruppert
    The Space Complexity of Unbounded Timestamps. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:223-237 [Conf]
  20. Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert
    The computational power of population protocols [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  21. Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. [Citation Graph (, )][DBLP]


  22. Secretive Birds: Privacy in Population Protocols. [Citation Graph (, )][DBLP]


  23. The Anonymous Consensus Hierarchy and Naming Problems. [Citation Graph (, )][DBLP]


  24. Non-blocking binary search trees. [Citation Graph (, )][DBLP]


  25. Partial snapshot objects. [Citation Graph (, )][DBLP]


  26. The computational power of population protocols. [Citation Graph (, )][DBLP]


  27. Anonymous and fault-tolerant shared-memory computing. [Citation Graph (, )][DBLP]


  28. The space complexity of unbounded timestamps. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002