Eric Ruppert

Available identifiers

zbMath Open ruppert.ericMaRDI QIDQ352240

List of research outcomes

Publication	Date of Publication	Type
A wait-free queue with polylogarithmic step complexity	2025-01-08	Paper
When is Recoverable Consensus Harder Than Consensus?	2024-03-26	Paper
A Wait-free Queue with Polylogarithmic Step Complexity	2024-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q6061694	2023-12-08	Paper
Finding the k shortest paths in parallel	2022-11-09	Paper
Hundreds of impossibility results for distributed computing	2020-12-04	Paper
Depth of a random binary search tree with concurrent insertions	2018-08-16	Paper
Brief Announcement	2017-10-11	Paper
Determining consensus numbers	2017-09-29	Paper
On the space complexity of set agreement?	2016-03-23	Paper
Consensus numbers of multi-objects	2016-03-02	Paper
Byzantine agreement with homonyms	2015-09-11	Paper
The amortized complexity of non-blocking binary search trees	2015-09-03	Paper
Pragmatic primitives for non-blocking data structures	2015-03-02	Paper
Time-space tradeoffs for implementations of snapshots	2014-11-25	Paper
Space-optimal multi-writer snapshot objects are slow	2014-07-25	Paper
Byzantine agreement with homonyms	2014-03-28	Paper
The space complexity of unbounded timestamps	2013-07-04	Paper
The computational power of population protocols	2013-06-20	Paper
Anonymous and fault-tolerant shared-memory computing	2013-06-20	Paper
Relationships between broadcast and shared memory in reliable anonymous distributed systems	2013-06-07	Paper
A tight time lower bound for space-optimal implementations of multi-writer snapshots	2010-08-16	Paper
https://portal.mardi4nfdi.de/entity/Q3396623	2009-09-19	Paper
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures	2009-07-14	Paper
Time lower bounds for implementations of multi-writer snapshots	2008-12-21	Paper
The Space Complexity of Unbounded Timestamps	2008-09-02	Paper
Secretive birds: privacy in population protocols	2008-04-22	Paper
Distributed Computing	2006-11-01	Paper
Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems	2005-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q2766858	2002-06-25	Paper
Determining Consensus Numbers	2000-10-18	Paper
Finding the \(k\) shortest paths in parallel	2000-09-14	Paper

Research outcomes over time

This page was built for person: Eric Ruppert