default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDConcurrency: the Works of Leslie Lamport, 2019
- Dahlia Malkhi:
Concurrency: the Works of Leslie Lamport. ACM 2019, ISBN 978-1-4503-7270-1 - Preface.
- Dahlia Malkhi, Idit Keidar:
Introduction. 1-12 - Leslie Lamport:
The computer science of concurrency: the early years. 13-26 - Hagit Attiya, Jennifer L. Welch:
Shared memory and the Bakery algorithm. 27-46 - Karolos Antoniadis, Rachid Guerraoui
:
The notions of time and global state in a distributed system. 47-65 - Christian Cachin:
Byzantine faults. 67-81 - Robbert van Renesse:
State machine replication with benign failures. 83-102 - Stephan Merz:
Formal specification and verification. 103-129 - Roy Levin:
Biography. 131-170 - Leslie Lamport:
A new solution of Dijkstra's concurrent programming problem. 171-178 - Leslie Lamport:
Time, clocks, and the ordering of events in a distributed system. 179-196 - Leslie Lamport:
How to make a multiprocessor computer that correctly executes multiprocess programs. 197-201 - Leslie Lamport, Robert E. Shostak, Marshall C. Pease:
The Byzantine generals problem. 203-226 - Leslie Lamport:
The mutual exclusion problem: part I - A theory of interprocess communication. 227-245 - Leslie Lamport:
The mutual exclusion problem: part II - Statement and solutions. 247-276 - Leslie Lamport:
The part-time parliament. 277-317 - References. 319-333
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-14 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
