Concepedia

Mihai Pǎtraşcu

MP

41

Publications

2.4K

Citations

25

H-Index

2004

Active since

Affiliations

AT&T (United States)(Current)

Massachusetts Institute of Technology

University of Copenhagen

University of Waterloo

Mihai Pǎtraşcu is an author at AT&T (United States) specializing in engineering, computational complexity, and computer science.

Top concepts

EngineeringComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationMathematical ProgrammingGraph TheoryApproximation TheoryComputational GeometryTheory Of Computing

Publications per year

2004–2015

41

Publications

41

Towards polynomial lower bounds for dynamic problems

Mihai Pǎtraşcu · 2010 · 211 citations

Mathematical Programming, Computational Complexity Theory, Multiphase Problem +15

Logarithmic Lower Bounds in the Cell-Probe Model

Mihai Pǎtraşcu, Erik D. Demaine · SIAM Journal on Computing · 2006 · 210 citations

Dynamic Data Structure, Biophysical Modeling, Computational Complexity Theory +14

Orthogonal range searching on the RAM, revisited

Timothy M. Chan, Kasper Green Larsen, Mihai Pǎtraşcu · 2011 · 195 citations

Engineering, Computational Complexity, Range Searching +17

Time-space trade-offs for predecessor search

Mihai Pǎtraşcu, Mikkel Thorup · 2006 · 175 citations

Computational Complexity Theory, Engineering, Computational Complexity +16

Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs

Nicholas J. A. Harvey, Mihai Pǎtraşcu, Yonggang Wen et al. · 2007 · 135 citations

Engineering, Verification, Network Robustness +24

Rows per page

1–5 of 41