The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Van H. Vu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  44. Smooth Analysis of the Condition Number and the Least Singular Value. [Citation Graph (, )][DBLP]


  45. Near optimal bounds for the Erdös distinct distances problem in high dimensions. [Citation Graph (, )][DBLP]


  46. Spectral norm of random matrices. [Citation Graph (, )][DBLP]


  47. An Inscribing Model for Random Polytopes. [Citation Graph (, )][DBLP]


  48. Random inscribing polytopes. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002