Van H. Vu
According to our database^{1},
Van H. Vu
authored at least 80 papers
between 1996 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on viaf.org

on id.loc.gov

on dnb.info
On csauthors.net:
Bibliography
2020
Proceedings of the Approximation, 2020
2019
Random Struct. Algorithms, 2019
2018
Random Struct. Algorithms, 2018
CoRR, 2018
2017
Comb., 2017
2016
Theory Comput., 2016
IEEE Trans. Inf. Theory, 2016
J. Comb. Theory, Ser. A, 2016
2015
Random Struct. Algorithms, 2015
CoRR, 2015
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
CoRR, 2014
2013
Random Struct. Algorithms, 2013
2012
J. Comb. Theory, Ser. A, 2012
The LittlewoodOfford problem in high dimensions and a conjecture of Frankl and Füredi.
Comb., 2012
2011
Random Struct. Algorithms, 2011
J. Lond. Math. Soc., 2011
2010
Random Struct. Algorithms, 2010
Math. Comput., 2010
Comb. Probab. Comput., 2010
Comb., 2010
2009
SIAM J. Discret. Math., 2009
J. Comb. Theory, Ser. A, 2009
Electron. J. Comb., 2009
2008
Random Struct. Algorithms, 2008
Random Struct. Algorithms, 2008
Random Struct. Algorithms, 2008
Discret. Comput. Geom., 2008
Comb., 2008
2007
Eur. J. Comb., 2007
Discret. Math., 2007
Comb., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Additive combinatorics.
Cambridge studies in advanced mathematics 105, Cambridge University Press, ISBN: 9780521853866, 2007
2006
Random Struct. Algorithms, 2006
Comb., 2006
2005
IEEE Trans. Inf. Theory, 2005
J. Graph Theory, 2005
Graphs Comb., 2005
Comb., 2005
Adv. Appl. Math., 2005
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005
2004
Random Struct. Algorithms, 2004
2003
IEEE Trans. Inf. Theory, 2003
Multirate Rearrangeable Clos Networks and a Generalized EdgeColoring Problem on Bipartite Graphs.
SIAM J. Comput., 2003
Random Struct. Algorithms, 2003
Random Struct. Algorithms, 2003
Internet Math., 2003
Comb., 2003
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003
2002
Random Struct. Algorithms, 2002
Random Struct. Algorithms, 2002
Approximating the Independence Number and the Chromatic Number in Expected Polynomial Time.
J. Comb. Optim., 2002
Comb. Probab. Comput., 2002
Comb. Probab. Comput., 2002
2001
Random Struct. Algorithms, 2001
J. Comb. Theory, Ser. B, 2001
Electron. Notes Discret. Math., 2001
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
Discret. Appl. Math., 2001
Comb. Probab. Comput., 2001
2000
Random Struct. Algorithms, 2000
Random Struct. Algorithms, 2000
Comb. Probab. Comput., 2000
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
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
Comb., 1999
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
1998
IEEE Trans. Inf. Theory, 1998
Ann. Math. Artif. Intell., 1998
1997
J. Comb. Theory, Ser. A, 1997
AntiHadamard Matrices, Coin Weighing, Threshold Gates, and Indecomposable Hypergraphs.
J. Comb. Theory, Ser. A, 1997
Graphs Comb., 1997
Comb. Probab. Comput., 1997
Proceedings of the Advances in Neural Information Processing Systems 10, 1997
1996
J. Graph Theory, 1996
Comb., 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996