Eric Ruppert
From MaRDI portal
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| A wait-free queue with polylogarithmic step complexity Distributed Computing | 2025-01-08 | Paper |
| When is Recoverable Consensus Harder Than Consensus? Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| A Wait-free Queue with Polylogarithmic Step Complexity Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7774263 (Why is no real title available?) | 2023-12-08 | Paper |
| Finding the \(k\) shortest paths in parallel Lecture Notes in Computer Science | 2022-11-09 | Paper |
| Hundreds of impossibility results for distributed computing Distributed Computing | 2020-12-04 | Paper |
| Depth of a random binary search tree with concurrent insertions | 2018-08-16 | Paper |
| Brief Announcement Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Determining consensus numbers Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
| On the space complexity of set agreement? Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| Consensus numbers of multi-objects Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
| Byzantine agreement with homonyms Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| The amortized complexity of non-blocking binary search trees Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| Pragmatic primitives for non-blocking data structures Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Time-space tradeoffs for implementations of snapshots Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| Space-optimal multi-writer snapshot objects are slow Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
| Byzantine agreement with homonyms Distributed Computing | 2014-03-28 | Paper |
| The space complexity of unbounded timestamps Distributed Computing | 2013-07-04 | Paper |
| The computational power of population protocols Distributed Computing | 2013-06-20 | Paper |
| Anonymous and fault-tolerant shared-memory computing Distributed Computing | 2013-06-20 | Paper |
| Relationships between broadcast and shared memory in reliable anonymous distributed systems Distributed Computing | 2013-06-07 | Paper |
| A tight time lower bound for space-optimal implementations of multi-writer snapshots Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5605125 (Why is no real title available?) | 2009-09-19 | Paper |
| Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures Automata, Languages and Programming | 2009-07-14 | Paper |
| Time lower bounds for implementations of multi-writer snapshots Journal of the ACM | 2008-12-21 | Paper |
| The Space Complexity of Unbounded Timestamps Lecture Notes in Computer Science | 2008-09-02 | Paper |
| Secretive birds: privacy in population protocols | 2008-04-22 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems Lecture Notes in Computer Science | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 1696663 (Why is no real title available?) | 2002-06-25 | Paper |
| Determining Consensus Numbers SIAM Journal on Computing | 2000-10-18 | Paper |
| Finding the \(k\) shortest paths in parallel Algorithmica | 2000-09-14 | Paper |
Research outcomes over time
This page was built for person: Eric Ruppert
