| 2008 |
|---|
| 52 | EE | József Solymosi,
Van H. Vu:
Near optimal bounds for the Erdös distinct distances problem in high dimensions.
Combinatorica 28(1): 113-125 (2008) |
| 51 | EE | Ross M. Richardson,
Van H. Vu,
Lei Wu:
An Inscribing Model for Random Polytopes.
Discrete & Computational Geometry 39(1-3): 469-499 (2008) |
| 50 | EE | Anders Johansson,
Jeff Kahn,
Van H. Vu:
Factors in random graphs.
Random Struct. Algorithms 33(1): 1-28 (2008) |
| 49 | EE | Kevin P. Costello,
Van H. Vu:
The rank of random graphs.
Random Struct. Algorithms 33(3): 269-285 (2008) |
| 48 | EE | Benny Sudakov,
Van H. Vu:
Local resilience of graphs.
Random Struct. Algorithms 33(4): 409-433 (2008) |
| 2007 |
|---|
| 47 | EE | Van H. Vu,
Terence Tao:
The condition number of a randomly perturbed matrix.
STOC 2007: 248-255 |
| 46 | EE | Jeong Han Kim,
Benny Sudakov,
Van H. Vu:
Small subgraphs of random regular graphs.
Discrete Mathematics 307(15): 1961-1967 (2007) |
| 45 | EE | Ross M. Richardson,
Van H. Vu,
Lei Wu:
Random inscribing polytopes.
Eur. J. Comb. 28(8): 2057-2071 (2007) |
| 2006 |
|---|
| 44 | EE | Jeong Han Kim,
Van H. Vu:
Generating Random Regular Graphs.
Combinatorica 26(6): 683-708 (2006) |
| 43 | EE | Terence Tao,
Van H. Vu:
On random plus/minus 1 matrices: Singularity and determinant.
Random Struct. Algorithms 28(1): 1-23 (2006) |
| 2005 |
|---|
| 42 | EE | Van H. Vu:
Spectral norm of random matrices.
STOC 2005: 423-430 |
| 41 | EE | Terence Tao,
Van H. Vu:
On random pm 1 matrices: singularity and determinant.
STOC 2005: 431-440 |
| 40 | EE | Jeong Han Kim,
Jirí Matousek,
Van H. Vu:
Discrepancy After Adding A Single Set.
Combinatorica 25(4): 499-501 (2005) |
| 39 | EE | Tibor Szabó,
Van H. Vu:
Exact k-Wise Intersection Theorems.
Graphs and Combinatorics 21(2): 247-261 (2005) |
| 38 | EE | Van H. Vu,
Lei Wu:
Improving the Gilbert-Varshamov Bound for q-Ary Codes.
IEEE Transactions on Information Theory 51(9): 3200-3208 (2005) |
| 37 | EE | Benny Sudakov,
Tibor Szabó,
Van H. Vu:
A generalization of Turán's theorem.
Journal of Graph Theory 49(3): 187-195 (2005) |
| 2004 |
|---|
| 36 | EE | Jeong Han Kim,
Van H. Vu:
Divide and conquer martingales and the number of triangles in a random graph.
Random Struct. Algorithms 24(2): 166-174 (2004) |
| 2003 |
|---|
| 35 | EE | Hung Q. Ngo,
Van H. Vu:
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs.
SODA 2003: 834-840 |
| 34 | EE | Jeong Han Kim,
Van H. Vu:
Generating random regular graphs.
STOC 2003: 213-222 |
| 33 | EE | József Solymosi,
Van H. Vu:
Distinct distances in homogeneous sets.
Symposium on Computational Geometry 2003: 104-105 |
| 32 | EE | Jeong Han Kim,
Van H. Vu:
Small Complete Arcs in Projective Planes.
Combinatorica 23(2): 311-363 (2003) |
| 31 | | Michael Krivelevich,
Benny Sudakov,
Van H. Vu:
Covering codes with improved density.
IEEE Transactions on Information Theory 49(7): 1812-1815 (2003) |
| 30 | | Fan R. K. Chung,
Linyuan Lu,
Van H. Vu:
The Spectra of Random Graphs with Given Expected Degrees.
Internet Mathematics 1(3): (2003) |
| 29 | EE | Michael Krivelevich,
Benny Sudakov,
Van H. Vu,
Nicholas C. Wormald:
On the probability of independent sets in random graphs.
Random Struct. Algorithms 22(1): 1-14 (2003) |
| 28 | EE | Tibor Szabó,
Van H. Vu:
Turán's theorem in sparse random graphs.
Random Struct. Algorithms 23(3): 225-234 (2003) |
| 27 | EE | Hung Q. Ngo,
Van H. Vu:
Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs.
SIAM J. Comput. 32(4): 1040-1049 (2003) |
| 2002 |
|---|
| 26 | | Van H. Vu:
A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs.
Combinatorics, Probability & Computing 11(1): (2002) |
| 25 | | Michael Krivelevich,
Benny Sudakov,
Van H. Vu:
A Sharp Threshold For Network Reliability.
Combinatorics, Probability & Computing 11(5): (2002) |
| 24 | | Michael Krivelevich,
Van H. Vu:
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time.
J. Comb. Optim. 6(2): 143-155 (2002) |
| 23 | EE | Van H. Vu:
Concentration of non-Lipschitz functions and applications.
Random Struct. Algorithms 20(3): 262-316 (2002) |
| 22 | EE | Jeong Han Kim,
Benny Sudakov,
Van H. Vu:
On the asymmetry of random regular graphs and random graphs.
Random Struct. Algorithms 21(3-4): 216-224 (2002) |
| 2001 |
|---|
| 21 | | Van H. Vu:
A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph.
Combinatorics, Probability & Computing 10(1): (2001) |
| 20 | | Igor Pak,
Van H. Vu:
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
Discrete Applied Mathematics 110(2-3): 251-272 (2001) |
| 19 | EE | Van H. Vu:
Some recent results on list coloring.
Electronic Notes in Discrete Mathematics 7: 170-173 (2001) |
| 18 | EE | Michael Krivelevich,
Van H. Vu:
Choosability in Random Hypergraphs.
J. Comb. Theory, Ser. B 83(2): 241-257 (2001) |
| 17 | | Michael Krivelevich,
Benny Sudakov,
Van H. Vu,
Nicholas C. Wormald:
Random regular graphs of high degree.
Random Struct. Algorithms 18(4): 346-363 (2001) |
| 2000 |
|---|
| 16 | | Jeff Kahn,
Jeong Han Kim,
László Lovász,
Van H. Vu:
The Cover Time, the Blanket Time, and the Matthews Bound.
FOCS 2000: 467-475 |
| 15 | EE | Michael Krivelevich,
Van H. Vu:
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time.
ICALP 2000: 13-24 |
| 14 | EE | Jeong Han Kim,
Van H. Vu:
Concentration of Multivariate Polynomials and Its Applications.
Combinatorica 20(3): 417-434 (2000) |
| 13 | | Van H. Vu:
On The Choice Number Of Random Hypergraphs.
Combinatorics, Probability & Computing 9(1): (2000) |
| 12 | | Van H. Vu:
On the concentration of multivariate polynomials with small expectation.
Random Struct. Algorithms 16(4): 344-363 (2000) |
| 11 | | Van H. Vu:
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help.
Random Struct. Algorithms 17(1): 29-63 (2000) |
| 1999 |
|---|
| 10 | EE | 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: 218-229 |
| 9 | EE | Van H. Vu:
Extremal Set Systems with Weakly Restricted Intersections.
Combinatorica 19(4): 567-587 (1999) |
| 1998 |
|---|
| 8 | | Vu A. Ha,
AnHai Doan,
Van H. Vu,
Peter Haddawy:
Geometric Foundations for Interval-Based Probabilities.
Ann. Math. Artif. Intell. 24(1-4): 1-21 (1998) |
| 7 | | Van H. Vu:
On the Infeasibility of Training Neural Networks with Small Mean-Sqared Error.
IEEE Transactions on Information Theory 44(7): 2892-2900 (1998) |
| 1997 |
|---|
| 6 | | Van H. Vu:
On the Infeasibility of Training Neural Networks with Small Squared Errors.
NIPS 1997 |
| 5 | | Van H. Vu:
On a Theorem of Ganter.
Combinatorics, Probability & Computing 6(2): 247-254 (1997) |
| 4 | EE | Dmitry N. Kozlov,
Van H. Vu:
Coins and Cones.
J. Comb. Theory, Ser. A 78(1): 1-14 (1997) |
| 3 | EE | Noga Alon,
Van H. Vu:
Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs.
J. Comb. Theory, Ser. A 79(1): 133-160 (1997) |
| 1996 |
|---|
| 2 | | Noga Alon,
Dmitry N. Kozlov,
Van H. Vu:
The Geometry of Coin-Weighing Problems.
FOCS 1996: 524-532 |
| 1 | | Van H. Vu:
A Strongly Regular N-Full Graph of Small Order.
Combinatorica 16(2): 295-299 (1996) |
