| Publication | Date of Publication | Type |
|---|
| The asymptotic normality of \((s,s+1)\)-cores with distinct parts | 2020-03-30 | Paper |
| Testing goodness of fit of random graph models | 2019-03-26 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs | 2017-06-14 | Paper |
| The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result | 2017-06-14 | Paper |
| The approximate Loebl-Koml\'os-S\'os Conjecture | 2012-11-13 | Paper |
| When the degree sequence is a sufficient statistic | 2012-02-13 | Paper |
| Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint) | 2006-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736881 | 2004-08-11 | Paper |
| Spanning Trees in Dense Graphs | 2002-09-17 | Paper |
| Singularity Probabilities for Random Matrices over Finite Fields | 2002-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228443 | 2002-01-20 | Paper |
| Proof of the Alon-Yuster conjecture | 2001-10-23 | Paper |
| Tiling Turán theorems | 2000-11-13 | Paper |
| The smallest Ramsey numbers | 2000-02-27 | Paper |
| The Blow-up Lemma | 1999-12-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269213 | 1999-10-31 | Paper |
| An algorithmic version of the blow-up lemma | 1999-08-02 | Paper |
| Proof of the Seymour conjecture for large graphs | 1999-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242960 | 1999-05-11 | Paper |
| Covering odd cycles | 1998-11-24 | Paper |
| Matching Nuts and Bolts in O(n log n) Time | 1998-09-21 | Paper |
| Blow-up lemma | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347905 | 1997-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875190 | 1996-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4878666 | 1996-11-21 | Paper |
| On the square of a Hamiltonian cycle in dense graphs | 1996-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871074 | 1996-08-18 | Paper |
| Proof of a Packing Conjecture of Bollobás | 1996-07-17 | Paper |
| Topological cliques in graphs II | 1996-07-01 | Paper |
| On the Probability That a Random ± 1-Matrix Is Singular | 1996-01-24 | Paper |
| Almost all trees have tribe number 2 or 3 | 1995-08-27 | Paper |
| Topological Cliques in Graphs | 1995-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4291330 | 1994-05-09 | Paper |
| Effect of connectivity in an associative memory model | 1994-01-06 | Paper |
| Almost tight bounds for \(\epsilon\)-nets | 1992-06-28 | Paper |
| A strange pigeon-hole principle | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3972306 | 1992-06-25 | Paper |
| On the properties of a tree-structured server process | 1991-01-01 | Paper |
| Construction of a Thin Set with small Fourier Coefficients | 1990-01-01 | Paper |
| Optimal parallel selection has complexity O(log log N) | 1989-01-01 | Paper |
| Sorting in Average Time $o(\log \,n)$ | 1989-01-01 | Paper |
| The spread of a partial order | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217347 | 1987-01-01 | Paper |
| Linear verification for spanning trees | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3698835 | 1985-01-01 | Paper |
| Probabilistic partitioning algorithms for the rectilinear steiner problem | 1985-01-01 | Paper |
| An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels | 1985-01-01 | Paper |
| On optimal matchings | 1984-01-01 | Paper |
| On the Size of Separating Systems and Families of Perfect Hash Functions | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3218717 | 1984-01-01 | Paper |
| On the distribution of cycle lengths in graphs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688307 | 1984-01-01 | Paper |
| Hash functions for priority queues | 1984-01-01 | Paper |
| Storing a Sparse Table with 0 (1) Worst Case Access Time | 1984-01-01 | Paper |
| Limit distribution for the existence of Hamiltonian cycles in a random graph | 1983-01-01 | Paper |
| Sorting in \(c \log n\) parallel steps | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318963 | 1983-01-01 | Paper |
| Extremal uncrowded hypergraphs | 1982-01-01 | Paper |
| Largest random component of a k-cube | 1982-01-01 | Paper |
| A Lower Bound for Heilbronn'S Problem | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956992 | 1982-01-01 | Paper |
| A dense infinite Sidon sequence | 1981-01-01 | Paper |
| The longest path in a random graph | 1981-01-01 | Paper |
| On Turan's theorem for sparse graphs | 1981-01-01 | Paper |
| The eigenvalues of random symmetric matrices | 1981-01-01 | Paper |
| On Heilbronn's Triangle Problem | 1981-01-01 | Paper |
| A note on Ramsey numbers | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3669459 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3950589 | 1979-01-01 | Paper |
| There is no fast single hashing algorithm | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4194278 | 1978-01-01 | Paper |
| An approximation of partial sums of independent RV's, and the sample DF. II | 1976-01-01 | Paper |
| On sequences of 'pure heads' | 1975-01-01 | Paper |
| Linear problems in combinatorial number theory | 1975-01-01 | Paper |
| An approximation of partial sums of independent RV'-s, and the sample DF. I | 1975-01-01 | Paper |
| On Sum-Free Subsequences | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4110385 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4155536 | 1975-01-01 | Paper |
| Every sequence converging to 0 weakly in L\(_2\) contains an unconditional convergence sequence | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4776667 | 1974-01-01 | Paper |
| On the capacity of graphs | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401944 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4775928 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5179903 | 1973-01-01 | Paper |
| A Central Limit Theorem for Multiplicative Systems | 1973-01-01 | Paper |
| On the rate of convergence of the Robbins-Monro method | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5669759 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5618375 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5619113 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5567460 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5571473 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5633357 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5532610 | 1967-01-01 | Paper |
| A generalization of a problem of Steinhaus | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5524098 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5342495 | 1964-01-01 | Paper |
