Mihai Pătrașcu

Mihai Pătrașcu was a Romanian-born computer scientist noted for foundational work in data structure lower bounds, dynamic algorithms, and succinct data structures. He completed graduate work at the Massachusetts Institute of Technology and held positions that connected the research communities of Princeton University, MIT, Microsoft Research, and the broader theory of computer science community. His papers influenced research on the cell-probe model, range searching, dynamic connectivity, and succinct data structures.

Early life and education

Born in Bucharest, he grew up in Romania and showed early aptitude in mathematics and programming competitions such as the International Olympiad in Informatics and national contests. He moved to the United States for higher education, earning degrees at Massachusetts Institute of Technology where he worked under advisors connected to the CSAIL circle, interacting with faculty from Harvard University, Stanford University, Princeton University, and visiting groups from Microsoft Research. During his student years he collaborated with peers associated with institutions like Carnegie Mellon University, University of California, Berkeley, University of Washington, ETH Zurich, and École Normale Supérieure.

Academic career and research

His academic career spanned collaborations with researchers at MIT, Princeton University, Microsoft Research New England, and workshops at Simons Institute for the Theory of Computing, Institute for Advanced Study, and conferences such as STOC, FOCS, SODA, ICALP, and ESA. He published work with coauthors from California Institute of Technology, Cornell University, University of California, San Diego, University of Illinois at Urbana–Champaign, Columbia University, University of Toronto, University of Michigan, and New York University. His research addressed questions framed in models like the cell-probe model, while engaging techniques from communication complexity, information theory, combinatorics, and probability theory. He contributed to the theory underlying practical systems developed by groups at Google, Facebook, Amazon, and Oracle by clarifying inherent limits and trade-offs in algorithmic design.

Major contributions and results

He produced influential lower bounds for dynamic problems, notably on the dynamic connectivity problem, range counting, and offline/online trade-offs, using reductions related to the set disjointness problem in communication complexity and leveraging hard instances akin to those in sorting networks and binary search trees. He and collaborators established tight or near-tight bounds in the cell-probe model for operations such as updates and queries, illuminating trade-offs comparable to those in succinct data structures for tree representations, rank/select operations, and predecessor search. His work connected to classic results by researchers associated with Donald Knuth, Robert Tarjan, John Hopcroft, Michael Rabin, Leslie Lamport, and contemporaries at Stanford University and Princeton University. He advanced methods influencing succinct encodings used in implementations like compressed indices from groups at University of Helsinki, Max Planck Institute for Informatics, and University of Pisa. Several of his theorems were presented at major venues including STOC and FOCS and influenced open problems discussed at workshops hosted by Microsoft Research and the Simons Foundation.

Awards and honors

He received recognition such as the Sloan Research Fellowship and invitations to speak at institutions and events including the ICALP, SODA, and major seminars at MIT, Princeton University, Berkeley, and Harvard University. His papers were finalists and best-paper nominees at conferences like STOC and FOCS, and his work has been cited by award-winning researchers across computer science departments at Carnegie Mellon University, University of Toronto, ETH Zurich, and École Polytechnique.

Personal life and legacy

Colleagues from MIT, Princeton University, Microsoft Research New England, and collaborators at Carnegie Mellon University remember him for rigorous problem selection and elegant proofs; his influence persists in curricula at institutions such as Stanford University and Harvard University and in open problems listed by research groups at Simons Institute for the Theory of Computing and the Institute for Advanced Study. Posthumous discussions at memorial sessions involved faculty from MIT, Princeton University, University of California, Berkeley, University of Washington, ETH Zurich, University of Toronto, Carnegie Mellon University, and industrial labs including Google Research and Microsoft Research. His techniques continue to inform work on succinct representations, dynamic graph algorithms, and lower bounds pursued by teams at University of Oxford, Imperial College London, University of Cambridge, École Normale Supérieure, and other centers of theoretical computer science. Category:Romanian computer scientists