Van H. Vu

According to our database, Van H. Vu authored at least 87 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Matrices With Gaussian Noise: Optimal Estimates for Singular Subspace Perturbation.

Sean O'Rourke, Van Vu, Ke Wang

IEEE Trans. Inf. Theory, 2024

Matrix Perturbation: Davis-Kahan in the Infinity Norm.

Abhinav Bhardwaj, Van Vu

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Entry-wise dissipation for singular vector perturbation bounds.

Abhinav Bhardwaj, Van Vu

CoRR, 2023

Optimal Subspace Perturbation Bounds under Gaussian Noise.

Sean O'Rourke, Van Vu, Ke Wang

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

VinDr-Mammo: A large-scale benchmark dataset for computer-aided diagnosis in full-field digital mammography.

Hieu T. Nguyen, Ha Q. Nguyen, Hieu H. Pham, Khanh Lam, Linh T. Le, Minh Dao, Van Vu

CoRR, 2022

2021

VinDr-SpineXR: A Deep Learning Framework for Spinal Lesions Detection and Classification from Radiographs.

Hieu T. Nguyen, Hieu H. Pham, Nghia T. Nguyen, Ha Q. Nguyen, Thang Q. Huynh, Minh Dao, Van Vu

Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2021 - 24th International Conference, Strasbourg, France, September 27, 2021

2020

Reaching a Consensus on Random Networks: The Power of Few.

Linh V. Tran, Van Vu

Proceedings of the Approximation, 2020

2019

Law of the iterated logarithm for random graphs.

Asaf Ferber, Daniel Montealegre, Van Vu

Random Struct. Algorithms, 2019

Spectrum of Complex Networks.

Daniel Montealegre, Van Vu

Internet Math., 2019

2018

Packing perfect matchings in random hypergraphs.

Asaf Ferber, Van Vu

Random Struct. Algorithms, 2018

Random perturbation and matrix sparsification and completion.

Sean O'Rourke, Van Vu, Ke Wang

CoRR, 2018

2017

Random matrices have simple spectrum.

Terence Tao, Van Vu

Comb., 2017

2016

Anti-concentration for Polynomials of Independent Random Variables.

Raghu Meka, Oanh Nguyen, Van Vu

Theory Comput., 2016

Dictionary Learning With Few Samples and Matrix Concentration.

Kyle Luh, Van H. Vu

IEEE Trans. Inf. Theory, 2016

Eigenvectors of random matrices: A survey.

Sean O'Rourke, Van Vu, Ke Wang

J. Comb. Theory, Ser. A, 2016

2015

Random weighted projections, random quadratic forms and random eigenvectors.

Van H. Vu, Ke Wang

Random Struct. Algorithms, 2015

Anti-concentration for random polynomials.

Oanh Nguyen, Van Vu

CoRR, 2015

Random Matrices: l1 Concentration and Dictionary Learning with Few Samples.

Kyle Luh, Van Vu

Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery.

Peter Chin, Anup Rao, Van Vu

Proceedings of The 28th Conference on Learning Theory, 2015

2014

A simple SVD algorithm for finding hidden partitions.

Van Vu

CoRR, 2014

2013

Sparse random graphs: Eigenvalues and eigenvectors.

Linh V. Tran, Van H. Vu, Ke Wang

Random Struct. Algorithms, 2013

2012

A characterization of incomplete sequences in vector spaces.

Hoi H. Nguyen, Van H. Vu

J. Comb. Theory, Ser. A, 2012

The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi.

Terence Tao, Van H. Vu

Comb., 2012

2011

Singular vectors under random perturbation.

Van Vu

Random Struct. Algorithms, 2011

Mapping incidences.

Van H. Vu, Melanie Matchett Wood, Philip Matchett Wood

J. Lond. Math. Soc., 2011

2010

A sharp inverse Littlewood-Offord theorem.

Terence Tao, Van H. Vu

Random Struct. Algorithms, 2010

Smooth analysis of the condition number and the least singular value.

Terence Tao, Van H. Vu

Math. Comput., 2010

On the Rank of Random Sparse Matrices.

Kevin P. Costello, Van H. Vu

Comb. Probab. Comput., 2010

Structure of large incomplete sets in abelian groups.

Van H. Vu

Comb., 2010

2009

Concentration of Random Determinants and Permanent Estimators.

Kevin P. Costello, Van H. Vu

SIAM J. Discret. Math., 2009

Classification theorems for sumsets modulo a prime.

Hoi H. Nguyen, Van H. Vu

J. Comb. Theory, Ser. A, 2009

The Inverse Erdös-Heilbronn Problem.

Van H. Vu, Philip Matchett Wood

Electron. J. Comb., 2009

2008

Local resilience of graphs.

Benny Sudakov, Van H. Vu

Random Struct. Algorithms, 2008

Factors in random graphs.

Anders Johansson, Jeff Kahn, Van H. Vu

Random Struct. Algorithms, 2008

The rank of random graphs.

Kevin P. Costello, Van H. Vu

Random Struct. Algorithms, 2008

An Inscribing Model for Random Polytopes.

Ross M. Richardson, Van H. Vu, Lei Wu

Discret. Comput. Geom., 2008

Near optimal bounds for the Erdös distinct distances problem in high dimensions.

József Solymosi, Van H. Vu

Comb., 2008

2007

Random inscribing polytopes.

Ross M. Richardson, Van H. Vu, Lei Wu

Eur. J. Comb., 2007

Small subgraphs of random regular graphs.

Jeong Han Kim, Benny Sudakov, Van H. Vu

Discret. Math., 2007

Spectral norm of random matrices.

Van H. Vu

Comb., 2007

The condition number of a randomly perturbed matrix.

Van H. Vu, Terence Tao

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Additive combinatorics.

Terence Tao, Van H. Vu

Cambridge studies in advanced mathematics 105, Cambridge University Press, ISBN: 978-0-521-85386-6, 2007

2006

On random plus/minus 1 matrices: Singularity and determinant.

Terence Tao, Van H. Vu

Random Struct. Algorithms, 2006

Generating Random Regular Graphs.

Jeong Han Kim, Van H. Vu

Comb., 2006

2005

Improving the Gilbert-Varshamov Bound for <i>q</i>-Ary Codes.

Van H. Vu, Lei Wu

IEEE Trans. Inf. Theory, 2005

A generalization of Turán's theorem.

Benny Sudakov, Tibor Szabó, Van H. Vu

J. Graph Theory, 2005

Exact <i>k</i>-Wise Intersection Theorems.

Tibor Szabó, Van H. Vu

Graphs Comb., 2005

Discrepancy After Adding A Single Set.

Jeong Han Kim, Jirí Matousek, Van H. Vu

Comb., 2005

De Bruijn covering codes with arbitrary alphabets.

Van H. Vu

Adv. Appl. Math., 2005

On random pm 1 matrices: singularity and determinant.

Terence Tao, Van H. Vu

Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004

Divide and conquer martingales and the number of triangles in a random graph.

Jeong Han Kim, Van H. Vu

Random Struct. Algorithms, 2004

2003

Covering codes with improved density.

Michael Krivelevich, Benny Sudakov, Van H. Vu

IEEE Trans. Inf. Theory, 2003

Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs.

Hung Q. Ngo, Van H. Vu

SIAM J. Comput., 2003

Turán's theorem in sparse random graphs.

Tibor Szabó, Van H. Vu

Random Struct. Algorithms, 2003

On the probability of independent sets in random graphs.

Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald

Random Struct. Algorithms, 2003

The Spectra of Random Graphs with Given Expected Degrees.

Fan R. K. Chung, Linyuan Lu, Van H. Vu

Internet Math., 2003

Small Complete Arcs in Projective Planes.

Jeong Han Kim, Van H. Vu

Comb., 2003

Distinct distances in homogeneous sets.

József Solymosi, Van H. Vu

Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002

Concentration of non-Lipschitz functions and applications.

Van H. Vu

Random Struct. Algorithms, 2002

On the asymmetry of random regular graphs and random graphs.

Jeong Han Kim, Benny Sudakov, Van H. Vu

Random Struct. Algorithms, 2002

Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time.

Michael Krivelevich, Van H. Vu

J. Comb. Optim., 2002

A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs.

Van H. Vu

Comb. Probab. Comput., 2002

A Sharp Threshold For Network Reliability.

Michael Krivelevich, Benny Sudakov, Van H. Vu

Comb. Probab. Comput., 2002

2001

Random regular graphs of high degree.

Michael Krivelevich, Benny Sudakov, Van H. Vu, Nicholas C. Wormald

Random Struct. Algorithms, 2001

Choosability in Random Hypergraphs.

Michael Krivelevich, Van H. Vu

J. Comb. Theory, Ser. B, 2001

Some recent results on list coloring.

Van H. Vu

Electron. Notes Discret. Math., 2001

On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.

Igor Pak, Van H. Vu

Discret. Appl. Math., 2001

A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph.

Van H. Vu

Comb. Probab. Comput., 2001

2000

On the concentration of multivariate polynomials with small expectation.

Van H. Vu

Random Struct. Algorithms, 2000

New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help.

Van H. Vu

Random Struct. Algorithms, 2000

On The Choice Number Of Random Hypergraphs.

Van H. Vu

Comb. Probab. Comput., 2000

Concentration of Multivariate Polynomials and Its Applications.

Jeong Han Kim, Van H. Vu

Comb., 2000

Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time.

Michael Krivelevich, Van H. Vu

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

The Cover Time, the Blanket Time, and the Matthews Bound.

Jeff Kahn, Jeong Han Kim, László Lovász, Van H. Vu

Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999

On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs.

Van H. Vu

J. Graph Theory, 1999

Extremal Set Systems with Weakly Restricted Intersections.

Van H. Vu

Comb., 1999

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics.

Christian Borgs, Jennifer T. Chayes, Alan M. Frieze, Jeong Han Kim, Prasad Tetali, Eric Vigoda, Van H. Vu

Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998

On the Infeasibility of Training Neural Networks with Small Mean-Sqared Error.

Van H. Vu

IEEE Trans. Inf. Theory, 1998

Geometric Foundations for Interval-Based Probabilities.

Vu A. Ha, AnHai Doan, Van H. Vu, Peter Haddawy

Ann. Math. Artif. Intell., 1998

1997

Coins and Cones.

Dmitry N. Kozlov, Van H. Vu

J. Comb. Theory, Ser. A, 1997

Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs.

Noga Alon, Van H. Vu

J. Comb. Theory, Ser. A, 1997

Extremal Systems with Upper-Bounded Odd Intersections.

Van H. Vu

Graphs Comb., 1997

On a Theorem of Ganter.

Van H. Vu

Comb. Probab. Comput., 1997

On the Infeasibility of Training Neural Networks with Small Squared Errors.

Van H. Vu

Proceedings of the Advances in Neural Information Processing Systems 10, 1997

1996

On the embedding of graphs into graphs with few eigenvalues.

Van H. Vu

J. Graph Theory, 1996

A Strongly Regular <i>N</i>-Full Graph of Small Order.

Van H. Vu

Comb., 1996

The Geometry of Coin-Weighing Problems.

Noga Alon, Dmitry N. Kozlov, Van H. Vu

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996