|
gptkbp:instanceOf
|
gptkb:computer_scientist
|
|
gptkbp:almaMater
|
gptkb:Massachusetts_Institute_of_Technology
|
|
gptkbp:award
|
gptkb:ACM_Doctoral_Dissertation_Award_Honorable_Mention
FOCS Best Paper Award
SODA Best Paper Award
|
|
gptkbp:birthDate
|
1982-07-17
|
|
gptkbp:birthPlace
|
gptkb:Romania
|
|
gptkbp:deathDate
|
2012-08-20
|
|
gptkbp:deathPlace
|
gptkb:New_York_City,_United_States
|
|
gptkbp:doctoralAdvisor
|
gptkb:Erik_Demaine
|
|
gptkbp:employer
|
gptkb:Microsoft_Research
gptkb:IBM_Almaden_Research_Center
gptkb:AT&T_Labs
|
|
gptkbp:field
|
theoretical computer science
algorithms
data structures
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Mihai Patrascu
|
|
gptkbp:knownFor
|
gptkb:cell-probe_model
communication complexity
dynamic connectivity
dynamic graph algorithms
lower bounds in data structures
succinct data structures
range searching
union-find lower bounds
|
|
gptkbp:nationality
|
gptkb:Romanian
|
|
gptkbp:thesisTitle
|
Lower Bound Techniques for Data Structures
|
|
gptkbp:thesisYear
|
2008
|
|
gptkbp:bfsParent
|
gptkb:Generalized_PushPush
|
|
gptkbp:bfsLayer
|
6
|