M. Patrascu

Publications
Influence

Towards polynomial lower bounds for dynamic problems

M. Patrascu
Mathematics, Computer Science
STOC '10
5 June 2010

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

Time-space trade-offs for predecessor search

M. Patrascu, M. Thorup
Mathematics, Computer Science
STOC '06
10 March 2006

We develop a new technique for proving cell-probe lower bounds for static data structures. Expand

On the possibility of faster SAT algorithms

M. Patrascu, R. Williams
Mathematics, Computer Science
SODA '10
17 January 2010

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

Logarithmic Lower Bounds in the Cell-Probe Model

M. Patrascu, E. Demaine
Mathematics, Computer Science
SIAM J. Comput.
7 February 2005

We develop a new technique for proving cell-probe lower bounds on dynamic data structures. Expand

Planning for Fast Connectivity Updates

M. Patrascu, M. Thorup
Mathematics, Computer Science
48th Annual IEEE Symposium on Foundations of…
21 October 2007

We describe a linear-space representation of graphs which enables us to determine how a batch of edge updates can impact the graph. Expand

Subquadratic Algorithms for 3SUM

I. Baran, E. Demaine, M. Patrascu
Computer Science
WADS
15 August 2005

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

The geometry of binary search trees

E. Demaine, D. Harmon, J. Iacono, D. Kane, M. Patrascu
Mathematics, Computer Science
SODA
4 January 2009

We present a novel connection between binary search trees (BSTs) and points in the plane satisfying a simple property. Expand

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

We present a data structure representing a dynamic set S of w-bit integers on a w- bit word RAM. Expand

Orthogonal range searching on the RAM, revisited

T. Chan, K. Larsen, M. Patrascu
Mathematics, Computer Science
SoCG '11
28 March 2011

We present a number of new results on one of the most extensively studied topics in computational geometry, orthogonal range searching. Expand

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

Nicholas J. A. Harvey, M. Patrascu, Y. Wen, S. Yekhanin, V. Chan
Computer Science
IEEE INFOCOM - 26th IEEE International…
1 May 2007

We consider the problem of detecting failures for all-optical networks, with the objective of keeping the diagnosis cost low. Expand

Recommended Authors