Related Research Articles
Leslie B. Lamport is an American computer scientist and mathematician. Lamport is best known for his seminal work in distributed systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual.
Self-stabilization is a concept of fault-tolerance in distributed systems. Given any initial state, a self-stabilizing distributed system will end up in a correct state in a finite number of execution steps.
Shafrira Goldwasser is an Israeli-American computer scientist and winner of the Turing Award in 2012. She is the RSA Professor of Electrical Engineering and Computer Science at Massachusetts Institute of Technology; a professor of mathematical sciences at the Weizmann Institute of Science, Israel; the director of the Simons Institute for the Theory of Computing at the University of California, Berkeley; and co-founder and chief scientist of Duality Technologies.
In computer science, concurrency is the ability of different parts or units of a program, algorithm, or problem to be executed out-of-order or in partial order, without affecting the outcome. This allows for parallel execution of the concurrent units, which can significantly improve overall speed of the execution in multi-processor and multi-core systems. In more technical terms, concurrency refers to the decomposability of a program, algorithm, or problem into order-independent or partially-ordered components or units of computation.
Shlomi Dolev is a Rita Altura Trust Chair Professor in Computer Science at Ben-Gurion University of the Negev (BGU) and the head of the BGU Negev Hi-Tech Faculty Startup Accelerator.
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.
George Varghese is a Principal Researcher at Microsoft Research. Before joining MSR's lab in Silicon Valley in 2013, he was a Professor of Computer Science at the University of California San Diego, where he led the Internet Algorithms Lab and also worked with the Center for Network Systems and the Center for Internet Epidemiology. He is the author of the textbook Network Algorithmics, published by Morgan Kaufmann in 2004.
David J. DeWitt is a computer scientist specializing in database management system research at the Massachusetts Institute of Technology. Prior to moving to MIT, DeWitt was the John P. Morgridge Professor (Emeritus) of Computer Sciences at the University of Wisconsin–Madison. He was also a Technical Fellow at Microsoft, leading the Microsoft Jim Gray Systems Lab at Madison, Wisconsin. Professor DeWitt received a B.A. degree from Colgate University in 1970, and a Ph.D. from the University of Michigan in 1976. He then joined the University of Wisconsin-Madison and started the Wisconsin Database Group, which he led for more than 30 years.
Edward Joseph McCluskey was a professor at Stanford University. He was a pioneer in the field of Electrical Engineering.
The ACM Symposium on Principles of Distributed Computing (PODC) is an academic conference in the field of distributed computing organised annually by the Association for Computing Machinery.
Larry Joseph Stockmeyer was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer.
Cynthia Dwork is an American computer scientist best known for her contributions to cryptography, distributed computing, and algorithmic fairness. She is one of the inventors of differential privacy and proof-of-work.
Michael John Fischer is an American computer scientist who works in the fields of distributed computing, parallel computing, cryptography, algorithms and data structures, and computational complexity.
Fred Barry Schneider is an American computer scientist, based at Cornell University, where he is the Samuel B. Eckert Professor of Computer Science. He has published in numerous areas including science policy, cybersecurity, and distributed systems. His research is in the area of concurrent and distributed systems for high-integrity and mission-critical applications.
Daniel (Danny) Dolev is an Israeli computer scientist known for his research in cryptography and distributed computing. He holds the Berthold Badler Chair in Computer Science at the Hebrew University of Jerusalem and is a member of the scientific council of the European Research Council.
Tal Rabin is a computer scientist and Professor of Computer and Information Science at the University of Pennsylvania. She was previously the head of research at the Algorand Foundation and the head of the cryptography research group at IBM's Thomas J. Watson Research Center.
Michel Raynal is a French informatics scientist, professor at IRISA, University of Rennes, France. He is known for his contributions in the fields of algorithms, computability, and fault-tolerance in the context of concurrent and distributed systems. Michel Raynal is also Distinguished Chair professor at the Hong Kong Polytechnic University and editor of the “Synthesis Lectures on Distributed Computing Theory” published by Morgan & Claypool. He is a senior member of Institut Universitaire de France and a member of Academia Europaea.
Jayadev Misra is an Indian-born computer scientist who has spent most of his professional career in the United States. He is the Schlumberger Centennial Chair Emeritus in computer science and a University Distinguished Teaching Professor Emeritus at the University of Texas at Austin. Professionally he is known for his contributions to the formal aspects of concurrent programming and for jointly spearheading, with Sir Tony Hoare, the project on Verified Software Initiative (VSI).
Sergio Rajsbaum is a Mexican computer scientist, working in the field of Theoretical Computer Science, specifically concurrent and distributed computing.
References
- ↑ Who's who of American women. Marquis Who's Who, 1973. p. 587.
- ↑ Nancy, Lynch (1972). Relativization of the theory of computational complexity (Ph.D.). Massachusetts Institute of Technology. hdl:1721.1/12180.
- ↑ Nancy Lynch at the Mathematics Genealogy Project
- ↑ Fischer, M. J.; Lynch, N. A.; Paterson, M. S. (1985). "Impossibility of distributed consensus with one faulty process" (PDF). Journal of the ACM . 32 (2): 374–382. doi:10.1145/3149.214121. S2CID 207660233.
- 1 2 "PODC Influential Paper Award: 2001" . Retrieved 2009-07-06.
- ↑ Lynch, Nancy (1996). Distributed Algorithms . San Francisco, CA: Morgan Kaufmann Publishers. ISBN 978-1-55860-348-6.
- ↑ "Nancy A Lynch – Award Winner". Association for Computing Machinery . Retrieved 31 October 2013.
- ↑ "NAE Members Directory - Dr. Nancy A. Lynch". NAE . Retrieved December 31, 2010.
- ↑ "IEEE Emanuel R. Piore Award Recipients" (PDF). IEEE. Archived (PDF) from the original on February 17, 2013. Retrieved March 20, 2021.
- ↑ "Lynch named Athena Lecturer". MIT News. 18 April 2012. Retrieved 31 October 2013.
- ↑ "National Academy of Sciences Members and Foreign Associates Elected" . Retrieved 2016-05-05.
