Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Share This Author
Towards polynomial lower bounds for dynamic problems
- M. Patrascu
- Mathematics, Computer ScienceSTOC '10
- 5 June 2010
TLDR
Time-space trade-offs for predecessor search
- M. Patrascu, M. Thorup
- Computer ScienceSTOC '06
- 10 March 2006
TLDR
On the possibility of faster SAT algorithms
- M. Patrascu, Ryan Williams
- Computer ScienceSODA '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. We show that attaining any of the following bounds…
Planning for Fast Connectivity Updates
- M. Patrascu, M. Thorup
- Computer Science48th Annual IEEE Symposium on Foundations of…
- 21 October 2007
TLDR
Orthogonal range searching on the RAM, revisited
- Timothy M. Chan, Kasper Green Larsen, M. Patrascu
- Computer Science, MathematicsSoCG '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. All our results are in the standard word RAM model: We present…
Logarithmic Lower Bounds in the Cell-Probe Model
- M. Patrascu, E. Demaine
- Computer Science, MathematicsSIAM J. Comput.
- 7 February 2005
TLDR
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
- M. Patrascu, M. Thorup
- Computer ScienceIEEE 55th Annual Symposium on Foundations of…
- 13 August 2014
TLDR
The geometry of binary search trees
- E. Demaine, Dion Harmon, J. Iacono, D. Kane, M. Patrascu
- Computer ScienceSODA
- 4 January 2009
TLDR
The Power of Simple Tabulation Hashing
- M. Patrascu, M. Thorup
- Computer ScienceJACM
- 23 November 2010
TLDR
Counting inversions, offline orthogonal range counting, and related problems
- Timothy M. Chan, M. Patrascu
- Computer ScienceSODA '10
- 17 January 2010
TLDR
...
1
2
3
4
5
...