Sam Toueg
#143,768
Most Influential Person Now
Sam Toueg's AcademicInfluence.com Rankings
Sam Touegcomputer-science Degrees
Computer Science
#7062
World Rank
#7438
Historical Rank
Database
#4122
World Rank
#4288
Historical Rank
Download Badge
Computer Science
Why Is Sam Toueg Influential?
(Suggest an Edit or Addition)Sam Toueg's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Unreliable failure detectors for reliable distributed systems (1996) (2819)
- The weakest failure detector for solving consensus (1992) (824)
- Checkpointing and Rollback-Recovery for Distributed Systems (1986) (694)
- Fault-tolerant broadcasts and related problems (1993) (612)
- Asynchronous consensus and broadcast protocols (1985) (524)
- A Modular Approach to Fault-Tolerant Broadcasts and Related Problems (1994) (416)
- The primary-backup approach (1993) (416)
- On the quality of service of failure detectors (2000) (396)
- Optimal clock synchronization (1985) (341)
- The weakest failure detector for solving consensus (1996) (314)
- Failure detection and consensus in the crash-recovery model (1998) (276)
- On the impossibility of group membership (1996) (260)
- The Causal Ordering Abstraction and a Simple Way to Implement it (1991) (257)
- Maintaining availability in partitioned replicated databases (1987) (197)
- Simulating authenticated broadcasts to derive simple fault-tolerant algorithms (1987) (187)
- Unreliable Failure Detectors for Asynchronous Systems (1991) (178)
- Randomized Byzantine Agreements (1984) (168)
- On the impossibility of Directed Moore Graphs (1980) (168)
- Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication (1997) (168)
- Optimal clock synchronization (1987) (162)
- Distributed agreement in the presence of processor and communication faults (1986) (155)
- Communication-efficient leader election and consensus with limited link synchrony (2004) (137)
- Automatically Increasing the Fault-Tolerance of Distributed Algorithms (1990) (136)
- Fault-tolerant wait-free shared objects (1992) (134)
- Stable Leader Election (2001) (133)
- On the Optimum Checkpoint Selection Problem (1984) (132)
- The weakest failure detectors to solve certain fundamental problems in distributed computing (2004) (130)
- On implementing omega with weak reliability and synchrony assumptions (2003) (127)
- Using the Heartbeat Failure Detector for Quiescent Reliable Communication and Consensus in Partitionable Networks (1999) (116)
- Availability in partitioned replicated databases (1985) (115)
- Unreliable failure detectors for asynchronous systems (preliminary version) (1991) (112)
- On the quality of service of failure detectors based on control theory (2006) (104)
- Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes (1996) (96)
- On the Formal Specification of Group Membership Services (1994) (94)
- Resilient consensus protocols (1983) (94)
- A distributed algorithm for generalized deadlock detection (1984) (91)
- Time and Space Lower Bounds for Nonblocking Implementations (2000) (89)
- A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds (1998) (85)
- Fast Distributed Agreement (1987) (84)
- Primary-Backup Protocols: Lower Bounds and Optimal Implementations (1992) (82)
- On Quiescent Reliable Communication (2000) (74)
- Deadlock-free packet switching networks (1979) (69)
- Automatically increasing the fault-tolerance of distributed systems (1988) (67)
- Some Results on the Impossibility, Universality, and Decidability of Consensus (1992) (65)
- Thrifty Generic Broadcast (2000) (60)
- Time and Message Efficient Reliable Broadcasts (1990) (59)
- Abortable and query-abortable objects and their efficient implementation (2007) (58)
- From set membership to group membership: a separation of concerns (2006) (55)
- Failure Detection and Randomization: A Hybrid Approach to Solve Consensus (1999) (54)
- Substituting for real time and common knowledge in asynchronous distributed systems (1987) (53)
- On implementing omega in systems with weak reliability and synchrony assumptions (2008) (51)
- Reliable Broadcast in Synchronous and Asynchronous Environments (Preliminary Version) (1989) (50)
- Non-blocking atomic commitment (1993) (49)
- Simulating synchronized clocks and common knowledge in distributed systems (1993) (46)
- Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract) (1994) (45)
- On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems (2002) (45)
- Consensus with Byzantine Failures and Little System Synchrony (2006) (44)
- Every problem has a weakest failure detector (2008) (42)
- Deadlock- and livelock-free packet switching networks (1980) (42)
- Optimal Primary-Backup Protocols (1992) (42)
- Revising the Weakest Failure Detector for Uniform Reliable Broadcast (1999) (42)
- The correctness proof of Ben-Or’s randomized consensus algorithm (1998) (39)
- The Design of Small-Diameter Networks by Local Search (1979) (34)
- Randomization and Failure Detection: A Hybrid Approach to Solve Consensus (1996) (31)
- Solving Problems in the Presence of Process Crashes and Lossy Links (1996) (31)
- Early-delivery atomic broadcast (1990) (30)
- Distributed deadlock detection (1987) (28)
- Passing Messages while Sharing Memory (2018) (28)
- Effects of Message Loss on the Termination of Distributed Protocols (1988) (27)
- A robust and lightweight stable leader election service for dynamic systems (2008) (26)
- Understanding Non-Blocking Atomic Commitment (1993) (26)
- An all-pairs shortest-path distributed algorithm (1981) (25)
- Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks (1981) (24)
- Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus (2005) (23)
- Inconsistency and contamination (preliminary version) (1991) (23)
- Wakeup under Read/Write Atomicity (1990) (22)
- Quiescent Reliable Communication and Quiescent Consensus in Partitionable Networks (1997) (21)
- The Group Paradigm for Concurrency Control Protocols (1989) (20)
- On deterministic abortable objects (2013) (20)
- Revisiting Safety and Liveness in the Context of Failures (2000) (20)
- Proceedings of the twelfth annual ACM symposium on Principles of distributed computing (1993) (20)
- Exposure to Deadlock for Communicating Processes is Hard to Detect (1983) (15)
- With Finite Memory Consensus Is Easier Than Reliable Broadcast (2008) (15)
- Partial synchrony based on set timeliness (2009) (14)
- Proceedings of the 5th International Workshop on Distributed Algorithms (1991) (14)
- Timeliness-based wait-freedom: a gracefully degrading progress condition (2008) (13)
- Distributed Snapshots In Spite of Failures (1984) (12)
- Crash failures vs. crash + link failures (1996) (11)
- The weakest failure detector to solve nonuniform consensus (2005) (10)
- Complement kinetics during continuous arteriovenous hemofiltration: studies with a new polysulfone hemofilter. (1988) (9)
- The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit (2012) (9)
- On the Formal Speci cation ofGroup Membership Services (1995) (8)
- The Cost of Graceful Degradation for Omission Failures (1999) (8)
- Early-Stopping Distributed Bidding and Applications (Preliminary Version) (1990) (8)
- State Machines and Assertions: An Integrated Approach to Modeling and Verification of Distributed Systems (1986) (8)
- On the Number of Objects with Distinct Power and the Linearizability of Set Agreement Objects (2017) (7)
- Life beyond set agreement (2017) (7)
- Asynchronous Consensus and Byzantine Protocols in Faulty Environments (1983) (7)
- Chapter The Primary Backup Approach (1993) (7)
- Fast distributed agreement (preliminary version) (1985) (7)
- An Authenticated Byzantine Generals Algorithm with Early Stopping (1984) (6)
- Optimal Register Construction in M&M Systems (2019) (6)
- Fast fault-tolerant agreement algorithms (2005) (6)
- On the Weakest Failure Detector for Quiescent Reliable Communication (1997) (6)
- The minimum information about failures for solving non-local tasks in message-passing systems (2009) (6)
- On atomic registers and randomized consensus in M&M systems (2019) (6)
- Substituting for Real Time and Common Knowledge in Distributed Systems (1986) (6)
- On Register Linearizability and Termination (2021) (6)
- Time and space lower bounds for non-blocking implementations (preliminary version) (1996) (6)
- Randomized Asynchronous Byzantine Agreements (1983) (5)
- On Linearizability and the Termination of Randomized Algorithms (2020) (5)
- Implementation Issues in Clock Synchronization (1986) (5)
- On the Classification of Deterministic Objects via Set Agreement Power (2018) (5)
- Randomized Consensus with Regular Registers (2020) (4)
- Distributed Algorithms (1992) (4)
- The design of deadlock- and livelock-free packet switching networks (1979) (4)
- Brief Announcement: Abortable and Query-Abortable Objects (2006) (4)
- Adaptive progress: a gracefully-degrading liveness property (2010) (4)
- k-Abortable Objects: Progress Under High Contention (2016) (3)
- An Algorithm for Replicated Objects with Efficient Reads (2016) (3)
- The Complexity of Optimal Addressing in Radio Networks (1982) (2)
- Bounded Disagreement (2020) (2)
- The Minimum Failure Detector For Non-Local Tasks In Message-Passing Systems (2009) (2)
- An Impossibility Result on Strong Linearizability in Message-Passing Systems (2021) (2)
- Simple and Efficient Byzantine General Algorithms with Early Stopping (1984) (2)
- On the Weakest Failure Detector for Uniform Reliable Broadcast (1999) (2)
- On the specification of fault-tolerant broadcast (1990) (2)
- Quand le consensus est plus simple que la diffusion fiable (2009) (1)
- Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems (2009) (1)
- The correctness proof of Ben-Or’s randomized consensus algorithm (2012) (1)
- Consensus is Easier Than Reliable Broadcast (2008) (1)
- Effects of Message Loss on Distributed Termination (1987) (1)
- The group paradigm for concurrency control (1988) (1)
- On the robustness of the hrm hierarchy (1998) (0)
- Partial synchrony based on set timeliness (2012) (0)
- AD-A 253 611 DTIC 1 I ii 1 ll ELECTE D JUL 3 0 1992 C The Weakest Failure Detector for Solving Consensus * (0)
- DISC at Its 20th Anniversary (Stockholm, 2006) (2007) (0)
- Lower Bounds for a Primary–Backup Implementation of a Bofo Service (2013) (0)
- Providing Design Abstractions in Distributed Systems (1988) (0)
- On Deterministic Linearizable Set Agreement Objects (2019) (0)
- Life beyond set agreement (2020) (0)
- Parameterized algorithm for replicated objects with local reads (2022) (0)
- A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling (2015) (0)
- Pspace-hard Functions Checkable Debate Systems and Approximation Algorithms for Pspace (2007) (0)
- DISC at its 20th anniversary: past, present and future (2006) (0)
- Effects of message loss on distributed termination. Technical report (1987) (0)
- Weakly Growing Context-sensitive Grammars Chicago Journal of Theoretical Computer Science (1996) (0)
- Distributed algorithms : 5th international workshop, WDAG '91, Delphi, Greece, October 7-9, 1991 : proceedings (1992) (0)
- 2 Model and Wakeup Specification (2005) (0)
- CM Understanding Non-Blocking Atomic Commitment (1993) (0)
- Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (info) Self-stabilization by Tree Correction (1995) (0)
- Crash Failures vs. Crash + Link Failures (Abstract). (1996) (0)
- B No Lockout \an Ecient Protocol for Checkpointing Recovery in Distibuted Systems", to Appear in Ieee Trans. Parallel and Appendix (proofs) (1993) (0)
- On implementing SWMR registers from SWSR registers in systems with Byzantine failures (2022) (0)
- On atomic registers and randomized consensus in M&M systems (2021) (0)
- REACHING AGREEMENT A Fundamental Task — Even in Distributed Computer Systems (2013) (0)
- A separation of (n -1)-consensus and n-consensus in read-write shared-memory systems (2014) (0)
- Differentiated nonblocking: a new progress condition and a matching queue algorithm (2021) (0)
This paper list is powered by the following services:
What Schools Are Affiliated With Sam Toueg?
Sam Toueg is affiliated with the following schools:
