Danny Dolev

According to our database1, Danny Dolev authored at least 218 papers between 1978 and 2019.

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

Awards

ACM Fellow

ACM Fellow 2007, "For contributions to fault-tolerant distributed computing.".

IEEE Fellow

IEEE Fellow 2017, "For development of consistent, robust, and efficient distributed computing and storage".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Distributed Protocols for Leader Election: A Game-Theoretic Perspective.
ACM Trans. Economics and Comput., 2019

Implementing Mediators with Asynchronous Cheap Talk.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Communication Complexity of Byzantine Agreement, Revisited.
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

2018
Compact routing messages in self-healing trees.
Theor. Comput. Sci., 2018

Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience.
IACR Cryptology ePrint Archive, 2018

Preventing (Network) Time Travel with Chronos.
Proceedings of the 25th Annual Network and Distributed System Security Symposium, 2018

2017
LogMemcached: An RDMA based Continuous Cache Replication.
Proceedings of the Workshop on Kernel-Bypass Networks, 2017

Stateless Computation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Synchronous counting and computational algorithm design.
J. Comput. Syst. Sci., 2016

HEX: Scaling honeycombs is easier than scaling clock trees.
J. Comput. Syst. Sci., 2016

Possibility and Impossibility of Reliable Broadcast in the Bounded Model.
CoRR, 2016

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

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

Synchronous Hybrid Message-Adversary.
CoRR, 2016

2015
Fault-tolerant Distributed Systems in Hardware.
Bulletin of the EATCS, 2015

Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

2014
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip.
J. Comput. Syst. Sci., 2014

Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation.
J. ACM, 2014

2013
Enhancing RSSI-based tracking accuracy in wireless sensor networks.
TOSN, 2013

Node-Initiated Byzantine Consensus Without a Common Clock.
CoRR, 2013

Enhanced calibration technique for RSSI-based ranging in body area networks.
Ad Hoc Networks, 2013

Synchronous Counting and Computational Algorithm Design.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Early-deciding consensus is expensive.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
An Optimal Self-Stabilizing Firing Squad.
SIAM J. Comput., 2012

FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs
CoRR, 2012

"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
CoRR, 2012

"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract).
Proceedings of the Distributed Computing - 26th International Symposium, 2012

No justified complaints: on fair sharing of multiple resources.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

2011
Fault Identification Via Nonparametric Belief Propagation.
IEEE Trans. Signal Processing, 2011

Fault-Tolerant Algorithms for Tick-Generation in Asynchronous Logic: Robust Pulse Generation - [Extended Abstract].
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2011

Delay Fast Packets (DFP): Prevention of DNS Cache Poisoning.
Proceedings of the Security and Privacy in Communication Networks, 2011

The promise in computer science research activities.
Proceedings of the Informatik 2011: Informatik schafft Communities, 2011

2010
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks.
IEEE Trans. Dependable Sec. Comput., 2010

Peer-to-peer secure multi-party numerical computation facing malicious adversaries.
Peer-to-Peer Networking and Applications, 2010

Simple Gradecast Based Algorithms
CoRR, 2010

Brief Announcement: Simple Gradecast Based Algorithms.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

A Fault-Resistant Asynchronous Clock Function.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

SPADE: Statistical Packet Acceptance Defense Engine.
Proceedings of the 11th IEEE International Conference on High Performance Switching and Routing, 2010

Continuous Close-Proximity RSSI-Based Tracking in Wireless Sensor Networks.
Proceedings of the International Conference on Body Sensor Networks, 2010

2009
Distributed Fault Identification via Non-parametric Belief Propagation
CoRR, 2009

Distributed Sensor Selection via Gaussian Belief Propagation
CoRR, 2009

A Low Density Lattice Decoder via Non-Parametric Belief Propagation
CoRR, 2009

Self-stabilizing Numerical Iterative Computation
CoRR, 2009

Collabrium: Active Traffic Pattern Prediction for Boosting P2P Collaboration.
Proceedings of the 18th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises, 2009

Distributed data flow language for multi-party protocols.
Proceedings of the Fifth Workshop on Programming Languages and Operating Systems, 2009

MULAN: Multi-Level Adaptive Network Filter.
Proceedings of the Security and Privacy in Communication Networks, 2009

Maxtream: Stabilizing P2P Streaming by Active Prediction of Behavior Patterns.
Proceedings of the 2009 Third International Conference on Multimedia and Ubiquitous Engineering, 2009

Distributed large scale network utility maximization.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Fixing convergence of Gaussian belief propagation.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Implementing reliable event streams in large systems via distributed data flows and recursive delegation.
Proceedings of the Third ACM International Conference on Distributed Event-Based Systems, 2009

2008
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines
CoRR, 2008

Polynomial Linear Programming with Gaussian Belief Propagation
CoRR, 2008

Distributed Kalman Filter via Gaussian Belief Propagation
CoRR, 2008

Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
CoRR, 2008

An Almost-Surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience
CoRR, 2008

Collabory: A Collaborative Throughput Stabilizer & Accelerator for P2P Protocols.
Proceedings of the 17th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises, 2008

Constant-Space Localized Byzantine Consensus.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Belief Propagation in Wireless Sensor Networks - A Practical Approach.
Proceedings of the Wireless Algorithms, 2008

Lower Bounds on Implementing Robust and Resilient Mediators.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Self-stabilizing Numerical Iterative Computation.
Proceedings of the Stabilization, 2008

OCD: obsessive consensus disorder (or repetitive consensus).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Fast self-stabilizing byzantine tolerant digital clock synchronization.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

An almost-surely terminating polynomial protocol forasynchronous byzantine agreement with optimal resilience.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Peer-to-Peer Secure Multi-party Numerical Computation.
Proceedings of the Proceedings P2P'08, 2008

Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures.
Proceedings of the 5th USENIX Symposium on Networked Systems Design & Implementation, 2008

Quicksilver Scalable Multicast (QSM).
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Gaussian belief propagation solver for systems of linear equations.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Gaussian belief propagation based multiuser detection.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

LiteLoad: Content unaware routing for localizing P2P protocols.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

The Building Blocks of Consensus.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Efficient Clustering for Improving Network Performance in Wireless Sensor Networks.
Proceedings of the Wireless Sensor Networks, 5th European Conference, 2008

Programming with Live Distributed Objects.
Proceedings of the ECOOP 2008, 2008

Tapping into the fountain of CPUs: on operating system support for programmable devices.
Proceedings of the 13th International Conference on Architectural Support for Programming Languages and Operating Systems, 2008

2007
Extensible Architecture for High-Performance, Scalable, Reliable Publish-Subscribe Eventing and Notification.
Int. J. Web Service Res., 2007

Live Distributed Objects: Enabling the Active Web.
IEEE Internet Computing, 2007

On Self-stabilizing Synchronous Actions Despite Byzantine Attacks.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Byzantine Self-stabilizing Pulse in a Bounded-Delay Model.
Proceedings of the Stabilization, 2007

Making Distributed Applications Robust.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Self-stabilizing and Byzantine-Tolerant Overlay Network.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

Accelerating Distributed Computing Applications Using a Network Offloading Framework.
Proceedings of the 21th International Parallel and Distributed Processing Symposium (IPDPS 2007), 2007

Exploiting Gossip for Self-Management in Scalable Event Notification Systems.
Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), 2007

Scalable Multicast Platforms for a New Generation of Robust Distributed Applications.
Proceedings of the Second International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2007), 2007

2006
On multicast trees: structure and size estimation.
IEEE/ACM Trans. Netw., 2006

Linear-time Self-stabilizing Byzantine Clock Synchronization
CoRR, 2006

Self-Stabilizing Byzantine Pulse Synchronization
CoRR, 2006

Search in Complex Networks : a New Method of Naming
CoRR, 2006

Internet resiliency to attacks and failures under BGP policy routing.
Comput. Networks, 2006

Asynchronous resource discovery.
Comput. Networks, 2006

Cooperative and reliable packet-forwarding on top of AODV.
Proceedings of the 4th International Symposium on Modeling and Optimization in Mobile, 2006

Self-stabilizing Byzantine Digital Clock Synchronization.
Proceedings of the Stabilization, 2006

Century papers at the first quarter-century milestone.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Self-stabilizing byzantine agreement.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

HYDRA: A Novel Framework for Making High-Performance Computing Offload Capable.
Proceedings of the LCN 2006, 2006

Wire-speed total order.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

On a NIC's Operating System, Schedulers and High-Performance Networking Applications.
Proceedings of the High Performance Computing and Communications, 2006

Scaling Byzantine Fault-Tolerant Replication toWide Area Networks.
Proceedings of the 2006 International Conference on Dependable Systems and Networks (DSN 2006), 2006

2005
Self-stabilization of Byzantine Protocols.
Proceedings of the Self-Stabilizing Systems, 2005

2004
Brief announcement: linear time byzantine self-stabilizing clock synchronization.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Optimal Resilience Asynchronous Approximate Agreement.
Proceedings of the Principles of Distributed Systems, 8th International Conference, 2004

Off-Piste QoS-aware Routing Protocol.
Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004), 2004

LLS: a locality aware location service for mobile ad hoc networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2004

2003
Nonmalleable Cryptography.
SIAM Review, 2003

On the Tomography of Networks and Multicast Trees
CoRR, 2003

Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks.
Proceedings of the Self-Stabilizing Systems, 6th International Symposium, SSS 2003, 2003

TCP-Friendly Many-to-Many End-to-End Congestion Control.
Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), 2003

Linear Time Byzantine Self-Stabilizing Clock Synchronization.
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

Accounting Mechanism for Membership Size-Dependent Pricing of Multicast Traffic.
Proceedings of the Group Communications and Charges; Technology and Business Models, 2003

Facilitating Efficient and Reliable Monitoring through HAMSA.
Proceedings of the Integrated Network Management VII, Managing It All, 2003

A Data-Centric Approach for Scalable State Machine Replication.
Proceedings of the Future Directions in Distributed Computing, 2003

2002
Moshe: A group membership service for WANs.
ACM Trans. Comput. Syst., 2002

Using AVL trees for fault-tolerant group key management.
Int. J. Inf. Sec., 2002

Ad Hoc Membership for Scalable Applications.
Proceedings of the Distributed Computing, 16th International Conference, 2002

An integrated architecture for the scalable delivery of semi-dynamic Web content.
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.
ACM Trans. Inf. Syst. Secur., 2001

Neighborhood Preserving Hashing and Approximate Queries.
SIAM J. Discrete Math., 2001

2000
Optimized Rekey for Group Communication Systems.
Proceedings of the Network and Distributed System Security Symposium, 2000

Implementing a Caching Service for Distributed CORBA Objects.
Proceedings of the Middleware 2000, 2000

A Client-Server Oriented Algorithm for Virtually Synchronous Group Membership in WANs.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

1999
Fault tolerance in the cardiac ganglion of the lobster.
Biological Cybernetics, 1999

Fault Tolerant Video on Demand Services.
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.
J. Comput. Syst. Sci., 1998

A Safe and Scalable Payment Infrastructure for Trade of Electronic Content.
Int. J. Cooperative Inf. Syst., 1998

An Adaptive Totally Ordered Multicast Protocol That Tolerates Partitions.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

BARTER: A Backbone Architecture for Trade of Electronic Content.
Proceedings of the Trends in Distributed Systems for Electronic Commerce, 1998

IMSS: IP Multicast Shortcut Service.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

1997
Bounded Concurrent Time-Stamping.
SIAM J. Comput., 1997

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

Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations.
J. Parallel Distributed Comput., 1997

Dynamic Voting for Consistent Primary Components.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Failure Detectors in Omission Failure Environments.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

The Caelum Toolkit for CSCW: The Sky is the Limit.
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.
Proceedings of the Networks in Distributed Computing, 1997

CONGRESS: connection-oriented group address resolution services.
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.
Journal of Computational Neuroscience, 1996

The Transis Approach to High Availability Cluster Communication.
Commun. ACM, 1996

Efficient Message Ordering in Dynamic Networks.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

A Framework for Partitionable Membership Service (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement
Inf. Comput., April, 1995

Dynamic Fault-Tolerant Clock Synchronization.
J. ACM, 1995

Sharing Memory Robustly in Message-Passing Systems.
J. ACM, 1995

Theory and Practice in Distributed Systems (Abstract).
Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Increasing the Resilience of Atomic Commit at No Additional Cost.
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.
Proceedings of IPPS '95, 1995

1994
A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.
ACM Trans. Program. Lang. Syst., 1994

Experience with RAPID prototypes.
Proceedings of IEEE 5th International Workshop on Rapid System Prototyping, 1994

Observable Clock Synchronization (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

PCODE: Efficient Parallel Computing over Distributed Environments.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Highly Available Cluster: A Case Study.
Proceedings of the Digest of Papers: FTCS/24, 1994

The Design of the Transis System.
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.
Mathematical Systems Theory, 1993

Perfectly Secure Message Transmission.
J. ACM, 1993

Atomic Snapshots of Shared Memory.
J. ACM, 1993

Finding the Neighborhood of a Query in a Dictionary.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

On Distributed Algorithms in a Broadcast Domain.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

A Highly Available Application in the Transis Environment.
Proceedings of the Hardware and Software Architectures for Fault Tolerance, 1993

Early Delivery Totally Ordered Multicast in Asynchronous Environments.
Proceedings of the Digest of Papers: FTCS-23, 1993

1992
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement
Inf. Comput., April, 1992

Determinism vs. Nondeterminism in Multiparty Communication Complexity.
SIAM J. Comput., 1992

Membership Algorithms for Multicast Communication Groups.
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Transis: A Communication Subsystem for High Availability.
Proceedings of the Digest of Papers: FTCS-22, 1992

1991
Fault-Tolerant Critical Section Management in Asynchronous Environments
Inf. Comput., November, 1991

Consensus Algorithms with One-Bit Messages.
Distributed Computing, 1991

Non-Malleable Cryptography (Extended Abstract)
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

1990
Early Stopping in Byzantine Agreement
J. ACM, October, 1990

Renaming in an Asynchronous Environment
J. ACM, July, 1990

A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem.
Proceedings of the Distributed Algorithms, 4th International Workshop, 1990

New Latency Bounds for Atomic Broadcast.
Proceedings of the Real-Time Systems Symposium, 1990

1989
The Distributed Firing Squad Problem.
SIAM J. Comput., 1989

Choice Coordination with Limited Failure.
Distributed Computing, 1989

Fault-Tolerant Critical Section Management in Asynchronous Networks.
Proceedings of the Distributed Algorithms, 1989

Bounded Concurrent Time-Stamp Systems Are Constructible
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Shared-Memory vs. Message-Passing in an Asynchronous Distributed Environment.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Bounded Polynomial Randomized Consensus.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989

Multiparty Communication Complexity
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.
SIAM J. Comput., 1988

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

Robust multi-agent decision making in faulty environment.
Proceedings of the 9th International Conference on Pattern Recognition, 1988

On Safety and Timeliness in Distributed Data Management.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

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

1987
Efficient Fault-Tolerant Routings in Networks
Inf. Comput., October, 1987

A New Look at Fault-Tolerant Network Routing
Inf. Comput., March, 1987

On the minimal synchronism needed for distributed consensus.
J. ACM, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Bounds for Width Two Branching Programs.
SIAM J. Comput., 1986

The Parallel Complexity of Scheduling with Precedence Constraints.
J. Parallel Distributed Comput., 1986

On the Possibility and Impossibility of Achieving Clock Synchronization.
J. Comput. Syst. Sci., 1986

Reaching approximate agreement in the presence of faults.
J. ACM, 1986

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

A Simple Model for Agreement in Distributed Systems.
Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

Atomic Broadcast in a Real-Time Environment.
Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1985
Bounds on Information Exchange for Byzantine Agreement
J. ACM, January, 1985

Scheduling Flat Graphs.
SIAM J. Comput., 1985

The Distributed Firing Squad Problem (Preliminary Version)
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).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

Choice Coordination with Bounded Failure (a Preliminary Version).
Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, 1985

1984
Scheduling Precedence Graphs of Bounded Height.
J. Algorithms, 1984

Correcting Faults in Write-Once Memory
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Fault-Tolerant Clock Synchronization.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Asynchronous Byzantine Consensus.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

Flipping coins in many pockets (Byzantine agreement on uniformly random values)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983
On the security of public key protocols.
IEEE Trans. Information Theory, 1983

Authenticated Algorithms for Byzantine Agreement.
SIAM J. Comput., 1983

Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1982
An Efficient Algorithm for Byzantine Agreement without Authentication
Information and Control, March, 1982

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

The Byzantine Generals Strike Again.
J. Algorithms, 1982

On the Security of Ping-Pong Protocols
Information and Control, 1982

Polynomial Algorithms for Multiple Processor Agreement
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

Finding Safe Paths in a Faulty Environment.
Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1982

'Eventual' Is Earlier than 'Immediate'
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Requirements for Agreement in a Distributed System.
Proceedings of the Second International Symposium on Distributed Data Bases, 1982

On the Security of Multi-Party Protocols in Distributed Systems.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981
Optimal Wiring between Rectangles
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

On the Security of Public Key Protocols (Extended Abstract)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

Unanimity in an Unknown and Unreliable Environment
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1979
Commutation Preperties and Generating Sets Characterize Slices of Various Synchronization Primitives.
Theor. Comput. Sci., 1979

1978
Commutation Relations of Slices Characterize Some Synchronization Primitives.
Inf. Process. Lett., 1978


  Loading...