Mihai Patrascu

2008
34	EE	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
33	EE	Amit Chakrabarti, T. S. Jayram, Mihai Patrascu: Tight lower bounds for selection in randomly ordered streams. SODA 2008: 720-729
32	EE	Ilya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. Algorithmica 50(4): 584-596 (2008)
2007
31	EE	Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting with No Extra Space. ESA 2007: 194-205
30	EE	Mihai Patrascu, Mikkel Thorup: Planning for Fast Connectivity Updates. FOCS 2007: 263-271
29	EE	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	EE	Mihai Patrascu, Mikkel Thorup: Randomization does not help searching predecessors. SODA 2007: 555-564
27	EE	Timothy M. Chan, Mihai Patrascu: Voronoi diagrams in n·2osqrt(lg lg n) time. STOC 2007: 31-39
26	EE	Mihai Patrascu: Lower bounds for 2-dimensional range counting. STOC 2007: 40-46
25	EE	Erik D. Demaine, Mihai Patrascu: Tight bounds for dynamic convex hull queries (again). Symposium on Computational Geometry 2007: 354-363
24	EE	Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting With No Extra Space CoRR abs/0706.4107: (2007)
23	EE	Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
22	EE	Mihai Patrascu, Corina E. Tarnita: On dynamic bit-probe complexity. Theor. Comput. Sci. 380(1-2): 127-142 (2007)
2006
21	EE	Mihai Patrascu: Planar Point Location in Sublogarithmic Time. FOCS 2006: 325-332
20	EE	Alexandr Andoni, Piotr Indyk, Mihai Patrascu: On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458
19	EE	Mihai Patrascu, Mikkel Thorup: Higher Lower Bounds for Near-Neighbor and Further Rich Problems. FOCS 2006: 646-654
18	EE	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	EE	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	EE	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	EE	Mihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240
14	EE	Mihai Patrascu, Mikkel Thorup: Time-Space Trade-Offs for Predecessor Search CoRR abs/cs/0603043: (2006)
13	EE	Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. 35(4): 932-963 (2006)
2005
12	EE	Corina E. Patrascu, Mihai Patrascu: On Dynamic Bit-Probe Complexity. ICALP 2005: 969-981
11	EE	Mihai Patrascu, Stefano Stramigioli: Stick-slip Actuation of Electrostatic Stepper Micropositioners for Data Storage - the µWalker. ICMENS 2005: 81-86
10	EE	Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On dynamic range reporting in one dimension. STOC 2005: 104-111
9	EE	Ilya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. WADS 2005: 409-421
8	EE	Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On Dynamic Range Reporting in One Dimension CoRR abs/cs/0502032: (2005)
7	EE	Mihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model CoRR abs/cs/0502041: (2005)
6	EE	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	EE	Corina E. Patrascu, Mihai Patrascu: Computing Order Statistics in the Farey Sequence. ANTS 2004: 358-366
4	EE	Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality -- Almost. FOCS 2004: 484-490
3	EE	Mihai Patrascu, Erik D. Demaine: Tight bounds for the partial-sums problem. SODA 2004: 20-29
2	EE	Erik D. Demaine, Thouis R. Jones, Mihai Patrascu: Interpolation search for non-independent data. SODA 2004: 529-530
1	EE	Mihai Patrascu, Erik D. Demaine: Lower bounds for dynamic connectivity. STOC 2004: 546-553

Coauthor Index

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

Colors in the list of coauthors