| 词条 | Mihai Pătrașcu |
| 释义 |
|name = Mihai Pătraşcu |image = mihai_patrascu2.jpg |caption = |birth_date = {{birth date|1982|07|17|df=y}} |birth_place = Craiova, Romania |death_date = {{death date and age|2012|06|05|1982|07|17|df=y}} |death_place = New York City, U.S. |field = Computer Science |work_institution = AT&T Labs |alma_mater = Massachusetts Institute of Technology |doctoral_advisor = Erik Demaine |thesis_title = Lower bound techniques for data structures |thesis_year = 2008 |thesis_url = http://dspace.mit.edu/handle/1721.1/45866 }}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, USA.[1] Pătraşcu attended Carol I National College in Craiova.[2] As a high school student, he won multiple medals 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] Selected publications
| first1 = Timothy M.| last1 = Chan | author1-link = Timothy M. Chan | first2 = Mihai | last2 = Pătraşcu | first3 =Liam |last3=Roditty | title =Dynamic connectivity: connecting to networks and geometry | journal = SIAM Journal on Computing | volume = 40 | issue = 2 | pages = 333–349 | year =2011 | doi = 10.1137/090751670 | url = http://people.csail.mit.edu/mip/papers/subconn/paper.pdf | arxiv =0808.1128}} Preliminary version published in FOCS 2008, {{doi|10.1109/FOCS.2008.29}}.
| first = Mihai | last =Pătraşcu | title =Unifying the landscape of cell-probe lower bounds | journal = SIAM Journal on Computing | volume = 40 | issue = 3 |pages= 827–847 | year = 2011 | doi = 10.1137/09075336X | url = http://people.csail.mit.edu/mip/papers/structures/paper.pdf }}
| first1 = Timothy | last1 =Chan | author1-link = Timothy M. Chan | first2 = Mihai | last2 = Pătraşcu | title =Transdichotomous results in computational geometry, I: Point location in sublogarithmic time | journal = SIAM Journal on Computing | volume = 39 | issue = 2| pages =703–729 | year =2010 | doi = 10.1137/07068669X | url = http://people.csail.mit.edu/mip/papers/planar/paper.pdf }}
| first1 = Mihai | last1 =Pătraşcu | first2 =Mikkel | last2 = Thorup | author2-link = Mikkel Thorup| title =Higher lower bounds for near-neighbor and further rich problems | journal = SIAM Journal on Computing | volume = 39 | issue = 2 | pages = 730–741 | year =2010 | doi = 10.1137/070684859 | url = http://people.csail.mit.edu/mip/papers/higher/higher.pdf }} Preliminary version published in FOCS 2006, {{doi|10.1109/FOCS.2006.35}}.
| first1 =Erik | last1 =Demaine| author1-link=Erik Demaine| first2 = Dion | last2 =Harmon | first3 =John | last3=Iacono | first4 =Mihai | last4=Pătraşcu | title =Dynamic optimality—almost | journal = SIAM Journal on Computing | volume = 37 | issue = 1 | pages = 240–251 | year =2007 | doi = 10.1137/S0097539705447347 | url = http://erikdemaine.org/papers/Tango_SICOMP/paper.pdf }} Preliminary version published in FOCS 2004, {{doi|10.1109/FOCS.2004.23}}. See Tango tree.
| first1 =Mihai | last1 =Pătraşcu | first2 =Erik | last2 =Demaine | title =Logarithmic lower bounds in the cell-probe model | journal = SIAM Journal on Computing | volume = 35 | issue = 4 | pages = 932–963 | year =2006 | doi = 10.1137/S0097539705447256 | url = http://erikdemaine.org/papers/DynamicConnectivity_SICOMP/paper.pdf | arxiv =cs/0502041 }} References1. ^Staff profile{{dead link|date=November 2017 |bot=InternetArchiveBot |fix-attempted=yes }}, AT&T Labs, accessed 2012-04-25. 2. ^{{ro}} {{web cite|url=https://pressone.ro/geniul/|title=Geniul|website=PressOne|access-date=2018-03-19}} 3. ^{{ro}} {{citation|title=Craiova: Mihai Pătraşcu, informaticianul care a cucerit America| language=Romanian|url=http://www.adevarul.ro/Patrascu-America-Mihai-informaticianul-cucerit_0_66593490.html|date=June 23, 2009|first=Cristina|last=Ghenea|journal=Adevărul}}. 4. ^{{mathgenealogy|id=132987}} 5. ^{{citation|url=http://eatcs.org/index.php/component/content/article/1-news/1243-presburger-award-2012|title=Presburger Award 2012|publisher=European Association for Theoretical Computer Science|accessdate=2012-04-25}}. 6. ^{{cite web|first=Michael|last=Mitzenmacher|authorlink=Michael Mitzenmacher|date=June 6, 2012|title=Sad Passing: Mihai Pătraşcu|url=http://mybiasedcoin.blogspot.com/2012/06/sad-passing-mihai-patrascu.html}} 7. ^{{cite web|first1=Lance|last1=Fortnow|author1-link=Lance Fortnow|first2=Mohammad Taghi|last2=Hajiaghayi|date=June 7, 2012|title=Mihai Pătraşcu (1982-2012)|url=http://blog.computationalcomplexity.org/2012/06/mihai-patrascu-1982-2012.html}} External links
11 : 1982 births|2012 deaths|Romanian computer scientists|Theoretical computer scientists|Researchers in geometric algorithms|Massachusetts Institute of Technology alumni|American people of Romanian descent|Deaths from brain tumor|AT&T people|People from Craiova|Carol I National College alumni |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。