| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7774281 (Why is no real title available?)
| 2023-12-08 | Paper |
Set agreement and renaming in the presence of contention-related crash failures
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Reaching agreement in the presence of contention-related crash failures
Theoretical Computer Science | 2023-06-21 | Paper |
Reaching consensus in the presence of contention-related crash failures
Lecture Notes in Computer Science | 2023-06-12 | Paper |
Anonymous Shared Memory
Journal of the ACM | 2023-04-27 | Paper |
Election in fully anonymous shared memory systems: tight space bounds and algorithms
| 2022-11-11 | Paper |
Corrigendum to: ``Mutual exclusion in fully anonymous shared memory systems
Information Processing Letters | 2022-10-28 | Paper |
A visit to mutual exclusion in seven dates
Theoretical Computer Science | 2022-05-10 | Paper |
scientific article; zbMATH DE number 7515766 (Why is no real title available?)
| 2022-04-28 | Paper |
The epigenetic consensus problem
| 2022-03-22 | Paper |
Contention-related crash failures: definitions, agreement algorithms, and impossibility results
Theoretical Computer Science | 2022-03-01 | Paper |
From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Waiting in concurrent algorithms
Computing | 2021-01-15 | Paper |
Objects shared by Byzantine processes
Distributed Computing | 2020-12-04 | Paper |
Fast timing-based algorithms
Distributed Computing | 2020-12-02 | Paper |
Leader-based de-anonymization of an anonymous read/write memory
Theoretical Computer Science | 2020-08-25 | Paper |
Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
| 2020-07-30 | Paper |
The computational structure of progress conditions and shared objects
Distributed Computing | 2020-04-23 | Paper |
Mutual exclusion in fully anonymous shared memory systems
Information Processing Letters | 2020-04-03 | Paper |
Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
| 2020-03-03 | Paper |
Anonymous Read/write memory: leader election and de-anonymization
| 2020-03-03 | Paper |
A closer look at concurrent data structures and algorithms
| 2019-07-03 | Paper |
A closer look at fault tolerance
Theory of Computing Systems | 2018-07-23 | Paper |
Coordination without prior agreement
Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
A lower bound on wait-free counting
Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
Disentangling multi-object operations (extended abstract)
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Contention---free complexity of shared memory algorithms
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Brief announcement: Computing in the presence of weak crash failures
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Concurrent counting (extended abstract)
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
Computing with faulty shared memory (extended abstract)
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
Contention-sensitive data structures and algorithms
Theoretical Computer Science | 2017-05-15 | Paper |
The computability of relaxed data structures: queues and stacks as examples
Distributed Computing | 2017-04-04 | Paper |
Distributed universality
Algorithmica | 2016-10-21 | Paper |
Time-adaptive algorithms for synchronization
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
The concurrency hierarchy, and algorithms for unbounded concurrency
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
The computability of relaxed data structures: queues and stacks as examples
Structural Information and Communication Complexity | 2016-01-08 | Paper |
Sequentially consistent versus linearizable counting networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
The power of multi-objects (extended abstract)
Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing - PODC '96 | 2015-09-11 | Paper |
Automatic discovery of mutual exclusion algorithms
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Knowledge in shared memory systems (preliminary version)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
On asymmetric progress conditions
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Distributed Universality
Lecture Notes in Computer Science | 2015-02-10 | Paper |
A closer look at fault tolerance
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Tight space bounds for \(\ell\)-exclusion
Distributed Computing | 2014-07-11 | Paper |
Computing with infinitely many processes
Information and Computation | 2014-01-10 | Paper |
Sequentially consistent versus linearizable counting networks
Distributed Computing | 2013-06-28 | Paper |
Tight bounds for shared memory systems accessed by Byzantine processes
Distributed Computing | 2013-06-07 | Paper |
Tight space bounds for \(\ell \)-exclusion
Lecture Notes in Computer Science | 2011-10-28 | Paper |
The computational structure of progress conditions
Lecture Notes in Computer Science | 2010-09-10 | Paper |
Resilient consensus for infinitely many processes. (Extended abstract)
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Contention-Sensitive Data Structures and Algorithms
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms
Lecture Notes in Computer Science | 2008-09-02 | Paper |
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
Lecture Notes in Computer Science | 2005-08-17 | Paper |
scientific article; zbMATH DE number 2013833 (Why is no real title available?)
| 2003-12-07 | Paper |
Public data structures: counters as a special case.
Theoretical Computer Science | 2003-01-21 | Paper |
The power of multiobjects.
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1696673 (Why is no real title available?)
| 2002-06-25 | Paper |
scientific article; zbMATH DE number 1696685 (Why is no real title available?)
| 2002-01-28 | Paper |
Impossibility results in the presence of multiple faulty processes
Information and Computation | 2000-08-02 | Paper |
A Lower Bound on Wait-Free Counting
Journal of Algorithms | 1998-05-25 | Paper |
Computing with faulty shared objects
Journal of the ACM | 1998-01-28 | Paper |
The Wakeup Problem
SIAM Journal on Computing | 1997-06-09 | Paper |
Time-Adaptive Algorithms for Synchronization
SIAM Journal on Computing | 1997-05-26 | Paper |
Concurrent counting
Journal of Computer and System Sciences | 1997-03-31 | Paper |
Contention-free complexity of shared memory algorithms
Information and Computation | 1996-12-12 | Paper |
A connection between random variables and latin \(k\)-cubes
Discrete Mathematics | 1996-08-18 | Paper |
Knowledge in shared memory systems.
Distributed Computing | 1995-11-22 | Paper |
Possibility and impossibility results in a shared memory environment
Acta Informatica | 1995-11-19 | Paper |
Speeding Lamport's fast mutual exclusion algorithm
Information Processing Letters | 1993-05-16 | Paper |
Space-efficient asynchronous consensus without shared memory initialization
Information Processing Letters | 1993-05-16 | Paper |
On the nonexistence of resilient consensus protocols
Information Processing Letters | 1991-01-01 | Paper |
Initial failures in distributed computations
International Journal of Parallel Programming | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4205964 (Why is no real title available?)
| 1989-01-01 | Paper |
Leader election in the presence of n-1 initial failures
Information Processing Letters | 1989-01-01 | Paper |
Script: A communication abstraction mechanism and its verification
Science of Computer Programming | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3926229 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3878340 (Why is no real title available?)
| 1984-01-01 | Paper |
