Eli Gafni

According to our database1, Eli Gafni authored at least 103 papers between 1984 and 2018.

Collaborative distances:
  • Dijkstra number2 of two.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
A Wealth of Sub-Consensus Deterministic Objects.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

The Assignment Problem.
Proceedings of the 19th International Conference on Distributed Computing and Networking, 2018

2016
Asynchronous Computability Theorems for t-Resilient Systems.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

Asynchronous Coordination Under Preferences and Constraints.
Proceedings of the Structural Information and Communication Complexity, 2016

Brief Announcement: Asynchronous Coordination with Constraints and Preferences.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Deterministic Objects: Life Beyond Consensus.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Read-Write Memory and k-Set Consensus as an Affine Task.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Set-Consensus Collections are Decidable.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Group mutual exclusion in linear time and space.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015
A simple characterization of asynchronous computations.
Theor. Comput. Sci., 2015

Elastic Configuration Maintenance via a Parsimonious Speculating Snapshot Solution.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

2014
Musical Chairs.
SIAM J. Discrete Math., 2014

Automatically Adjusting Concurrency to the Level of Synchrony.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

A generalized asynchronous computability theorem.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Strong Equivalence Relations for Iterated Models.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Sporadic Solutions to Zero-One Exclusion Tasks.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Adaptive Register Allocation with a Linear Number of Registers.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|.
Proceedings of the Networked Systems - First International Conference, 2013

Linear Space Bootstrap Communication Schemes.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

Asynchrony from Synchrony.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
Wait-freedom with advice.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
The Complexity of Early Deciding Set Agreement.
SIAM J. Comput., 2011

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

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

Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

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

2010
The k-simultaneous consensus problem.
Distributed Computing, 2010

Recursion in Distributed Computing.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

Brief announcement: on L-resilience, hitting sets, and colorless tasks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Distributed Programming with Tasks.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

Turning Adversaries into Friends: Simplified, Made Constructive, and Extended.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
From adaptive renaming to set agreement.
Theor. Comput. Sci., 2009

On Set Consensus Numbers.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The extended BG-simulation and the characterization of t-resiliency.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

The weakest failure detector for solving k-set agreement.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

2008
Renaming in synchronous message passing systems with Byzantine failures.
Distributed Computing, 2008

The Mailbox Problem.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

The 0-1-Exclusion Families of Tasks.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007
Test & Set, Adaptive Renaming and Set Agreement: a Guided Visit to Asynchronous Computability.
Proceedings of the 26th IEEE Symposium on Reliable Distributed Systems (SRDS 2007), 2007

N-Consensus is the Second Strongest Object for N+1 Processes.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006
Subconsensus Tasks: Renaming Is Weaker Than Set Agreement.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Common2 extended to stacks and unbounded concurrency.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Renaming with k-Set-Consensus: An Optimal Algorithm into n + k - 1 Slots.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

How Deep Should It Be? On the Optimality of Hierarchical Architectures.
Proceedings of the Next Generation Information Technologies and Systems, 2006

The Committee Decision Problem.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Read-Write Reductions.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005
Musical Benches.
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.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004
Group-Solvability.
Proceedings of the Distributed Computing, 18th International Conference, 2004

An Information Theoretic Lower Bound for Broadcasting in Radio Networks.
Proceedings of the STACS 2004, 2004

2003
Uniform Solvability with a Finite Number of MWMR Registers.
Proceedings of the Distributed Computing, 17th International Conference, 2003

On using network attached disks as shared memory.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002
An adaptive collect algorithm with applications.
Distributed Computing, 2002

Fast Collect in the absence of contention.
ICDCS, 2002

A Simple Algorithmic Characterization of Uniform Solvability.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
The BG distributed simulation algorithm.
Distributed Computing, 2001

The concurrency hierarchy, and algorithms for unbounded concurrency.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Disk Paxos.
Proceedings of the Distributed Computing, 14th International Conference, 2000

1999
Three-Processor Tasks Are Undecidable.
SIAM J. Comput., 1999

Analysis of Timing-Based Mutual Exclusion with Random Times.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Efficient Methods for Integrating Traceability and Broadcast Encryption.
Proceedings of the Advances in Cryptology, 1999

1998
Structured Derivations of Consensus Algorithms for Failure Detectors.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony (Extended Abstract).
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997
Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms, 1997

A Simple Algorithmically Reasoned Characterization of Wait-Free Computations (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
Simulation as an Iterated Task (Abstract).
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).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
The Supercomputer Supernet: A Scalable Distributed Terabit Network.
J. High Speed Networks, 1995

3-Processor Tasks Are Undecidable (Abstract).
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.
ACM Trans. Program. Lang. Syst., 1994

Distributed Algorithms for Unidirectional Networks.
SIAM J. Comput., 1994

Consensus Power Makes (Some) Sense! (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Atomic Snapshots of Shared Memory.
J. ACM, 1993

Generalized FLP impossibility result for t-resilient asynchronous computations.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Immediate Atomic Snapshots and Fast Renaming (Extended Abstract).
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992
Wait-free Test-and-Set (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract).
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.
SIAM J. Comput., 1991

Bootstrap Network Resynchronization (Extended Abstract).
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.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Atomic Snapshots of Shared Memory.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1989
On Separating the Erew and Crew Pram Models.
Theor. Comput. Sci., 1989

A Distributed Implementation of Simulated Annealing.
J. Parallel Distrib. Comput., 1989

Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract)
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.
Algorithmica, 1988

Toward a Non-Atomic Era: \ell-Exclusion as a Test Case
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

End-to-End Communication in Unreliable Networks.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

Understanding and Verifying Distributed Algorithms Using Stratified Decomposition.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987
Asymptotic optimality of shortest path routing algorithms.
IEEE Trans. Information Theory, 1987

Distributed Sorting Algorithms for Multi-Channel Broadcast Networks.
Theor. Comput. Sci., 1987

Generalized Scheme for Topology-Update in Dynamic Networks.
Proceedings of the Distributed Algorithms, 1987

Local Fail-safe Network Reset Procedure.
Proceedings of the Distributed Algorithms, 1987

A Software-Based Hardware Fault Tolerance Scheme for Multicomputers.
Proceedings of the International Conference on Parallel Processing, 1987

An O(n^2 m^1/2) Distributed Max-Flow Algorithm.
Proceedings of the International Conference on Parallel Processing, 1987

Concurrency in Heavily Loaded Neighborhood-Constrained Systems.
Proceedings of the 7th International Conference on Distributed Computing Systems, 1987

Applying Static Network Protocols to Dynamic Networks
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985
Improvements in the Time Complexity of Two Message-Optimal Election Algorithms.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks.
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Sorting and Selection in Multi-Channel Broadcast Networks.
Proceedings of the International Conference on Parallel Processing, 1985

1984
Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks.
IEEE Trans. Communications, 1984

Election and Traversal in Unidirectional Networks.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984


  Loading...