Travelled to:
1 × China
4 × USA
Collaborated with:
L.Orecchia J.A.Kelner Z.Liao S.Lattanzi V.S.Mirrokni W.Chen C.Zhu G.Wang Z.Chen A.Sidford S.Misailovic M.C.Rinard T.Wan D.Wang
Talks about:
algorithm (3) search (2) linear (2) time (2) rank (2) near (2) combinatori (1) difficulti (1) transform (1) spectral (1)
Person: Zeyuan Allen Zhu
DBLP: Zhu:Zeyuan_Allen
Contributed to:
Wrote 7 papers:
- STOC-2015-ZhuLO #matrix #multi
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (ZAZ, ZL, LO), pp. 237–245.
- STOC-2015-ZhuO #convergence #performance
- Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (ZAZ, LO), pp. 229–236.
- ICML-c3-2013-ZhuLM #algorithm #clustering
- A Local Algorithm for Finding Well-Connected Clusters (ZAZ, SL, VSM), pp. 396–404.
- STOC-2013-KelnerOSZ #algorithm #combinator
- A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (JAK, LO, AS, ZAZ), pp. 911–920.
- POPL-2012-ZhuMKR #approximate #performance #program transformation #random
- Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.
- CIKM-2009-ZhuCWZWC #divide and conquer #learning #query #ranking
- To divide and conquer search ranking by learning query difficulty (ZAZ, WC, TW, CZ, GW, ZC), pp. 1883–1886.
- CIKM-2009-ZhuCZWWC #algorithm #ranking
- A general magnitude-preserving boosting algorithm for search ranking (CZ, WC, ZAZ, GW, DW, ZC), pp. 817–826.