Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Towards polynomial lower bounds for dynamic problems
- M. Patrascu
- Mathematics, Computer Science
- STOC '10
- 5 June 2010
TLDR
Time-space trade-offs for predecessor search
- M. Patrascu, M. Thorup
- Mathematics, Computer Science
- STOC '06
- 10 March 2006
TLDR
On the possibility of faster SAT algorithms
- M. Patrascu, R. Williams
- Mathematics, Computer Science
- SODA '10
- 17 January 2010
TLDR
Logarithmic Lower Bounds in the Cell-Probe Model
- M. Patrascu, E. Demaine
- Mathematics, Computer Science
- SIAM J. Comput.
- 7 February 2005
TLDR
Planning for Fast Connectivity Updates
- M. Patrascu, M. Thorup
- Mathematics, Computer Science
- 48th Annual IEEE Symposium on Foundations of…
- 21 October 2007
TLDR
Subquadratic Algorithms for 3SUM
- I. Baran, E. Demaine, M. Patrascu
- Computer Science
- WADS
- 15 August 2005
TLDR
The geometry of binary search trees
- E. Demaine, D. Harmon, J. Iacono, D. Kane, M. Patrascu
- Mathematics, Computer Science
- SODA
- 4 January 2009
TLDR
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
Orthogonal range searching on the RAM, revisited
- T. Chan, K. Larsen, M. Patrascu
- Mathematics, Computer Science
- SoCG '11
- 28 March 2011
TLDR
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
TLDR