Mihai Patrascu

Mihai Patrascu
Name	Mihai Patrascu
Birth date	1982
Birth place	Romania
Death date	2012
Nationality	Romanian
Fields	Computer Science
Institutions	Massachusetts Institute of Technology, University of California, Berkeley, Aarhus University, University of Tokyo
Alma mater	University of Bucharest, Massachusetts Institute of Technology
Doctoral advisor	Erik Demaine

Mihai Patrascu was a Romanian-born theoretical computer scientist known for foundational work in data structures, lower bounds, and algorithmic complexity. His research combined techniques from combinatorics, communication complexity, and computational geometry to produce influential lower-bound frameworks and near-optimal data-structure tradeoffs. He held positions at leading institutions and left a lasting impact on theoretical computer science communities worldwide.

Early life and education

Patrascu was born in Romania and attended the University of Bucharest before moving to the United States for graduate study at the Massachusetts Institute of Technology where he completed doctoral work under Erik Demaine. During his formative years he interacted with researchers from Stanford University, Princeton University, Cornell University, Harvard University, and Carnegie Mellon University. His doctoral environment connected him with students and faculty associated with ACM, IEEE, SIAM, European Research Council, and visiting scholars from École Polytechnique, Université Paris-Sud, and ETH Zurich.

Academic career and positions

Patrascu held positions and visiting appointments that included time at Massachusetts Institute of Technology as a student and researcher, a postdoctoral or visiting role connected with University of California, Berkeley, collaborations with groups at Aarhus University and University of Tokyo, and interactions with labs at Microsoft Research, Google Research, IBM Research, and Bell Labs. He presented work at venues such as STOC, FOCS, SODA, ICALP, ESA, and COLT, and was active in workshops like Dagstuhl Seminars and programs at Simons Institute for the Theory of Computing. His collaborations linked him to authors from Princeton University, Yale University, University of Illinois Urbana–Champaign, University of Washington, and Università di Roma La Sapienza.

Research contributions and notable results

Patrascu produced a sequence of results developing connections among data-structure complexity, cell-probe models, and communication complexity. He established lower bounds in the cell-probe model and introduced reductions from hard problems used by researchers at Stanford University and Princeton University. His influential techniques involved adversary arguments related to work by scholars from Columbia University, Dartmouth College, Brown University, New York University, and California Institute of Technology. Key results included tight bounds for dynamic predecessor search that influenced subsequent work at ETH Zurich and Tel Aviv University, and tradeoff frameworks that were cited by teams at University of Toronto, McGill University, University of British Columbia, University of Waterloo, and McMaster University.

Patrascu's papers often applied combinatorial constructs and information-theoretic arguments drawing on prior ideas from László Babai-style group theory work, communication complexity themes developed at Rutgers University and University of Chicago, and the cell-probe analysis tradition associated with Andrew Yao and Marek Karpinski. He contributed to problems in dynamic connectivity, orthogonal range searching, and succinct data structures, with implications followed by researchers from Princeton University, Yale University, Columbia University, University of Maryland, Brown University, Duke University, and Johns Hopkins University.

His methodology inspired subsequent lower-bound proofs and upper-bound constructions in papers circulated at arXiv and presented at European Symposium on Algorithms, influencing work from groups at University College London, Imperial College London, University of Edinburgh, University of Manchester, and University of Cambridge.

Awards and honors

Patrascu received recognition through best-paper and influential-paper citations at conferences such as STOC and FOCS, and was acknowledged by committees of ACM SIGACT and SIAM. His work was highlighted in collections curated by Communications of the ACM editors and referenced in surveys produced by researchers from MIT Press, Oxford University Press, Cambridge University Press, and journals like Journal of the ACM, SIAM Journal on Computing, and Theory of Computing. Professional communities at European Association for Theoretical Computer Science events and memorials by groups at Simons Institute for the Theory of Computing commemorated his contributions.

Personal life and legacy

Patrascu's untimely death in 2012 prompted remembrances and dedicated sessions at conferences such as STOC and FOCS and memorial symposia organized by colleagues at Massachusetts Institute of Technology, Princeton University, Harvard University, and ETH Zurich. His students and collaborators, from institutions including University of California, Berkeley, University of Toronto, Tel Aviv University, Aarhus University, and University of Washington, continue to build on his frameworks. Collections of lecture notes and online repositories curated by academics from Stanford University, Cornell University, Columbia University, Yale University, and University of California, San Diego preserve his problem lists and open questions for new generations of researchers.

Category:Romanian computer scientists Category:Theoretical computer scientists Category:1982 births Category:2012 deaths