Eric Ruppert

According to our database1, Eric Ruppert authored at least 41 papers between 1998 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries.
Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

2018
Persistent Non-Blocking Binary Search Trees Supporting Wait-Free Range Queries.
CoRR, 2018

2017
Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Snapshots in Shared Memory.
Encyclopedia of Algorithms, 2016

Implementing Shared Registers in Asynchronous Message-Passing Systems.
Encyclopedia of Algorithms, 2016

Depth of a Random Binary Search Tree with Concurrent Insertions.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015
On the Space Complexity of Set Agreement?
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014
A general technique for non-blocking trees.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2014

A paradox of eventual linearizability in shared memory.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

The amortized complexity of non-blocking binary search trees.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Linearizability Is Not Always a Safety Property.
Proceedings of the Networked Systems - Second International Conference, 2014

2013
Byzantine agreement with homonyms.
Distributed Computing, 2013

Pragmatic primitives for non-blocking data structures.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2010
Non-blocking binary search trees.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

An Introduction to Population Protocols.
Proceedings of the Middleware for Network Eccentric and Mobile Applications, 2009

2008
Snapshots in Shared Memory.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Implementing Shared Registers in Asynchronous Message-Passing Systems.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The space complexity of unbounded timestamps.
Distributed Computing, 2008

Partial snapshot objects.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

2007
Time lower bounds for implementations of multi-writer snapshots.
J. ACM, 2007

An Introduction to Population Protocols.
Bulletin of the EATCS, 2007

Anonymous and fault-tolerant shared-memory computing.
Distributed Computing, 2007

The computational power of population protocols.
Distributed Computing, 2007

The Anonymous Consensus Hierarchy and Naming Problems.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Secretive Birds: Privacy in Population Protocols.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006
Relationships between broadcast and shared memory in reliable anonymous distributed systems.
Distributed Computing, 2006

Time-space tradeoffs for implementations of snapshots.
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

When Birds Die: Making Population Protocols Fault-Tolerant.
Proceedings of the Distributed Computing in Sensor Systems, 2006

2005
What Can Be Implemented Anonymously?
Proceedings of the Distributed Computing, 19th International Conference, 2005

On the Power of Anonymous One-Way Communication.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004
Lock-free linked lists and skip lists.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
Hundreds of impossibility results for distributed computing.
Distributed Computing, 2003

A tight time lower bound for space-optimal implementations of multi-writer snapshots.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Space-optimal multi-writer snapshot objects are slow.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2000
Determining Consensus Numbers.
SIAM J. Comput., 2000

Finding the k Shortest Paths in Parallel.
Algorithmica, 2000

Lower Bounds in Distributed Computing.
Proceedings of the Distributed Computing, 14th International Conference, 2000

On the Existence of Booster Types.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Consensus Numbers of Transactional Objects.
Proceedings of the Distributed Computing, 1999

1998
Consensus Numbers of Multi-Objects.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998


  Loading...