The following pages link to Zeyuan Allen Zhu (Q496012):
Displaying 16 items.
- Shorter arithmetization of nondeterministic computations (Q496013) (← links)
- Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
- (Q2227543) (redirect page) (← links)
- Near-optimal discrete optimization for experimental design: a regret minimization approach (Q2227544) (← links)
- Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908) (← links)
- Mechanism design with approximate valuations (Q2826042) (← links)
- Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (Q2941511) (← links)
- Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates (Q2941512) (← links)
- Randomized accuracy-aware program transformations for efficient approximate computations (Q2942894) (← links)
- Restricted Isometry Property for General p-Norms (Q2976590) (← links)
- Expanders via Local Edge Flips (Q4575596) (← links)
- Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver (Q4575711) (← links)
- Optimization Algorithms for Faster Computational Geometry (Q4598192) (← links)
- Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
- Restricted Isometry Property for General p-Norms. (Q5368705) (← links)
- Johnson-Lindenstrauss Compression with Neuroscience-Based Constraints (Q6256579) (← links)
