Mihai Patrascu

Publication Activity (10 Years)

Years Active: 2004-2016
Publications (10 Years): 4

Top Venues

CoRR

FOCS

SODA

ICALP (1)

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Mihai Patrascu, Mikkel Thorup
-Independence Required by Linear Probing and Minwise Independence. ACM Trans. Algorithms 12 (1) (2016)
Paul Beame, Vincent Liew, Mihai Patrascu
Finding the Median (Obliviously) with Bounded Space. CoRR (2015)
Paul Beame, Vincent Liew, Mihai Patrascu
Finding the Median (Obliviously) with Bounded Space. ICALP (1) (2015)
Anupama Kulkarni, Mihai Patrascu, Yuri van de Vijver, Jaap van Wensveen, Robert Pijnenburg, Stoyan Nihtianov
Investigation of long-term drift of NTC temperature sensors with less than 1 mK uncertainty. ISIE (2015)
Mihai Patrascu, Liam Roditty
Distance Oracles beyond the Thorup-Zwick Bound. SIAM J. Comput. 43 (1) (2014)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
Necklaces, Convolutions, and X+Y. Algorithmica 69 (2) (2014)
Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu
Picture-Hanging Puzzles. Theory Comput. Syst. 54 (4) (2014)
Mihai Patrascu, Mikkel Thorup
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. CoRR (2014)
Mihai Patrascu, Mikkel Thorup
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. FOCS (2014)
Mihai Patrascu, Mikkel Thorup
Twisted Tabulation Hashing. SODA (2013)
John Iacono, Mihai Patrascu
Using hashing to solve the dictionary problem. SODA (2012)
David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian
Necklaces, Convolutions, and X+Y CoRR (2012)
Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu
Picture-Hanging Puzzles CoRR (2012)
Mihai Patrascu, Liam Roditty, Mikkel Thorup
A New Infinity of Distance Oracles for Sparse Graphs. FOCS (2012)
Mihai Patrascu, Mikkel Thorup
The Power of Simple Tabulation Hashing. J. ACM 59 (3) (2012)
Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu
Picture-Hanging Puzzles. FUN (2012)
John Iacono, Mihai Patrascu
Using Hashing to Solve the Dictionary Problem (In External Memory) CoRR (2011)
Mihai Patrascu, Mikkel Thorup
The power of simple tabulation hashing. STOC (2011)
Mihai Patrascu, Mikkel Thorup
Don't Rush into a Union: Take Time to Find Your Roots CoRR (2011)
Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu
Orthogonal range searching on the RAM, revisited. SCG (2011)
Timothy M. Chan, Mihai Patrascu, Liam Roditty
Dynamic Connectivity: Connecting to Networks and Geometry. SIAM J. Comput. 40 (2) (2011)
Mihai Patrascu
Unifying the Landscape of Cell-Probe Lower Bounds. SIAM J. Comput. 40 (3) (2011)
Timothy M. Chan, Kasper Green Larsen, Mihai Patrascu
Orthogonal Range Searching on the RAM, Revisited CoRR (2011)
Mihai Patrascu, Mikkel Thorup
Don't rush into a union: take time to find your roots. STOC (2011)
Timothy M. Chan, Mihai Patrascu
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. SODA (2010)
Mihai Patrascu
Towards polynomial lower bounds for dynamic problems. STOC (2010)
Mihai Patrascu, Mikkel Thorup
-Independence Required by Linear Probing and Minwise Independence. ICALP (1) (2010)
Yevgeniy Dodis, Mihai Patrascu, Mikkel Thorup
Changing base without losing space. STOC (2010)
Mihai Patrascu
Unifying the Landscape of Cell-Probe Lower Bounds CoRR (2010)
Mihai Patrascu, Ryan Williams
On the Possibility of Faster SAT Algorithms. SODA (2010)
Mihai Patrascu, Mikkel Thorup
The Power of Simple Tabulation Hashing CoRR (2010)
Alexandr Andoni, T. S. Jayram, Mihai Patrascu
Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. SODA (2010)
Timothy M. Chan, Mihai Patrascu
Transdichotomous Results in Computational Geometry, II: Offline Search CoRR (2010)
Mihai Patrascu, Liam Roditty
Distance Oracles beyond the Thorup-Zwick Bound. FOCS (2010)
Mihai Patrascu, Emanuele Viola
Cell-Probe Lower Bounds for Succinct Partial Sums. SODA (2010)
Jakub Pawlewicz, Mihai Patrascu
Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons. Algorithmica 55 (2) (2009)
Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu
The geometry of binary search trees. SODA (2009)
Mihai Patrascu
A Lower Bound for Succinct Rank Queries CoRR (2009)
Timothy M. Chan, Mihai Patrascu
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. SIAM J. Comput. 39 (2) (2009)
Mihai Patrascu, Mikkel Thorup
Higher Lower Bounds for Near-Neighbor and Further Rich Problems. SIAM J. Comput. 39 (2) (2009)
Alexandr Andoni, Dorian Croitoru, Mihai Patrascu
Hardness of Nearest Neighbor under L-infinity. FOCS (2008)
Timothy M. Chan, Mihai Patrascu, Liam Roditty
Dynamic Connectivity: Connecting to Networks and Geometry CoRR (2008)
Timothy M. Chan, Mihai Patrascu, Liam Roditty
Dynamic Connectivity: Connecting to Networks and Geometry. FOCS (2008)
Mihai Patrascu
Succincter. FOCS (2008)
Amit Chakrabarti, T. S. Jayram, Mihai Patrascu
Tight lower bounds for selection in randomly ordered streams. SODA (2008)
Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar
Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). SIGMOD Conference (2008)
Mihai Patrascu
(Data) STRUCTURES. FOCS (2008)
Ilya Baran, Erik D. Demaine, Mihai Patrascu
Subquadratic Algorithms for 3SUM. Algorithmica 50 (4) (2008)
Mihai Patrascu, Corina E. Tarnita
On dynamic bit-probe complexity. Theor. Comput. Sci. 380 (1-2) (2007)
Timothy M. Chan, Mihai Patrascu
time. STOC (2007)
Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan
Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. INFOCOM (2007)
Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
Radix Sorting with No Extra Space. ESA (2007)
Mihai Patrascu, Mikkel Thorup
Randomization does not help searching predecessors. SODA (2007)
Mihai Patrascu
Lower bounds for 2-dimensional range counting. STOC (2007)
Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
Dynamic Optimality - Almost. SIAM J. Comput. 37 (1) (2007)
Mihai Patrascu, Mikkel Thorup
Planning for Fast Connectivity Updates. FOCS (2007)
Erik D. Demaine, Mihai Patrascu
Tight bounds for dynamic convex hull queries (again). SCG (2007)
Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
Radix Sorting With No Extra Space CoRR (2007)
Mihai Patrascu, Mikkel Thorup
Time-space trade-offs for predecessor search. STOC (2006)
Mihai Patrascu, Mikkel Thorup
Higher Lower Bounds for Near-Neighbor and Further Rich Problems. FOCS (2006)
Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
On Dynamic Dictionaries Using Little Space). LATIN (2006)
Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu
Lower bounds for asymmetric communication channels and distributed source coding. SODA (2006)
Mihai Patrascu, Erik D. Demaine
Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. 35 (4) (2006)
Mihai Patrascu
Planar Point Location in Sublogarithmic Time. FOCS (2006)
Alexandr Andoni, Piotr Indyk, Mihai Patrascu
On the Optimality of the Dimensionality Reduction Method. FOCS (2006)
Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann
Deterministic load balancing and dictionaries in the parallel disk model. SPAA (2006)
Mihai Patrascu, Mikkel Thorup
Time-Space Trade-Offs for Predecessor Search CoRR (2006)
Ilya Baran, Erik D. Demaine, Mihai Patrascu
Subquadratic Algorithms for 3SUM. WADS (2005)
Mihai Patrascu, Stefano Stramigioli
Stick-slip Actuation of Electrostatic Stepper Micropositioners for Data Storage - the µWalker. ICMENS (2005)
Corina E. Patrascu, Mihai Patrascu
On Dynamic Bit-Probe Complexity. ICALP (2005)
Mihai Patrascu, Erik D. Demaine
Logarithmic Lower Bounds in the Cell-Probe Model CoRR (2005)
Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu
On dynamic range reporting in one dimension. STOC (2005)
Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu
De Dictionariis Dynamicis Pauco Spatio Utentibus CoRR (2005)
Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu
On Dynamic Range Reporting in One Dimension CoRR (2005)
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
Interpolation search for non-independent data. SODA (2004)
Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
Dynamic Optimality - Almost. FOCS (2004)
Corina E. Patrascu, Mihai Patrascu
Computing Order Statistics in the Farey Sequence. ANTS (2004)
Mihai Patrascu, Erik D. Demaine
Lower bounds for dynamic connectivity. STOC (2004)
Mihai Patrascu, Erik D. Demaine
Tight bounds for the partial-sums problem. SODA (2004)

Mihai Patrascu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mihai Patrascu