Mihai Pǎtraşcu

Available identifiers

zbMath Open patrascu.mihaiWikidataQ6845108 ScholiaQ6845108MaRDI QIDQ489744

List of research outcomes

Publication	Date of Publication	Type
Twisted Tabulation Hashing	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q5743421	2019-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4633860	2019-05-06	Paper
On the k -Independence Required by Linear Probing and Minwise Independence	2018-10-30	Paper
Necklaces, convolutions, and \(X+Y\)	2017-03-27	Paper
Finding the Median (Obliviously) with Bounded Space	2015-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q5501238	2015-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q5501303	2015-08-03	Paper
Picture-hanging puzzles	2015-01-21	Paper
https://portal.mardi4nfdi.de/entity/Q2934638	2014-12-18	Paper
Time-space trade-offs for predecessor search	2014-11-25	Paper
Changing base without losing space	2014-08-13	Paper
Towards polynomial lower bounds for dynamic problems	2014-08-13	Paper
The Power of Simple Tabulation Hashing	2014-06-05	Paper
Don't rush into a union	2014-06-05	Paper
Distance Oracles beyond the Thorup--Zwick Bound	2014-06-04	Paper
https://portal.mardi4nfdi.de/entity/Q5417611	2014-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q5417615	2014-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q5417617	2014-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q5417690	2014-05-22	Paper
Orthogonal range searching on the RAM, revisited	2014-03-24	Paper
The Power of Simple Tabulation Hashing	2014-02-17	Paper
Unifying the Landscape of Cell-Probe Lower Bounds	2011-10-18	Paper
Dynamic Connectivity: Connecting to Networks and Geometry	2011-07-29	Paper
On the k-Independence Required by Linear Probing and Minwise Independence	2010-09-07	Paper
On dynamic range reporting in one dimension	2010-08-16	Paper
Lower bounds for asymmetric communication channels and distributed source coding	2010-08-16	Paper
Lower bounds for dynamic connectivity	2010-08-15	Paper
https://portal.mardi4nfdi.de/entity/Q3579381	2010-08-06	Paper
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time	2010-04-29	Paper
Higher Lower Bounds for Near-Neighbor and Further Rich Problems	2010-04-29	Paper
Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons	2009-08-27	Paper
Tight bounds for dynamic convex hull queries (again)	2009-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q3549594	2009-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q3549595	2009-01-05	Paper
De Dictionariis Dynamicis Pauco Spatio Utentibus	2008-09-18	Paper
Subquadratic algorithms for 3SUM	2008-04-23	Paper
Dynamic Optimality—Almost	2008-03-28	Paper
Farey Statistics in Time n^{2/3} and Counting Primitive Lattice Points in Polygons	2007-08-01	Paper
On dynamic bit-probe complexity	2007-07-16	Paper
Algorithms and Data Structures	2006-10-25	Paper
Logarithmic Lower Bounds in the Cell-Probe Model	2006-06-01	Paper
Automata, Languages and Programming	2006-01-10	Paper
Algorithmic Number Theory	2005-08-12	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

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