Jump to content

Mihai Pătrașcu (computer scientist)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by BD2412 (talk | contribs) at 18:42, 23 November 2016 (→top: Per consensus in discussion at Talk:New York#Proposed action to resolve incorrect incoming links using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Mihai Pătraşcu
Born(1982-07-17)17 July 1982
Craiova, Romania
Died5 June 2012(2012-06-05) (aged 29)
New York City
Alma materMassachusetts Institute of Technology
Scientific career
FieldsComputer Science
InstitutionsAT&T Labs
ThesisLower bound techniques for data structures (2008)
Doctoral advisorErik 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.

References

  1. ^ Staff profile, AT&T Labs, accessed 2012-04-25.
  2. ^ Ghenea, Cristina (June 23, 2009), "Craiova: Mihai Pătraşcu, informaticianul care a cucerit America", Adevărul (in Romanian).
  3. ^ Mihai Pătrașcu at the Mathematics Genealogy Project
  4. ^ Presburger Award 2012, European Association for Theoretical Computer Science, retrieved 2012-04-25.
  5. ^ Mitzenmacher, Michael (June 6, 2012). "Sad Passing: Mihai Pătraşcu".
  6. ^ Fortnow, Lance; Hajiaghayi, Mohammad Taghi (June 7, 2012). "Mihai Pătraşcu (1982-2012)".


Flag of RomaniaScientist icon Stub icon

This article about a Romanian scientist is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Mihai_Pătrașcu_(computer_scientist)&oldid=751153442"