Danny Dolev

Danny Raz

Gleb Shaviner

Proceedings of the Integrated Network Management VII, Managing It All, 2003

A Data-Centric Approach for Scalable State Machine Replication.

[BibT_eX]

[DOI]

Gregory V. Chockler

Dahlia Malkhi

Proceedings of the Future Directions in Distributed Computing, 2003

2002

Moshe: A group membership service for WANs.

[BibT_eX]

[DOI]

ACM Trans. Comput. Syst., 2002

Using AVL trees for fault-tolerant group key management.

[BibT_eX]

[DOI]

Ohad Rodeh

Kenneth P. Birman

Int. J. Inf. Sec., 2002

Ad Hoc Membership for Scalable Applications.

[BibT_eX]

[DOI]

Tal Anker

Ilya Shnayderman

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

An integrated architecture for the scalable delivery of semi-dynamic Web content.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Computers and Communications (ISCC 2002), 2002

2001

The architecture and performance of security protocols in the ensemble group communication system: Using diamonds to guard the castle.

[BibT_eX]

[DOI]

Ohad Rodeh

Kenneth P. Birman

ACM Trans. Inf. Syst. Secur., 2001

2000

Nonmalleable Cryptography.

[BibT_eX]

[DOI]

Cynthia Dwork

Moni Naor

SIAM J. Comput., 2000

Optimized Rekey for Group Communication Systems.

[BibT_eX]

[DOI]

Ohad Rodeh

Kenneth P. Birman

Proceedings of the Network and Distributed System Security Symposium, 2000

Implementing a Caching Service for Distributed CORBA Objects.

[BibT_eX]

[DOI]

Proceedings of the Middleware 2000, 2000

A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

1999

Fault tolerance in the cardiac ganglion of the lobster.

[BibT_eX]

[DOI]

Ehud Sivan

Hanna Parnas

Biol. Cybern., 1999

Fault Tolerant Video on Demand Services.

[BibT_eX]

[DOI]

Tal Anker

Proceedings of the 19th International Conference on Distributed Computing Systems, Austin, TX, USA, May 31, 1999

1998

Increasing the Resilience of Distributed and Replicated Database Systems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

A Safe and Scalable Payment Infrastructure for Trade of Electronic Content.

[BibT_eX]

[DOI]

Gadi Shamir

Int. J. Cooperative Inf. Syst., 1998

An Adaptive Totally Ordered Multicast Protocol That Tolerates Partitions.

[BibT_eX]

[DOI]

Gregory V. Chockler

N. Huleihel

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

BARTER: A Backbone Architecture for Trade of Electronic Content.

[BibT_eX]

[DOI]

Gadi Shamir

Proceedings of the Trends in Distributed Systems for Electronic Commerce, 1998

IMSS: IP Multicast Shortcut Service.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

1997

Bounded Concurrent Time-Stamping.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996.

[BibT_eX]

[DOI]

Real Time Syst., 1997

Dynamic Voting for Consistent Primary Components.

[BibT_eX]

[DOI]

Esti Yeger Lotem

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

Failure Detectors in Omission Failure Environments.

[BibT_eX]

[DOI]

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

The Caelum Toolkit for CSCW: The Sky is the Limit.

[BibT_eX]

Proceedings of the Next Generation Information Technologies and Systems (NGITS '97), Third International Workshop, Neve Ilan, Israel, June 30, 1997

Scalable group membership services for novel applications.

[BibT_eX]

[DOI]

Proceedings of the Networks in Distributed Computing, 1997

CONGRESS: connection-oriented group address resolution services.

[BibT_eX]

[DOI]

Proceedings of the Broadband Networking Technologies, Dallas, TX, USA, November 2, 1997, 1997

1996

Relationship between burst properties and sensitivity to input: A theoretical analysis.

[BibT_eX]

[DOI]

Ehud Sivan

Hanna Parnas

J. Comput. Neurosci., 1996

The Transis Approach to High Availability Cluster Communication.

[BibT_eX]

[DOI]

Commun. ACM, 1996

Efficient Message Ordering in Dynamic Networks.

[BibT_eX]

[DOI]

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

A Framework for Partitionable Membership Service (Abstract).

[BibT_eX]

[DOI]

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

1995

Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement

[BibT_eX]

[DOI]

Inf. Comput., April, 1995

Dynamic Fault-Tolerant Clock Synchronization.

[BibT_eX]

[DOI]

J. ACM, 1995

Theory and Practice in Distributed Systems (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations.

[BibT_eX]

[DOI]

Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

Increasing the Resilience of Atomic Commit at No Additional Cost.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain.

[BibT_eX]

[DOI]

Proceedings of IPPS '95, 1995

1994

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

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1994

Neighborhood Preserving Hashing and Approximate Queries.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Experience with RAPID prototypes.

[BibT_eX]

[DOI]

Ray Strong

Ed Wimmers

Proceedings of IEEE 5th International Workshop on Rapid System Prototyping, 1994

Observable Clock Synchronization (Extended Abstract).

[BibT_eX]

[DOI]

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

PCODE: Efficient Parallel Computing over Distributed Environments.

[BibT_eX]

[DOI]

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

Highly Available Cluster: A Case Study.

[BibT_eX]

[DOI]

Proceedings of the Digest of Papers: FTCS/24, 1994

The Design of the Transis System.

[BibT_eX]

[DOI]

Proceedings of the Theory and Practice in Distributed Systems, International Workshop, 1994

1993

A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1993

Finding the Neighborhood of a Query in a Dictionary.

[BibT_eX]

[DOI]

Yuval Harari

Michal Parnas

Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

On Distributed Algorithms in a Broadcast Domain.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

A Highly Available Application in the Transis Environment.

[BibT_eX]

[DOI]

Ofir Amir

Yair Amir

Proceedings of the Hardware and Software Architectures for Fault Tolerance, 1993

Early Delivery Totally Ordered Multicast in Asynchronous Environments.

[BibT_eX]

[DOI]

Shlomo Kramer

Proceedings of the Digest of Papers: FTCS-23, 1993

1992

Determinism vs. Nondeterminism in Multiparty Communication Complexity.

[BibT_eX]

[DOI]

Tomás Feder

SIAM J. Comput., 1992

Membership Algorithms for Multicast Communication Groups.

[BibT_eX]

[DOI]

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

Transis: A Communication Subsystem for High Availability.

[BibT_eX]

[DOI]

Proceedings of the Digest of Papers: FTCS-22, 1992

1991

Fault-Tolerant Critical Section Management in Asynchronous Environments

[BibT_eX]

[DOI]

Inf. Comput., November, 1991

Consensus Algorithms with One-Bit Messages.

[BibT_eX]

[DOI]

Distributed Comput., 1991

Non-Malleable Cryptography (Extended Abstract)

[BibT_eX]

[DOI]

Cynthia Dwork

Moni Naor

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990

Early Stopping in Byzantine Agreement

[BibT_eX]

[DOI]

J. ACM, October, 1990

Renaming in an Asynchronous Environment

[BibT_eX]

[DOI]

J. ACM, July, 1990

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

[BibT_eX]

[DOI]

Yehuda Afek

Eli Gafni

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

New Latency Bounds for Atomic Broadcast.

[BibT_eX]

[DOI]

Flaviu Cristian

Proceedings of the Real-Time Systems Symposium, 1990

Sharing Memory Robustly in Message-Passing Systems.

[BibT_eX]

[DOI]

Hagit Attiya

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Atomic Snapshots of Shared Memory.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

Perfectly Secure Message Transmission

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

1989

The Distributed Firing Squad Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Choice Coordination with Limited Failure.

[BibT_eX]

[DOI]

Distributed Comput., 1989

Fault-Tolerant Critical Section Management in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 1989

Bounded Concurrent Time-Stamp Systems Are Constructible

[BibT_eX]

[DOI]

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Bounded Polynomial Randomized Consensus.

[BibT_eX]

[DOI]

Hagit Attiya

Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Multiparty Communication Complexity

[BibT_eX]

[DOI]

Tomás Feder

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

1988

Some Geometry for General River Routing.

[BibT_eX]

[DOI]

Alan Siegel

SIAM J. Comput., 1988

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

[BibT_eX]

[DOI]

Eli Gafni

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

Robust multi-agent decision making in faulty environment.

[BibT_eX]

[DOI]

Dragutin Petkovic

Proceedings of the 9th International Conference on Pattern Recognition, 1988

On Safety and Timeliness in Distributed Data Management.

[BibT_eX]

[DOI]

Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

Families of Consensus Algorithms.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)

[BibT_eX]

[DOI]

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

1986

The Parallel Complexity of Scheduling with Precedence Constraints.

[BibT_eX]

[DOI]

Eli Upfal

Manfred K. Warmuth

J. Parallel Distributed Comput., 1986

Cheating Husbands and other Stories: A Case Study of Knowledge, Action, and Communication.

[BibT_eX]

[DOI]

Yoram Moses

Joseph Y. Halpern

Distributed Comput., 1986

A Simple Model for Agreement in Distributed Systems.

[BibT_eX]

[DOI]

Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

Atomic Broadcast in a Real-Time Environment.

[BibT_eX]

[DOI]

Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1985

Scheduling Flat Graphs.

[BibT_eX]

[DOI]

Manfred K. Warmuth

SIAM J. Comput., 1985

The Distributed Firing Squad Problem (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Cheating Husbands and Other Stories: A Case Study of Knowledge, Action, and Communication (Preliminary Version).

[BibT_eX]

[DOI]

Yoram Moses

Joseph Y. Halpern

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

Choice Coordination with Bounded Failure (a Preliminary Version).

[BibT_eX]

[DOI]

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

1984

Scheduling Precedence Graphs of Bounded Height.

[BibT_eX]

[DOI]

Manfred K. Warmuth

J. Algorithms, 1984

Correcting Faults in Write-Once Memory

[BibT_eX]

[DOI]

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

A New Look at Fault Tolerant Network Routing

[BibT_eX]

[DOI]

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

On the Possibility and Impossibility of Achieving Clock Synchronization

[BibT_eX]

[DOI]

Joseph Y. Halpern

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Efficient Fault Tolerant Routings in Networks

[BibT_eX]

[DOI]

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Fault-Tolerant Clock Synchronization.

[BibT_eX]

[DOI]

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

Asynchronous Byzantine Consensus.

[BibT_eX]

[DOI]

Chagit Attiya

Joseph Gil

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

Flipping coins in many pockets (Byzantine agreement on uniformly random values)

[BibT_eX]

[DOI]

Andrei Z. Broder

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

On the security of public key protocols.

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

IEEE Trans. Inf. Theory, 1983

Authenticated Algorithms for Byzantine Agreement.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Bounds for Width Two Branching Programs

[BibT_eX]

[DOI]

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Reaching Approximate Agreement in the Presence of Faults.

[BibT_eX]

Proceedings of the Third Symposium on Reliability in Distributed Software and Database Systems, 1983

On the Minimal Synchronism Needed for Distributed Consensus

[BibT_eX]

[DOI]

Cynthia Dwork

Larry J. Stockmeyer

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

An Efficient Algorithm for Byzantine Agreement without Authentication

[BibT_eX]

[DOI]

Inf. Control., March, 1982

An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle.

[BibT_eX]

[DOI]

Maria M. Klawe

Michael Rodeh

J. Algorithms, 1982

The Byzantine Generals Strike Again.

[BibT_eX]

[DOI]

J. Algorithms, 1982

Polynomial Algorithms for Multiple Processor Agreement

[BibT_eX]

[DOI]

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Bounds on Information Exchange for Byzantine Agreement.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

Finding Safe Paths in a Faulty Environment.

[BibT_eX]

[DOI]

José Meseguer

Marshall C. Pease

Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

'Eventual' Is Earlier than 'Immediate'

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Requirements for Agreement in a Distributed System.

[BibT_eX]

Proceedings of the Second International Symposium on Distributed Data Bases, 1982

On the Security of Multi-Party Protocols in Distributed Systems.

[BibT_eX]

[DOI]

Avi Wigderson

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

On the Security of Ping-Pong Protocols.

[BibT_eX]

[DOI]

Shimon Even

Richard M. Karp

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981

Optimal Wiring between Rectangles

[BibT_eX]

[DOI]

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

On the Security of Public Key Protocols (Extended Abstract)

[BibT_eX]

[DOI]

Andrew Chi-Chih Yao

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

Unanimity in an Unknown and Unreliable Environment

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1979

Commutation Preperties and Generating Sets Characterize Slices of Various Synchronization Primitives.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1979

1978

Commutation Relations of Slices Characterize Some Synchronization Primitives.

[BibT_eX]

[DOI]