Dahlia Malkhi received her Ph.D., an M.Sc. and a B.Sc. in computer science from the Hebrew University of Jerusalem. She is currently a lead researcher at Calibra. She is an ACM fellow (2011), serves on the Simons Institute Advisory Board, on the MIT Cryptocurrency Journal Advisory Board, and on the editorial boards of the Distributed Computing Journal. Her research career spans between industrial research and academia: 2014–2019, founding member and principal researcher at VMware Research; 2004–2014, principal researcher at Microsoft Research, Silicon Valley; 1999–2007, associate professor at the Hebrew University of Jerusalem; 1995–1999, senior researcher, AT&T Labs-Research, New Jersey. She has research interest in applied and foundational aspects of reliability and security in distributed systems.

• PrefacePhoto and Text CreditsIntroductionThe Computer Science of Concurrency: The Early YearsPART I TECHNICAL PERSPECTIVES ON LAMPORT'S WORKShared Memory and the Bakery AlgorithmThe Notions of Time and Global State in a Distributed SystemByzantine FaultsState Machine Replication with Benign FailuresFormal Specification and VerificationBiographyPART II SELECTED PAPERSA New Solution of Dijkstra's Concurrent Programming ProblemTime, Clocks, and the Ordering of Events in a Distributed SystemHow to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsThe Byzantine Generals ProblemThe Mutual Exclusion Problem: Part I—A Theory of Interprocess CommunicationThe Mutual Exclusion Problem: Part II—Statement and SolutionsThe Part-Time ParliamentReferencesIndexBiographies

Dahlia Malkhi received her Ph.D., an M.Sc. and a B.Sc. in computer science from the Hebrew University of Jerusalem. She is currently a lead researcher at Calibra. She is an ACM fellow (2011), serves on the Simons Institute Advisory Board, on the MIT Cryptocurrency Journal Advisory Board, and on the editorial boards of the Distributed Computing Journal. Her research career spans between industrial research and academia: 2014–2019, founding member and principal researcher at VMware Research; 2004–2014, principal researcher at Microsoft Research, Silicon Valley; 1999–2007, associate professor at the Hebrew University of Jerusalem; 1995–1999, senior researcher, AT&T Labs-Research, New Jersey. She has research interest in applied and foundational aspects of reliability and security in distributed systems.

• PrefacePhoto and Text CreditsIntroductionThe Computer Science of Concurrency: The Early YearsPART I TECHNICAL PERSPECTIVES ON LAMPORT'S WORKShared Memory and the Bakery AlgorithmThe Notions of Time and Global State in a Distributed SystemByzantine FaultsState Machine Replication with Benign FailuresFormal Specification and VerificationBiographyPART II SELECTED PAPERSA New Solution of Dijkstra's Concurrent Programming ProblemTime, Clocks, and the Ordering of Events in a Distributed SystemHow to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsThe Byzantine Generals ProblemThe Mutual Exclusion Problem: Part I—A Theory of Interprocess CommunicationThe Mutual Exclusion Problem: Part II—Statement and SolutionsThe Part-Time ParliamentReferencesIndexBiographies

Dahlia Malkhi received her Ph.D., an M.Sc. and a B.Sc. in computer science from the Hebrew University of Jerusalem. She is currently a lead researcher at Calibra. She is an ACM fellow (2011), serves on the Simons Institute Advisory Board, on the MIT Cryptocurrency Journal Advisory Board, and on the editorial boards of the Distributed Computing Journal. Her research career spans between industrial research and academia: 2014–2019, founding member and principal researcher at VMware Research; 2004–2014, principal researcher at Microsoft Research, Silicon Valley; 1999–2007, associate professor at the Hebrew University of Jerusalem; 1995–1999, senior researcher, AT&T Labs-Research, New Jersey. She has research interest in applied and foundational aspects of reliability and security in distributed systems.

• PrefacePhoto and Text CreditsIntroductionThe Computer Science of Concurrency: The Early YearsPART I TECHNICAL PERSPECTIVES ON LAMPORT'S WORKShared Memory and the Bakery AlgorithmThe Notions of Time and Global State in a Distributed SystemByzantine FaultsState Machine Replication with Benign FailuresFormal Specification and VerificationBiographyPART II SELECTED PAPERSA New Solution of Dijkstra's Concurrent Programming ProblemTime, Clocks, and the Ordering of Events in a Distributed SystemHow to Make a Multiprocessor Computer That Correctly Executes Multiprocess ProgramsThe Byzantine Generals ProblemThe Mutual Exclusion Problem: Part I—A Theory of Interprocess CommunicationThe Mutual Exclusion Problem: Part II—Statement and SolutionsThe Part-Time ParliamentReferencesIndexBiographies