| Publication | Date of Publication | Type |
|---|
| The likely maximum size of twin subtrees in a large random tree | 2023-12-02 | Paper |
| Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves | 2023-10-12 | Paper |
| On Bollobás‐Riordan random pairing model of preferential attachment graph | 2023-10-12 | Paper |
| Counting subtrees of the branching process tree by the number of leaves | 2023-05-05 | Paper |
| Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree | 2023-03-30 | Paper |
| The Critical Beta-splitting Random Tree: Heights and Related Results | 2023-02-10 | Paper |
| Perfect partitions of a random set of integers | 2022-10-02 | Paper |
| Giant descendant trees, matchings, and independent sets in age-biased attachment graphs | 2022-07-08 | Paper |
| On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM | 2022-06-28 | Paper |
| Expected number of induced subtrees shared by two independent copies of a random tree | 2021-02-11 | Paper |
| One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences | 2021-02-01 | Paper |
| On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences | 2020-09-01 | Paper |
| On connectivity, conductance and bootstrap percolation for a random k‐out, age‐biased graph | 2020-06-19 | Paper |
| One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferences | 2020-05-13 | Paper |
| Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph | 2020-04-22 | Paper |
| On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women | 2020-03-12 | Paper |
| On the cycle structure of the product of random maximal cycles | 2019-09-17 | Paper |
| On a random search tree: asymptotic enumeration of vertices by distance from leaves | 2019-09-16 | Paper |
| On random stable partitions | 2019-07-11 | Paper |
| On a perfect matching in a random bipartite digraph with average out-degree below two | 2019-03-13 | Paper |
| On random quadratic forms: supports of potential local maxima | 2019-01-17 | Paper |
| Counting strongly connected (k1, k2)‐directed cores | 2018-09-28 | Paper |
| Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions | 2018-06-22 | Paper |
| On random exchange-stable matchings | 2018-06-20 | Paper |
| The Satisfiability Threshold fork-XORSAT | 2017-10-10 | Paper |
| Formation of a giant component in the intersection graph of a random chord diagram | 2017-05-26 | Paper |
| Birth of a giant \((k_{1},k_{2})\)-core in the random digraph | 2017-03-16 | Paper |
| Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs | 2016-09-07 | Paper |
| Central limit theorems, Lee-Yang zeros, and graph-counting polynomials | 2016-04-20 | Paper |
| Another proof of the Harer-Zagier formula | 2016-02-11 | Paper |
| Inside the critical window for cohomology of random k -complexes | 2016-02-03 | Paper |
| On a surface formed by randomly gluing together polygonal discs | 2015-12-23 | Paper |
| Distance between two random k-out digraphs, with and without preferential attachment | 2015-11-06 | Paper |
| Sharp threshold and scaling window for the integer partitioning problem | 2015-02-27 | Paper |
| On the connected components of a random permutation graph with a given number of edges | 2014-01-06 | Paper |
| On a sparse random graph with minimum degree three: likely Pósa sets are large | 2013-11-05 | Paper |
| Counting strongly-connected, moderately sparse directed graphs | 2013-08-27 | Paper |
| The Satisfiability Threshold for $k$-XORSAT, using an alternative proof | 2012-12-16 | Paper |
| The genus of a random chord diagram is asymptotically normal | 2012-11-09 | Paper |
| Tight Markov chains and random compositions | 2012-08-17 | Paper |
| How frequently is a system of 2-linear Boolean equations solvable? | 2010-08-12 | Paper |
| On the Likely Number of Solutions for the Stable Marriage Problem | 2010-04-23 | Paper |
| On a random graph evolving by degrees | 2010-01-05 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Expected coalescence time for a nonuniform allocation process | 2009-02-16 | Paper |
| On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem | 2008-12-05 | Paper |
| Edge percolation on a random regular graph of low degree | 2008-09-04 | Paper |
| How often are two permutations comparable? | 2008-09-01 | Paper |
| On the largest component of a random graph with a subpower-law degree sequence in a subcritical phase | 2008-08-20 | Paper |
| Corrigendum to ``Counting connected graphs inside-out [J. Comb. Theory, Ser. B 93, No. 2, 127--172 (2005; Zbl 1057.05044)] | 2008-07-24 | Paper |
| Limit shape of a random integer partition with a bounded max-to-min ratio of parts sizes | 2007-10-10 | Paper |
| Limit shapes for random square Young tableaux | 2007-08-27 | Paper |
| Large harmonic sets of noncrossing edges for n randomly labeled vertices in convex position | 2007-02-07 | Paper |
| Bootstrap percolation on the random regular graph | 2007-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485345 | 2006-08-29 | Paper |
| On the Likelihood of Comparability in Bruhat Order | 2006-05-17 | Paper |
| On Dimensions of a Random Solid Diagram | 2005-11-14 | Paper |
| Counting connected graphs inside-out | 2005-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3154668 | 2005-01-14 | Paper |
| Phase diagram for the constrained integer partitioning problem | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471289 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428924 | 2003-09-22 | Paper |
| Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph | 2003-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2712580 | 2003-07-27 | Paper |
| Phase transition and finite-size scaling for the integer partitioning problem | 2003-07-05 | Paper |
| Size of the largest cluster under zero-range invariant measures | 2003-05-06 | Paper |
| Asymptotic enumeration of sparse graphs with a minimum degree constraint | 2003-04-28 | Paper |
| On the distribution of the number of Young tableaux for a uniformly random diagram | 2003-03-26 | Paper |
| Analysis of Rabin's irreducibility test for polynomials over finite fields | 2003-02-25 | Paper |
| On tail distribution of interpost distance | 2002-12-10 | Paper |
| On the largest component of the random graph at a nearcritical stage | 2002-12-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385084 | 2002-11-11 | Paper |
| Confirming the Kleitman-Winston conjecture on the largest coefficient in a \(q\)-Catalan number | 2001-02-22 | Paper |
| On a random graph with immigrating vertices: Emergence of the giant component | 2001-02-06 | Paper |
| Normal convergence problem? Two moments and a recurrence may be the clues | 2000-09-04 | Paper |
| The random bipartite nearest neighbor graphs | 2000-05-09 | Paper |
| Where the typical set partitions meet and join | 2000-03-01 | Paper |
| Tree and forest weights and their application to nonuniform random graphs | 2000-02-09 | Paper |
| Confirming two conjectures about the integer partitions | 1999-12-20 | Paper |
| On the multiplicity of parts in a random partition | 1999-08-19 | Paper |
| On the random Young diagrams and their cores | 1999-07-20 | Paper |
| The asymptotic number of set partitions with unequal block sizes | 1999-02-02 | Paper |
| On a likely shape of the random Ferrers diagram | 1998-09-08 | Paper |
| Random set partitions: Asymptotics of subset counts | 1998-09-08 | Paper |
| On-Line Coloring of Sparse Random Graphs and Random Trees | 1997-04-27 | Paper |
| A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree | 1997-01-27 | Paper |
| Sudden emergence of a giant \(k\)-core in a random graph | 1996-10-14 | Paper |
| Probabilistic analysis of an algorithm in the theory of markets in indivisible goods | 1996-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763383 | 1995-04-11 | Paper |
| The Structure of a Random Graph at the Point of the Phase Transition | 1995-03-02 | Paper |
| An upper bound for the solvability probability of a random stable roommates instance | 1995-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138917 | 1994-09-19 | Paper |
| Components of Random Forests | 1994-08-10 | Paper |
| Note on the heights of random recursive trees and random m‐ary search trees | 1994-06-22 | Paper |
| On a Random Instance of a ‘Stable Roommates’ Problem: Likely Behavior of the Proposal Algorithm | 1994-05-24 | Paper |
| The ``stable roommates problem with random preferences | 1994-01-05 | Paper |
| The average performance of the greedy matching algorithm | 1993-10-28 | Paper |
| The birth of the giant component | 1993-08-22 | Paper |
| Correction to: Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel | 1993-01-16 | Paper |
| On likely solutions of a stable marriage problem | 1993-01-16 | Paper |
| A Graph-Valued Markov Process as Rings-Allowed Polymerization Model: Subcritical Behavior | 1992-06-25 | Paper |
| Corrigendum | 1992-06-25 | Paper |
| How many random questions are necessary to identify \(n\) distinct objects? | 1992-06-25 | Paper |
| Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel | 1992-06-25 | Paper |
| On tree census and the giant component in sparse random graphs | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3977629 | 1992-06-25 | Paper |
| Stable husbands | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3357248 | 1990-01-01 | Paper |
| On a Daley-Kendall model of random rumours | 1990-01-01 | Paper |
| The first cycles in an evolving graph | 1989-01-01 | Paper |
| The Average Number of Stable Matchings | 1989-01-01 | Paper |
| A Recurrence Related to Trees | 1989-01-01 | Paper |
| Analysis of the space of search trees under the random insertion algorithm | 1989-01-01 | Paper |
| On the joint distribution of the insertion path length and the number of comparisons in search trees | 1988-01-01 | Paper |
| On Search Times for Early-Insertion Coalesced Hashing | 1988-01-01 | Paper |
| A Random Graph With a Subcritical Number of Edges | 1988-01-01 | Paper |
| Linear probing: The probable largest search time grows logarithmically with the number of records | 1987-01-01 | Paper |
| On probabilistic analysis of a coalesced hashing algorithm | 1987-01-01 | Paper |
| On Spreading a Rumor | 1987-01-01 | Paper |
| An urn model for cannibal behavior | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3812298 | 1987-01-01 | Paper |
| On growing a random Young tableau | 1986-01-01 | Paper |
| Paths in a random digital tree: limiting distributions | 1986-01-01 | Paper |
| Asymptotical growth of a class of random trees | 1985-01-01 | Paper |
| Random permutations and Brownian motion | 1985-01-01 | Paper |
| On growing random binary trees | 1984-01-01 | Paper |
| On the Most Probable Shape of a Search Tree Grown from a Random Permutation | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3697964 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732635 | 1984-01-01 | Paper |
| On distributions related to transitive closures of random finite mappings | 1983-01-01 | Paper |
| Counting subsets of the random partition and the 'Brownian bridge' process | 1983-01-01 | Paper |
| The Worst and the Most Probable Performance of a Class of Set-Covering Algorithms | 1983-01-01 | Paper |
| On the probable behaviour of some algorithms for finding the stability number of a graph | 1982-01-01 | Paper |
| Limiting behavior of a process of runs | 1981-01-01 | Paper |
| The number of increasing subsequences of the random permutation | 1981-01-01 | Paper |
| A process of runs and its convergence to the Brownian motion | 1980-01-01 | Paper |
| Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis | 1979-01-01 | Paper |
| On a Game Random Walk on a Straight Line | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5179647 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5684817 | 1972-01-01 | Paper |
| Semi-Markov Decisions in a Problem of Optimizing a Checking Procedure of an Unreliable Queuing System | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4086550 | 1972-01-01 | Paper |
| A Minimax Analogue of the Weak Law of Large Numbers | 1971-01-01 | Paper |
| A Linear Programming Problem Connected with Optimal Stationary Control in a Dynamic Decision Problem | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5566452 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5572986 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5590499 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5602475 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5608429 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5647286 | 1967-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5561223 | 1965-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5334562 | 1964-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5337972 | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5602474 | 1963-01-01 | Paper |
| Some problems of optimum control. I | 1963-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5340285 | 1962-01-01 | Paper |
