Statistics
Publications
42
Citations
2.6K
H-Index
26
Active since
2004
Mihai Pǎtraşcu is an author at AT&T (United States) specializing in computer science, computing, and algorithms.
Publications per year
2004–2015
42
42
Towards polynomial lower bounds for dynamic problems
Mihai Pǎtraşcu · 2010 · 216 citations
Logarithmic Lower Bounds in the Cell-Probe Model
Mihai Pǎtraşcu, Erik D. Demaine · SIAM Journal on Computing · 2006 · 213 citations
Orthogonal range searching on the RAM, revisited
Timothy M. Chan, Kasper Green Larsen, Mihai Pǎtraşcu · 2011 · 198 citations
Time-space trade-offs for predecessor search
Mihai Pǎtraşcu, Mikkel Thorup · 2006 · 177 citations
On the possibility of faster SAT algorithms
Mihai Pǎtraşcu, Ryan Williams · 2010 · 167 citations
1–5 of 42