Leslie Barry Lamport was born on February 7, 1941. He is an American computer scientist and mathematician. Lamport is most known for his important work in distributed systems and for creating the document preparation system LaTeX, along with writing its first manual.

In 2013, Lamport won the Turing Award for helping to make sense of the confusing way distributed computing systems work. These systems involve multiple computers that operate independently and communicate by sending messages to each other. Lamport created key algorithms and developed methods to model and check how these systems function. His work has improved the accuracy, speed, and dependability of computer systems.

Early life and education

Lamport was born into a Jewish family in Brooklyn, New York, to parents named Benjamin and Hannah Lamport (née Lasser). His father was born in Volkovisk, which was part of the Russian Empire (now known as Vawkavysk, Belarus), and his mother was born in the Austro-Hungarian Empire (now southeastern Poland).

After graduating from Bronx High School of Science, Lamport earned a Bachelor’s degree in mathematics from the Massachusetts Institute of Technology in 1960. He later received a Master’s degree in mathematics from Brandeis University in 1963 and a Doctorate degree in mathematics from the same university in 1972. His doctoral thesis, titled The analytic Cauchy problem with singular data, focuses on the study of how certain mathematical problems can have unusual or complex solutions in the field of analytic partial differential equations.

Career and research

Lamport worked as a computer scientist at Massachusetts Computer Associates from 1970 to 1977, at Stanford Research Institute (SRI International) from 1977 to 1985, and at Digital Equipment Corporation and Compaq from 1985 to 2001. In 2001, he joined Microsoft Research in California, and he retired in January 2025.

Lamport’s research contributions helped create the theory of distributed systems. His most important papers include:

• "Time, Clocks, and the Ordering of Events in a Distributed System," which won the Principles of Distributed Computing (PODC) Influential Paper Award in 2000,
• "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs," which introduced the idea of sequential consistency,
• "The Byzantine Generals’ Problem,"
• "Distributed Snapshots: Determining Global States of a Distributed System," and
• "The Part-Time Parliament."

These papers discuss topics like logical clocks (and the happened-before relationship) and Byzantine failures. They are among the most cited papers in computer science and describe algorithms to solve important problems in distributed systems, including:

• the Paxos algorithm for consensus,
• the bakery algorithm for mutual exclusion of multiple threads in a computer system that need the same resources at the same time,
• the Chandy–Lamport algorithm for determining consistent global states (snapshot), and
• the Lamport signature, one of the first prototypes of the digital signature.

When Donald Knuth started releasing early versions of TeX in the 1980s, Lamport, because he needed to write a book, began creating a set of macros based on TeX. He hoped these macros would become the standard package for TeX. This set of macros later became known as LaTeX. In 1983, Peter Gordon, an editor at Addison-Wesley, asked Lamport to turn his user manual into a book.

In September 1984, Lamport released version 2.06a of the LaTeX macros. In August 1985, he released LaTeX 2.09, the final version of his LaTeX. Addison-Wesley published Lamport’s first LaTeX user manual, LaTeX: A Document Preparation System, in 1986. The book sold over a few hundred thousand copies. On August 21, 1989, at a TeX User Group meeting at Stanford, Lamport agreed to hand over the maintenance and development of LaTeX to Frank Mittelbach. Mittelbach, along with Chris Rowley and Rainer Schöpf, formed the LaTeX3 team. They later released LaTeX 2e, the current version of LaTeX, in 1994.

Lamport is also known for his work on temporal logic, where he introduced the temporal logic of actions (TLA). One of his recent contributions is TLA, a language for describing and analyzing concurrent and reactive systems. He explains TLA in the book Specifying Systems: The TLA Language and Tools for Hardware and Software Engineers. He describes TLA+ as a "quixotic attempt to overcome engineers’ antipathy towards mathematics."

Awards and honors

Lamport was awarded the 2013 Turing Award for important work in the theory and practice of systems that work together and handle tasks at the same time. His contributions include the creation of ideas like causality and logical clocks, safety and liveness, replicated state machines, and sequential consistency, which help systems stay synchronized. In 1991, he was elected to the National Academy of Engineering for his work on the theoretical basis of systems that handle tasks together and remain reliable even when problems occur. In 2014, he became a Fellow of the Association for Computing Machinery for his contributions to the theory and practice of systems that work together and handle tasks at the same time. He received five honorary doctorates from European universities: University of Rennes and Christian Albrechts University of Kiel in 2003, École Polytechnique Fédérale de Lausanne (EPFL) in 2004, University of Lugano in 2006, and Nancy-Université in 2007. In 2004, he received the IEEE Emanuel R. Piore Award. In 2005, the paper "Reaching Agreement in the Presence of Faults" was honored with the Dijkstra Prize. To celebrate Lamport's 60th birthday, a lecture series was held at the 20th Symposium on Principles of Distributed Computing (PODC 2001). In 2008, he received the IEEE John von Neumann Medal. In 2011, he was elected to the National Academy of Sciences. In 2020, the Solana blockchain platform named its smallest unit of currency the "lamport" in his honor. A lamport is a small part of the main currency, equal to 0.000000001 sol (one billionth of a sol).