Mihai Pǎtraşcu

From MaRDI portal
Person:489744

Available identifiers

zbMath Open patrascu.mihaiWikidataQ6845108 ScholiaQ6845108MaRDI QIDQ489744

List of research outcomes

PublicationDate of PublicationType
Twisted Tabulation Hashing2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434212019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338602019-05-06Paper
On the k -Independence Required by Linear Probing and Minwise Independence2018-10-30Paper
Necklaces, convolutions, and \(X+Y\)2017-03-27Paper
Finding the Median (Obliviously) with Bounded Space2015-10-27Paper
https://portal.mardi4nfdi.de/entity/Q55012382015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013032015-08-03Paper
Picture-hanging puzzles2015-01-21Paper
https://portal.mardi4nfdi.de/entity/Q29346382014-12-18Paper
Time-space trade-offs for predecessor search2014-11-25Paper
Changing base without losing space2014-08-13Paper
Towards polynomial lower bounds for dynamic problems2014-08-13Paper
The Power of Simple Tabulation Hashing2014-06-05Paper
Don't rush into a union2014-06-05Paper
Distance Oracles beyond the Thorup--Zwick Bound2014-06-04Paper
https://portal.mardi4nfdi.de/entity/Q54176112014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54176152014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54176172014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54176902014-05-22Paper
Orthogonal range searching on the RAM, revisited2014-03-24Paper
The Power of Simple Tabulation Hashing2014-02-17Paper
Unifying the Landscape of Cell-Probe Lower Bounds2011-10-18Paper
Dynamic Connectivity: Connecting to Networks and Geometry2011-07-29Paper
On the k-Independence Required by Linear Probing and Minwise Independence2010-09-07Paper
On dynamic range reporting in one dimension2010-08-16Paper
Lower bounds for asymmetric communication channels and distributed source coding2010-08-16Paper
Lower bounds for dynamic connectivity2010-08-15Paper
https://portal.mardi4nfdi.de/entity/Q35793812010-08-06Paper
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time2010-04-29Paper
Higher Lower Bounds for Near-Neighbor and Further Rich Problems2010-04-29Paper
Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons2009-08-27Paper
Tight bounds for dynamic convex hull queries (again)2009-02-12Paper
https://portal.mardi4nfdi.de/entity/Q35495942009-01-05Paper
https://portal.mardi4nfdi.de/entity/Q35495952009-01-05Paper
De Dictionariis Dynamicis Pauco Spatio Utentibus2008-09-18Paper
Subquadratic algorithms for 3SUM2008-04-23Paper
Dynamic Optimality—Almost2008-03-28Paper
Farey Statistics in Time n^{2/3} and Counting Primitive Lattice Points in Polygons2007-08-01Paper
On dynamic bit-probe complexity2007-07-16Paper
Algorithms and Data Structures2006-10-25Paper
Logarithmic Lower Bounds in the Cell-Probe Model2006-06-01Paper
Automata, Languages and Programming2006-01-10Paper
Algorithmic Number Theory2005-08-12Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mihai Pǎtraşcu