A Hundred Impossibility Proofs for Distributed Computing

A Hundred Impossibility Proofs for Distributed Computing (1989)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Nancy A. Lynch

Citations:

24 - 1 self

BibTeX

@MISC{Lynch89ahundred,
    author = {Nancy A. Lynch},
    title = {A Hundred Impossibility Proofs for Distributed Computing},
    year = {1989}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1300	Impossibility of distributed consensus with one faulty process - Fischer, Lynch, et al. - 1985
1069	The byzantine generals problem - Lamport, Shostak, et al. - 1982
725	the Ordering of Events in a Distributed System - Time - 1978
450	Reaching agreement in the presence of faults - Pease, Shostak, et al. - 1980
350	Hierarchical correctness proofs for distributed algorithms - Lynch, Tuttle - 1987
259	Solution of a problem in concurrent programming control - Dijkstra - 1965
217	On the minimal synchronism needed for distributed consensus - Dolev, Dwork, et al. - 1987
191	Notes on Data Base Operating Systems - Gray - 1978
171	Local and global properties in networks of processors (Extended Abstract - Angluin - 1980
152	Randomized Byzantine generals - Rabin - 1983
122	Knowledge and common knowledge in a Byzantine environment: Crash failures - Dwork, Moses - 1990
122	A lower bound for the time to assure interactive consistency - Fischer, Lynch - 1982
114	The Byzantine generals strike again - Dolev - 1982
99	An Upper and Lower Bound for Clock Synchronization - Lundelius, Lynch - 1984
89	Reaching approximate agreement in the presence of faults - Dolev, Lynch, et al. - 1986
86	Programming simultaneous actions using common knowledge - Moses, Tuttle - 1988
77	Computing on an anonymous ring - Attiya, Snir, et al. - 1988
74	Impossibility and Universality Results for Wait-Free Synchronization,” PODC - Herlihy - 1988
73	A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization - Bar-Yehuda, Goldreich, et al. - 1992
71	Optimal Algorithms for Byzantine Agreement - Feldman, Micali - 1988
68	On the possibility and impossibility of achieving clock synchronization - Dolev, Halpern, et al. - 1986
68	M.: Easy impossibility proofs for distributed consensus problems - Fischer, Lynch, et al. - 1986
66	Constructing Two-writer Atomic Registers - Bloom - 1988
65	On processor coordination using asynchronous hardware - Chor, Israeli, et al. - 1987
62	Economical solutions for the critical section problem in a distributed system - Peterson, Fischer - 1977
59	Symmetry breaking in distributed networks - Itai, Rodeh - 1990
51	Cryptographic protocols - DeMillo, Lynch, et al. - 1982
48	On describing the behavior and implementation of distributed systems - Lynch, Fischer - 1981
44	Electing a leader in a synchronous ring - Frederickson, Lynch - 1987
33	Bounds on information exchange for byzantine agreement - Dolev, Reischuk - 1985
30	Computing on Anonymous Networks - Yamashita, Kameda - 1988
30	Limitations on Database Availability when Networks Partition - Coan, Oki, et al. - 1986
29	On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes - Bougé - 1988
26	Efficiency of synchronous versus asynchronous distributed systems - Arjomandi, Lynch - 1980
26	A Formal Model for Message Passing Systems - Burns - 1981
24	Asymptotically optimal algorithms for approximate agreement - Fekete - 1986
23	Mutual exclusion using indivisible reads and writes - Burns, Lynch - 1980
22	Tight lower and upper bounds for some distributed algorithms for a complete network of processors - Korach, Moran, et al. - 1984
21	Time and message bounds for election in synchronous and asynchronous complete networks - Afek, Gafni - 1991
19	Data requirements for implementation of n-process mutual exclusion using a single shared variable - Burns, Fisher, et al. - 1982
19	Tight Bounds for the Sequence Transmission Problem - Wang, Zuck - 1989
18	Fault-tolerant decision making in totally asynchronous distributed systems - Bridgland, Watro - 1987
18	The data link layer: two impossibility results - Lynch, Mansour, et al. - 1988
16	Shumuel Zaks. A combinatorial characterization of the distributed 1-solvable tasks - Biran, Moran - 1990
15	Lower bounds for distributed maximumfinding algorithms - Pachl, Korach, et al. - 1984
14	Asynchronous approximate agreement - Fekete - 1987
13	Asynchronous Byzantine consensus - ATTIYA, DOLEV, et al.
13	The inherent cost of nonblocking commitment - Dwork, Skeen - 1983
13	A knowledge-theoretic analysis of atomic commitment protocols - Hadzilacos - 1987
13	A trade-off between information and communication in broadcast protocols - Awerbuch, Goldreich, et al. - 1990