| Publication | Date of Publication | Type |
|---|
| Threshold functions for incidence properties in finite vector spaces | 2023-03-10 | Paper |
| Cosmological particle production and pairwise hotspots on the CMB | 2022-10-10 | Paper |
| Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions | 2022-08-04 | Paper |
| Threshold functions for incidence properties in finite vector spaces | 2022-03-23 | Paper |
| Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions | 2021-12-21 | Paper |
| Some advances on Sidorenko's conjecture | 2019-01-11 | Paper |
| On the total variation distance between the binomial random graph and the random intersection graph | 2018-09-05 | Paper |
| Sidorenko's conjecture for higher tree decompositions | 2018-05-06 | Paper |
| Two approaches to Sidorenko’s conjecture | 2016-03-07 | Paper |
| On coupon colorings of graphs | 2015-07-24 | Paper |
| Universality of Random Graphs for Graphs of Maximum Degree Two | 2014-12-22 | Paper |
| Diameters in Supercritical Random Graphs Via First Passage Percolation | 2013-03-13 | Paper |
| Finding Weighted Graphs by Combinatorial Search | 2012-01-18 | Paper |
| Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions | 2012-01-11 | Paper |
| Anatomy of a young giant component in the random graph | 2011-10-25 | Paper |
| A sequential algorithm for generating random graphs | 2010-11-08 | Paper |
| Optimal query complexity bounds for finding graphs | 2010-09-02 | Paper |
| Oblivious routing in directed graphs with random demands | 2010-08-16 | Paper |
| Generating random regular graphs | 2010-08-16 | Paper |
| A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm | 2010-05-06 | Paper |
| Phase transition in a random NK landscape model | 2009-07-17 | Paper |
| A Sequential Algorithm for Generating Random Graphs | 2009-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5302100 | 2009-01-05 | Paper |
| Entropy and sorting. | 2008-12-21 | Paper |
| A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm | 2008-05-27 | Paper |
| Small subgraphs of random regular graphs | 2007-05-23 | Paper |
| Generating random regular graphs | 2007-05-08 | Paper |
| Near Optimal Bounds for Collision in Pollard Rho for Discrete Log | 2006-11-19 | Paper |
| Poisson Cloning Model for Random Graphs | 2006-09-26 | Paper |
| Regular subgraphs of random graphs | 2006-09-06 | Paper |
| Discrepancy after adding a single set | 2006-06-27 | Paper |
| A phase transition for avoiding a giant component | 2006-05-16 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| How complex are random graphs in first order logic? | 2005-04-21 | Paper |
| Sandwiching random graphs: universality between random graph models | 2004-11-18 | Paper |
| Divide and conquer martingales and the number of triangles in a random graph | 2004-03-29 | Paper |
| Hamiltonian decompositions of random bipartite regular graphs. | 2004-03-14 | Paper |
| Tail bound for the minimal spanning tree of a complete graph. | 2004-02-14 | Paper |
| Small complete arcs in projective planes | 2003-12-14 | Paper |
| ECONOMICAL COVERS WITH GEOMETRIC APPLICATIONS | 2003-11-17 | Paper |
| Perfect matchings in random uniform hypergraphs | 2003-11-10 | Paper |
| On the asymmetry of random regular graphs and random graphs | 2003-03-19 | Paper |
| Permutation Pseudographs and Contiguity | 2003-03-09 | Paper |
| On tail distribution of interpost distance | 2002-12-10 | Paper |
| Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs | 2002-12-10 | Paper |
| Two‐coloring random hypergraphs | 2002-08-08 | Paper |
| The scaling window of the 2-SAT transition | 2002-02-19 | Paper |
| Analysis of a phase transition phenomenon in packet networks | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2741470 | 2001-10-24 | Paper |
| Large deviations for Small buffers: An insensitivity result | 2001-07-19 | Paper |
| Concentration of multivariate polynomials and its applications | 2001-06-12 | Paper |
| Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number | 2001-02-22 | Paper |
| The cover time, the blanket time, and the Matthews bound | 2000-05-11 | Paper |
| Covering cubes by random half cubes, with applications to binary neural networks | 1998-11-10 | Paper |
| Interference-Minimizing Colorings of Regular Graphs | 1998-05-11 | Paper |
| Nearly perfect matchings in regular simple hypergraphs | 1997-09-17 | Paper |
| On the degree, size, and chromatic index of a uniform hypergraph | 1997-08-18 | Paper |
| Score certificates for tournaments | 1997-06-29 | Paper |
| On increasing subsequences of random permutations | 1997-04-07 | Paper |
| On Brooks' Theorem for Sparse Graphs | 1996-03-11 | Paper |
| The Ramsey number R(3, t) has order of magnitude t2/log t | 1996-02-08 | Paper |
| On 3-colorings of \(E(K_ n)\) | 1994-01-18 | Paper |
