· (with M. Wood and P. Wood) Mapping Incidences. pdf file.
·
(with T. Tao) Random matrices: Universality of ESD and the
Circular Law (with an appendix by M. Krishnapur). pdf file.
·
(with T. Tao) Inverse Littlewood-Offord theorems and the
condition number of random matrices (Annals of Mathematics). pdf file.
· (with T. Tao) On the permanent of random Bernoulli matrices (Advances in Mathematics). pdf file.
· (with T. Tao ) John type theorems for generalized arithmetic prgressions and iterated sumsets p. (Advances in Mathematics) pdf file.
· Structure of large incomplete sets in abelian groups, Combinatorica. pdf file.
· (with K. Costello) The Rank of random graphs, (Random Structures and Algorithms). pdf file.
· (with Sudakov) Resilience of graphs. (Random Structures and Algorithms) pdf file.
· (with A. Johansson and J. Kahn) Factors in random graphs, Random structures and Algorithms, 2008. pdf file.
· Random discrete matrices , Horizons in Combinatorics, Proceeding of the Bolyai Society, 2008. pdf file.
· A structural approach
to subset-sum problems , Bulding Bridges
(Lovasz is 60), Proceeding of the Bolyai Society, 2008. pdf file.
· (with R. Richardson and L. Wu) Random inscribing polytopes , Discrete and Computational Geometry 39 (2008) 469-499. pdf file.
·
(with H. Nguyen and
· (with J. Solymosi) Near optimal bound for the distinct distances in high dimensions, Combinatorica 28 (2008), 113-125. pdf file.
· Sum-product estimates via directed expanders, Mathematical Research Letters 15 (2008), 375-388. pdf file.
·(with T. Tao) Random matrices: The Circular Law, Communication in Contemporary Mathematics, 10 (2008) 261-307.pdf file.
· (with I. Barany) Central limit theorems for Gaussian polytopes, Annals of Probability, 35, 2007, 1593-1621. pdf file.
· (with T. Tao) On the singularity probability of random Bernoulli matrices, Journal of the A. M. S. 20 (3), 2007, 603-628. pdf file.
· Spectral Norm of Random Matrices, Combinatorica 27 (6), 2007, 721-736. pdf file.
· (with Kim and Sudakov) Small subgraphs of random regular graphs, Discrete Mathematics 307, 2007, 1961-1967. pdf file.
· Some new results on subset sums, Journal of Number Theory 124 (1), 2007, 229-233. (part of this paper was posted on the arxiv under the title "Olson theorem for cyclic groups")
· Central limit theorems for random polytopes in a smooth convex body, Advances in Mathematics 207 (2006) 221-243 pdf file.
· (with K. Costello and T. Tao) Random symmetric matrices are almost surely singular, Duke Math. Journal 135, number 2 (2006), 395-413, pdf file.
· (with T. Tao) On random (-1,1) matrices: Singularity and Determinant, Random Structures and Algorithms 28 (2006), no 1, 1-23.; extended abstract appears in STOC 2005. pdf file.
· (with Szemeredi) Long Arithmetic Progressions in Sumsets: Thresholds and Bounds, Journal of the A.M.S, 19 (2006), no 1, 119-169. pdf file.
·
(with
· (with Wu) Improving the Gilbert-Varshamov bounds forSumsets: q-ary codes, IEEE Transcation in Information Theory 51 (2005), no 9, 3200-3208. pdf file.
·
(with B. Sudakov and
· (with J.H. Kim and J. Matousek) Discrepancy after adding a single set ,: Combinatorica. 25 (2005), no 4, 499-501. ps file.
· (with T. Szabo) k-wise intersecting theorems ,Graph and Combnatorics, 21 (2005), 147-161 pdf file.
· (with B. Sudakov and T. Szabo) A generalization of Turan theorem,Graph Theory 49 (2005), 187-195 pdf file.
· Covering codes of arbitrary alphabets,Advances in Applied Math. 34 (2005), 65-70 pdf file.
·
(with
· Sharp concentration of random polytopes GAFA (2005), no 6, 1284-1328 pdf file.
· (with J. Solymosi) Distinct distances in high dimensional homogeneous sets Towards a theory of geometric graphs, Contemp. Math. 342, AMS 259-263. pdf file.
· (with J.H. Kim) Sandwiching random graphs Advances in Mathematics 188 (2004) 444-469. pdf file.
· (with J.H. Kim) Devide and Conquer Martingales and the number of triangles in a random graph, Random Structures and Algorithms 24 (2004), no. 2, 166--174. pdf file.
· (with H. Q Ngo) Clos networks and a generalized edge-coloring problem on bipartite graphs, SIAM J. Comput. 32 (2003), no. 4, 1040--1049 pdf file.
· (with J.H. Kim) Small complete arcs in projective planes, Combinatorica 23 (2003), no. 2,311--363 pdf file
· (with T. Szabo) Turan's theorem for sparse random graphs, Random Structures and Algorithms, 23 (2003), no. 3, 225--234. pdf file
· (with F. Chung and L. Lu) Eigenvalues of Power Law Graphs, Annals of Combinatoris 7 (2003), 21-33 pdf file.
· (with F. Chung and L. Lu) The spectra of random graphs with expected degrees, Proceedings of National Academy of Sciences, 100, no. 11, (2003), pdf file.
· (with J.H. Kim) Generating random regular graphs (2003), STOC 2003 213-222 (complete version to appear in Combinatorica) pdf file.
· (with M. Krivelevich and B. Sudakov) Covering codes with improved density, IEEE Transaction on Information Theory, 49 (2003) 1812-1815. pdf file.
·
(with M. Krivelevich, B. Sudakov and
·
(with
·
On sum of dependent random variables and applications in additive
number theory, Number theory for the millennium, III (
· On a problem of Gowers, Annals of Combinatorics (2002) 229-233. pdf file.
· An upper bound on the list chromatic number of locally sparse graphs, Combinatorics, Probability and Computing 11 (2002), 103-111( pdf file. A full version with detailed proof pdf file.
· (with M. Krivelevich and B. Sudakov) Sharp threshold of reliability, Combinatorics, Probability and Computing 11 (2002), 465-474. pdf file.
· (with J. H. Kim and B. Sudakov) On the asymmetry of random graphs and random regular graphs, Random Structures and Algorithms 21(2002), 216-224. pdf file.
· Concentration of non-Lipschitz functions and applications, Random Structures and Algorithms, 20 (3) (2002), 262- 316 pdf file.
·
(with
· High order complementary bases of primes, Integer 2 (2002) (electronic 5pp) ps file.
· ( with M. Krivelevich) Approximating theindependent number and the chromatic number in expected polynomial time, Journal of Comb. Optimization (2002) 143-155; extended abstract appeared inproceeding of ICALP 2000, p13-25pdf file
· A large deviation result on the number of small subgraphs of a random graph, Combinatorics, Probability and Computing, 10 (2001), no. 1, 79--94. pdf file.
·
(with M. Kirivelevich, B. Sudakov and
· (with M. Krivelevich) The weak choice number of random hypergraphs, Journal of Combinatorial Theory, Series B, 83 (2001), no. 2, 241--257. pdf file
· (with I. Pak) On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes, Discrete Applied Mathematics, 110 (2001), 251-272, pdf file
· New bounds onnearly perfect matchings in hypergraphs:higher codegrees do help, Random Structures andAlgorithms, 17 (1)(2000), 29-63. pdf file
· (with J.H. Kim) Concentration of multi-variate polynomials and its applications, Combinatorica, 20 (3) (2000), 417-434 ,pdf file.
· On theconcentration of multi- variate polynomials with smallexpectation, Random Structures and Algorithms, 16 (4) (2000), 344-363, pdf file
· On the choicenumber of random hypergraphs, Combinatorics,Probability and Computing 9, (2000), 79-95, pdf file
· (with J. Kahn, J.H. Kim and L. Lovasz)The cover time, the blanket time, and the Matthews bound, Proc 41th IEEE (2000), 467-476,pdf file
· On a refinement of Waring's problem, Duke Math. Journal,105, (1 )(2000), 107-134, pdf file
· On some degree conditions whichguarantee the upper bound of chromatic (choice) number of random graphs,Journal of Graph Theory, 31, (1999), no. 3, 201-226. pdf file.
· ( with C. Borg, J. Chayes, A.Frieze, J.H. Kim, P. Tetali and E. Vigoda, Torpid mixing of some MCMCalgorithms in statistical physics, Proc 40th IEEE FOCS (1999), 218-229.
· Set systems with weakly restricted intersections, Combinatorica 19, (1999), no. 4, 567-587, pdf file
· On theinfeasibility of training neural networks with small mean squared error, IEEETransaction on Information Theory 44, (1998), no. 7, 2892-2900, pdf file.
· On a theoremof Ganter, Combinatorics,Probability and Computing 6, (1997), no. 2, 247-254, pdf file.
· (with D.Kozlov) Coins and Cones,J. of Combinatorial Theory, series A, 78 (1997), no. 1, 1-14 , pdf file.
· (with Noga Alon)Anti- Hadamard matrices, coin weighing, thresholdgates and indecomposable hypergraphs, J. ofCombinatorial Theory, series A, 79, (1997), no. 1, 133-160, pdf file
· Extremal set systems with upper bounded odd intersections, Combinatorics 13, (1997), no. 2, 197-208, pdf file
· (with Noga Alon and Dmitry Kozlov)The geometry of coin-weighing problems, Proc 37th IEEE FOCS(1996), 524-532. pdf file
· Smallstrongly regular r-full graphs, Combinatorica 16,(1996), no. 2, 295-299, pdf file
· On the embedding of graphs into graphs with few eigenvalues,J. of Graph Theory, 22 (1996), no. 2, 137-149 ps file