M
Mihai Patrascu
Researcher at AT&T Labs
Publications - 72
Citations - 3400
Mihai Patrascu is an academic researcher from AT&T Labs. The author has contributed to research in topics: Upper and lower bounds & Hash function. The author has an hindex of 30, co-authored 72 publications receiving 3188 citations. Previous affiliations of Mihai Patrascu include AT&T & University of Twente.
Papers
More filters
Proceedings ArticleDOI
Towards polynomial lower bounds for dynamic problems
TL;DR: This work describes a carefully-chosen dynamic version of set disjointness (the "multiphase problem"), and conjecture that it requires n^Omega(1) time per operation, and forms the first nonalgebraic reduction from 3SUM, which allows3SUM-hardness results for combinatorial problems.
Proceedings ArticleDOI
On the possibility of faster SAT algorithms
Mihai Patrascu,Ryan Williams +1 more
TL;DR: Reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural algorithmic problems are described, showing that attaining any of the following bounds would improve the state of the art in algorithms for SAT.
Proceedings ArticleDOI
Orthogonal range searching on the RAM, revisited
TL;DR: A randomized algorithm for 4-d offline dominance range reporting/emptiness with running time O(n log n) plus the output size is given, which resolves two open problems: given a set of n axis-aligned rectangles in the plane, the authors can report all k enclosure pairs in O( n lg n + k) expected time; and given aSet of n points in 4-D,they can find all maximal points (points not dominated by any other points) in O
Journal ArticleDOI
Logarithmic Lower Bounds in the Cell-Probe Model
Mihai Patrascu,Erik D. Demaine +1 more
TL;DR: In this paper, the cell-probe lower bound for dynamic data structures has been shown to be amortized in the external-memory model without assumptions on the data structure (such as the comparison model).
Posted Content
Time-Space Trade-Offs for Predecessor Search
Mihai Patrascu,Mikkel Thorup +1 more
TL;DR: In this paper, the cell-probe lower bound for searching predecessors among a static set of integers has been shown to be tight in polynomial and near-linear space.