• Publications
  • Influence
Towards polynomial lower bounds for dynamic problems
  • M. Patrascu
  • Mathematics, Computer Science
  • STOC '10
  • 5 June 2010
TLDR
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require nΩ(1) time per operation, unless 3SUM has strongly subquadratic algorithms. Expand
  • 192
  • 29
  • PDF
Time-space trade-offs for predecessor search
TLDR
We develop a new technique for proving cell-probe lower bounds for static data structures. Expand
  • 187
  • 29
  • PDF
On the possibility of faster SAT algorithms
TLDR
We describe reductions from the problem of determining the satisfiability of Boolean CNF formulas (CNF-SAT) to several natural algorithmic problems, where attaining any of the following bounds would improve the state of the art in algorithms for SAT. Expand
  • 209
  • 24
  • PDF
Logarithmic Lower Bounds in the Cell-Probe Model
TLDR
We develop a new technique for proving cell-probe lower bounds on dynamic data structures. Expand
  • 182
  • 17
  • PDF
Planning for Fast Connectivity Updates
  • M. Patrascu, M. Thorup
  • Mathematics, Computer Science
  • 48th Annual IEEE Symposium on Foundations of…
  • 21 October 2007
TLDR
We describe a linear-space representation of graphs which enables us to determine how a batch of edge updates can impact the graph. Expand
  • 72
  • 12
  • PDF
Subquadratic Algorithms for 3SUM
TLDR
We obtain subquadratic algorithms for 3SUM on integers and rationals in several models that are almost quadratic in the parallelism the model can afford, which may be the best possible. Expand
  • 53
  • 12
The geometry of binary search trees
TLDR
We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Expand
  • 62
  • 11
  • PDF
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
  • M. Patrascu, M. Thorup
  • Mathematics, Computer Science
  • IEEE 55th Annual Symposium on Foundations of…
  • 13 August 2014
TLDR
We present a data structure representing a dynamic set S of w-bit integers on a w- bit word RAM. Expand
  • 47
  • 11
  • PDF
Orthogonal range searching on the RAM, revisited
TLDR
We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. Expand
  • 178
  • 10
  • PDF
Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs
TLDR
We consider the problem of detecting failures for all-optical networks, with the objective of keeping the diagnosis cost low. Expand
  • 123
  • 9
  • PDF