Mihai Pătrașcu

Mihai Pătraşcu

Born	(1982-07-17)17 July 1982 Craiova, Romania
Died	5 June 2012(2012-06-05) (aged 29) New York City
Fields	Computer Science
Institutions	AT&T Labs
Alma mater	Massachusetts Institute of Technology
Thesis	Lower bound techniques for data structures (2008)
Doctoral advisor	Erik Demaine

Mihai Pătraşcu (17 July 1982 – 5 June 2012) was a Romanian computer scientist at AT&T Labs in Florham Park, New Jersey, USA.^[1] As a high school student, Pătraşcu won multiple medals at the International Olympiad in Informatics.^[2] He completed his undergraduate and graduate studies in Computer Science at Massachusetts Institute of Technology, completing his thesis under the supervision of Erik Demaine in 2008.^[3]

Pătraşcu’s work was concerned with fundamental questions about basic data structures. Pătraşcu received the Machtey Award for the best student paper at the Symposium on Foundations of Computer Science in 2008, and the Presburger Award from the European Association for Theoretical Computer Science in 2012, for breaking “many old barriers on fundamental data structure problems, not only revitalizing but also revolutionizing a field that was almost silent for over a decade.”^[4]

Pătraşcu died in 2012 after suffering from brain cancer for a year and a half.^[5]^[6]

Selected publications

Chan, Timothy M.; Pătraşcu, Mihai; Roditty, Liam (2011). "Dynamic connectivity: connecting to networks and geometry". SIAM Journal on Computing. 40 (2): 333–349. doi:10.1137/090751670. Preliminary version published in FOCS 2008, doi:10.1109/FOCS.2008.29.
Pătraşcu, Mihai (2011). "Unifying the landscape of cell-probe lower bounds". SIAM Journal on Computing. 40 (3): 827–847. doi:10.1137/09075336X.
Chan, Timothy; Pătraşcu, Mihai (2010). "Transdichotomous results in computational geometry, I: Point location in sublogarithmic time". SIAM Journal on Computing. 39 (2): 703–729. doi:10.1137/07068669X.
Pătraşcu, Mihai; Thorup, Mikkel (2010). "Higher lower bounds for near-neighbor and further rich problems". SIAM Journal on Computing. 39 (2): 730–741. doi:10.1137/070684859. Preliminary version published in FOCS 2006, doi:10.1109/FOCS.2006.35.
Demaine, Erik; Harmon, Dion; Iacono, John; Pătraşcu, Mihai (2007). "Dynamic optimality—almost". SIAM Journal on Computing. 37 (1): 240–251. doi:10.1137/S0097539705447347. Preliminary version published in FOCS 2004, doi:10.1109/FOCS.2004.23. See Tango tree.
Pătraşcu, Mihai; Demaine, Erik (2006). "Logarithmic lower bounds in the cell-probe model". SIAM Journal on Computing. 35 (4): 932–963. doi:10.1137/S0097539705447256.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.