The Papers — Distributed Algorithms of Ancient Greece

#	Year	Paper	Book and setting
1	1978	Leslie Lamport, “Time, Clocks, and the Ordering of Events in a Distributed System.” Communications of the ACM 21, 7.	Ordering Without Clocks The Ring Road
2	1980	Marshall Pease, Robert Shostak and Leslie Lamport, “Reaching Agreement in the Presence of Faults.” Journal of the ACM 27, 2.	Agreeing Among Liars The Crown of Mount Phyle
3	1982	Leslie Lamport, Robert Shostak and Marshall Pease, “The Byzantine Generals Problem.” ACM Transactions on Programming Languages and Systems 4, 3.	Agreeing Among Liars The Crown of Mount Phyle
4	1983	Michael Ben-Or, “Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols.” PODC ’83.	Agreeing by Chance The Foot of Mount Phyle
5	1985	Michael Fischer, Nancy Lynch and Michael Paterson, “Impossibility of Distributed Consensus with One Faulty Process.” Journal of the ACM 32, 2.	The Limits of Agreement The Foot of Mount Phyle
6	1985	K. Mani Chandy and Leslie Lamport, “Distributed Snapshots: Determining Global States of Distributed Systems.” ACM Transactions on Computer Systems 3, 1.	Taking Stock Without Stopping The Ring Road
7	1987	Alan Demers et al., “Epidemic Algorithms for Replicated Database Maintenance.” PODC ’87.	Spreading by Word of Mouth The Scholars’ Coast
8	1988	Cynthia Dwork, Nancy Lynch and Larry Stockmeyer, “Consensus in the Presence of Partial Synchrony.” Journal of the ACM 35, 2.	Agreeing When Messages Run Late The Foot of Mount Phyle
9	1988	Colin Fidge, “Timestamps in Message-Passing Systems That Preserve the Partial Ordering.” 11th Australian Computer Science Conference.	Ordering Without Clocks The Ring Road
10	1988	Friedemann Mattern, “Virtual Time and Global States of Distributed Systems.” Workshop on Parallel and Distributed Algorithms.	Ordering Without Clocks The Ring Road
11	1988	Brian Oki and Barbara Liskov, “Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems.” PODC ’88.	One Leader at a Time Schedia
12	1990	Maurice Herlihy and Jeannette Wing, “Linearizability: A Correctness Condition for Concurrent Objects.” ACM Transactions on Programming Languages and Systems 12, 3.	Many Copies, Acting as One The Ring Road
13	1996	Tushar Deepak Chandra and Sam Toueg, “Unreliable Failure Detectors for Reliable Distributed Systems.” Journal of the ACM 43, 2.	Telling the Dead from the Slow The Foot of Mount Phyle
14	1998	Leslie Lamport, “The Part-Time Parliament.” ACM Transactions on Computer Systems 16, 2.	The Part-Time Parliament The Chamber
15	1999	Miguel Castro and Barbara Liskov, “Practical Byzantine Fault Tolerance.” OSDI ’99.	Keeping Order Among Liars The Crown of Mount Phyle
16	2000	Eric Brewer, “Towards Robust Distributed Systems.” keynote, PODC 2000.	Answering While Cut Off The Foot of Mount Phyle
17	2001	Leslie Lamport, “Paxos Made Simple.” ACM SIGACT News 32, 4.	The Part-Time Parliament The Chamber
18	2002	Seth Gilbert and Nancy Lynch, “Brewer’s Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services.” ACM SIGACT News 33, 2.	Answering While Cut Off The Foot of Mount Phyle
19	2010	Joseph Hellerstein, “The Declarative Imperative: Experiences and Conjectures in Distributed Logic.” ACM SIGMOD Record 39, 1.	Knowing When to Wait The Hall of Two Doors
20	2011	Marc Shapiro, Nuno Preguiça, Carlos Baquero and Marek Zawirski, “Conflict-Free Replicated Data Types.” SSS 2011.	Changes That Never Clash The Scholars’ Coast
21	2011	Marc Shapiro, Nuno Preguiça, Carlos Baquero and Marek Zawirski, “A Comprehensive Study of Convergent and Commutative Replicated Data Types.” INRIA research report RR-7506.	Changes That Never Clash The Scholars’ Coast
22	2011	Tom Ameloot, Frank Neven and Jan Van den Bussche, “Relational Transducers for Declarative Networking.” PODS 2011.	Knowing When to Wait The Hall of Two Doors
23	2012	Peter Bailis et al., “Probabilistically Bounded Staleness for Practical Partial Quorums.” Proceedings of the VLDB Endowment 5, 8.	Probably Up to Date The Scholars’ Coast
24	2014	Peter Bailis et al., “Highly Available Transactions: Virtues and Limitations.” Proceedings of the VLDB Endowment 7, 3.	What You Can Promise Alone The Scholars’ Coast
25	2019	Maofan Yin, Dahlia Malkhi, Michael Reiter, Guy Golan Gueta and Ittai Abraham, “HotStuff: BFT Consensus with Linearity and Responsiveness.” PODC 2019.	Changing Leaders Among Liars The Crown of Mount Phyle

Two books also draw on a later paper:

Seth Gilbert and Nancy Lynch, “Perspectives on the CAP Theorem.” IEEE Computer 45, 2 (2012) — also drawn on by Answering While Cut Off.
Joseph Hellerstein and Peter Alvaro, “Keeping CALM: When Distributed Consistency Is Easy.” Communications of the ACM 63, 9 (2020) — also drawn on by Knowing When to Wait.