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 | 223 | 2010 |

Towards polynomial lower bounds for dynamic problems M Patrascu Proceedings of the forty-second ACM symposium on Theory of computing, 603-610, 2010 | 216 | 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 | 205 | 2006 |

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 | 200 | 2011 |

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

Logarithmic lower bounds in the cell-probe model M Patrascu, ED Demaine SIAM Journal on Computing 35 (4), 932-963, 2006 | 176 | 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 | 142 | 2007 |

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

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

Dynamic optimality—almost ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu SIAM Journal on Computing 37 (1), 240-251, 2007 | 108 | 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 | 103* | 2010 |

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 | 98 | 2006 |

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 | 91 | 2010 |

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

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

Planning for fast connectivity updates M Patrascu, M Thorup 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 263-271, 2007 | 71 | 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 | 64* | 2010 |

Tight bounds for the partial-sums problem M Patrascu, ED Demaine SODA 4, 20-29, 2004 | 64 | 2004 |

On dynamic range reporting in one dimension CW Mortensen, R Pagh, M Pǎtraçcu Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005 | 63 | 2005 |

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