Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
Reaching approximate agreement in the presence of faults
Journal of the ACM (JACM)
Easy impossibility proofs for distributed consensus problems
Distributed Computing
Distributed Computing
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
Journal of the ACM (JACM)
On the possibility and impossibility of achieving clock synchronization
Journal of Computer and System Sciences
Transaction commit in a realistic fault model
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Asymptotically optimal algorithms for approximate agreement
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Gap theorems for distributed computing
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Limitations on database availability when networks partition
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The distributed firing squad problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Knowledge and common knowledge in a Byzantine environment I: crash failures
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Transaction commitment at minimal communication cost
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A knowledge-theoretic analysis of atomic commitment protocols
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Simulating synchronous processors
Information and Computation
A lower bound for probabilistic distributed algorithms
Journal of Algorithms
On the bit complexity of distributed computations in a ring with a leader
Information and Computation
Achieving consensus in fault-tolerant distributed computer systems: protocols, lower bounds, and simulations
Symmetry in distributed systems
Symmetry in distributed systems
Language complexity on the synchronous anonymous ring
Theoretical Computer Science
Extended impossibility results for asynchronous complete networks
Information Processing Letters
Fault-tolerant decision making in totally asynchronous distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Asynchronous approximate agreement
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing two-writer atomic registers
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Effects of message loss on the termination of distributed protocols
Information Processing Letters
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
A tradeoff between information and communication in broadcast protocols
VLSI Algorithms and Architectures
Computing on an anonymous network
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Data link layer: two impossibility results
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Impossibility and universality results for wait-free synchronization
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Tight bounds for the sequence transmission problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On the improbability of reaching Byzantine agreements
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
Journal of the ACM (JACM)
Efficiency of Synchronous Versus Asynchronous Distributed Systems
Journal of the ACM (JACM)
The Weak Byzantine Generals Problem
Journal of the ACM (JACM)
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Communication-time trade-offs in network synchronization
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Impossibility of distributed consensus with one faulty process
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Lower Bounds for Synchronous Networks and the Advantage of Local Information
Proceedings of the 2nd International Workshop on Distributed Algorithms
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Bounds on information exchange for Byzantine Agreement
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a distributed environment
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Byzantine clock synchronization
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
A New Explanation of the Glitch Phenomenon
A New Explanation of the Glitch Phenomenon
Probabilistic Solitude Detection II: Ring Size Known Exactly
Probabilistic Solitude Detection II: Ring Size Known Exactly
Fault-tolerant distributed algorithms for agreement and election
Fault-tolerant distributed algorithms for agreement and election
The impossibility of implementing reliable communication in the face of crashes
Journal of the ACM (JACM)
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Lower Bounds in Distributed Computing
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Operation-valency and the cost of coordination
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Analysis of a randomized rendezvous algorithm
Information and Computation
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Solving Vector Consensus with a Wormhole
IEEE Transactions on Parallel and Distributed Systems
A Distributed Protocol for Dynamic Address Assignment in Mobile Ad Hoc Networks
IEEE Transactions on Mobile Computing
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
On the message complexity of binary byzantine agreement under crash failures
Distributed Computing
Efficient parallel algorithms can be made robust
Distributed Computing
Broadcast in the rendezvous model
Information and Computation
A new adaptive accrual failure detector for dependable distributed systems
Proceedings of the 2007 ACM symposium on Applied computing
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Information and Computation
Journal of Parallel and Distributed Computing
Tight Local Approximation Results for Max-Min Linear Programs
Algorithmic Aspects of Wireless Sensor Networks
Reliable relaying with uncertain knowledge
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Broadcast in the rendezvous model
Information and Computation
ARCS'07 Proceedings of the 20th international conference on Architecture of computing systems
Communication algorithms with advice
Journal of Computer and System Sciences
Autonomous and scalable failure detection in distributed systems
International Journal of Autonomous and Adaptive Communications Systems
On the message complexity of global computations
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Tight bounds for parallel randomized load balancing: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Distributed computing with rules of thumb
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Characterizing topological assumptions of distributed algorithms in dynamic networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Distributed computing with advice: information sensitivity of graph coloring
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Best-response dynamics out of sync: complexity and characterization
Proceedings of the fourteenth ACM conference on Electronic commerce
| Hi-index | 0.00 |