Zeyuan Allen Zhu

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Zhenyu Liao

> Home > Persons > Zeyuan Allen Zhu

Publications

2016
[c26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icalp/ZhuLY16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/ZhuLY16
Zeyuan Allen Zhu, Zhenyu Liao, Yang Yuan:
Optimization Algorithms for Faster Computational Geometry. ICALP 2016: 53:1-53:6
2015
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/ZhuLO15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/ZhuLO15
Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia:
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. STOC 2015: 237-245
[i21]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ZhuLO15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ZhuLO15
Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia:
Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates. CoRR abs/1506.04838 (2015)
2014
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ZhuLO14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ZhuLO14
Zeyuan Allen Zhu, Zhenyu Liao, Lorenzo Orecchia:
Using Optimization to Find Maximum Inscribed Balls and Minimum Enclosing Balls. CoRR abs/1412.1001 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.