Nonsingular plane cubic curves over finite fields
Journal of Combinatorial Theory Series A
Asymptotic behavior of the chromatic index for hypergraphs
Journal of Combinatorial Theory Series A
On the completeness of certain plane arcs—II
European Journal of Combinatorics
Journal of Combinatorial Theory Series A
Restricted colorings of graphs
Surveys in combinatorics, 1993
Polynomials in finite geometries and combinatorics
Surveys in combinatorics, 1993
The Ramsey number R(3, t) has order of magnitude t2/log t
Random Structures & Algorithms
Asymptotically good list-colorings
Journal of Combinatorial Theory Series A
Nearly-perfect hypergraph packing is in NC
Information Processing Letters
Finite geometries
A bound on the strong chromatic index of a graph
Journal of Combinatorial Theory Series B
On small complete arcs in a finite plane
Proceedings of the international conference on Combinatorics '94
Partial Steiner systems and matchings in hypergraphs
proceedings of the eighth international conference on Random structures and algorithms
Coloring graphs with sparse neighborhoods
Journal of Combinatorial Theory Series B
On the concentration of multivariate polynomials with small expectation
Random Structures & Algorithms
New bounds on nearly perfect matchings in hypergraphs: higher codegrees do help
Random Structures & Algorithms
Random regular graphs of high degree
Random Structures & Algorithms
A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
Combinatorics, Probability and Computing
A Large Deviation Result on the Number of Small Subgraphs of a Random Graph
Combinatorics, Probability and Computing
The Choice Number of Dense Random Graphs
Combinatorics, Probability and Computing
On the Choice Number of Random Hypergraphs
Combinatorics, Probability and Computing
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Generating random regular graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Random Structures & Algorithms
On the $b$-Independence Number of Sparse Random Graphs
Combinatorics, Probability and Computing
Divide and conquer martingales and the number of triangles in a random graph
Random Structures & Algorithms
Random Structures & Algorithms
A Sequential Algorithm for Generating Random Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Relationship privacy: output perturbation for queries with joins
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sub-gaussian tails for the number of triangles in g(n, p)
Combinatorics, Probability and Computing
Concentration inequalities for nonlinear matroid intersection
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Concentration and moment inequalities for polynomials of independent random variables
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The missing log in large deviations for triangle counts
Random Structures & Algorithms
A concentration result with application to subgraph count
Random Structures & Algorithms
| Hi-index | 0.00 |
Strong concentration results play a fundamental role in probabilistic combinatorics and theoretical computer science. In this paper, we present several new concentration results developed recently by the author and collaborators. To illustrate the power of these new results, we discuss applications in many different areas of mathematics, from combinatorial number theory to the theory of random graphs.