The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mihai Patrascu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Corina E. Patrascu, Mihai Patrascu
    Computing Order Statistics in the Farey Sequence. [Citation Graph (0, 0)][DBLP]
    ANTS, 2004, pp:358-366 [Conf]
  2. Erik D. Demaine, Mihai Patrascu
    Tight bounds for dynamic convex hull queries (again). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:354-363 [Conf]
  3. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
    Dynamic Optimality -- Almost. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:484-490 [Conf]
  4. Mihai Patrascu
    Planar Point Location in Sublogarithmic Time. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:325-332 [Conf]
  5. Alexandr Andoni, Piotr Indyk, Mihai Patrascu
    On the Optimality of the Dimensionality Reduction Method. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:449-458 [Conf]
  6. Mihai Patrascu, Mikkel Thorup
    Higher Lower Bounds for Near-Neighbor and Further Rich Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:646-654 [Conf]
  7. Corina E. Patrascu, Mihai Patrascu
    On Dynamic Bit-Probe Complexity. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:969-981 [Conf]
  8. Mihai Patrascu, Stefano Stramigioli
    Stick-slip Actuation of Electrostatic Stepper Micropositioners for Data Storage - the µWalker. [Citation Graph (0, 0)][DBLP]
    ICMENS, 2005, pp:81-86 [Conf]
  9. 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). [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:349-361 [Conf]
  10. Micah Adler, Erik D. Demaine, Nicholas J. A. Harvey, Mihai Patrascu
    Lower bounds for asymmetric communication channels and distributed source coding. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:251-260 [Conf]
  11. Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
    Interpolation search for non-independent data. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:529-530 [Conf]
  12. Mihai Patrascu, Erik D. Demaine
    Tight bounds for the partial-sums problem. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:20-29 [Conf]
  13. Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann
    Deterministic load balancing and dictionaries in the parallel disk model. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:299-307 [Conf]
  14. Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu
    On dynamic range reporting in one dimension. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:104-111 [Conf]
  15. Mihai Patrascu, Erik D. Demaine
    Lower bounds for dynamic connectivity. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:546-553 [Conf]
  16. Mihai Patrascu, Mikkel Thorup
    Time-space trade-offs for predecessor search. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:232-240 [Conf]
  17. Ilya Baran, Erik D. Demaine, Mihai Patrascu
    Subquadratic Algorithms for 3SUM. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:409-421 [Conf]
  18. Mihai Patrascu, Erik D. Demaine
    Logarithmic Lower Bounds in the Cell-Probe Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:4, pp:932-963 [Journal]
  19. Erik D. Demaine, Dion Harmon, John Iacono, Mihai Patrascu
    Dynamic Optimality - Almost. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:37, n:1, pp:240-251 [Journal]
  20. Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
    Radix Sorting with No Extra Space. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:194-205 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:697-705 [Conf]
  22. Mihai Patrascu, Mikkel Thorup
    Randomization does not help searching predecessors. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:555-564 [Conf]
  23. Mihai Patrascu
    Lower bounds for 2-dimensional range counting. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:40-46 [Conf]
  24. Timothy M. Chan, Mihai Patrascu
    Voronoi diagrams in n·2osqrt(lg lg n) time. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:31-39 [Conf]
  25. Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu
    Radix Sorting With No Extra Space [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  26. Mihai Patrascu, Mikkel Thorup
    Time-Space Trade-Offs for Predecessor Search [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  27. Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu
    On Dynamic Range Reporting in One Dimension [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  28. Mihai Patrascu, Erik D. Demaine
    Logarithmic Lower Bounds in the Cell-Probe Model [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  29. Mihai Patrascu, Corina E. Tarnita
    On dynamic bit-probe complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:127-142 [Journal]

  30. Hardness of Nearest Neighbor under L-infinity. [Citation Graph (, )][DBLP]


  31. (Data) STRUCTURES. [Citation Graph (, )][DBLP]


  32. Planning for Fast Connectivity Updates. [Citation Graph (, )][DBLP]


  33. Dynamic Connectivity: Connecting to Networks and Geometry. [Citation Graph (, )][DBLP]


  34. Succincter. [Citation Graph (, )][DBLP]


  35. On the k-Independence Required by Linear Probing and Minwise Independence. [Citation Graph (, )][DBLP]


  36. Corrigendum to "efficient similarity search and classification via rank aggregation" by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD'03). [Citation Graph (, )][DBLP]


  37. Tight lower bounds for selection in randomly ordered streams. [Citation Graph (, )][DBLP]


  38. The geometry of binary search trees. [Citation Graph (, )][DBLP]


  39. On the Possibility of Faster SAT Algorithms. [Citation Graph (, )][DBLP]


  40. Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities. [Citation Graph (, )][DBLP]


  41. Counting Inversions, Offline Orthogonal Range Counting, and Related Problems. [Citation Graph (, )][DBLP]


  42. Cell-Probe Lower Bounds for Succinct Partial Sums. [Citation Graph (, )][DBLP]


  43. Towards polynomial lower bounds for dynamic problems. [Citation Graph (, )][DBLP]


  44. Changing base without losing space. [Citation Graph (, )][DBLP]


  45. Subquadratic Algorithms for 3SUM. [Citation Graph (, )][DBLP]


  46. Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons. [Citation Graph (, )][DBLP]


  47. De Dictionariis Dynamicis Pauco Spatio Utentibus [Citation Graph (, )][DBLP]


  48. Dynamic Connectivity: Connecting to Networks and Geometry [Citation Graph (, )][DBLP]


  49. A Lower Bound for Succinct Rank Queries [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002