Danny Dolev

Q: What Schools Are Affiliated With Danny Dolev

Danny Dolev is affiliated with the following schools: Weizmann Institute of Science, IBM Research – Almaden, Hebrew University of Jerusalem, Stanford University

Danny Dolev's AcademicInfluence.com Rankings

Danny Dolev

Computer Science

#1413

World Rank

#1462

Historical Rank

Database

#1052

World Rank

#1106

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Danny Dolev Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Daniel Dolev is an Israeli computer scientist known for his research in cryptography and distributed computing. He holds the Berthold Badler Chair in Computer Science at the Hebrew University of Jerusalem and is a member of the scientific council of the European Research Council.

(See a Problem?)

Danny Dolev'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

On the security of public key protocols (1983) (5114)
Non-malleable cryptography (1991) (1029)
On the minimal synchronism needed for distributed consensus (1983) (703)
Nonmalleable Cryptography (2000) (696)
Authenticated Algorithms for Byzantine Agreement (1983) (602)
The Byzantine Generals Strike Again (1981) (560)
Reaching approximate agreement in the presence of faults (1986) (514)
Perfectly secure message transmission (1990) (440)
Atomic snapshots of shared memory (1990) (425)
ATOMIC BROADCAST: FROM SIMPLE MESSAGE DIFFUSION TO BYZANTINE AGREEMENT (1995) (396)
Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation (2006) (377)
The Transis approach to high availability cluster communication (1996) (377)
Sharing memory robustly in message-passing systems (1990) (359)
Transis: A Communication Sub-system for High Availability (1992) (354)
Renaming in an asynchronous environment (1990) (329)
Sharing memory robustly in message-passing systems (1995) (268)
Bounds on information exchange for Byzantine agreement (1985) (259)
Early stopping in Byzantine agreement (1990) (250)
Transis: a communication subsystem for high availability (1992) (240)
Non-Malleable Cryptography (Extended Abstract) (1991) (224)
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle (1982) (213)
On the possibility and impossibility of achieving clock synchronization (1984) (213)
Fault-tolerant clock synchronization (1984) (198)
Shifting gears: changing algorithms on the fly to expedite Byzantine agreement (1987) (176)
Polynomial algorithms for multiple processor agreement (1982) (171)
On the Security of Public Key Protocols (Extended Abstract) (1981) (150)
Atomic snapshots of shared memory (1993) (146)
An Efficient Algorithm for Byzantine Agreement without Authentication (1982) (135)
LLS: a locality aware location service for mobile ad hoc networks (2004) (131)
On the Security of Ping-Pong Protocols (1982) (130)
Membership Algorithms for Multicast Communication Groups (1992) (130)
No justified complaints: on fair sharing of multiple resources (2011) (124)
Failure detectors in omission failure environments (1997) (114)
Gaussian belief propagation solver for systems of linear equations (2008) (108)
Efficient message ordering in dynamic networks (1996) (97)
"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract) (2012) (97)
Moshe: A group membership service for WANs (2002) (95)
Optimized Group Rekey for Group Communications Systems (1999) (94)
Scaling Byzantine Fault-Tolerant Replication toWide Area Networks (2006) (92)
Efficient message passing interface (MPI) for parallel computing on clusters of workstations (1995) (90)
Early delivery totally ordered multicast in asynchronous environments (1993) (90)
Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks (2010) (89)
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience (2019) (87)
Achievable cases in an asynchronous environment (1987) (86)
Dynamic fault-tolerant clock synchronization (1995) (85)
Superconcentrators, generalizers and generalized connectors with limited depth (1983) (80)
Dynamic voting for consistent primary components (1997) (77)
Bounded concurrrent time-stamp systems are constructible (1989) (74)
Communication Complexity of Byzantine Agreement, Revisited (2018) (74)
Planar Embedding of Planar Graphs (1983) (73)
Shared-memory vs. message-passing in an asynchronous distributed environment (1989) (70)
Increasing the resilience of atomic commit, at no additional cost (1995) (70)
Optimal wiring between rectangles (1981) (69)
A client-server oriented algorithm for virtually synchronous group membership in WANs (2000) (69)
The architecture and performance of security protocols in the ensemble group communication system (2000) (67)
Enhancing RSSI-based tracking accuracy in wireless sensor networks (2013) (66)
A framework for partitionable membership service (1996) (64)
Optimal Resilience Asynchronous Approximate Agreement (2004) (64)
Bounded Concurrent Time-Stamping (1997) (63)
Using AVL trees for fault-tolerant group key management (2000) (63)
Lower Bounds on Implementing Robust and Resilient Mediators (2007) (62)
Internet resiliency to attacks and failures under BGP policy routing (2006) (62)
An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience (2008) (61)
Bounds for width two branching programs (1983) (61)
'Eventual' is earlier than 'immediate' (1982) (61)
Efficient Clustering for Improving Network Performance in Wireless Sensor Networks (2008) (58)
Distributed Protocols for Leader Election: A Game-Theoretic Perspective (2013) (58)
Profile Scheduling of Opposing Forests and Level Orders (1985) (57)
Unanimity in an unknown and unreliable environment (1981) (57)
The distributed firing squad problem (1985) (56)
Robust and Efficient Replication Using Group Communication (1994) (56)
Fault tolerant video on demand services (1999) (56)
Cheating husbands and other stories: A case study of knowledge, action, and communication (1986) (56)
A new look at fault tolerant network routing (1984) (55)
High performance string matching algorithm for a network intrusion prevention system (NIPS) (2006) (55)
Gaussian belief propagation based multiuser detection (2008) (54)
Implementing a Caching Service for Distributed CORBA Objects (2000) (54)
Self-Stabilizing Pulse Synchronization Inspired by Biological Pacemaker Networks (2003) (53)
Bounded polynomial randomized consensus (1989) (53)
A Highly Available Paradigm for Consistent Object Replication (1994) (52)
Nysiad: Practical Protocol Transformation to Tolerate Byzantine Failures (2008) (51)
Programming with Live Distributed Objects (2008) (50)
Optimized Rekey for Group Communication Systems (2000) (49)
An adaptive totally ordered multicast protocol that tolerates partitions (1998) (49)
Scalable group membership services for novel applications (1997) (48)
Fast self-stabilizing byzantine tolerant digital clock synchronization (2008) (48)
A bounded first-in, first-enabled solution to the l-exclusion problem (1994) (47)
Scheduling Precedence Graphs of Bounded Height (1984) (47)
Linear Time Byzantine Self-Stabilizing Clock Synchronization (2003) (47)
Fixing convergence of Gaussian belief propagation (2009) (47)
A New Look at Fault-Tolerant Network Routing (1987) (47)
The Byzantine generals (1987) (46)
Increasing the Resilience of Distributed and Replicated Database Systems (1998) (45)
Toward a non-atomic era: l-exclusion as a test case (1988) (44)
Distributed large scale network utility maximization (2009) (44)
Asynchronous Byzantine consensus (1984) (43)
Enhanced calibration technique for RSSI-based ranging in body area networks (2013) (40)
The Separation for General Single-Layer Wiring Barriers (1981) (39)
Searching complex networks efficiently with minimal information (2006) (39)
Efficient Synchronous Byzantine Consensus (2017) (38)
Group communication as an infrastructure for distributed system management (1996) (37)
Scheduling Flat Graphs (1985) (37)
Tapping into the fountain of CPUs: on operating system support for programmable devices (2008) (37)
A Highly Available Application in the Transis Environment (1994) (37)
On multicast trees: structure and size estimation (2006) (36)
Self-stabilizing Byzantine Digital Clock Synchronization (2006) (34)
Flipping coins in many pockets (Byzantine agreement on uniformly random values) (1984) (34)
Byzantine Self-stabilizing Pulse in a Bounded-Delay Model (2007) (33)
On Self-stabilizing Synchronous Actions Despite Byzantine Attacks (2007) (33)
Requirements for Agreement in a Distributed System (1982) (33)
Peer-to-peer secure multi-party numerical computation facing malicious adversaries (2008) (32)
Linear Detection via Belief Propagation (2007) (32)
DISTRIBUTED COMMIT WITH BOUNDED WAITING (1982) (32)
Synchronous counting and computational algorithm design (2013) (31)
Continuous Close-Proximity RSSI-Based Tracking in Wireless Sensor Networks (2010) (30)
Self-stabilization of Byzantine Protocols (2005) (30)
Ensemble Security (1998) (29)
Efficient fault tolerant routings in networks (1984) (28)
Cooperative and Reliable Packet-Forwarding on Top of AODV (2006) (28)
Self-stabilizing byzantine agreement (2006) (28)
Asynchronous resource discovery (2003) (28)
A Gaussian Belief Propagation Solver for Large Scale Support Vector Machines (2008) (28)
Quicksilver Scalable Multicast (QSM) (2008) (27)
The Design of the Transis System (1994) (27)
Extensible Architecture for High-Performance, Scalable, Reliable Publish-Subscribe Eventing and Notification (2007) (27)
The architecture and performance of security protocols in the ensemble group communication system: Using diamonds to guard the castle. (2001) (27)
Neighborhood preserving hashing and approximate queries (1994) (26)
Self-stabilizing and Byzantine-Tolerant Overlay Network (2007) (25)
Fault-tolerant algorithms for tick-generation in asynchronous logic (2011) (25)
Multiparty communication complexity (1989) (25)
CONGRESS: connection-oriented group address resolution services (1997) (24)
Live Distributed Objects: Enabling the Active Web (2007) (23)
Efficient Fault-Tolerant Routings in Networks (1987) (23)
Totally ordered broadcast in the face of network partitions: exploiting group communication for repl (1999) (23)
Distributed Kalman filter via Gaussian Belief Propagation (2008) (22)
The Building Blocks of Consensus (2008) (20)
Finding the neighborhood of a query in a dictionary (1993) (20)
Tomography of scale-free networks and shortest path trees. (2006) (20)
On linear area embedding of planar graphs (1981) (19)
Fault Identification Via Nonparametric Belief Propagation (2009) (19)
On multicast trees: structure and size estimation (2003) (18)
Self-Stabilizing Byzantine Pulse Synchronization (2006) (18)
New latency bounds for atomic broadcast (1990) (18)
QuickSilver Scalable Multicast (2007) (18)
Efficient State Transfer in Partitionable Environments (1997) (18)
Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip☆ (2014) (18)
Polynomial Linear Programming with Gaussian belief propagation (2008) (18)
A low density lattice decoder via non-parametric belief propagation (2009) (18)
Families of Consensus Algorithms (1988) (17)
Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity (2015) (17)
Group Communication Speci cations: A Comprehensive Study (1999) (17)
Evaluating Total Order Algorithms in WAN (2003) (17)
Determinism vs. Nondeterminism in Multiparty Communication Complexity (1992) (17)
Early-deciding consensus is expensive (2013) (17)
Fault tolerance in the cardiac ganglion of the lobster (1999) (16)
Atomic Broadcast in a Real-Time Environment (1986) (16)
Simple Gradecast Based Algorithms (2010) (16)
Accounting Mechanism for Membership Size-Dependent Pricing of Multicast Traffic (2003) (16)
Consensus algorithms with one-bit messages (1991) (16)
Exploiting Gossip for Self-Management in Scalable Event Notification Systems (2007) (14)
The design of xpand: a group communication system for wide area networks (2000) (14)
A Simple Model for Agreement in Distributed Systems (1986) (14)
Belief Propagation in Wireless Sensor Networks - A Practical Approach (2008) (13)
The Parallel Complexity of Scheduling with Precedence Constraints (1986) (13)
Total Ordering of Messages in Broadcast Domains (1992) (13)
Highly available cluster: a case study (1994) (13)
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem (1990) (13)
Some Geometry for General River Routing (1988) (12)
ON THE MINIMAL SYNCHRONISMNEEDED FOR DISTRIBUTED CONSENSUS (1983) (12)
Modified Belief Propagation Algorithm for Energy Saving in Wireless and Sensor Networks (2005) (12)
Steward: Scaling Byzantine Fault-Tolerant Systems to Wide Area Networks (2005) (12)
Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application (2008) (12)
Making Distributed Applications Robust (2007) (12)
Transport Layer End-to-End Error Correcting (2004) (12)
HEX: scaling honeycombs is easier than scaling clock trees (2013) (12)
Collabrium: Active Traffic Pattern Prediction for Boosting P2P Collaboration (2009) (11)
A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment (1993) (11)
The Caelum Toolkit for CSCW: The Sky is the Limit (1997) (11)
Preventing (Network) Time Travel with Chronos (2018) (11)
A Framework for Partitionable Membership Service (Abstract). (1996) (11)
Bounded Concurrent TimeStamp Systems Are Constructible (1989) (11)
Deciding in Partitionable Networks (1995) (10)
On the Role of Helper Peers in P2P Networks (2010) (10)
LiteLoad: Content unaware routing for localizing P2P protocols (2008) (10)
Compact routing messages in self-healing trees (2015) (10)
Accelerating Distributed Computing Applications Using a Network Offloading Framework (2007) (10)
Brief Announcement: Simple Gradecast Based Algorithms (2010) (9)
Distributed Protocols for Leader Election (2019) (9)
Some Garbage In - Some Garbage Out: Asynchronous t-Byzantine as Asynchronous Benign t-resilient system with fixed t-Trojan-Horse Inputs (2016) (9)
Scalable Multicast Platforms for a New Generation of Robust Distributed Applications (2007) (9)
Implementing Mediators with Asynchronous Cheap Talk (2018) (9)
Revisiting asynchronous fault tolerant computation with optimal resilience (2020) (8)
Implementing reliable event streams in large systems via distributed data flows and recursive delegation (2009) (8)
Bounds on information exchange for Byzantine Agreement (1982) (8)
Fault-Tolerant Critical Section Management in Asynchronous Environments (1991) (8)
An Optimal Self-Stabilizing Firing Squad (2009) (8)
PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain (1995) (7)
On Distributed Algorithms in a Broadcast Domain (1993) (7)
How the Hidden Hand Shapes the Market for Software Reliability (2006) (7)
A Study of Group Rekeying (2000) (7)
Constant-Space Localized Byzantine Consensus (2008) (7)
A Data-Centric Approach for Scalable State Machine Replication (2003) (7)
One Algorithm to Match Them All: On a Generic NIPS Pattern Matching Algorithm (2007) (7)
Fault-tolerant Distributed Systems in Hardware (2015) (7)
Brief announcement: linear time byzantine self-stabilizing clock synchronization (2004) (7)
Indexing data-oriented overlay networks using belief propagation (2005) (7)
Search in Complex Networks : a New Method of Naming (2006) (7)
Delay Fast Packets (DFP): Prevention of DNS Cache Poisoning (2011) (6)
Properties Framework and Typed Endpoints for Scalable Group Communication (2006) (6)
Observable clock synchronization extended abstract (1994) (6)
HYDRA: A Novel Framework for Making High-Performance Computing Offload Capable (2006) (6)
On a NIC's Operating System, Schedulers and High-Performance Networking Applications (2006) (6)
Theory of Computing and Systems (1992) (6)
Off-piste QoS-aware routing protocol (2004) (5)
Programming Live Distributed Objects with Distributed Data Flows (2009) (5)
Experience with RAPID prototypes (1994) (5)
Correcting faults in write-once memory (1984) (5)
A Additional Proofs (1998) (5)
Distributed Sensor Selection via Gaussian Belief Propagation (2009) (5)
OCD: obsessive consensus disorder (or repetitive consensus) (2008) (5)
A Decentralized High Performance Time Service Architecture (1995) (5)
Path-Regular Graphs. (1980) (4)
Declarative Reliable Multi-Party Protocols (2007) (4)
BARTER: A Backbone Architecture for Trade of Electronic Content (1998) (4)
Supporting Multiple Quality of Service Optionswith High Performance Groupware (1996) (4)
Human Motion Tracking and Orientation Estimation using inertial sensors and RSSI measurements (2011) (4)
An integrated architecture for the scalable delivery of semi-dynamic Web content (2002) (4)
Collabory: A Collaborative Throughput Stabilizer & Accelerator for P2P Protocols (2008) (4)
A message-passing solver for linear systems (2008) (4)
On the Security of Multi-Party Protocols in Distributed Systems (1982) (4)
On the Tomography of Networks and Multicast Trees (2003) (4)
Probabilistic fair queuing (2001) (4)
Distributed Sensor Selection using a Truncated Newton Method (2009) (4)
Maxtream: Stabilizing P2P Streaming by Active Prediction of Behavior Patterns (2009) (4)
Stateless Computation (2016) (4)
Ad Hoc Membership for Scalable Applications (2002) (4)
PCODE: efficient parallel computing over distributed environments (1994) (3)
Distributed data flow language for multi-party protocols (2009) (3)
Efficient Peer-to-Peer Content Distribution (2006) (3)
TCP-friendly many-to-many end-to-end congestion control (2003) (3)
IMSS: IP Multicast Shortcut Service (1998) (3)
Achievable Cases in an Asynchronous Environment (Extended Abstract) (1987) (3)
Warm backup using snooping (1994) (3)
Preventing (Network) Time Travel with Chronos. (2018) (3)
MULAN: Multi-Level Adaptive Network Filter (2009) (3)
Synchronous Hybrid Message-Adversary (2016) (3)
Proceedings of the Israel Symposium on Theory of Computing and Systems (1992) (3)
A Safe and Scalable Payment Infrastructure for Trade of Electronic Content (1998) (3)
Cheating husbands and other stories (preliminary version): a case study of knowledge, action, and communication (1985) (3)
Implementing a caching service a distributed COBRA objects (2000) (3)
Self-Stabilizing Byzantine Token Circulation (2005) (3)
Achieving Reliability Through Distributed Data Flows and Recursive Delegation (2009) (2)
Evolution vs. Intelligent Design in Consensus Protocols (2007) (2)
A Secure Selection and Filtering Mechanism for the Network Time Protocol Version 4 (2019) (2)
Dynamic Voting for Consistent Primary Components 1 (1996) (2)
On Safety and Timeliness in Distributed Data Management (1988) (2)
Object-Oriented Architecture for Web Services Eventing (2010) (2)
Commutation Relations of Slices Characterize Some Synchronization Primitives (1978) (2)
Colordag: An Incentive-Compatible Blockchain (2022) (2)
Fault-Tolerant Critical Section Management in Asynchronous Networks (1989) (2)
Wire-speed total order (2006) (2)
The Distributed Firing Squad Problem (Preliminary Version) (1985) (2)
Distributed Fault Identification via Non-parametric Belief Propagation (2009) (2)
Finding safe paths in a faulty environment (1982) (2)
Facilitating efficient and reliable monitoring through HAMSA (2003) (2)
Choice coordination with limited failure (1989) (2)
C ONGRES S : C ONnection-oriented Group address RESolution Service (2017) (2)
Exploitation of electromagnetic radiation properties for medical diagnostic (2011) (1)
DYNAMIC OFFLOADING INFRASTRUCTURE FOR PROGRAMMABLE DEVICES (2007) (1)
Using AVL Trees for Fault Tolerant (2000) (1)
ILP FORMULATION FOR DYNAMIC OFFLOADING LAYOUTS (2007) (1)
LogMemcached: An RDMA based Continuous Cache Replication (2017) (1)
Towards Self-stabilizing Byzantine Fault-Tolerant Clock Generation in Systems-on-Chip (2012) (1)
MULTIPLE IDENTITY ATTACKS ON DISTRIBUTED SYSTEMS (2005) (1)
Theory and Practice in Distributed Systems (Abstract) (1995) (1)
IT ] 18 J an 2 00 9 Distributed Large Scale Network Utility Maximization (2009) (1)
Robust multi-agent decision making in faulty environment (1988) (1)
Self-stabilizing Numerical Iterative Computation (2008) (1)
The QuickSilver Properties Framework ( abstract for an OSDI 2006 poster ) (2006) (1)
A Fault-Resistant Asynchronous Clock Function (2010) (1)
Century papers at the first quarter-century milestone (2006) (1)
New Latency Bounds for Atomic Broadcast (EXTENDED ABSTRACT) (1990) (1)
Observable Clock Synchronization Med. Universitt at Zu L Ubeck (1994) (0)
Laboratory for Massachusetts It Institute Of (0)
5 Applications and Concluding Remarks Acknowledgemnt: I Wish to Thank Shmuel Zaks for His Helpful Comments (1995) (0)
Cluster Communication Group Communication (1996) (0)
Scheduling Wide Graphs (1998) (0)
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, Toronto, Ontario, Canada, August 15-17, 1988 (1988) (0)
SPADE: Statistical Packet Acceptance Defense Engine (2010) (0)
Complexity of Byzantine Agreement , Revisited (2019) (0)
The promise in computer science research activities (2011) (0)
N MIT / LCS / TM-423 0 ) N SHARING MEMORY ROBUSTLY IN MESSAGE-PASSING SYSTEMS (0)
Compiler Aided Ticket Scheduling ( CATS ) For Non-Preemptive Embedded Systems (2005) (0)
Node-Initiated Byzantine Consensus Without a Common Clock (2013) (0)
Relationship between burst properties and sensitivity to input: A theoretical analysis (1996) (0)
Procede et dispositif destines a la gestion de communications (2006) (0)
2011 Edsger W. Dijkstra Prize in Distributed Computing Sharing Memory Robustly in Message-passing Systems (2011) (0)
A Byzantizer for Ad Hoc Routing Schemes (2005) (0)
Hierarchical Reactive Monitoring of Multicast Membership Size (2002) (0)
Report Dagstuhl Seminar on Time Services Schloß Dagstuhl, March 11. – March 15. 1996 (1997) (0)
Byzantine Processors and Cuckoo Birds: Confining Maliciousness to the Outset (2016) (0)
Acknowledgments: We Thank (2007) (0)
Self-Stabilizing Byzantine Agreement in a Synchronous Network (2011) (0)
A Layered Synchronized Simulation Pair-Wise Synchronized System in Emulated Fail-Stop Model Fail-Stop Fault Model over an Omission Fault Model a Semi-Synchronized System to a Pair-Wise Synchronized System in the Emulated Fail-Stop Model (2015) (0)
Statistical Packet Acceptance Defense Engine (2010) (0)
Method for securing concurrence among asynchronous processors (1982) (0)
IP-SENATE : IP multicast SErvice for Non-broadcast Accessnetworking TEchnology (2007) (0)
Linear-time Self-stabilizing Byzantine Clock Synchronization (2006) (0)
Sensor Fusion of Intelligent Sensors using Probability Density (2020) (0)
A sequential analytical method for the howard mould count test of tomato products (1977) (0)
Method for synchronizing local time scale with standard time scale (1993) (0)
Possibility and Impossibility of Reliable Broadcast in the Bounded Model (2016) (0)
Commutation Preperties and Generating Sets Characterize Slices of Various Synchronization Primitives (1979) (0)
Choice coordination with bounded failure (a preliminary version) (1985) (0)
Towards Highly Available Three-Tier Monitoring Applications ( Extended Abstract ) (2007) (0)
Authenticated Consensus in Synchronous Systems with Mixed Faults (2022) (0)
Method for achieving Byzantine agreement with early stopping and without authentication (1983) (0)
A NETWORK INTRUSION PREVENTION SYSTEM (NIPS) FOR HIGH-SPEED NETWORKS (2005) (0)
FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs (2012) (0)
Highly Available Monitoring System Architecture (HAMSA) (2003) (0)
A Additional Proofs 6 Discussion (0)
Theory of Computing and Systems: Istcs '92 Israel Symposium Haifa, Israel, May 27-28, 1992 Proceedings (1992) (0)
Multiparty Coin1nunicat)ion Complexity (1989) (0)
Symposium proceedings on Theory of computing and systems (1992) (0)
Robust Mult i-Agent8 Decision LIaking in Faulty Em-ironnieiit (1988) (0)
Coordination Problems in Distributed Systems (extended Abstract) (0)
Time Services (Dagstuhl Seminar 9611) (2021) (0)
Full Program Committee (2006) (0)

This paper list is powered by the following services:

Other Resources About Danny Dolev

en.wikipedia.org

What Schools Are Affiliated With Danny Dolev?

Danny Dolev is affiliated with the following schools: