Gadi Taubenfeld

Proceedings of the Structural Information and Communication Complexity, 2024

Better Sooner Rather Than Later.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2024

2023

Reaching agreement in the presence of contention-related crash failures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2023

Corrigendum to "Mutual exclusion in fully anonymous shared memory systems" [Inf. Process. Lett. 158 (2020) 105938].

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

Memory-Anonymous Starvation-Free Mutual Exclusion: Possibility and Impossibility Results.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Distributed Computing, 2023

2022

A visit to mutual exclusion in seven dates.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Contention-related crash failures: Definitions, agreement algorithms, and impossibility results.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Anonymous Shared Memory.

[BibT_eX]

[DOI]

J. ACM, 2022

Symmetry and Anonymity in Shared Memory Concurrent Systems.

[BibT_eX]

[DOI]

Bull. EATCS, 2022

Reaching Consensus in the Presence of Contention-Related Crash Failures.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Election in Fully Anonymous Shared Memory Systems: Tight Space Bounds and Algorithms.

[BibT_eX]

[DOI]

Damien Imbs

Proceedings of the Structural Information and Communication Complexity, 2022

2022 Principles of Distributed Computing Doctoral Dissertation Award.

[BibT_eX]

[DOI]

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

2021

Constant RMR Group Mutual Exclusion for Arbitrarily Many Processes and Sessions.

[BibT_eX]

[DOI]

Liat Maor

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

The Epigenetic Consensus Problem.

[BibT_eX]

[DOI]

Sabrina Rashid

Ziv Bar-Joseph

Proceedings of the Structural Information and Communication Complexity, 2021

2020

Leader-based de-anonymization of an anonymous read/write memory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Mutual exclusion in fully anonymous shared memory systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2020

The computational structure of progress conditions and shared objects.

[BibT_eX]

[DOI]

Distributed Comput., 2020

Genome-Wide Epigenetic Modifications as a Shared Memory Consensus Problem.

[BibT_eX]

[DOI]

Sabrina Rashid

Ziv Bar-Joseph

CoRR, 2020

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Fully Anonymous Consensus and Set Agreement Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 8th International Conference, 2020

2019

Fully Anonymous Shared Memory Algorithms.

[BibT_eX]

[DOI]

CoRR, 2019

Mutex-based Desanonymization of an Anonymous Read/Write Memory.

[BibT_eX]

[DOI]

CoRR, 2019

Waiting in concurrent algorithms.

[BibT_eX]

[DOI]

Computing, 2019

Brief Announcement: Fully Anonymous Shared Memory Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2019

Set Agreement Power Is Not a Precise Characterization for Oblivious Deterministic Anonymous Objects.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Anonymous Read/Write Memory: Leader Election and De-anonymization.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2019

Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion.

[BibT_eX]

[DOI]

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

Mutex-Based De-anonymization of an Anonymous Read/Write Memory.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 7th International Conference, 2019

2018

Distributed Computing Pearls

[BibT_eX]

[DOI]

Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, ISBN: 978-3-031-02012-4, 2018

A Closer Look at Fault Tolerance.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

Set Agreement and Renaming in the Presence of Contention-Related Crash Failures.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

2018 Edsger W. Dijkstra Prize in Distributed Computing.

[BibT_eX]

[DOI]

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

Weak Failures: Definitions, Algorithms and Impossibility Results.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - 6th International Conference, 2018

2017

Contention-sensitive data structures and algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Coordination Without Prior Agreement.

[BibT_eX]

[DOI]

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

Mutual Exclusion Algorithms with Constant RMR Complexity and Wait-Free Exit Code.

[BibT_eX]

[DOI]

Rotem Dvir

Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016

Concurrent Programming, Mutual Exclusion.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Fair synchronization.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2016

The computability of relaxed data structures: queues and stacks as examples.

[BibT_eX]

[DOI]

Nir Shavit

Distributed Comput., 2016

Distributed Universality.

[BibT_eX]

[DOI]

Julien Stainer

Algorithmica, 2016

Brief Announcement: Computing in the Presence of Weak Crash Failures.

[BibT_eX]

[DOI]

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

2015

Special issue on PODC 2013.

[BibT_eX]

[DOI]

Distributed Comput., 2015

2014

Tight space bounds for #8467;-exclusion.

[BibT_eX]

[DOI]

Distributed Comput., 2014

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties.

[BibT_eX]

[DOI]

Julien Stainer

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

2013

Computing with infinitely many processes.

[BibT_eX]

[DOI]

Inf. Comput., 2013

Weak Read/Write Registers.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2011

On the performance of distributed lock-based synchronization?

[BibT_eX]

[DOI]

Yuval Lubowich

ACM SIGOPS Oper. Syst. Rev., 2011

Tight Space Bounds for ℓ-Exclusion.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010

Special issue on DISC 2008.

[BibT_eX]

[DOI]

Distributed Comput., 2010

The Computational Structure of Progress Conditions.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 24th International Symposium, 2010

On asymmetric progress conditions.

[BibT_eX]

[DOI]

Damien Imbs

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

2009

On the Computational Power of Shared Objects.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008

Concurrent Programming, Mutual Exclusion.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Shared Memory Synchronization.

[BibT_eX]

Bull. EATCS, 2008

Sequentially consistent versus linearizable counting networks.

[BibT_eX]

[DOI]

Marios Mavronicolas

Distributed Comput., 2008

Group Renaming.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007

Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

The notion of a timed register and its application to indulgent synchronization.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2006

Computing in the Presence of Timing Failures.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

2005

Tight bounds for shared memory systems accessed by Byzantine processes.

[BibT_eX]

[DOI]

Distributed Comput., 2005

2004

The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 18th International Conference, 2004

2003

Objects shared by Byzantine processes.

[BibT_eX]

[DOI]

Distributed Comput., 2003

Resilient Consensus for Infinitely Many Processes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 17th International Conference, 2003

Automatic discovery of mutual exclusion algorithms.

[BibT_eX]

[DOI]

Yoah Bar-David

Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002

Public data structures: counters as a special case.

[BibT_eX]

[DOI]

Hagit Brit

Theor. Comput. Sci., 2002

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 16th International Conference, 2002

2001

The concurrency hierarchy, and algorithms for unbounded concurrency.

[BibT_eX]

[DOI]

Eli Gafni

Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

1999

Constructing a Reliable Test&Set Bit.

[BibT_eX]

[DOI]

Frank A. Stomp

IEEE Trans. Parallel Distributed Syst., 1999

The Power of Multiobjects.

[BibT_eX]

[DOI]

Yehuda Afek

Inf. Comput., 1999

1998

Fairness of Shared Objects.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997

Time-Adaptive Algorithms for Synchronization.

[BibT_eX]

[DOI]

Hagit Attiya

SIAM J. Comput., 1997

A Lower Bound on Wait-Free Counting.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Disentangling Multi-Object Operations (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996

The Wakeup Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

Concurrent Counting.

[BibT_eX]

[DOI]

Irit Yadin

J. Comput. Syst. Sci., 1996

Contention-Free Complexity of Shared Memory Algorithms.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Fast Timing-Based Algorithms.

[BibT_eX]

[DOI]

Distributed Comput., 1996

Possibility and Impossibility Results in a Shared Memory Environment.

[BibT_eX]

[DOI]

Acta Informatica, 1996

Constructing a Reliable Test&Set Bit (Abstract).

[BibT_eX]

[DOI]

Frank A. Stomp

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

The Power of Multi-objects (Extended Abstract).

[BibT_eX]

[DOI]

Yehuda Afek

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Computing With Faulty Shared Objects.

[BibT_eX]

[DOI]

J. ACM, 1995

A connection between random variables and latin k-cubes.

[BibT_eX]

[DOI]

Ruben Michel

Andrew Berman

Discret. Math., 1995

Public Data Structures: Counters as a Special Case (Abridged Version).

[BibT_eX]

[DOI]

Hagit Brit

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994

Impossibility Results in the Presence of Multiple Faulty Processes

[BibT_eX]

[DOI]

Inf. Comput., September, 1994

Atomic m-Register Operations.

[BibT_eX]

[DOI]

Distributed Comput., 1994

1993

Speeding Lamport's Fast Mutual Exclusion Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

Space-Efficient Asynchronous Consensus Without Shared Memory Initialization.

[BibT_eX]

[DOI]

Michael J. Fischer

Inf. Process. Lett., 1993

Knowledge in Shared Memory Systems.

[BibT_eX]

[DOI]

Distributed Comput., 1993

Benign Failure Models for Shared Memory (Preliminary Version).

[BibT_eX]

[DOI]

Yehuda Afek

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

How to Share an Object: A Fast Timing-Based Solution.

[BibT_eX]

[DOI]

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

1992

Choice Coordination with Multiple Alternatives (Preliminary Version).

[BibT_eX]

[DOI]

David S. Greenberg

Da-Wei Wang

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Results about Fast Mutual Exclusion.

[BibT_eX]

[DOI]

Proceedings of the Real-Time Systems Symposium, 1992

Concurrent Counting (Extended Abstract).

[BibT_eX]

[DOI]

Irit Yadin

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

Computing with Faulty Shared Memory (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991

On the Nonexistence of Resilient Consensus Protocols.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Atomic m-Register Operations (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Knowledge in Shared Memory Systems (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990

The Wakeup Problem (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

Leader Election in the Presence of n-1 Initial Failures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Initial failures in distributed computations.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1989

Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1986

Script: A Communication Abstraction Mechanism and Its Verification.

[BibT_eX]

[DOI]

Nissim Francez

Brent Hailpern

Sci. Comput. Program., 1986

What Processes Know: Definitions and Proof Methods (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

1984

Proof Rules for Communication Abstractions (Abstract).

[BibT_eX]

[DOI]