Mihai Pǎtraşcu

Computer Science · Physical Sciences

27h-index2.7kcitations93works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Algorithms and Data Compression(41), Complexity and Algorithms in Graphs(31), DNA and Biological Computing(17), Computational Geometry and Mesh Generation(14), Cryptography and Data Security(11)

Publications93 total

“Looking for the trees in the forest“ An attempt to finding the best segmentation-based methodology to discriminate deciduous trees in the Dubbarp area, Sweden
Lund University Publications Student Papers (Lund University)·2021Open Access
Predecessor Search
Encyclopedia of Algorithms·2016
On the <i>k</i> -Independence Required by Linear Probing and Minwise Independence
ACM Transactions on Algorithms·2015· 15 cited
Finding the Median (Obliviously) with Bounded Space
arXiv (Cornell University)·2015Open Access
Finding the Median (Obliviously) with Bounded Space
Lecture notes in computer science·2015· 2 cited
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
2014· 66 cited
Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search
arXiv (Cornell University)·2014· 7 citedOpen Access
Distance Oracles beyond the Thorup--Zwick Bound
SIAM Journal on Computing·2014· 57 cited
Twisted Tabulation Hashing
2013· 9 cited
Twisted tabulation hashing
Symposium on Discrete Algorithms·2013· 17 cited
Necklaces, Convolutions, and X+Y
Algorithmica·2012· 39 citedOpen Access
Necklaces, Convolutions, and X+Y
arXiv (Cornell University)·2012· 1 citedOpen Access
Volatile detection system using piezoelectric micromechanical resonators interfaced by an oscillator readout
Sensors and Actuators A Physical·2012· 23 cited
A New Infinity of Distance Oracles for Sparse Graphs
2012· 26 cited
The Power of Simple Tabulation Hashing
Journal of the ACM·2012· 93 cited
Flexible, electrostatic microfluidic actuators based on thin film fabrication
Sensors and Actuators A Physical·2012· 24 cited
Using hashing to solve the dictionary problem
Symposium on Discrete Algorithms·2012· 18 cited
Using Hashing to Solve the Dictionary Problem (In External Memory)
2012· 7 citedOpen Access
Using hashing to solve the dictionary problem
Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)·2012· 5 cited
Picture-Hanging Puzzles
Lecture notes in computer science·2012· 3 cited
page 1 of 5Next →

Frequent Co-authors

Mikkel Thorup(13), Erik D. Demaine(10), Timothy M. Chan(4), Liam Roditty(4), Alexandr Andoni(3), John Iacono(3), Nicholas J. A. Harvey(2), Ilya Baran(2), Rasmus Pagh(2), Sywert Brongersma(2), Mercedes Crego‐Calama(2), Kasper Green Larsen(1), Yonggang Wen(1), Sergey Yekhanin(1), Vincent W. S. Chan(1), Piotr Indyk(1), Ryan Williams(1), Yevgeniy Dodis(1), Amit Chakrabarti(1), T. S. Jayram(1)