The following pages link to Van Vu (Q178484):
Displaying 50 items.
- (Q3549620) (← links)
- (Q3576701) (← links)
- (Q3576705) (← links)
- On random pm 1 matrices (Q3581438) (← links)
- Concentration of Random Determinants and Permanent Estimators (Q3583307) (← links)
- A Structural Approach to Subset-Sum Problems (Q3601935) (← links)
- The rank of random graphs (Q3608296) (← links)
- Local resilience of graphs (Q3608302) (← links)
- (Q3619955) (← links)
- Smooth Analysis of the Condition Number and the Least Singular Value (Q3638915) (← links)
- Sum-product estimates for well-conditioned matrices (Q3646369) (← links)
- (Q3653943) (← links)
- On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (Q4256092) (← links)
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs (Q4330738) (← links)
- On a Theorem of Ganter (Q4348793) (← links)
- Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs (Q4429671) (← links)
- Turán's theorem in sparse random graphs (Q4431433) (← links)
- (Q4431826) (← links)
- ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS (Q4435712) (← links)
- Divide and conquer martingales and the number of triangles in a random graph (Q4459588) (← links)
- (Q4471380) (← links)
- New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help (Q4500484) (← links)
- On the concentration of multivariate polynomials with small expectation (Q4500690) (← links)
- Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
- (Q4589016) (← links)
- A Simple SVD Algorithm for Finding Hidden Partitions (Q4601058) (← links)
- Anti-concentration Inequalities for Polynomials (Q4604399) (← links)
- Normal Vector of a Random Hyperplane (Q4619347) (← links)
- Law of the iterated logarithm for random graphs (Q4625027) (← links)
- Packing perfect matchings in random hypergraphs (Q4642740) (← links)
- (Q4657595) (← links)
- The Spectra of Random Graphs with Given Expected Degrees (Q4672751) (← links)
- Long arithmetic progressions in sum-sets and the number x-sum-free sets (Q4673045) (← links)
- On the infeasibility of training neural networks with small mean-squared error (Q4701218) (← links)
- A Sharp Threshold for Network Reliability (Q4796015) (← links)
- On the asymmetry of random regular graphs and random graphs (Q4798165) (← links)
- On the probability of independent sets in random graphs (Q4798177) (← links)
- (Q4804268) (← links)
- On the embedding of graphs into graphs with few eigenvalues (Q4888106) (← links)
- Sparse random graphs: Eigenvalues and eigenvectors (Q4903280) (← links)
- On the Choice Number of Random Hypergraphs (Q4948047) (← links)
- Roots of random functions: A framework for local universality (Q5024864) (← links)
- Central Limit Theorems for the Real Zeros of Weyl Polynomials (Q5147255) (← links)
- Random matrices: The Universality phenomenon for Wigner ensembles (Q5178623) (← links)
- Local Universality of Zeroes of Random Polynomials (Q5264501) (← links)
- From the Littlewood-Offord problem to the Circular Law: Universality of the spectral distribution of random matrices (Q5322172) (← links)
- Singular vectors under random perturbation (Q5388973) (← links)
- (Q5393666) (← links)
- Small Ball Probability, Inverse Theorems, and Applications (Q5416087) (← links)
- Subset sums modulo a prime (Q5445530) (← links)
