Mihai Patrascu
Mihai Patrascu
AT&T Labs
Geverifieerd e-mailadres voor alum.mit.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
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
2152010
Towards polynomial lower bounds for dynamic problems
M Patrascu
Proceedings of the forty-second ACM symposium on Theory of computing, 603-610, 2010
1982010
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
1932006
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
1912011
Succincter
M Patrascu
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 305-313, 2008
1912008
Logarithmic lower bounds in the cell-probe model
M Patrascu, ED Demaine
SIAM Journal on Computing 35 (4), 932-963, 2006
1662006
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
1352007
The power of simple tabulation hashing
M Pǎtraşcu, M Thorup
Journal of the ACM (JACM) 59 (3), 1-50, 2012
1302012
Unifying the landscape of cell-probe lower bounds
M P a ˇ traşcu
SIAM Journal on Computing 40 (3), 827-847, 2011
1112011
Dynamic optimality—almost
ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu
SIAM Journal on Computing 37 (1), 240-251, 2007
1022007
Distance oracles beyond the Thorup-Zwick bound
M Patrascu, L Roditty
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010
97*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
912006
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
902010
Necklaces, Convolutions, and X + Y
D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ...
European Symposium on Algorithms, 160-171, 2006
86*2006
Lower bounds for 2-dimensional range counting
M Patrascu
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
812007
Subquadratic algorithms for 3SUM
I Baran, ED Demaine, M Pǎtraşcu
Algorithmica 50 (4), 584-596, 2008
782008
Planning for fast connectivity updates
M Patrascu, M Thorup
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 263-271, 2007
662007
Primal dual gives almost optimal energy-efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
622017
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
612005
On the k-Independence Required by Linear Probing and Minwise Independence
M Pǎtraşcu, M Thorup
International Colloquium on Automata, Languages, and Programming, 715-726, 2010
60*2010
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20