Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Vu, Van"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A characterization of incomplete sequences in vector spaces
Hoi H. Nguyen
,
Van H. Vu
Journal of Combinatorial Theory Series A
119
(1), 2012, pp. 33-41
The Littlewood-Offord problem in high dimensions and a conjecture of Frankl and Füredi
Terence Tao
,
Van Vu
Combinatorica
32
(3), 2012, pp. 363-372
Concentration of random determinants and permanent estimators
Kevin P. Costello
,
Van Vu
SIAM Journal on Discrete Mathematics
23
(3), 2009, pp. 1356-1371
Classification theorems for sumsets modulo a prime
Hoi H. Nguyen
,
Van H. Vu
Journal of Combinatorial Theory Series A
116
(4), 2009, pp. 936-959
Near optimal bounds for the Erdŏs distinct distances problem in high dimensions
József Solymosi
,
Van H. Vu
Combinatorica
28
(1), 2008, pp. 113-125
The condition number of a randomly perturbed matrix
Terence Tao
,
Van Vu
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 248-255
Spectral norm of random matrices
Van H. Vu
Combinatorica
27
(6), 2007, pp. 721-736
Discrepancy after adding a single set
Jeong Han Kim
,
Jiȓí Matous̑ek
,
Van H. Vu
Combinatorica
25
(4), 2005, pp. 499-501
A generalization of Turán's theorem
Benny Sudakov
,
Tibor Szabó
,
Van H. Vu
Journal of Graph Theory
49
(3), 2005, pp. 187-195
On random
^+_-
1 matrices: Singularity and determinant
Terence Tao
,
Van Vu
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC'2005 (Baltimore, Maryland, USA, May 22-24, 2005)
, 2005, pp. 431-440
Generating random regular graphs
Jeong Han Kim
,
Van H. Vu
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC'2003 (San Diego, California, USA, June 9-11, 2003)
, 2003, pp. 213-222
Multirate rearrangeable Clos networks and a generalized edge-coloring problem on bipartite graphs
Hung Q. Ngo
,
Van H. Vu
SIAM Journal on Computing
32
(4), 2003, pp. 1040-1049
Choosability in random hypergraphs
Michael Krivelevich
,
Van H. Vu
Journal of Combinatorial Theory Series B
83
(2), 2001, pp. 241-257
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
Igor Pak
,
Van H. Vu
Discrete Applied Mathematics
110
(2-3), 2001, pp. 251-272
Concentration of multivariate polynomials and its applications
Jeong Han Kim
,
Van H. Vu
Combinatorica
20
(3), 2000, pp. 417-434
Approximating the independence number and the chromatic number in expected polynomial time
Michael Krivelevich
,
Van H. Vu
Lecture Notes in Computer Science
1853
, 2000, pp. 13-24
Extremal set systems with weakly restricted intersections
Van H. Vu
Combinatorica
19
(4), 1999, pp. 567-587
On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
Van H. Vu
Journal of Graph Theory
31
(3), 1999, pp. 201-226
Coins and cones
Dmitry N. Kozlov
,
Van H. Vu
Journal of Combinatorial Theory Series A
78
(1), 1997, pp. 1-14
Extremal systems with upper-bounded odd intersections
Van H. Vu
Graphs and Combinatorics
13
, 1997, pp. 197-208
The geometry of coin-weighted problems
Noga Alon
,
Dmitry N. Kozlov
,
Van H. Vu
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 524-532
A strongly regular
N
-full graph of small order
Van H. Vu
Combinatorica
16
(2), 1996, pp. 295-299
On the embedding of graphs into graphs with few eigenvalues
Van H. Vu
Journal of Graph Theory
22
(2), 1996, pp. 137-149