Concurrency: the Works of Leslie Lamport - researchr publication

researchr

You are not signed in
Sign in
Sign up

Dahlia Malkhi, editor, Concurrency: the Works of Leslie Lamport. ACM, 2019. [doi]

Abstract is missing.

IntroductionDahlia Malkhi, Idit Keidar. 1-12 [doi]

The computer science of concurrency: the early yearsLeslie Lamport. 13-26 [doi]

Shared memory and the Bakery algorithmHagit Attiya, Jennifer L. Welch. 27-46 [doi]

The notions of time and global state in a distributed systemKarolos Antoniadis, Rachid Guerraoui. 47-65 [doi]

Byzantine faultsChristian Cachin. 67-81 [doi]

State machine replication with benign failuresRobbert van Renesse. 83-102 [doi]

Formal specification and verificationStephan Merz. 103-129 [doi]

BiographyRoy Levin. 131-170 [doi]

A new solution of Dijkstra's concurrent programming problemLeslie Lamport. 171-178 [doi]

Time, clocks, and the ordering of events in a distributed systemLeslie Lamport. 179-196 [doi]

How to make a multiprocessor computer that correctly executes multiprocess programsLeslie Lamport. 197-201 [doi]

The Byzantine generals problemLeslie Lamport, Robert E. Shostak, Marshall C. Pease. 203-226 [doi]

The mutual exclusion problem: part I - A theory of interprocess communicationLeslie Lamport. 227-245 [doi]

The mutual exclusion problem: part II - Statement and solutionsLeslie Lamport. 247-276 [doi]

The part-time parliamentLeslie Lamport. 277-317 [doi]

References319-333 [doi]

runs on WebDSL