Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:computer_scientist
|
| gptkbp:almaMater |
gptkb:Massachusetts_Institute_of_Technology
|
| gptkbp:awardReceived |
gptkb:Best_Paper_Award_at_FOCS_2006
gptkb:Best_Paper_Award_at_STOC_2008 |
| gptkbp:birthDate |
1982-07-17
|
| gptkbp:birthPlace |
gptkb:Romania
|
| gptkbp:deathDate |
2012-08-05
|
| gptkbp:deathPlace |
gptkb:United_States
|
| gptkbp:doctoralAdvisor |
gptkb:Erik_Demaine
|
| gptkbp:employer |
gptkb:Massachusetts_Institute_of_Technology
gptkb:AT&T_Labs |
| gptkbp:field |
computer science
algorithms data structures |
| https://www.w3.org/2000/01/rdf-schema#label |
Mihai Pătrașcu
|
| gptkbp:knownFor |
gptkb:cell-probe_model
dynamic connectivity lower bounds in data structures succinct data structures |
| gptkbp:nationality |
gptkb:Romanian
|
| gptkbp:thesisTitle |
Lower Bound Techniques for Data Structures
|
| gptkbp:thesisYear |
2008
|
| gptkbp:bfsParent |
gptkb:Erik_Demaine
|
| gptkbp:bfsLayer |
4
|