Van H. Vu

According to our database1, Van H. Vu authored at least 80 papers between 1996 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Reaching a Consensus on Random Networks: The Power of Few.
Proceedings of the Approximation, 2020

2019
Law of the iterated logarithm for random graphs.
Random Struct. Algorithms, 2019

2018
Packing perfect matchings in random hypergraphs.
Random Struct. Algorithms, 2018

Random perturbation and matrix sparsification and completion.
CoRR, 2018

2017
Random matrices have simple spectrum.
Comb., 2017

2016
Anti-concentration for Polynomials of Independent Random Variables.
Theory Comput., 2016

Dictionary Learning With Few Samples and Matrix Concentration.
IEEE Trans. Inf. Theory, 2016

Eigenvectors of random matrices: A survey.
J. Comb. Theory, Ser. A, 2016

2015
Random weighted projections, random quadratic forms and random eigenvectors.
Random Struct. Algorithms, 2015

Anti-concentration for random polynomials.
CoRR, 2015

Random Matrices: l1 Concentration and Dictionary Learning with Few Samples.
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.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
A simple SVD algorithm for finding hidden partitions.
CoRR, 2014

2013
Sparse random graphs: Eigenvalues and eigenvectors.
Random Struct. Algorithms, 2013

2012
A characterization of incomplete sequences in vector spaces.
J. Comb. Theory, Ser. A, 2012

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

2011
Singular vectors under random perturbation.
Random Struct. Algorithms, 2011

Mapping incidences.
J. Lond. Math. Soc., 2011

2010
A sharp inverse Littlewood-Offord theorem.
Random Struct. Algorithms, 2010

Smooth analysis of the condition number and the least singular value.
Math. Comput., 2010

On the Rank of Random Sparse Matrices.
Comb. Probab. Comput., 2010

Structure of large incomplete sets in abelian groups.
Comb., 2010

2009
Concentration of Random Determinants and Permanent Estimators.
SIAM J. Discret. Math., 2009

Classification theorems for sumsets modulo a prime.
J. Comb. Theory, Ser. A, 2009

The Inverse Erdös-Heilbronn Problem.
Electron. J. Comb., 2009

2008
Local resilience of graphs.
Random Struct. Algorithms, 2008

Factors in random graphs.
Random Struct. Algorithms, 2008

The rank of random graphs.
Random Struct. Algorithms, 2008

An Inscribing Model for Random Polytopes.
Discret. Comput. Geom., 2008

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

2007
Random inscribing polytopes.
Eur. J. Comb., 2007

Small subgraphs of random regular graphs.
Discret. Math., 2007

Spectral norm of random matrices.
Comb., 2007

The condition number of a randomly perturbed matrix.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Additive combinatorics.
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.
Random Struct. Algorithms, 2006

Generating Random Regular Graphs.
Comb., 2006

2005
Improving the Gilbert-Varshamov Bound for <i>q</i>-Ary Codes.
IEEE Trans. Inf. Theory, 2005

A generalization of Turán's theorem.
J. Graph Theory, 2005

Exact <i>k</i>-Wise Intersection Theorems.
Graphs Comb., 2005

Discrepancy After Adding A Single Set.
Comb., 2005

De Bruijn covering codes with arbitrary alphabets.
Adv. Appl. Math., 2005

On random pm 1 matrices: singularity and determinant.
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.
Random Struct. Algorithms, 2004

2003
Covering codes with improved density.
IEEE Trans. Inf. Theory, 2003

Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs.
SIAM J. Comput., 2003

Turán's theorem in sparse random graphs.
Random Struct. Algorithms, 2003

On the probability of independent sets in random graphs.
Random Struct. Algorithms, 2003

The Spectra of Random Graphs with Given Expected Degrees.
Internet Math., 2003

Small Complete Arcs in Projective Planes.
Comb., 2003

Distinct distances in homogeneous sets.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Concentration of non-Lipschitz functions and applications.
Random Struct. Algorithms, 2002

On the asymmetry of random regular graphs and random graphs.
Random Struct. Algorithms, 2002

Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time.
J. Comb. Optim., 2002

A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs.
Comb. Probab. Comput., 2002

A Sharp Threshold For Network Reliability.
Comb. Probab. Comput., 2002

2001
Random regular graphs of high degree.
Random Struct. Algorithms, 2001

Choosability in Random Hypergraphs.
J. Comb. Theory, Ser. B, 2001

Some recent results on list coloring.
Electron. Notes Discret. Math., 2001

On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
Discret. Appl. Math., 2001

A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph.
Comb. Probab. Comput., 2001

2000
On the concentration of multivariate polynomials with small expectation.
Random Struct. Algorithms, 2000

New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help.
Random Struct. Algorithms, 2000

On The Choice Number Of Random Hypergraphs.
Comb. Probab. Comput., 2000

Concentration of Multivariate Polynomials and Its Applications.
Comb., 2000

Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

The Cover Time, the Blanket Time, and the Matthews Bound.
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.
J. Graph Theory, 1999

Extremal Set Systems with Weakly Restricted Intersections.
Comb., 1999

Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics.
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.
IEEE Trans. Inf. Theory, 1998

Geometric Foundations for Interval-Based Probabilities.
Ann. Math. Artif. Intell., 1998

1997
Coins and Cones.
J. Comb. Theory, Ser. A, 1997

Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs.
J. Comb. Theory, Ser. A, 1997

Extremal Systems with Upper-Bounded Odd Intersections.
Graphs Comb., 1997

On a Theorem of Ganter.
Comb. Probab. Comput., 1997

On the Infeasibility of Training Neural Networks with Small Squared Errors.
Proceedings of the Advances in Neural Information Processing Systems 10, 1997

1996
On the embedding of graphs into graphs with few eigenvalues.
J. Graph Theory, 1996

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

The Geometry of Coin-Weighing Problems.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996


  Loading...