Sam Toueg

Affiliations:
  • Cornell University, Ithaca, USA


According to our database1, Sam Toueg authored at least 104 papers between 1979 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On implementing SWMR registers from SWSR registers in systems with Byzantine failures.
Distributed Comput., June, 2024

2022
Randomized consensus with regular registers.
Inf. Process. Lett., 2022

On atomic registers and randomized consensus in M&M systems.
Distributed Comput., 2022

Parameterized algorithm for replicated objects with local reads.
CoRR, 2022

2021
An Impossibility Result on Strong Linearizability in Message-Passing Systems.
CoRR, 2021

Differentiated nonblocking: a new progress condition and a matching queue algorithm.
CoRR, 2021

On Register Linearizability and Termination.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

2020
Bounded disagreement.
Theor. Comput. Sci., 2020

Life beyond set agreement.
Distributed Comput., 2020

On Linearizability and the Termination of Randomized Algorithms.
CoRR, 2020

2019
On Deterministic Linearizable Set Agreement Objects.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

Optimal Register Construction in M&M Systems.
Proceedings of the 23rd International Conference on Principles of Distributed Systems, 2019

2018
On the Classification of Deterministic Objects via Set Agreement Power.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Passing Messages while Sharing Memory.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

2016
k-Abortable Objects: Progress Under High Contention.
Proceedings of the Distributed Computing - 30th International Symposium, 2016

An Algorithm for Replicated Objects with Efficient Reads.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

2015
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling.
Proceedings of the Structural Information and Communication Complexity, 2015

2013
On deterministic abortable objects.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit.
SIAM J. Comput., 2012

The correctness proof of Ben-Or's randomized consensus algorithm.
Distributed Comput., 2012

Partial synchrony based on set timeliness.
Distributed Comput., 2012

2011
The minimum information about failures for solving non-local tasks in message-passing systems.
Distributed Comput., 2011

2010
Adaptive progress: a gracefully-degrading liveness property.
Distributed Comput., 2010

2009
Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

2008
On implementing omega in systems with weak reliability and synchrony assumptions.
Distributed Comput., 2008

Every problem has a weakest failure detector.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Timeliness-based wait-freedom: a gracefully degrading progress condition.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

With Finite Memory Consensus Is Easier Than Reliable Broadcast.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

A robust and lightweight stable leader election service for dynamic systems.
Proceedings of the 38th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2008

2007
The weakest failure detector to solve nonuniform consensus.
Distributed Comput., 2007

DISC at Its 20th Anniversary (Stockholm, 2006).
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Abortable and query-abortable objects and their efficient implementation.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

2006
From Set Membership to Group Membership: A Separation of Concerns.
IEEE Trans. Dependable Secur. Comput., 2006

Brief Announcement: Abortable and Query-Abortable Objects.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Consensus with Byzantine Failures and Little System Synchrony.
Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

2005
Fast fault-tolerant agreement algorithms.
Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, 2005

2004
Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus.
SIAM J. Comput., 2004

The weakest failure detectors to solve certain fundamental problems in distributed computing.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Communication-efficient leader election and consensus with limited link synchrony.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
On implementing omega with weak reliability and synchrony assumptions.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002
On the Quality of Service of Failure Detectors.
IEEE Trans. Computers, 2002

On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems.
Proceedings of the Distributed Computing, 16th International Conference, 2002

2001
Stable Leader Election.
Proceedings of the Distributed Computing, 15th International Conference, 2001

2000
Time and Space Lower Bounds for Nonblocking Implementations.
SIAM J. Comput., 2000

On Quiescent Reliable Communication.
SIAM J. Comput., 2000

Failure Detection and Consensus in the Crash-Recovery Model.
Distributed Comput., 2000

Thrifty Generic Broadcast.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Revisiting Safety and Liveness in the Context of Failures.
Proceedings of the CONCUR 2000, 2000

1999
Using the Heartbeat Failure Detector for Quiescent Reliable Communication and Consensus in Partitionable Networks.
Theor. Comput. Sci., 1999

The Cost of Graceful Degradation for Omission Failures.
Inf. Process. Lett., 1999

A Simple Bivalency Proof that <i>t</i>-Resilient Consensus Requires <i>t</i> + 1 Rounds.
Inf. Process. Lett., 1999

Revising the Weakest Failure Detector for Uniform Reliable Broadcast.
Proceedings of the Distributed Computing, 1999

1998
Failure Detection and Randomization: A Hybrid Approach to Solve Consensus.
SIAM J. Comput., 1998

Fault-Tolerant Wait-Free Shared Objects.
J. ACM, 1998

1997
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

1996
Unreliable Failure Detectors for Reliable Distributed Systems.
J. ACM, 1996

The Weakest Failure Detector for Solving Consensus.
J. ACM, 1996

Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Randomization and Failure Detection: A Hybrid Approach to Solve Consensus.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Time and Space Lower Bounds for Non-Blocking Implementations (Preliminary Version).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

On the Impossibility of Group Membership.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Crash Failures vs. Crash + Link Failures (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1994
Wait-Freedom vs. t-Resiliency and the Robustness of Wait-Free Hierarchies.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Simulating Synchronized Clocks and Common Knowledge in Distributed Systems.
J. ACM, 1993

1992
Some Results on the Impossibility, Universality, and Decidability of Consensus.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Optimal Primary-Backup Protocols.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

1991
The Causal Ordering Abstraction and a Simple Way to Implement it.
Inf. Process. Lett., 1991

Inconsistency and Contamination (Preliminary Version).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

Unreliable Failure Detectors for Asynchronous Systems (Preliminary Version).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990
Automatically Increasing the Fault-Tolerance of Distributed Algorithms.
J. Algorithms, 1990

Wakeup under Read/Write Atomicity.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Time and Message Efficient Reliable Broadcasts.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Early-Stopping Distributed Bidding and Applications (Preliminary Version).
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

Early-Delivery Atomic Broadcast.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1989
Maintaining Availability in Partitioned Replicated Databases.
ACM Trans. Database Syst., 1989

The Group Paradigm for Concurrency Control Protocols.
IEEE Trans. Knowl. Data Eng., 1989

Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version).
Proceedings of the Distributed Algorithms, 1989

1988
Effects of Message Loss on the Termination of Distributed Protocols.
Inf. Process. Lett., 1988

Automatically Increasing the Fault-Tolerance of Distributed Systems.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

1987
Checkpointing and Rollback-Recovery for Distributed Systems.
IEEE Trans. Software Eng., 1987

Fast Distributed Agreement.
SIAM J. Comput., 1987

Optimal clock synchronization.
J. ACM, 1987

Simulating Authenticated Broadcasts to Derive Simple Fault-Tolerant Algorithms.
Distributed Comput., 1987

Distributed Deadlock Detection.
Distributed Comput., 1987

Substituting for Real Time and Common Knowledge in Asynchronous Distributed Systems.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986
Distributed Agreement in the Presence of Processor and Communication Faults.
IEEE Trans. Software Eng., 1986

State Machines and Assertions: An Integrated Approach to Modeling and Verification of Distributed Systems.
Sci. Comput. Program., 1986

Availability in Partitioned Replicated Databases.
Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

Implementation Issues in Clock Synchronization.
Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1985
Asynchronous Consensus and Broadcast Protocols
J. ACM, October, 1985

Exposure to Deadlock for Communicating Processes is Hard to Detect.
Inf. Process. Lett., 1985

Fast Distributed Agreement (Preliminary Version).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

1984
On the Optimum Checkpoint Selection Problem.
SIAM J. Comput., 1984

Randomized Byzantine Agreements.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

A Distributed Algorithm for Generalized Deadlock Detection.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983
Resilient Consensus Protocols.
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

1982
The Complexity of Optimal Addressing in Radio Networks.
IEEE Trans. Commun., 1982

1981
Deadlock-Free Packet Switching Networks.
SIAM J. Comput., 1981

Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks.
SIAM J. Comput., 1981

An all-pairs shortest-path distributed algorithm.
Perform. Evaluation, 1981

1980
On the impossibility of Directed Moore Graphs.
J. Comb. Theory B, 1980

Deadlock- and Livelock-Free Packet Switching Networks
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979
The Design of Small-Diameter Networks by Local Search.
IEEE Trans. Computers, 1979


  Loading...