| 2015 | ICALP | Finding the Median (Obliviously) with Bounded Space. | Paul Beame, Vincent Liew, Mihai Patrascu |
| 2014 | FOCS | Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search. | Mihai Patrascu, Mikkel Thorup |
| 2013 | SODA | Twisted Tabulation Hashing. | Mihai Patrascu, Mikkel Thorup |
| 2012 | FOCS | A New Infinity of Distance Oracles for Sparse Graphs. | Mihai Patrascu, Liam Roditty, Mikkel Thorup |
| 2012 | FUN | Picture-Hanging Puzzles. | Erik D. Demaine, Martin L. Demaine, Yair N. Minsky, Joseph S. B. Mitchell, Ronald L. Rivest, Mihai Patrascu |
| 2012 | SODA | Using hashing to solve the dictionary problem. | John Iacono, Mihai Patrascu |
| 2011 | STOC | The power of simple tabulation hashing. | Mihai Patrascu, Mikkel Thorup |
| 2011 | STOC | Don't rush into a union: take time to find your roots. | Mihai Patrascu, Mikkel Thorup |
| 2010 | FOCS | Distance Oracles beyond the Thorup-Zwick Bound. | Mihai Patrascu, Liam Roditty |
| 2010 | ICALP | On the | Mihai Patrascu, Mikkel Thorup |
| 2010 | SODA | Lower Bounds for Edit Distance and Product Metrics via Poincar-Type Inequalities. | Alexandr Andoni, T. S. Jayram, Mihai Patrascu |
| 2010 | SODA | Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. | Timothy M. Chan, Mihai Patrascu |
| 2010 | SODA | Cell-Probe Lower Bounds for Succinct Partial Sums. | Mihai Patrascu, Emanuele Viola |
| 2010 | SODA | On the Possibility of Faster SAT Algorithms. | Mihai Patrascu, Ryan Williams |
| 2010 | STOC | Changing base without losing space. | Yevgeniy Dodis, Mihai Patrascu, Mikkel Thorup |
| 2010 | STOC | Towards polynomial lower bounds for dynamic problems. | Mihai Patrascu |
| 2009 | SODA | The geometry of binary search trees. | Erik D. Demaine, Dion Harmon, John Iacono, Daniel Kane, Mihai Patrascu |
| 2008 | FOCS | Hardness of Nearest Neighbor under L-infinity. | Alexandr Andoni, Dorian Croitoru, Mihai Patrascu |
| 2008 | FOCS | Dynamic Connectivity: Connecting to Networks and Geometry. | Timothy M. Chan, Mihai Patrascu, Liam Roditty |
| 2008 | FOCS | Succincter. | Mihai Patrascu |
| 2008 | FOCS | (Data) STRUCTURES. | Mihai Patrascu |
| 2008 | SIGMOD | Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). | Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar |
| 2008 | SODA | Tight lower bounds for selection in randomly ordered streams. | Amit Chakrabarti, T. S. Jayram, Mihai Patrascu |
| 2007 | ESA | Radix Sorting with No Extra Space. | Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu |
| 2007 | FOCS | Planning for Fast Connectivity Updates. | Mihai Patrascu, Mikkel Thorup |
| 2007 | INFOCOM | Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. | Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan |
| 2007 | SODA | Randomization does not help searching predecessors. | Mihai Patrascu, Mikkel Thorup |
| 2007 | STOC | Voronoi diagrams in n·2 | Timothy M. Chan, Mihai Patrascu |
| 2007 | STOC | Lower bounds for 2-dimensional range counting. | Mihai Patrascu |
| 2006 | FOCS | On the Optimality of the Dimensionality Reduction Method. | Alexandr Andoni, Piotr Indyk, Mihai Patrascu |
| 2006 | FOCS | Planar Point Location in Sublogarithmic Time. | Mihai Patrascu |
| 2006 | FOCS | Higher Lower Bounds for Near-Neighbor and Further Rich Problems. | Mihai Patrascu, Mikkel Thorup |
| 2006 | LATIN | De Dictionariis Dynamicis Pauco Spatio Utentibus ( | Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu |
| 2006 | SODA | Lower bounds for asymmetric communication channels and distributed source coding. | Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu |
| 2006 | STOC | Time-space trade-offs for predecessor search. | Mihai Patrascu, Mikkel Thorup |
| 2006 | SPAA | Deterministic load balancing and dictionaries in the parallel disk model. | Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann |
| 2005 | ICALP | On Dynamic Bit-Probe Complexity. | Corina E. Patrascu, Mihai Patrascu |
| 2005 | STOC | On dynamic range reporting in one dimension. | Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu |
| 2005 | WADS | Subquadratic Algorithms for 3SUM. | Ilya Baran, Erik D. Demaine, Mihai Patrascu |
| 2004 | FOCS | Dynamic Optimality - Almost. | Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu |
| 2004 | SODA | Interpolation search for non-independent data. | Erik D. Demaine, Thouis R. Jones, Mihai Patrascu |
| 2004 | SODA | Tight bounds for the partial-sums problem. | Mihai Patrascu, Erik D. Demaine |
| 2004 | STOC | Lower bounds for dynamic connectivity. | Mihai Patrascu, Erik D. Demaine |