팔로우
Mihai Patrascu
Mihai Patrascu
AT&T Labs
alum.mit.edu의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
Towards polynomial lower bounds for dynamic problems
M Patrascu
Proceedings of the forty-second ACM symposium on Theory of computing, 603-610, 2010
2542010
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
2442010
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
2252006
Succincter
M Patrascu
2008 49th Annual IEEE Symposium on Foundations of Computer Science, 305-313, 2008
2192008
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
2122011
Logarithmic lower bounds in the cell-probe model
M Patrascu, ED Demaine
SIAM Journal on Computing 35 (4), 932-963, 2006
1872006
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
1582007
The power of simple tabulation hashing
M Pǎtraşcu, M Thorup
Journal of the ACM (JACM) 59 (3), 1-50, 2012
1472012
Unifying the landscape of cell-probe lower bounds
M P a ˇ traşcu
SIAM Journal on Computing 40 (3), 827-847, 2011
130*2011
Dynamic optimality—almost
ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu
SIAM Journal on Computing 37 (1), 240-251, 2007
1172007
Distance oracles beyond the Thorup-Zwick bound
M Patrascu, L Roditty
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 815-823, 2010
116*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
1072010
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
992006
Subquadratic algorithms for 3SUM
I Baran, ED Demaine, M Pǎtraşcu
Algorithmica 50 (4), 584-596, 2008
942008
Lower bounds for 2-dimensional range counting
M Patrascu
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
892007
Planning for fast connectivity updates
M Patrascu, M Thorup
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 263-271, 2007
762007
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
71*2010
Randomization does not help searching predecessors
M Patrascu, M Thorup
SODA 7, 555-564, 2007
692007
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
662009
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
662005
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20