Van H. Vu

73 papers A* 9Journal 60Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Spectral Perturbation Bounds for Low-Rank Approximation with Applications to Privacy.
CoRR
Phuc Tran, Nisheeth K. Vishnoi, Van H. Vu
2016 J jnl
Dictionary Learning With Few Samples and Matrix Concentration.
IEEE Trans. Inf. Theory
Kyle Luh, Van H. Vu
2015 J jnl
Random weighted projections, random quadratic forms and random eigenvectors.
Random Struct. Algorithms
Van H. Vu, Ke Wang
2013 J jnl
Sparse random graphs: Eigenvalues and eigenvectors.
Random Struct. Algorithms
Linh V. Tran, Van H. Vu, Ke Wang
2012 J jnl
A characterization of incomplete sequences in vector spaces.
J. Comb. Theory A
Hoi H. Nguyen, Van H. Vu
2012 J jnl
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi.
Comb.
Terence Tao, Van H. Vu
2011 J jnl
Mapping incidences.
J. Lond. Math. Soc.
Van H. Vu, Melanie Matchett Wood, Philip Matchett Wood
2010 J jnl
A sharp inverse Littlewood-Offord theorem.
Random Struct. Algorithms
Terence Tao, Van H. Vu
2010 J jnl
On the Rank of Random Sparse Matrices.
Comb. Probab. Comput.
Kevin P. Costello, Van H. Vu
2010 J jnl
Smooth analysis of the condition number and the least singular value.
Math. Comput.
Terence Tao, Van H. Vu
2010 J jnl
Structure of large incomplete sets in abelian groups.
Comb.
Van H. Vu
2009 J jnl
Classification theorems for sumsets modulo a prime.
J. Comb. Theory A
Hoi H. Nguyen, Van H. Vu
2009 J jnl
Concentration of Random Determinants and Permanent Estimators.
SIAM J. Discret. Math.
Kevin P. Costello, Van H. Vu
2009 — conf
Smooth Analysis of the Condition Number and the Least Singular Value.
APPROX-RANDOM
Terence Tao, Van H. Vu
2009 J jnl
The Inverse Erdös-Heilbronn Problem.
Electron. J. Comb.
Van H. Vu, Philip Matchett Wood
2008 J jnl
An Inscribing Model for Random Polytopes.
Discret. Comput. Geom.
Ross M. Richardson, Van H. Vu, Lei Wu
2008 J jnl
Factors in random graphs.
Random Struct. Algorithms
Anders Johansson, Jeff Kahn, Van H. Vu
2008 J jnl
Local resilience of graphs.
Random Struct. Algorithms
Benny Sudakov, Van H. Vu
2008 J jnl
Near optimal bounds for the Erdös distinct distances problem in high dimensions.
Comb.
József Solymosi, Van H. Vu
2008 J jnl
The rank of random graphs.
Random Struct. Algorithms
Kevin P. Costello, Van H. Vu
2007 — book
Additive combinatorics.
Terence Tao, Van H. Vu
2007 J jnl
Random inscribing polytopes.
Eur. J. Comb.
Ross M. Richardson, Van H. Vu, Lei Wu
2007 J jnl
Small subgraphs of random regular graphs.
Discret. Math.
Jeong Han Kim, Benny Sudakov, Van H. Vu
2007 J jnl
Spectral norm of random matrices.
Comb.
Van H. Vu
2007 A* conf
The condition number of a randomly perturbed matrix.
STOC
Van H. Vu, Terence Tao
2006 J jnl
Generating Random Regular Graphs.
Comb.
Jeong Han Kim, Van H. Vu
2006 J jnl
On random plus/minus 1 matrices: Singularity and determinant.
Random Struct. Algorithms
Terence Tao, Van H. Vu
2005 J jnl
A generalization of Turán's theorem.
J. Graph Theory
Benny Sudakov, Tibor Szabó, Van H. Vu
2005 J jnl
De Bruijn covering codes with arbitrary alphabets.
Adv. Appl. Math.
Van H. Vu
2005 J jnl
Discrepancy After Adding A Single Set.
Comb.
Jeong Han Kim, Jirí Matousek, Van H. Vu
2005 J jnl
Exact
Graphs Comb.
Tibor Szabó, Van H. Vu
2005 J jnl
Improving the Gilbert-Varshamov Bound for
IEEE Trans. Inf. Theory
Van H. Vu, Lei Wu
2005 A* conf
On random pm 1 matrices: singularity and determinant.
STOC
Terence Tao, Van H. Vu
2005 A* conf
Spectral norm of random matrices.
STOC
Van H. Vu
2004 J jnl
Divide and conquer martingales and the number of triangles in a random graph.
Random Struct. Algorithms
Jeong Han Kim, Van H. Vu
2003 J jnl
Covering codes with improved density.
IEEE Trans. Inf. Theory
Michael Krivelevich, Benny Sudakov, Van H. Vu
2003 — conf
Distinct distances in homogeneous sets.
SCG
József Solymosi, Van H. Vu
2003 A* conf
Generating random regular graphs.
STOC
Jeong Han Kim, Van H. Vu
2003 J jnl
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs.
SIAM J. Comput.
Hung Q. Ngo, Van H. Vu
2003 A* conf
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs.
SODA
Hung Q. Ngo, Van H. Vu
2003 J jnl
On the probability of independent sets in random graphs.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2003 J jnl
Small Complete Arcs in Projective Planes.
Comb.
Jeong Han Kim, Van H. Vu
2003 J jnl
The Spectra of Random Graphs with Given Expected Degrees.
Internet Math.
Fan R. K. Chung, Linyuan Lu, Van H. Vu
2003 J jnl
Turán's theorem in sparse random graphs.
Random Struct. Algorithms
Tibor Szabó, Van H. Vu
2002 J jnl
A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs.
Comb. Probab. Comput.
Van H. Vu
2002 J jnl
A Sharp Threshold For Network Reliability.
Comb. Probab. Comput.
Michael Krivelevich, Benny Sudakov, Van H. Vu
2002 J jnl
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time.
J. Comb. Optim.
Michael Krivelevich, Van H. Vu
2002 J jnl
Concentration of non-Lipschitz functions and applications.
Random Struct. Algorithms
Van H. Vu
2002 J jnl
On the asymmetry of random regular graphs and random graphs.
Random Struct. Algorithms
Jeong Han Kim, Benny Sudakov, Van H. Vu
2001 J jnl
A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph.
Comb. Probab. Comput.
Van H. Vu
2001 J jnl
Choosability in Random Hypergraphs.
J. Comb. Theory B
Michael Krivelevich, Van H. Vu
2001 J jnl
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
Discret. Appl. Math.
Igor Pak, Van H. Vu
2001 J jnl
Random regular graphs of high degree.
Random Struct. Algorithms
Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald
2001 J jnl
Some recent results on list coloring.
Electron. Notes Discret. Math.
Van H. Vu
2000 A* conf
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time.
ICALP
Michael Krivelevich, Van H. Vu
2000 J jnl
Concentration of Multivariate Polynomials and Its Applications.
Comb.
Jeong Han Kim, Van H. Vu
2000 J jnl
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help.
Random Struct. Algorithms
Van H. Vu
2000 J jnl
On The Choice Number Of Random Hypergraphs.
Comb. Probab. Comput.
Van H. Vu
2000 J jnl
On the concentration of multivariate polynomials with small expectation.
Random Struct. Algorithms
Van H. Vu
2000 A* conf
The Cover Time, the Blanket Time, and the Matthews Bound.
FOCS
Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu
1999 J jnl
Extremal Set Systems with Weakly Restricted Intersections.
Comb.
Van H. Vu
1999 J jnl
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs.
J. Graph Theory
Van H. Vu
1999 A* conf
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics.
FOCS
Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu
1998 J jnl
Geometric Foundations for Interval-Based Probabilities.
Ann. Math. Artif. Intell.
Vu A. Ha, AnHai Doan, Van H. Vu, Peter Haddawy
1998 J jnl
On the Infeasibility of Training Neural Networks with Small Mean-Sqared Error.
IEEE Trans. Inf. Theory
Van H. Vu
1997 J jnl
Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs.
J. Comb. Theory A
Noga Alon, Van H. Vu
1997 J jnl
Coins and Cones.
J. Comb. Theory A
Dmitry N. Kozlov, Van H. Vu
1997 J jnl
Extremal Systems with Upper-Bounded Odd Intersections.
Graphs Comb.
Van H. Vu
1997 J jnl
On a Theorem of Ganter.
Comb. Probab. Comput.
Van H. Vu
1997 — conf
On the Infeasibility of Training Neural Networks with Small Squared Errors.
NIPS
Van H. Vu
1996 J jnl
A Strongly Regular
Comb.
Van H. Vu
1996 J jnl
On the embedding of graphs into graphs with few eigenvalues.
J. Graph Theory
Van H. Vu
1996 A* conf
The Geometry of Coin-Weighing Problems.
FOCS
Noga Alon, Dmitry N. Kozlov, Van H. Vu