Mihai Patrascu Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJakub 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)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu: A Lower Bound for Succinct Rank Queries CoRR abs/0907.1103: (2009)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy M. Chan, Mihai Patrascu: Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time. SIAM J. Comput. 39(2): 703-729 (2009)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Mikkel Thorup: Higher Lower Bounds for Near-Neighbor and Further Rich Problems. SIAM J. Comput. 39(2): 730-741 (2009)
2008
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu: Succincter. FOCS 2008: 305-313
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Dorian Croitoru, Mihai Patrascu: Hardness of Nearest Neighbor under L-infinity. FOCS 2008: 424-433
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu: (Data) STRUCTURES. FOCS 2008: 434-443
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry. FOCS 2008: 95-104
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr 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
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAmit Chakrabarti, T. S. Jayram, Mihai Patrascu: Tight lower bounds for selection in randomly ordered streams. SODA 2008: 720-729
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu: Lower Bounds for Dynamic Connectivity. Encyclopedia of Algorithms 2008
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu: Predecessor Search. Encyclopedia of Algorithms 2008
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. Algorithmica 50(4): 584-596 (2008)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy M. Chan, Mihai Patrascu, Liam Roditty: Dynamic Connectivity: Connecting to Networks and Geometry CoRR abs/0808.1128: (2008)
2007
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting with No Extra Space. ESA 2007: 194-205
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Mikkel Thorup: Planning for Fast Connectivity Updates. FOCS 2007: 263-271
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNicholas 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
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Mikkel Thorup: Randomization does not help searching predecessors. SODA 2007: 555-564
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTimothy M. Chan, Mihai Patrascu: Voronoi diagrams in n·2osqrt(lg lg n) time. STOC 2007: 31-39
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu: Lower bounds for 2-dimensional range counting. STOC 2007: 40-46
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Mihai Patrascu: Tight bounds for dynamic convex hull queries (again). Symposium on Computational Geometry 2007: 354-363
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGianni Franceschini, S. Muthukrishnan, Mihai Patrascu: Radix Sorting With No Extra Space CoRR abs/0706.4107: (2007)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality - Almost. SIAM J. Comput. 37(1): 240-251 (2007)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Corina E. Tarnita: On dynamic bit-probe complexity. Theor. Comput. Sci. 380(1-2): 127-142 (2007)
2006
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu: Planar Point Location in Sublogarithmic Time. FOCS 2006: 325-332
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexandr Andoni, Piotr Indyk, Mihai Patrascu: On the Optimality of the Dimensionality Reduction Method. FOCS 2006: 449-458
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Mikkel Thorup: Higher Lower Bounds for Near-Neighbor and Further Rich Problems. FOCS 2006: 646-654
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik 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
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMicah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu: Lower bounds for asymmetric communication channels and distributed source coding. SODA 2006: 251-260
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMette 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
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Mikkel Thorup: Time-space trade-offs for predecessor search. STOC 2006: 232-240
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Mikkel Thorup: Time-Space Trade-Offs for Predecessor Search CoRR abs/cs/0603043: (2006)
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model. SIAM J. Comput. 35(4): 932-963 (2006)
2005
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCorina E. Patrascu, Mihai Patrascu: On Dynamic Bit-Probe Complexity. ICALP 2005: 969-981
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Stefano Stramigioli: Stick-slip Actuation of Electrostatic Stepper Micropositioners for Data Storage - the µWalker. ICMENS 2005: 81-86
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On dynamic range reporting in one dimension. STOC 2005: 104-111
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIlya Baran, Erik D. Demaine, Mihai Patrascu: Subquadratic Algorithms for 3SUM. WADS 2005: 409-421
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Worm Mortensen, Rasmus Pagh, Mihai Patrascu: On Dynamic Range Reporting in One Dimension CoRR abs/cs/0502032: (2005)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Logarithmic Lower Bounds in the Cell-Probe Model CoRR abs/cs/0502041: (2005)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu: De Dictionariis Dynamicis Pauco Spatio Utentibus CoRR abs/cs/0512081: (2005)
2004
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCorina E. Patrascu, Mihai Patrascu: Computing Order Statistics in the Farey Sequence. ANTS 2004: 358-366
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu: Dynamic Optimality -- Almost. FOCS 2004: 484-490
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Tight bounds for the partial-sums problem. SODA 2004: 20-29
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErik D. Demaine, Thouis R. Jones, Mihai Patrascu: Interpolation search for non-independent data. SODA 2004: 529-530
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihai Patrascu, Erik D. Demaine: Lower bounds for dynamic connectivity. STOC 2004: 546-553

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Feb 9 14:55:32 2010 by Michael Ley (ley@uni-trier.de)