Eli Gafni

CoRR, 2024

Brief Announcement: Understanding Read-Write Wait-Free Coverings in the Fully-Anonymous Shared-Memory Model.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024

2023

Time is not a Healer, but it Sure Makes Hindsight 20: 20.

[BibT_eX]

[DOI]

CoRR, 2023

Synchrony/Asynchrony vs. Stationary/Mobile? The Latter is Superior...in Theory.

[BibT_eX]

[DOI]

Vasileios Zikas

CoRR, 2023

Consensus in the Unknown-Participation Message-Adversary Model.

[BibT_eX]

[DOI]

CoRR, 2023

Brief Announcement: Byzantine Consensus Under Dynamic Participation with a Well-Behaved Majority.

[BibT_eX]

[DOI]

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

Invited Paper: Time Is Not a Healer, but It Sure Makes Hindsight 20:20.

[BibT_eX]

[DOI]

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

2021

The assignment problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

2019

A King in every two consecutive tournaments.

[BibT_eX]

[DOI]

Nati Linial

CoRR, 2019

Stellar Consensus by Instantiation.

[BibT_eX]

[DOI]

David Mazières

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Fast and secure global payments with Stellar.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Operating Systems Principles, 2019

2018

Group mutual exclusion in linear time and space.

[BibT_eX]

[DOI]

Yuan He

Krishnan Gopalakrishnan

Theor. Comput. Sci., 2018

An algorithmic approach to the asynchronous computability theorem.

[BibT_eX]

[DOI]

Vikram Saraph

J. Appl. Comput. Topol., 2018

A Wealth of Sub-Consensus Deterministic Objects.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2017

The Life in 1-Consensus.

[BibT_eX]

[DOI]

Eli Daian

CoRR, 2017

2016

Byzantine Processors and Cuckoo Birds: Confining Maliciousness to the Outset.

[BibT_eX]

[DOI]

CoRR, 2016

Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs.

[BibT_eX]

[DOI]

CoRR, 2016

Synchronous Hybrid Message-Adversary.

[BibT_eX]

[DOI]

CoRR, 2016

Asynchronous Computability Theorems for t-Resilient Systems.

[BibT_eX]

[DOI]

Vikram Saraph

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

Asynchronous Coordination Under Preferences and Constraints.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.

[BibT_eX]

[DOI]

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

Deterministic Objects: Life Beyond Consensus.

[BibT_eX]

[DOI]

Faith Ellen

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

Read-Write Memory and k-Set Consensus as an Affine Task.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Set-Consensus Collections are Decidable.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015

Linear space bootstrap communication schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A simple characterization of asynchronous computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Wait-freedom with advice.

[BibT_eX]

[DOI]

Distributed Comput., 2015

Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution.

[BibT_eX]

[DOI]

Dahlia Malkhi

Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014

Musical Chairs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Snapshot for Time: The One-Shot Case.

[BibT_eX]

[DOI]

CoRR, 2014

Set Consensus: Captured by a Set of Runs with Ramifications.

[BibT_eX]

[DOI]

CoRR, 2014

Live Equals Fast in Iterated Models.

[BibT_eX]

[DOI]

Zohir Bouzid

CoRR, 2014

Automatically Adjusting Concurrency to the Level of Synchrony.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing - 28th International Symposium, 2014

A generalized asynchronous computability theorem.

[BibT_eX]

[DOI]

Ciprian Manolescu

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

Strong Equivalence Relations for Iterated Models.

[BibT_eX]

[DOI]

Zohir Bouzid

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Sporadic Solutions to Zero-One Exclusion Tasks.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Adaptive Register Allocation with a Linear Number of Registers.

[BibT_eX]

[DOI]

Leslie Lamport

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|.

[BibT_eX]

[DOI]

Proceedings of the Networked Systems - First International Conference, 2013

Asynchrony from Synchrony.

[BibT_eX]

[DOI]

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

2011

The Complexity of Early Deciding Set Agreement.

[BibT_eX]

[DOI]

Rachid Guerraoui

Bastian Pochon

SIAM J. Comput., 2011

On set consensus numbers.

[BibT_eX]

[DOI]

Distributed Comput., 2011

Impersonal Failure Detection

[BibT_eX]

[DOI]

CoRR, 2011

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector.

[BibT_eX]

[DOI]

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

Oblivious Collaboration.

[BibT_eX]

[DOI]

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

Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

Generalized Universality.

[BibT_eX]

[DOI]

Rachid Guerraoui

Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

2010

The mailbox problem.

[BibT_eX]

[DOI]

Marcos Kawazoe Aguilera

Leslie Lamport

Distributed Comput., 2010

The k-simultaneous consensus problem.

[BibT_eX]

[DOI]

Distributed Comput., 2010

L-Resilient Adversaries and Hitting Sets

[BibT_eX]

[DOI]

CoRR, 2010

Recursion in Distributed Computing.

[BibT_eX]

[DOI]

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

Brief announcement: on L-resilience, hitting sets, and colorless tasks.

[BibT_eX]

[DOI]

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

Distributed Programming with Tasks.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Turning Adversaries into Friends: Simplified, Made Constructive, and Extended.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009

From adaptive renaming to set agreement.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus.

[BibT_eX]

[DOI]

Opher Lieber

Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The extended BG-simulation and the characterization of t-resiliency.

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

The weakest failure detector for solving k-set agreement.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008

Renaming in synchronous message passing systems with Byzantine failures.

[BibT_eX]

[DOI]

Michael Okun

Amnon Barak

Distributed Comput., 2008

The 0-1-Exclusion Families of Tasks.

[BibT_eX]

[DOI]

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

2007

Common2 extended to stacks and unbounded concurrency.

[BibT_eX]

[DOI]

Adam Morrison

Distributed Comput., 2007

Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability.

[BibT_eX]

[DOI]

Michel Raynal

Corentin Travers

Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), 2007

N-Consensus is the Second Strongest Object for N+1 Processes.

[BibT_eX]

[DOI]

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

2006

Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 20th International Symposium, 2006

Renaming with k-Set-Consensus: An Optimal Algorithm into n + k - 1 Slots.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

How Deep Should It Be? On the Optimality of Hierarchical Architectures.

[BibT_eX]

[DOI]

Amihai Motro

Alessandro D'Atri

Proceedings of the Next Generation Information Technologies and Systems, 2006

The Committee Decision Problem.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Read-Write Reductions.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005

Musical Benches.

[BibT_eX]

[DOI]

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

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement.

[BibT_eX]

[DOI]

Rachid Guerraoui

Bastian Pochon

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

Group-Solvability.

[BibT_eX]

[DOI]

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

An Information Theoretic Lower Bound for Broadcasting in Radio Networks.

[BibT_eX]

[DOI]

Carlos Brito

Shailesh Vaya

Proceedings of the STACS 2004, 2004

2003

Disk Paxos.

[BibT_eX]

[DOI]

Leslie Lamport

Distributed Comput., 2003

Uniform Solvability with a Finite Number of MWMR Registers.

[BibT_eX]

[DOI]

Marcos Kawazoe Aguilera

Burkhard Englert

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

On using network attached disks as shared memory.

[BibT_eX]

[DOI]

Marcos Kawazoe Aguilera

Burkhard Englert

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

2002

An adaptive collect algorithm with applications.

[BibT_eX]

[DOI]

Hagit Attiya

Arie Fouren

Distributed Comput., 2002

Fast Collect in the absence of contention.

[BibT_eX]

[DOI]

Burkhard Englert

Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), 2002

A Simple Algorithmic Characterization of Uniform Solvability.

[BibT_eX]

[DOI]

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

Analysis of Timing-Based Mutual Exclusion with Random Times.

[BibT_eX]

[DOI]

Michael Mitzenmacher

SIAM J. Comput., 2001

The BG distributed simulation algorithm.

[BibT_eX]

[DOI]

Distributed Comput., 2001

The concurrency hierarchy, and algorithms for unbounded concurrency.

[BibT_eX]

[DOI]

Michael Merritt

Gadi Taubenfeld

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

1999

Three-Processor Tasks Are Undecidable.

[BibT_eX]

[DOI]

Elias Koutsoupias

SIAM J. Comput., 1999

Efficient Methods for Integrating Traceability and Broadcast Encryption.

[BibT_eX]

[DOI]

Jessica Staddon

Yiqun Lisa Yin

Proceedings of the Advances in Cryptology, 1999

Distributed Computing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Structured Derivations of Consensus Algorithms for Failure Detectors.

[BibT_eX]

[DOI]

Jiong Yang

Gil Neiger

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

Slide-The Key to Polynomial End-to-End Communication.

[BibT_eX]

[DOI]

J. Algorithms, 1997

A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract).

[BibT_eX]

[DOI]

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

1996

Simulation as an Iterated Task (Abstract).

[BibT_eX]

[DOI]

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

A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract).

[BibT_eX]

[DOI]

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

1995

The Supercomputer Supernet: A Scalable Distributed Terabit Network.

[BibT_eX]

[DOI]

J. High Speed Networks, 1995

3-Processor Tasks Are Undecidable (Abstract).

[BibT_eX]

[DOI]

Elias Koutsoupias

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994

A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1994

Distributed Algorithms for Unidirectional Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Consensus Power Makes (Some) Sense! (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993

Atomic Snapshots of Shared Memory.

[BibT_eX]

[DOI]

J. ACM, 1993

Generalized FLP impossibility result for t-resilient asynchronous computations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Immediate Atomic Snapshots and Fast Renaming (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

Wait-free Test-and-Set (Extended Abstract).

[BibT_eX]

[DOI]

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

The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract).

[BibT_eX]

[DOI]

Adi Rosén

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

1991

Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Bootstrap Network Resynchronization (Extended Abstract).

[BibT_eX]

[DOI]

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

1990

A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

1989

Concurrency in Heavily Loaded Neighborhood-Constrained Systems.

[BibT_eX]

[DOI]

Valmir Carneiro Barbosa

ACM Trans. Program. Lang. Syst., 1989

On Separating the Erew and Crew Pram Models.

[BibT_eX]

[DOI]

Joseph Naor

Prabhakar Ragde

Theor. Comput. Sci., 1989

A Distributed Implementation of Simulated Annealing.

[BibT_eX]

[DOI]

Valmir Carneiro Barbosa

J. Parallel Distributed Comput., 1989

Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract)

[BibT_eX]

[DOI]

Moty Ricklin

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Sorting in Constant Number of Row and Column Phases on a Mesh.

[BibT_eX]

[DOI]

Algorithmica, 1988

Toward a Non-Atomic Era: \ell-Exclusion as a Test Case

[BibT_eX]

[DOI]

Nir Shavit

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

End-to-End Communication in Unreliable Networks.

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Understanding and Verifying Distributed Algorithms Using Stratified Decomposition.

[BibT_eX]

[DOI]

Ching-Tsun Chou

Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987

Asymptotic optimality of shortest path routing algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1987

Distributed Sorting Algorithms for Multi-Channel Broadcast Networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Generalized Scheme for Topology-Update in Dynamic Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1987

Local Fail-safe Network Reset Procedure.

[BibT_eX]

[DOI]

Baruch Awerbuch

Proceedings of the Distributed Algorithms, 1987

A Software-Based Hardware Fault Tolerance Scheme for Multicomputers.

[BibT_eX]

Yuval Tamir

Proceedings of the International Conference on Parallel Processing, 1987

An O(n^2 m^1/2) Distributed Max-Flow Algorithm.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1987

Applying Static Network Protocols to Dynamic Networks

[BibT_eX]

[DOI]

Baruch Awerbuch

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985

Improvements in the Time Complexity of Two Message-Optimal Election Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Sorting and Selection in Multi-Channel Broadcast Networks.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1985

1984

Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks.

[BibT_eX]

[DOI]

Robert G. Gallager

IEEE Trans. Commun., 1984

Election and Traversal in Unidirectional Networks.

[BibT_eX]

[DOI]

Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983

Path assignment for virtual circuit routing.

[BibT_eX]

[DOI]

Eliezer M. Gafni

Proceedings of the symposium on Communications Architectures & Protocols, 1983

1982

The integration of routing and flow-control for voice and data in a computer communication network.

[BibT_eX]

[DOI]

Eliezer M. Gafni

PhD thesis, 1982

1981

Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology.

[BibT_eX]

[DOI]