Eric Ruppert

Distributed Comput., December, 2024

Lock-Free Augmented Trees.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023

Practically and Theoretically Efficient Garbage Collection for Multiversioning.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2023

A Wait-Free Deque With Polylogarithmic Step Complexity.

[BibT_eX]

[DOI]

Shalom M. Asbell

Proceedings of the 27th International Conference on Principles of Distributed Systems, 2023

2022

Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact).

[BibT_eX]

[DOI]

Dataset, December, 2022

When is Recoverable Consensus Harder Than Consensus?

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Space and Time Bounded Multiversion Garbage Collection.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

Constant-time snapshots with applications to concurrent data structures.

[BibT_eX]

[DOI]

Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

2020

Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures.

[BibT_eX]

[DOI]

CoRR, 2020

2019

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

[BibT_eX]

[DOI]

Elias Papavasileiou

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.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016

Snapshots in Shared Memory.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Implementing Shared Registers in Asynchronous Message-Passing Systems.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Depth of a Random Binary Search Tree with Concurrent Insertions.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 30th International Symposium, 2016

2015

On the Space Complexity of Set Agreement.

[BibT_eX]

[DOI]

Petr Kuznetsov

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

2014

A general technique for non-blocking trees.

[BibT_eX]

[DOI]

Trevor Brown

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2014

A paradox of eventual linearizability in shared memory.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

The amortized complexity of non-blocking binary search trees.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Linearizability Is Not Always a Safety Property.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - Second International Conference, 2014

2013

Byzantine agreement with homonyms.

[BibT_eX]

[DOI]

Distributed Comput., 2013

Pragmatic primitives for non-blocking data structures.

[BibT_eX]

[DOI]

Trevor Brown

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2010

Non-blocking binary search trees.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

An Introduction to Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Middleware for Network Eccentric and Mobile Applications, 2009

2008

Snapshots in Shared Memory.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Implementing Shared Registers in Asynchronous Message-Passing Systems.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

The space complexity of unbounded timestamps.

[BibT_eX]

[DOI]

Distributed Comput., 2008

Partial snapshot objects.

[BibT_eX]

[DOI]

Hagit Attiya

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.

[BibT_eX]

[DOI]

J. ACM, 2007

An Introduction to Population Protocols.

[BibT_eX]

Bull. EATCS, 2007

Anonymous and fault-tolerant shared-memory computing.

[BibT_eX]

[DOI]

Distributed Comput., 2007

The computational power of population protocols.

[BibT_eX]

[DOI]

Distributed Comput., 2007

The Anonymous Consensus Hierarchy and Naming Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Secretive Birds: Privacy in Population Protocols.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006

Relationships between broadcast and shared memory in reliable anonymous distributed systems.

[BibT_eX]

[DOI]

Faith Ellen Fich

Distributed Comput., 2006

Time-space tradeoffs for implementations of snapshots.

[BibT_eX]

[DOI]

Faith Ellen Fich

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

When Birds Die: Making Population Protocols Fault-Tolerant.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing in Sensor Systems, 2006

2005

What Can Be Implemented Anonymously?

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 19th International Conference, 2005

On the Power of Anonymous One-Way Communication.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

2004

Lock-free linked lists and skip lists.

[BibT_eX]

[DOI]

Mikhail Fomitchev

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003

Hundreds of impossibility results for distributed computing.

[BibT_eX]

[DOI]

Distributed Comput., 2003

A tight time lower bound for space-optimal implementations of multi-writer snapshots.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Space-optimal multi-writer snapshot objects are slow.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

2000

The consensus power of shared-memory distributed systems.

[BibT_eX]

[DOI]

PhD thesis, 2000

Determining Consensus Numbers.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Finding the k Shortest Paths in Parallel.

[BibT_eX]

[DOI]

Algorithmica, 2000

Lower Bounds in Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 14th International Conference, 2000

On the Existence of Booster Types.

[BibT_eX]

[DOI]

Maurice Herlihy

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

Consensus Numbers of Transactional Objects.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 1999

1998

Consensus Numbers of Multi-Objects.

[BibT_eX]

[DOI]