Mihai Patrascu

IBM, San Jose, CA, .

E-mail: trimite un mesaj.

Pagina web personala: http://people.csail.mit.edu/mip/

Nascut(a) in: 1982

Interese: informatica teoretica

Detalii:
Mihai Patrascu este în prezent cercetător postdoctoral la IBM Almaden; din vara 2009, va fi cercetător (senior member) la ATT Labs. Mihai a absolvit doctoratul în informatică la MIT în 2008, după ce absolvise studiile universitare tot la MIT, în 2006. Printre disctincțiile sale se numără IBM Raviv Memorial Fellowship în 2008, premiile pentru cea mai bună lucrare studențească la FOCS 2008 și ICALP 2005, premiul pentru cercetare studenteasca al Computer Research Association (CRA) în 2005, și multiple medalii la olimpiadele internaționale de informatică.

Details:
Mihai Patrascu is currently a postdoc at IBM Almaden, and will start as a Senior Member at ATT Labs in summer 2009. Mihai obtained a PhD at MIT in 2008, and a Bachelor's in 2006, also at MIT. He is the recipient of an IBM Raviv Memorial Fellowship, the Best Student Paper awards at FOCS'08 and ICALP'05, the CRA Outstanding Undergraduate Research Award in 2005, and a number of medals in international computer olympiads.

Publicații selectate:

* Mihai Patrascu, Computational Geometry through the Information Lens, 2007.

* Jakub Pawlewicz, Mihai Patrascu, Order Statistics in the Farey Sequences in Sublinear Time, Algorithmica, 2008.

* Amit Chakrabarti, T.S. Jayram, Mihai Patrascu, Tight Lower Bounds for Selection in Randomly Ordered Streams, 19th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2008.

* Mihai Patrascu, Mikkel Thorup, Planning for Fast Connectivity Updates, 48th IEEE Symposium on Foundations of Computer Science (FOCS), 2007.

* Gianni Franceschini, S. Muthukrishnan, Mihai Patrascu, Radix Sorting With No Extra Space, 15th European Symposium on Algorithms (ESA), 2007.

* Mihai Patrascu, Lower Bounds for 2-Dimensional Range Counting, 39th ACM Symposium on Theory of Computing (STOC), 2007.

* Timothy Chan, Mihai Patrascu, Voronoi Diagrams in n.2^O(sqrt(lglg n)) Time, 39th ACM Symposium on Theory of Computing (STOC), 2007.

* Erik Demaine, Mihai Patrascu, Tight Bounds for Dynamic Convex Hull Queries (Again), 23rd ACM Symposium on Computational Geometry (SoCG), 2007.

* Nick Harvey, Mihai Patrascu, Yonggang Wen, Sergey Yekhanin, Vincent Chan, Non-Adaptive Fault Diagnosis for All-Optical Networks via Combinatorial Group Testing on Graphs, 26th IEEE Conference on Computer Communications (INFOCOM), 2007.

* Mihai Patrascu, Mikkel Thorup, Randomization Does Not Help Searching Predecessors, 18th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2007.

* Timothy Chan, Mihai Patrascu, Point Location in Sublogarithmic Time and Other Transdichotomous Results in Computational Geometry, SIAM Journal on Computing (SICOMP), 2008.

* Mihai Patrascu, Planar Point Location in Sublogarithmic Time, 47th IEEE Symposium on Foundations of Computer Science (FOCS), 2006.

* Mihai Patrascu, Mikkel Thorup, Higher Lower Bounds for Near-Neighbor and Further Rich Problems, SIAM Journal on Computing (SICOMP), 2008.

* Alex Andoni, Piotr Indyk, Mihai Patrascu, On the Optimality of the Dimensionality Reduction Method, 47th IEEE Symposium on Foundations of Computer Science (FOCS), 2006.

* Mette Berger, Esben Rune Hansen, Rasmus Pagh, Mihai Patrascu, Milan Ruzic, Peter Tiedemann, Deterministic Load Balancing and Dictionaries in the Parallel Disk Model, 18th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2006.

* Mihai Patrascu, Mikkel Thorup, Time-Space Trade-Offs for Predecessor Search, 38th ACM Symposium on Theory of Computing (STOC), 2006.

* Erik Demaine, Friedhelm Meyer auf der Heide, Rasmus Pagh, Mihai Patrascu, De Dictionariis Dynamicis Pauco Spatio Utentibus, 7th Latin American Theoretical Informatics (LATIN), 2006.

* Micah Adler, Erik Demaine, Nick Harvey, Mihai Patrascu, Lower Bounds for Asymmetric Communication Channels and Distributed Source Coding, 17th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2006.

* Ilya Baran, Erik Demaine, Mihai Patrascu, Subquadratic Algorithms for 3SUM, Algorithmica, 2008.

* Mihai Patrascu, Corina Tarnita, On Dynamic Bit-Probe Complexity, Theoretical Computer Science (TCS), 380, 2007.

* Christian Worm Mortensen, Rasmus Pagh, Mihai Patrascu, On Dynamic Range Reporting in One Dimension, 37th ACM Symposium on Theory of Computing (STOC), 2005.

* Erik Demaine, Dion Harmon, John Iacono, Mihai Patrascu, Dynamic Optimality -- Almost, SIAM Journal on Computing (SICOMP), 37(1), 2007.

* Corina Tarnita, Mihai Patrascu, Computing Order Statistics in the Farey Sequence, 6th Algorithmic Number Theory Symposium (ANTS), 2004.

* Erik Demaine, Thouis Jones, Mihai Patrascu, Interpolation Search for Non-Independent Data, ACM, 15th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2004.

* Mihai Patrascu, Erik Demaine, Logarithmic Lower Bounds in the Cell-Probe Model, SIAM, SIAM Journal on Computing (SICOMP), 35(4), 2006.