Towards polynomial lower bounds for dynamic problems M Patrascu Proceedings of the forty-second ACM symposium on Theory of computing, 603-610, 2010 | 268 | 2010 |

On the possibility of faster SAT algorithms M Pătrașcu, R Williams Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 249 | 2010 |

Time-space trade-offs for predecessor search M Pătrașcu, M Thorup Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 229 | 2006 |

Succincter M Patrascu 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 305-313, 2008 | 224 | 2008 |

Orthogonal range searching on the RAM, revisited TM Chan, KG Larsen, M Pătrașcu Proceedings of the twenty-seventh annual symposium on Computational geometry …, 2011 | 222 | 2011 |

Logarithmic lower bounds in the cell-probe model M Patrascu, ED Demaine SIAM Journal on Computing 35 (4), 932-963, 2006 | 194 | 2006 |

Non-adaptive fault diagnosis for all-optical networks via combinatorial group testing on graphs NJA Harvey, M Patrascu, Y Wen, S Yekhanin, VWS Chan IEEE INFOCOM 2007-26th IEEE International Conference on Computer …, 2007 | 161 | 2007 |

The power of simple tabulation hashing M Pǎtrașcu, M Thorup Journal of the ACM (JACM) 59 (3), 1-50, 2012 | 151 | 2012 |

Unifying the landscape of cell-probe lower bounds M P a · trașcu SIAM Journal on Computing 40 (3), 827-847, 2011 | 132* | 2011 |

Dynamic optimality—almost ED Demaine, D Harmon, J Iacono, M P a · trașcu SIAM Journal on Computing 37 (1), 240-251, 2007 | 122 | 2007 |

Distance oracles beyond the Thorup-Zwick bound M Patrascu, L Roditty 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010 | 121* | 2010 |

Counting inversions, offline orthogonal range counting, and related problems TM Chan, M Pătrașcu Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 110 | 2010 |

Subquadratic algorithms for 3SUM I Baran, ED Demaine, M Pǎtrașcu Algorithmica 50 (4), 584-596, 2008 | 100 | 2008 |

On the optimality of the dimensionality reduction method A Andoni, P Indyk, M Patrascu 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006 | 99 | 2006 |

Lower bounds for 2-dimensional range counting M Patrascu Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 89 | 2007 |

Planning for fast connectivity updates M Patrascu, M Thorup 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 263-271, 2007 | 78 | 2007 |

On the *k*-Independence Required by Linear Probing and Minwise IndependenceM Pǎtrașcu, M Thorup International Colloquium on Automata, Languages, and Programming, 715-726, 2010 | 72* | 2010 |

The geometry of binary search trees ED Demaine, D Harmon, J Iacono, D Kane, M Patrașcu Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 70 | 2009 |

Randomization does not help searching predecessors M Patrascu, M Thorup SODA 7, 555-564, 2007 | 69 | 2007 |

Changing base without losing space Y Dodis, M Patrascu, M Thorup Proceedings of the forty-second ACM symposium on Theory of computing, 593-602, 2010 | 68 | 2010 |