| Publication | Date of Publication | Type |
|---|
| Cover and hitting times of hyperbolic random graphs | 2024-11-20 | Paper |
| Cover and hitting times of hyperbolic random graphs | 2024-08-22 | Paper |
| Label propagation on binomial random graphs | 2023-02-07 | Paper |
| Quasi-random words and limits of word sequences | 2022-10-13 | Paper |
| Cover and Hitting Times of Hyperbolic Random Graphs | 2022-07-14 | Paper |
| Tail bounds for detection times in mobile hyperbolic graphs | 2022-02-28 | Paper |
| Quasi-random words and limits of word sequences | 2021-09-02 | Paper |
| On the Second Largest Component of Random Hyperbolic Graphs | 2019-11-20 | Paper |
| A Bound for the Diameter of Random Hyperbolic Graphs | 2019-09-17 | Paper |
| Spectral gap of random hyperbolic graphs and related parameters | 2018-06-29 | Paper |
| Longest Increasing Subsequences of Randomly Chosen Multi-Row Arrays | 2017-10-04 | Paper |
| FIFO Queues Are Bad for Rumor Spreading | 2017-06-08 | Paper |
| Approximate testing with relative error | 2016-09-29 | Paper |
| Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations | 2016-06-22 | Paper |
| Repetition-free longest common subsequence of random sequences | 2016-06-22 | Paper |
| Adaptive Rumor Spreading | 2016-01-08 | Paper |
| Types of perfect matchings in toroidal square grids | 2014-06-12 | Paper |
| Antiferromagnetic Ising model in triangulations with applications to counting perfect matchings | 2014-05-06 | Paper |
| Counting perfect matchings in the geometric dual | 2013-07-23 | Paper |
| On-line approximate string matching with bounded errors | 2012-01-09 | Paper |
| Counting perfect matchings of cubic graphs in the geometric dual | 2010-10-28 | Paper |
| Satisfying states of triangulations of a convex \(n\)-gon | 2010-03-26 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs | 2009-04-07 | Paper |
| On-Line Approximate String Matching with Bounded Errors | 2008-06-17 | Paper |
| A concentration bound for the longest increasing subsequence of a randomly chosen involution | 2006-08-17 | Paper |
| Expected length of the longest common subsequence for large alphabets | 2005-11-22 | Paper |
| Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs | 2005-03-22 | Paper |
| The chilean highway problem | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044343 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736880 | 2004-08-11 | Paper |
| Electronic jury voting protocols | 2004-08-10 | Paper |
| Approximate testing with error relative to input size. | 2003-08-13 | Paper |
| Largest planar matching in random bipartite graphs | 2003-04-02 | Paper |
| Alternation in interaction | 2002-06-02 | Paper |
| Min-max-boundary domain decomposition | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252728 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218415 | 1998-11-11 | Paper |
| Linearity testing in characteristic two | 1997-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4890454 | 1997-06-03 | Paper |
| No polynomial bound for the period of the parallel chip firing game on graphs | 1997-02-27 | Paper |
| Games on line graphs and sand piles | 1994-04-13 | Paper |
| A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer | 1992-06-28 | Paper |
