Travelled to:1 × Canada
1 × France
1 × Japan
1 × Portugal
6 × USA
Collaborated with:M.Thorup ∅ T.M.Chan C.E.Patrascu E.D.Demaine P.Beame V.Liew Y.Dodis C.W.Mortensen R.Pagh A.Andoni R.Fagin R.Kumar D.Sivakumar
Talks about:dynam (4) bound (4) space (3) lower (3) time (3) independ (2) search (2) probe (2) rang (2) find (2)
Person: Mihai Patrascu
DBLP: Patrascu:Mihai
Contributed to:
2015
201120102010
200820072006200520052004Wrote 13 papers:
- ICALP-v1-2015-BeameLP #bound
- Finding the Median (Obliviously) with Bounded Space (PB, VL, MP), pp. 103–115.
- STOC-2011-PatrascuT #power of
- The power of simple tabulation hashing (MP, MT), pp. 1–10.
- STOC-2011-PatrascuT11a
- Don’t rush into a union: take time to find your roots (MP, MT), pp. 559–568.
- ICALP-v1-2010-PatrascuT #independence #linear #on the
- On the k-Independence Required by Linear Probing and Minwise Independence (MP, MT), pp. 715–726.
- STOC-2010-DodisPT
- Changing base without losing space (YD, MP, MT), pp. 593–602.
- STOC-2010-Patrascu #bound #polynomial #problem #towards
- Towards polynomial lower bounds for dynamic problems (MP), pp. 603–610.
- SIGMOD-2008-AndoniFKPS #classification #performance #rank #similarity
- Corrigendum to “efficient similarity search and classification via rank aggregation” by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD’03) (AA, RF, RK, MP, DS), pp. 1375–1376.
- STOC-2007-ChanP #diagrams
- Voronoi diagrams in n·2osqrt(lg lg n) time (TMC, MP), pp. 31–39.
- STOC-2007-Patrascu #2d #bound
- Lower bounds for 2-dimensional range counting (MP), pp. 40–46.
- STOC-2006-PatrascuT #trade-off
- Time-space trade-offs for predecessor search (MP, MT), pp. 232–240.
- ICALP-2005-PatrascuP #complexity #on the
- On Dynamic Bit-Probe Complexity (CEP, MP), pp. 969–981.
- STOC-2005-MortensenPP #on the
- On dynamic range reporting in one dimension (CWM, RP, MP), pp. 104–111.
- STOC-2004-PatrascuD #bound
- Lower bounds for dynamic connectivity (MP, EDD), pp. 546–553.