We stand with Ukraine

We stand with Ukraine

Mihai Patrascu

Affiliations:

University of Copenhagen, Denmark
University of Washington, Seattle, WA, USA
AT&T Labs - Research, Florham Park, NJ, USA
IBM Research, Almaden, San Jose, CA, USA
Massachusetts Institute of Technology, CSAIL, Cambridge, MA, USA (PhD 2008)

According to our database¹, Mihai Patrascu authored at least 62 papers between 2004 and 2016.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2016

Predecessor Search.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Lower Bounds for Dynamic Connectivity.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

On the <i>k</i>-Independence Required by Linear Probing and Minwise Independence.

[BibT_eX]

[DOI]

,

ACM Trans. Algorithms, 2016

2015

Investigation of long-term drift of NTC temperature sensors with less than 1 mK uncertainty.

[BibT_eX]

[DOI]

Anupama Kulkarni

,

,

Yuri van de Vijver

,

Jaap van Wensveen

,

Robert Pijnenburg

,

Stoyan Nihtianov

Proceedings of the 24th IEEE International Symposium on Industrial Electronics, 2015

Finding the Median (Obliviously) with Bounded Space.

[BibT_eX]

[DOI]

,

,

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Distance Oracles beyond the Thorup-Zwick Bound.

[BibT_eX]

[DOI]

,

SIAM J. Comput., 2014

Picture-Hanging Puzzles.

[BibT_eX]

[DOI]

Erik D. Demaine

,

Martin L. Demaine

,

,

Joseph S. B. Mitchell

,

Ronald L. Rivest

,

Theory Comput. Syst., 2014

Necklaces, Convolutions, and X+Y.

[BibT_eX]

[DOI]

,

Timothy M. Chan

,

Erik D. Demaine

,

,

,

,

Stefan Langerman

,

,

Perouz Taslakian

Algorithmica, 2014

Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search.

[BibT_eX]

[DOI]

,

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

Twisted Tabulation Hashing.

[BibT_eX]

[DOI]

,

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

The Power of Simple Tabulation Hashing.

[BibT_eX]

[DOI]

,

J. ACM, 2012

Using hashing to solve the dictionary problem.

[BibT_eX]

[DOI]

,

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

A New Infinity of Distance Oracles for Sparse Graphs.

[BibT_eX]

[DOI]

,

,

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Unifying the Landscape of Cell-Probe Lower Bounds.

[BibT_eX]

[DOI]

SIAM J. Comput., 2011

Dynamic Connectivity: Connecting to Networks and Geometry.

[BibT_eX]

[DOI]

Timothy M. Chan

,

,

SIAM J. Comput., 2011

Using Hashing to Solve the Dictionary Problem (In External Memory)

[BibT_eX]

[DOI]

,

CoRR, 2011

Don't rush into a union: take time to find your roots.

[BibT_eX]

[DOI]

,

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Orthogonal range searching on the RAM, revisited.

[BibT_eX]

[DOI]

Timothy M. Chan

,

Kasper Green Larsen

,

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

Transdichotomous Results in Computational Geometry, II: Offline Search

[BibT_eX]

[DOI]

Timothy M. Chan

,

CoRR, 2010

Towards polynomial lower bounds for dynamic problems.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Changing base without losing space.

[BibT_eX]

[DOI]

,

,

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

On the Possibility of Faster SAT Algorithms.

[BibT_eX]

[DOI]

,

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Cell-Probe Lower Bounds for Succinct Partial Sums.

[BibT_eX]

[DOI]

,

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Counting Inversions, Offline Orthogonal Range Counting, and Related Problems.

[BibT_eX]

[DOI]

Timothy M. Chan

,

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Lower Bounds for Edit Distance and Product Metrics via Poincaré-Type Inequalities.

[BibT_eX]

[DOI]

Alexandr Andoni

,

,

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

Higher Lower Bounds for Near-Neighbor and Further Rich Problems.

[BibT_eX]

[DOI]

,

SIAM J. Comput., 2009

Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time.

[BibT_eX]

[DOI]

Timothy M. Chan

,

SIAM J. Comput., 2009

A Lower Bound for Succinct Rank Queries

[BibT_eX]

[DOI]

CoRR, 2009

Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons.

[BibT_eX]

[DOI]

Jakub Pawlewicz

,

Algorithmica, 2009

The geometry of binary search trees.

[BibT_eX]

[DOI]

Erik D. Demaine

,

,

,

,

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008

Predecessor Search.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Lower Bounds for Dynamic Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Lower bound techniques for data structures.

[BibT_eX]

[DOI]

PhD thesis, 2008

Subquadratic Algorithms for 3SUM.

[BibT_eX]

[DOI]

,

Erik D. Demaine

,

Algorithmica, 2008

Tight lower bounds for selection in randomly ordered streams.

[BibT_eX]

[DOI]

Amit Chakrabarti

,

,

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

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

[BibT_eX]

[DOI]

Alexandr Andoni

,

,

,

,

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

(Data) STRUCTURES.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Succincter.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

Hardness of Nearest Neighbor under L-infinity.

[BibT_eX]

[DOI]

Alexandr Andoni

,

Dorian Croitoru

,

Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007

On dynamic bit-probe complexity.

[BibT_eX]

[DOI]

,

Corina E. Tarnita

Theor. Comput. Sci., 2007

Dynamic Optimality - Almost.

[BibT_eX]

[DOI]

Erik D. Demaine

,

,

,

SIAM J. Comput., 2007

Lower bounds for 2-dimensional range counting.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Voronoi diagrams in n·2<sup>osqrt(lg lg n)</sup> time.

[BibT_eX]

[DOI]

Timothy M. Chan

,

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Randomization does not help searching predecessors.

[BibT_eX]

[DOI]

,

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs.

[BibT_eX]

[DOI]

Nicholas J. A. Harvey

,

,

,

Sergey Yekhanin

,

Vincent W. S. Chan

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

Planning for Fast Connectivity Updates.

[BibT_eX]

[DOI]

,

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Radix Sorting with No Extra Space.

[BibT_eX]

[DOI]

Gianni Franceschini

,

S. Muthukrishnan

,

Proceedings of the Algorithms, 2007

Tight bounds for dynamic convex hull queries (again).

[BibT_eX]

[DOI]

Erik D. Demaine

,

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Logarithmic Lower Bounds in the Cell-Probe Model.

[BibT_eX]

[DOI]

,

Erik D. Demaine

SIAM J. Comput., 2006

Time-space trade-offs for predecessor search.

[BibT_eX]

[DOI]

,

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

Deterministic load balancing and dictionaries in the parallel disk model.

[BibT_eX]

[DOI]

,

Esben Rune Hansen

,

,

,

,

Peter Tiedemann

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Lower bounds for asymmetric communication channels and distributed source coding.

[BibT_eX]

[DOI]

,

Erik D. Demaine

,

Nicholas J. A. Harvey

,

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

De Dictionariis Dynamicis Pauco Spatio Utentibus (<i>lat.</i> On Dynamic Dictionaries Using Little Space).

[BibT_eX]

[DOI]

Erik D. Demaine

,

Friedhelm Meyer auf der Heide

,

,

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Planar Point Location in Sublogarithmic Time.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

On the Optimality of the Dimensionality Reduction Method.

[BibT_eX]

[DOI]

Alexandr Andoni

,

,

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

De Dictionariis Dynamicis Pauco Spatio Utentibus

[BibT_eX]

[DOI]

Erik D. Demaine

,

Friedhelm Meyer auf der Heide

,

,

CoRR, 2005

On dynamic range reporting in one dimension.

[BibT_eX]

[DOI]

Christian Worm Mortensen

,

,

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

Stick-slip Actuation of Electrostatic Stepper Micropositioners for Data Storage - the µWalker.

[BibT_eX]

[DOI]

,

Stefano Stramigioli

Proceedings of the 2005 International Conference on MEMS, 2005

2004

Lower bounds for dynamic connectivity.

[BibT_eX]

[DOI]

,

Erik D. Demaine

Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Tight bounds for the partial-sums problem.

[BibT_eX]

[DOI]

,

Erik D. Demaine

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Interpolation search for non-independent data.

[BibT_eX]

[DOI]

Erik D. Demaine

,

Thouis R. Jones

,

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Computing Order Statistics in the Farey Sequence.

[BibT_eX]

[DOI]

Corina E. Patrascu

,

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

Loading...