Mihai Patrascu

	2009
46		Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
45		Jakub Pawlewicz, Mihai Patrascu: Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons. Algorithmica 55(2): 271-282 (2009)
44		Mihai Patrascu: A Lower Bound for Succinct Rank Queries CoRR abs/0907.1103: (2009)
43		Timothy M. Chan, Mihai Patrascu: Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. SIAM J. Comput. 39(2): 703-729 (2009)
42		Mihai Patrascu, Mikkel Thorup: Higher Lower Bounds for Near-Neighbor and Further Rich Problems. SIAM J. Comput. 39(2): 730-741 (2009)
	2008
41		Mihai Patrascu: Succincter. FOCS 2008: 305-313
40		Alexandr Andoni, Dorian Croitoru, Mihai Patrascu: Hardness of Nearest Neighbor under L-infinity. FOCS 2008: 424-433
39		Mihai Patrascu: (Data) STRUCTURES. FOCS 2008: 434-443
38		Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry. FOCS 2008: 95-104
37		Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar: Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). SIGMOD Conference 2008: 1375-1376
36		Amit Chakrabarti, T. S. Jayram, Mihai Patrascu: Tight lower bounds for selection in randomly ordered streams. SODA 2008: 720-729
35		Mihai Patrascu: Lower Bounds for Dynamic Connectivity. Encyclopedia of Algorithms 2008
34		Mihai Patrascu: Predecessor Search. Encyclopedia of Algorithms 2008
33		Ilya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. Algorithmica 50(4): 584-596 (2008)
32		Timothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry CoRR abs/0808.1128: (2008)
	2007
31		Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting with No Extra Space. ESA 2007: 194-205
30		Mihai Patrascu, Mikkel Thorup: Planning for Fast Connectivity Updates. FOCS 2007: 263-271
29		Nicholas J. A. Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent W. S. Chan: Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs. INFOCOM 2007: 697-705
28		Mihai Patrascu, Mikkel Thorup: Randomization does not help searching predecessors. SODA 2007: 555-564
27		Timothy M. Chan, Mihai Patrascu: Voronoi diagrams in n·2osqrt(lg lg n) time. STOC 2007: 31-39
26		Mihai Patrascu: Lower bounds for 2-dimensional range counting. STOC 2007: 40-46
25		Erik D. Demaine, Mihai Patrascu: Tight bounds for dynamic convex hull queries (again). Symposium on Computational Geometry 2007: 354-363
24		Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting With No Extra Space CoRR abs/0706.4107: (2007)
23		Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
22		Mihai Patrascu, Corina E. Tarnita: On dynamic bit-probe complexity. Theor. Comput. Sci. 380(1-2): 127-142 (2007)
	2006
21		Mihai Patrascu: Planar Point Location in Sublogarithmic Time. FOCS 2006: 325-332
20		Alexandr Andoni, Piotr Indyk, Mihai Patrascu: On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458
19		Mihai Patrascu, Mikkel Thorup: Higher Lower Bounds for Near-Neighbor and Further Rich Problems. FOCS 2006: 646-654
18		Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). LATIN 2006: 349-361
17		Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu: Lower bounds for asymmetric communication channels and distributed source coding. SODA 2006: 251-260
16		Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann: Deterministic load balancing and dictionaries in the parallel disk model. SPAA 2006: 299-307
15		Mihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240
14		Mihai Patrascu, Mikkel Thorup: Time-Space Trade-Offs for Predecessor Search CoRR abs/cs/0603043: (2006)
13		Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. 35(4): 932-963 (2006)
	2005
12		Corina E. Patrascu, Mihai Patrascu: On Dynamic Bit-Probe Complexity. ICALP 2005: 969-981
11		Mihai Patrascu, Stefano Stramigioli: Stick-slip Actuation of Electrostatic Stepper Micropositioners for Data Storage - the µWalker. ICMENS 2005: 81-86
10		Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On dynamic range reporting in one dimension. STOC 2005: 104-111
9		Ilya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. WADS 2005: 409-421
8		Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On Dynamic Range Reporting in One Dimension CoRR abs/cs/0502032: (2005)
7		Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model CoRR abs/cs/0502041: (2005)
6		Erik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus CoRR abs/cs/0512081: (2005)
	2004
5		Corina E. Patrascu, Mihai Patrascu: Computing Order Statistics in the Farey Sequence. ANTS 2004: 358-366
4		Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality -- Almost. FOCS 2004: 484-490
3		Mihai Patrascu, Erik D. Demaine: Tight bounds for the partial-sums problem. SODA 2004: 20-29
2		Erik D. Demaine, Thouis R. Jones, Mihai Patrascu: Interpolation search for non-independent data. SODA 2004: 529-530
1		Mihai Patrascu, Erik D. Demaine: Lower bounds for dynamic connectivity. STOC 2004: 546-553

Coauthor Index

1	Micah Adler	[17]
2	Alexandr Andoni	[20] [37] [40]
3	Ilya Baran	[9] [33]
4	Mette Berger	[16]
5	Amit Chakrabarti	[36]
6	Timothy M. Chan	[27] [32] [38] [43]
7	Vincent W. S. Chan	[29]
8	Dorian Croitoru	[40]
9	Erik D. Demaine	[1] [2] [3] [4] [6] [7] [9] [13] [17] [18] [23] [25] [33] [46]
10	Ronald Fagin	[37]
11	Gianni Franceschini	[24] [31]
12	Esben Rune Hansen	[16]
13	Dion Harmon	[4] [23] [46]
14	Nicholas J. A. Harvey	[17] [29]
15	Friedhelm Meyer auf der Heide	[6] [18]
16	John Iacono	[4] [23] [46]
17	Piotr Indyk	[20]
18	T. S. Jayram (Jayram S. Thathachar)	[36]
19	Thouis R. Jones	[2]
20	Daniel M. Kane	[46]
21	Ravi Kumar (S. Ravi Kumar)	[37]
22	Christian Worm Mortensen	[8] [10]
23	S. Muthukrishnan (S. Muthu Muthukrishnan)	[24] [31]
24	Rasmus Pagh	[6] [8] [10] [16] [18]
25	Corina E. Patrascu	[5] [12]
26	Jakub Pawlewicz	[45]
27	Liam Roditty	[32] [38]
28	Milan Ruzic	[16]
29	D. Sivakumar	[37]
30	Stefano Stramigioli	[11]
31	Corina E. Tarnita	[22]
32	Mikkel Thorup	[14] [15] [19] [28] [30] [42]
33	Peter Tiedemann	[16]
34	Yonggang Wen	[29]
35	Sergey Yekhanin	[29]

Colors in the list of coauthors