M
Mihai Patrascu
Researcher at AT&T Labs
Publications - 72
Citations - 3400
Mihai Patrascu is an academic researcher from AT&T Labs. The author has contributed to research in topics: Upper and lower bounds & Hash function. The author has an hindex of 30, co-authored 72 publications receiving 3188 citations. Previous affiliations of Mihai Patrascu include AT&T & University of Twente.
Papers
More filters
Posted Content
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
Mihai Patrascu,Mikkel Thorup +1 more
TL;DR: In this paper, the authors present a data structure representing a dynamic set S of w-bit integers on a word RAM with O(log n/ log w) time complexity.
Posted Content
Radix Sorting With No Extra Space
TL;DR: This work presents a simple, stable, integer sorting algorithm for words of size O(log n), which works in O(n) time and uses only O(1) words of extra memory on a RAM model.
Book ChapterDOI
On the k-independence required by linear probing and minwise independence
Mihai Patrascu,Mikkel Thorup +1 more
TL;DR: It is shown that linear probing requires 5-independent hash functions for expected constant-time performance, and that the multiply-shift scheme of Dietzfelbinger, most commonly used in practice, fails badly in both applications.
Book ChapterDOI
Radix sorting with no extra space
TL;DR: In this paper, a stable, stable integer sorting algorithm for words of size O(log n) was presented, which works in O(n) time and uses only O(1) words of extra memory on a RAM model.
Journal Article
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
Timothy M. Chan,Mihai Patrascu +1 more
TL;DR: In this paper, a linear-space data structure that can answer point-location queries in O(min{lg n/lg lg n, √lg U/ lg U}) time on the unit-cost random access machine (RAM) with word size w is presented.