Mihai Pătrașcu (computer scientist)
Romanian computer scientist

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.
Pătrașcu attended Carol I National College in Craiova.
As a high school student, he won 2 gold medals and 1 silver medal at the International Olympiad in Informatics. After attending for one year the University of Craiova, he completed his undergraduate and graduate studies in Computer Science at Massachusetts Institute of Technology. Under the supervision of Erik Demaine, he defended his MS and PhD theses in 2007 and 2008 respectively.
Pătrașcu’s work was concerned with fundamental questions about basic data structures. He 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."
Mihai Pătrașcu died in 2012 at the age of 29 after suffering from brain cancer for a year and a half, and was buried in his native city, Craiova.
Selected publications
Chan, Timothy M.; Pătrașcu, Mihai; Roditty, Liam (2011). "Dynamic connectivity: connecting to networks and geometry" (PDF). SIAM Journal on Computing.
Begin with the source’s own compact description: “Mihai Pătrașcu (computer scientist)” is romanian computer scientist. The dossier treats that line as a proposition to test through Mihai, Pătrașcu and computer, not as a finished interpretation.
Why this record matters
The phrase “romanian computer scientist” supplies a clear boundary for inquiry. It also exposes the unanswered questions: who defined that boundary, when it became stable and which sources sit outside it.
Biographical claims are most persuasive when dates, appointments and relationships can be traced to records created close to the events described. The source revision retrieved here is dated Aug 29, 2026. The linked authority identifier is Q6845108. VIAF identifies the subject as 29303358. The Library of Congress control number is no2007023136. 1 of 4 selected statements include explicit references; 1 carry qualifiers and 0 use preferred rank. The first chronological checks are 1982, 2012, 2007 and 2008.
Later biographies can compress uncertainty and repeat inherited reputations, so apparently settled claims may still require comparison. The lead is largely declarative, so disagreement and counter-evidence require a deliberate search beyond the opening account. Authority statements aid reconciliation but still require their own references, qualifiers and ranks to be checked.
How to read it
Read biographical claims against dates, named institutions and the cited references. Distinguish a subject’s later reputation from evidence produced during their lifetime.
- Establishing names and roles
- Building a first chronology
- Locating cited institutions
Personal papers, civil or court records, institutional files and the scholarship cited by the source.
Three-step research path
- Establish the record: confirm the title “Mihai Pătrașcu (computer scientist)”, its source revision and the description used here.
- Expand the search: follow Mihai Pătrașcu (computer scientist) primary sources, Mihai Pătrașcu (computer scientist) archive and Mihai research across catalogues and specialist indexes.
- Test the account: compare the strongest cited source with the responsible institution’s current record and note any disagreement.
Questions for further research
- Which source most directly establishes the central claim about “Mihai Pătrașcu (computer scientist)”?
- Which claims depend on a single source or contested interpretation?
- Which primary records establish identity, chronology and institutional ties?
Search terms from this dossier
This entry incorporates text from “Mihai Pătrașcu (computer scientist)” on English Wikipedia. Contributors are listed in the page history. Text is available under the Creative Commons Attribution-ShareAlike 4.0 License. Selected authority identifiers and statements are retrieved from Wikidata under CC0; their references and qualifiers remain part of the verification path.