Travelled to:1 × Latvia
2 × Canada
4 × USA
Collaborated with:M.Braverman ∅ B.Barak A.Orso M.J.Harrold O.Weinstein A.Yehudayoff X.Chen R.Shaltiel A.Wigderson J.Kamp S.P.Vadhan D.Zuckerman M.B.Cohen R.Kyng G.L.Miller J.W.Pachocki R.Peng S.C.Xu
Talks about:sourc (3) extractor (2) polynomi (2) interact (2) compress (2) communic (2) entropi (2) small (2) determinist (1) construct (1)
Person: Anup Rao
DBLP: Rao:Anup
Contributed to:
2014
20132011201020082006
2002Wrote 9 papers:
- STOC-2014-CohenKMPPRX #linear
- Solving SDD linear systems in nearly mlog1/2n time (MBC, RK, GLM, JWP, RP, AR, SCX), pp. 343–352.
- ICALP-v1-2013-BravermanRWY
- Direct Product via Round-Preserving Compression (MB, AR, OW, AY), pp. 232–243.
- STOC-2011-BravermanR #communication #fault #interactive #towards
- Towards coding for maximum errors in interactive communication (MB, AR), pp. 159–166.
- STOC-2010-BarakBCR #communication #how #interactive
- How to compress interactive communication (BB, MB, XC, AR), pp. 67–76.
- STOC-2008-Rao #bound #game studies #parallel
- Parallel repetition in projection games and a concentration bound (AR), pp. 1–10.
- STOC-2006-BarakRSW #graph
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (BB, AR, RS, AW), pp. 671–680.
- STOC-2006-KampRVZ
- Deterministic extractors for small-space sources (JK, AR, SPV, DZ), pp. 691–700.
- STOC-2006-Rao #constant #independence
- Extractors for a constant number of polynomially small min-entropy independent sources (AR), pp. 497–506.
- ICSM-2002-OrsoRH #java
- A Technique for Dynamic Updating of Java Software (AO, AR, MJH), pp. 649–658.