default search action
Van H. Vu
Person information
- affiliation: Yale University, New Haven, USA
- affiliation: Rutgers University, Piscataway, USA
- award (2012): Fulkerson Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j69]Phuc Tran, Van Vu:
A Short Proof of Kahn-Kalai Conjecture. Electron. J. Comb. 31(3) (2024) - [j68]Sean O'Rourke
, Van Vu, Ke Wang
Matrices With Gaussian Noise: Optimal Estimates for Singular Subspace Perturbation. IEEE Trans. Inf. Theory 70(3): 1978-2002 (2024) - [c18]Abhinav Bhardwaj, Van Vu:
Matrix Perturbation: Davis-Kahan in the Infinity Norm. SODA 2024: 880-934 - [i8]Phuc Tran, Van Vu:
Matrix perturbation bounds via contour bootstrapping. CoRR abs/2407.05230 (2024) - 2023
- [j67]Linh V. Tran, Van Vu:
Reaching a Consensus on Random Networks: The Power of Few. Theory Comput. 19: 1-21 (2023) - [c17]Sean O'Rourke, Van Vu, Ke Wang
Optimal Subspace Perturbation Bounds under Gaussian Noise. ISIT 2023: 2601-2606 - [i7]Abhinav Bhardwaj, Van Vu:
Entry-wise dissipation for singular vector perturbation bounds. CoRR abs/2304.00328 (2023) - 2022
- [i6]Hieu T. Nguyen, Ha Q. Nguyen, Hieu H. Pham
VinDr-Mammo: A large-scale benchmark dataset for computer-aided diagnosis in full-field digital mammography. CoRR abs/2203.11205 (2022) - 2021
- [c16]Hieu T. Nguyen
VinDr-SpineXR: A Deep Learning Framework for Spinal Lesions Detection and Classification from Radiographs. MICCAI (5) 2021: 291-301 - [i5]Hieu T. Nguyen, Hieu H. Pham, Nghia T. Nguyen, Ha Q. Nguyen, Thang Q. Huynh, Minh Dao, Van Vu:
VinDr-SpineXR: A deep learning framework for spinal lesions detection and classification from radiographs. CoRR abs/2106.12930 (2021) - 2020
- [c15]Linh V. Tran, Van Vu:
Reaching a Consensus on Random Networks: The Power of Few. APPROX-RANDOM 2020: 20:1-20:15
2010 – 2019
- 2019
- [j66]Daniel Montealegre, Van Vu:
Spectrum of Complex Networks. Internet Math. 2019 (2019) - [j65]Asaf Ferber, Daniel Montealegre, Van Vu:
Law of the iterated logarithm for random graphs. Random Struct. Algorithms 54(1): 3-38 (2019) - 2018
- [j64]Asaf Ferber, Van Vu:
Packing perfect matchings in random hypergraphs. Random Struct. Algorithms 52(3): 367-378 (2018) - [i4]Sean O'Rourke, Van Vu, Ke Wang
Random perturbation and matrix sparsification and completion. CoRR abs/1803.00679 (2018) - 2017
- [j63]Terence Tao, Van Vu:
Random matrices have simple spectrum. Comb. 37(3): 539-553 (2017) - 2016
- [j62]Sean O'Rourke, Van Vu, Ke Wang
Eigenvectors of random matrices: A survey. J. Comb. Theory A 144: 361-442 (2016) - [j61]Kyle Luh, Van H. Vu:
Dictionary Learning With Few Samples and Matrix Concentration. IEEE Trans. Inf. Theory 62(3): 1516-1527 (2016) - [j60]Raghu Meka, Oanh Nguyen, Van Vu:
Anti-concentration for Polynomials of Independent Random Variables. Theory Comput. 12(1): 1-17 (2016) - 2015
- [j59]Van H. Vu, Ke Wang
Random weighted projections, random quadratic forms and random eigenvectors. Random Struct. Algorithms 47(4): 792-821 (2015) - [c14]Peter Chin, Anup Rao, Van Vu:
Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery. COLT 2015: 391-423 - [c13]Kyle Luh, Van Vu:
Random Matrices: l1 Concentration and Dictionary Learning with Few Samples. FOCS 2015: 1409-1425 - [i3]Peter Chin, Anup Rao, Van Vu:
Stochastic Block Model and Community Detection in the Sparse Graphs: A spectral algorithm with optimal rate of recovery. CoRR abs/1501.05021 (2015) - [i2]Oanh Nguyen, Van Vu:
Anti-concentration for random polynomials. CoRR abs/1507.00829 (2015) - 2014
- [i1]Van Vu:
A simple SVD algorithm for finding hidden partitions. CoRR abs/1404.3918 (2014) - 2013
- [j58]Linh V. Tran, Van H. Vu, Ke Wang
Sparse random graphs: Eigenvalues and eigenvectors. Random Struct. Algorithms 42(1): 110-134 (2013) - 2012
- [j57]Terence Tao, Van H. Vu:
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi. Comb. 32(3): 363-372 (2012) - [j56]Hoi H. Nguyen
A characterization of incomplete sequences in vector spaces. J. Comb. Theory A 119(1): 33-41 (2012) - 2011
- [j55]Van H. Vu, Melanie Matchett Wood, Philip Matchett Wood:
Mapping incidences. J. Lond. Math. Soc. 84(2): 433-445 (2011) - [j54]Van Vu:
Singular vectors under random perturbation. Random Struct. Algorithms 39(4): 526-538 (2011) - 2010
- [j53]Van H. Vu:
Structure of large incomplete sets in abelian groups. Comb. 30(2): 225-237 (2010) - [j52]Kevin P. Costello
On the Rank of Random Sparse Matrices. Comb. Probab. Comput. 19(3): 321-342 (2010) - [j51]Terence Tao, Van H. Vu:
Smooth analysis of the condition number and the least singular value. Math. Comput. 79(272): 2333-2352 (2010) - [j50]Terence Tao, Van H. Vu:
A sharp inverse Littlewood-Offord theorem. Random Struct. Algorithms 37(4): 525-539 (2010)
2000 – 2009
- 2009
- [j49]Van H. Vu, Philip Matchett Wood:
The Inverse Erdös-Heilbronn Problem. Electron. J. Comb. 16(1) (2009) - [j48]Hoi H. Nguyen
Classification theorems for sumsets modulo a prime. J. Comb. Theory A 116(4): 936-959 (2009) - [j47]Kevin P. Costello
Concentration of Random Determinants and Permanent Estimators. SIAM J. Discret. Math. 23(3): 1356-1371 (2009) - [c12]Terence Tao, Van H. Vu:
Smooth Analysis of the Condition Number and the Least Singular Value. APPROX-RANDOM 2009: 714-737 - 2008
- [j46]József Solymosi, Van H. Vu:
Near optimal bounds for the Erdös distinct distances problem in high dimensions. Comb. 28(1): 113-125 (2008) - [j45]Ross M. Richardson, Van H. Vu, Lei Wu:
An Inscribing Model for Random Polytopes. Discret. Comput. Geom. 39(1-3): 469-499 (2008) - [j44]Anders Johansson, Jeff Kahn, Van H. Vu:
Factors in random graphs. Random Struct. Algorithms 33(1): 1-28 (2008) - [j43]Kevin P. Costello
The rank of random graphs. Random Struct. Algorithms 33(3): 269-285 (2008) - [j42]Benny Sudakov, Van H. Vu:
Local resilience of graphs. Random Struct. Algorithms 33(4): 409-433 (2008) - 2007
- [b1]Terence Tao, Van H. Vu:
Additive combinatorics. Cambridge studies in advanced mathematics 105, Cambridge University Press 2007, ISBN 978-0-521-85386-6, pp. I-XVIII, 1-512 - [j41]Van H. Vu:
Spectral norm of random matrices. Comb. 27(6): 721-736 (2007) - [j40]Jeong Han Kim, Benny Sudakov, Van H. Vu:
Small subgraphs of random regular graphs. Discret. Math. 307(15): 1961-1967 (2007) - [j39]Ross M. Richardson, Van H. Vu, Lei Wu:
Random inscribing polytopes. Eur. J. Comb. 28(8): 2057-2071 (2007) - [c11]Van H. Vu, Terence Tao:
The condition number of a randomly perturbed matrix. STOC 2007: 248-255 - 2006
- [j38]Jeong Han Kim, Van H. Vu:
Generating Random Regular Graphs. Comb. 26(6): 683-708 (2006) - [j37]Terence Tao, Van H. Vu:
On random plus/minus 1 matrices: Singularity and determinant. Random Struct. Algorithms 28(1): 1-23 (2006) - 2005
- [j36]Van H. Vu:
De Bruijn covering codes with arbitrary alphabets. Adv. Appl. Math. 34(1): 65-70 (2005) - [j35]Jeong Han Kim, Jirí Matousek, Van H. Vu:
Discrepancy After Adding A Single Set. Comb. 25(4): 499-501 (2005) - [j34]Tibor Szabó, Van H. Vu:
Exact k-Wise Intersection Theorems. Graphs Comb. 21(2): 247-261 (2005) - [j33]Benny Sudakov, Tibor Szabó, Van H. Vu:
A generalization of Turán's theorem. J. Graph Theory 49(3): 187-195 (2005) - [j32]Van H. Vu, Lei Wu:
Improving the Gilbert-Varshamov Bound for q-Ary Codes. IEEE Trans. Inf. Theory 51(9): 3200-3208 (2005) - [c10]Van H. Vu:
Spectral norm of random matrices. STOC 2005: 423-430 - [c9]Terence Tao, Van H. Vu:
On random pm 1 matrices: singularity and determinant. STOC 2005: 431-440 - 2004
- [j31]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
- [j30]Jeong Han Kim, Van H. Vu:
Small Complete Arcs in Projective Planes. Comb. 23(2): 311-363 (2003) - [j29]Fan R. K. Chung, Linyuan Lu, Van H. Vu:
The Spectra of Random Graphs with Given Expected Degrees. Internet Math. 1(3): 257-275 (2003) - [j28]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) - [j27]Tibor Szabó, Van H. Vu:
Turán's theorem in sparse random graphs. Random Struct. Algorithms 23(3): 225-234 (2003) - [j26]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) - [j25]Michael Krivelevich, Benny Sudakov, Van H. Vu:
Covering codes with improved density. IEEE Trans. Inf. Theory 49(7): 1812-1815 (2003) - [c8]József Solymosi, Van H. Vu:
Distinct distances in homogeneous sets. SCG 2003: 104-105 - [c7]Hung Q. Ngo, Van H. Vu:
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs. SODA 2003: 834-840 - [c6]Jeong Han Kim, Van H. Vu:
Generating random regular graphs. STOC 2003: 213-222 - 2002
- [j24]Van H. Vu:
A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs. Comb. Probab. Comput. 11(1): 103-111 (2002) - [j23]Michael Krivelevich, Benny Sudakov, Van H. Vu:
A Sharp Threshold For Network Reliability. Comb. Probab. Comput. 11(5): 465-474 (2002) - [j22]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) - [j21]Van H. Vu:
Concentration of non-Lipschitz functions and applications. Random Struct. Algorithms 20(3): 262-316 (2002) - [j20]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
- [j19]Van H. Vu:
A Large Deviation Result On The Number Of Small Subgraphs Of A Random Graph. Comb. Probab. Comput. 10(1): 79-94 (2001) - [j18]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): 251-272 (2001) - [j17]Van H. Vu:
Some recent results on list coloring. Electron. Notes Discret. Math. 7: 170-173 (2001) - [j16]Michael Krivelevich, Van H. Vu:
Choosability in Random Hypergraphs. J. Comb. Theory B 83(2): 241-257 (2001) - [j15]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
- [j14]Jeong Han Kim, Van H. Vu:
Concentration of Multivariate Polynomials and Its Applications. Comb. 20(3): 417-434 (2000) - [j13]Van H. Vu:
On The Choice Number Of Random Hypergraphs. Comb. Probab. Comput. 9(1): 79-95 (2000) - [j12]Van H. Vu:
On the concentration of multivariate polynomials with small expectation. Random Struct. Algorithms 16(4): 344-363 (2000) - [j11]Van H. Vu:
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help. Random Struct. Algorithms 17(1): 29-63 (2000) - [c5]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 - [c4]Michael Krivelevich, Van H. Vu:
Approximating the Independence Number and the Chromatic Number in Expected Polynominal Time. ICALP 2000: 13-24
1990 – 1999
- 1999
- [j10]Van H. Vu:
Extremal Set Systems with Weakly Restricted Intersections. Comb. 19(4): 567-587 (1999) - [j9]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): 201-226 (1999) - [c3]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 - 1998
- [j8]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) - [j7]Van H. Vu:
On the Infeasibility of Training Neural Networks with Small Mean-Sqared Error. IEEE Trans. Inf. Theory 44(7): 2892-2900 (1998) - 1997
- [j6]Van H. Vu:
On a Theorem of Ganter. Comb. Probab. Comput. 6(2): 247-254 (1997) - [j5]Van H. Vu:
Extremal Systems with Upper-Bounded Odd Intersections. Graphs Comb. 13(2): 197-208 (1997) - [j4]Dmitry N. Kozlov, Van H. Vu:
Coins and Cones. J. Comb. Theory A 78(1): 1-14 (1997) - [j3]Noga Alon, Van H. Vu:
Anti-Hadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs. J. Comb. Theory A 79(1): 133-160 (1997) - [c2]Van H. Vu:
On the Infeasibility of Training Neural Networks with Small Squared Errors. NIPS 1997: 371-377 - 1996
- [j2]Van H. Vu:
A Strongly Regular N-Full Graph of Small Order. Comb. 16(2): 295-299 (1996) - [j1]Van H. Vu:
On the embedding of graphs into graphs with few eigenvalues. J. Graph Theory 22(2): 137-149 (1996) - [c1]Noga Alon, Dmitry N. Kozlov, Van H. Vu:
The Geometry of Coin-Weighing Problems. FOCS 1996: 524-532
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-12 21:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: