Jayadev Misra
Jayadev Misra (born October 17, 1947) is an Indian-born American computer scientist who spent most of his career at the University of Texas at Austin. He is the Schlumberger Centennial Chair Emeritus in computer science and a University Distinguished Teaching Professor Emeritus at UT Austin. He earned a B.Tech in electrical engineering from IIT Kanpur in 1969 and a Ph.D. in electrical engineering and computer science from Johns Hopkins University in 1972, under advisor Harlan Mills.
After a short time at IBM, Misra joined UT Austin in 1974 and remained there, with a sabbatical at Stanford in 1983–1984. He retired from teaching in 2015.
Misra is known for his formal work on concurrent and distributed computing. With K. Mani Chandy, he created UNITY, a programming notation and logic to describe and reason about concurrent programs. UNITY helped turn informal proofs into rigorous methods, a contribution praised by Leslie Lamport. Misra and Chandy also developed efficient algorithms for distributed simulation, resource allocation, deadlock detection, graph problems, and the study of how knowledge is transmitted in distributed systems. With David Gries, he proposed the first algorithm for the heavy-hitters problem, which finds the most frequent items in data streams. He also proposed axioms for how memory behaves in concurrent systems, forming part of the theory of linearizability.
His later project, Orc, aims to build a mathematical framework to help combine and coordinate different parts of software that run at the same time.
This page was last edited on 3 February 2026, at 14:58 (CET).