Travelled to:1 × Greece
3 × USA
Collaborated with:E.Petrank ∅ H.Jowhari M.Saglam J.Kilian B.Aronov J.Pach M.Sharir N.Alon M.Dietzfelbinger P.B.Miltersen S.Ben-David A.Borodin R.M.Karp A.Wigderson
Talks about:probabilist (2) fingerprint (1) algorithm (1) knowledg (1) distinct (1) checkabl (1) sampler (1) problem (1) distanc (1) stream (1)
Person: Gábor Tardos
DBLP: Tardos:G=aacute=bor
Contributed to:
2011
200319971990Wrote 6 papers:
- PODS-2011-JowhariST #bound #problem
- Tight bounds for Lp samplers, finding duplicates in streams, and related problems (HJ, MS, GT), pp. 49–58.
- STOC-2003-AronovPST
- Distinct distances in three and higher dimensions (BA, JP, MS, GT), pp. 541–546.
- STOC-2003-Tardo #probability
- Optimal probabilistic fingerprint codes (GT), pp. 116–125.
- STOC-1997-AlonDMPT #linear #question
- Is Linear Hashing Good? (NA, MD, PBM, EP, GT), pp. 465–474.
- STOC-1997-KilianPT #proving
- Probabilistically Checkable Proofs with Zero Knowledge (JK, EP, GT), pp. 496–505.
- STOC-1990-Ben-DavidBKTW #algorithm #on the #online #power of
- On the Power of Randomization in Online Algorithms (SBD, AB, RMK, GT, AW), pp. 379–386.