Biography:Mihai Pătrașcu (computer scientist)
Mihai Pătrașcu | |
|---|---|
 | |
| Born | Craiova, Romania |
| Died | 5 June 2012 (aged 29) |
| Resting place | Craiova |
| Alma mater | Massachusetts Institute of Technology |
| Scientific career | |
| Fields | Computer Science |
| Institutions | AT&T Labs |
| 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-American computer scientist at AT&T Labs in Florham Park, New Jersey, United States .[1]
Pătrașcu attended Carol I National College in Craiova.[2] As a high school student, he won 2 gold medals and 1 silver medal at the International Olympiad in Informatics.[3] 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.[4]
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."[5]
Pătrașcu died in 2012 after suffering from brain cancer for a year and a half,[6][7] and was buried in his native city.[8]
Selected publications
- "Dynamic connectivity: connecting to networks and geometry". SIAM Journal on Computing 40 (2): 333–349. 2011. doi:10.1137/090751670. http://people.csail.mit.edu/mip/papers/subconn/paper.pdf. 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. http://people.csail.mit.edu/mip/papers/structures/paper.pdf.
- SIAM Journal on Computing 39 (2): 703–729. 2010. doi:10.1137/07068669X. http://people.csail.mit.edu/mip/papers/planar/paper.pdf.
- . Preliminary version published in FOCS 2006, doi:10.1109/FOCS.2006.35.
- . 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. http://erikdemaine.org/papers/DynamicConnectivity_SICOMP/paper.pdf.
References
- ↑ Staff profile[yes|permanent dead link|dead link}}], AT&T Labs, accessed 2012-04-25.
- ↑ (in Romanian) "Geniul". https://pressone.ro/geniul/.
- ↑ "Mihai Patrascu". https://stats.ioinformatics.org/people/1571.
- ↑ Mihai Pătrașcu at the Mathematics Genealogy Project
- ↑ Presburger Award 2012, European Association for Theoretical Computer Science, http://eatcs.org/index.php/component/content/article/1-news/1243-presburger-award-2012, retrieved 2012-04-25.
- ↑ Mitzenmacher, Michael (June 6, 2012). "Sad Passing: Mihai Pătrașcu". http://mybiasedcoin.blogspot.com/2012/06/sad-passing-mihai-patrascu.html.
- ↑ Fortnow, Lance; Hajiaghayi, Mohammad Taghi (June 7, 2012). "Mihai Pătrașcu (1982-2012)". http://blog.computationalcomplexity.org/2012/06/mihai-patrascu-1982-2012.html.
- ↑ "Comunitatea informatică comemorează dispariția lui Mihai Patrascu, românul care a obținut cele mai multe premii la olimpiadele internaționale" (in ro). June 12, 2012. https://www.hotnews.ro/stiri-esential-12503029-comunitatea-informatica-comemoreaza-disparitia-lui-mihai-patrascu-romanul-care-obtinut-cele-mai-multe-premii-olimpiadele-internationale.htm.
External links
- Pătrașcu’s blog WebDiarios de Motocicleta
- Mihai Pătrașcu Memorial
- {{Google Scholar id}} template missing ID and not present in Wikidata.
 |  |
