Follow
Mihai Patrascu
Mihai Patrascu
AT&T Labs
Verified email at alum.mit.edu - Homepage
Title
Cited by
Cited by
Year
Towards polynomial lower bounds for dynamic problems
M Patrascu
Proceedings of the forty-second ACM symposium on Theory of computing, 603-610, 2010
3112010
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
2612010
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
2462011
Succincter
M Patrascu
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 305-313, 2008
2402008
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
2362006
Logarithmic lower bounds in the cell-probe model
M Patrascu, ED Demaine
SIAM Journal on Computing 35 (4), 932-963, 2006
2112006
The power of simple tabulation hashing
M Pǎtrașcu, M Thorup
Journal of the ACM (JACM) 59 (3), 1-50, 2012
1822012
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
1682007
Unifying the landscape of cell-probe lower bounds
M P a · trașcu
SIAM Journal on Computing 40 (3), 827-847, 2011
1422011
Distance oracles beyond the Thorup-Zwick bound
M Patrascu, L Roditty
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010
138*2010
Dynamic optimality—almost
ED Demaine, D Harmon, J Iacono, M P a · trașcu
SIAM Journal on Computing 37 (1), 240-251, 2007
1372007
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
1232010
Subquadratic algorithms for 3SUM
I Baran, ED Demaine, M Pǎtrașcu
Algorithmica 50 (4), 584-596, 2008
1132008
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
1022006
Lower bounds for 2-dimensional range counting
M Patrascu
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
952007
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
842009
Planning for fast connectivity updates
M Patrascu, M Thorup
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 263-271, 2007
822007
On the k-Independence Required by Linear Probing and Minwise Independence
M Pǎtrașcu, M Thorup
ACM Transactions on Algorithms (TALG) 12 (1), 1-27, 2015
742015
Randomization does not help searching predecessors
M Patrascu, M Thorup
SODA 7, 555-564, 2007
732007
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
722010
The system can't perform the operation now. Try again later.
Articles 1–20