Van H. Vu

Publication Activity (10 Years)

Years Active: 1996-2016
Publications (10 Years): 1

Top Topics

Eigenvalues And Eigenvectors

Indexing Schemes

High Dimensions

Top Venues

Random Struct. Algorithms

IEEE Trans. Inf. Theory

J. Comb. Theory, Ser. A

Publications

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