| Publication | Date of Publication | Type |
|---|
| Robustness: a new form of heredity motivated by dynamic networks | 2020-01-16 | Paper |
| Counting in one-hop beeping networks | 2019-06-06 | Paper |
| Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds | 2019-05-07 | Paper |
| Design patterns in beeping algorithms: examples, emulation, and analysis | 2018-12-21 | Paper |
| Deterministic leader election in \(O(D+\log n)\) time with messages of size \(O(1)\) | 2018-08-16 | Paper |
| Design Patterns in Beeping Algorithms. | 2018-07-18 | Paper |
| On the concentration of the height of binary search trees | 2018-07-04 | Paper |
| Randomised distributed MIS and colouring algorithms for rings with oriented edges in \(O(\sqrt{\log n})\) bit rounds | 2016-11-18 | Paper |
| A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots | 2016-03-10 | Paper |
| Analysis of fully distributed splitting and naming probabilistic procedures and applications | 2015-05-22 | Paper |
| On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms | 2015-01-13 | Paper |
| On the time and the bit complexity of distributed randomised anonymous ring colouring | 2014-01-10 | Paper |
| Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings | 2014-01-10 | Paper |
| Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications | 2013-12-17 | Paper |
| On the number of indecomposable permutations with a given number of cycles | 2012-06-12 | Paper |
| An optimal bit complexity randomized distributed MIS algorithm | 2012-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077352 | 2011-02-22 | Paper |
| About randomised distributed graph colouring and graph partition algorithms | 2010-10-22 | Paper |
| Uniform election in trees and polyominoids | 2010-10-11 | Paper |
| An Optimal Bit Complexity Randomized Distributed MIS Algorithm (Extended Abstract) | 2010-02-24 | Paper |
| Efficient Simulations by Queue Machines | 2006-06-01 | Paper |
| Cantorian tableaux and permanents | 2005-09-28 | Paper |
| Constant bounds on the moments of the height of binary search trees | 2002-07-15 | Paper |
| Hard tiling problems with simple tiles | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754190 | 2001-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753924 | 2001-11-11 | Paper |
| Strategy and Complexity of The Game of Squares | 2000-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941171 | 2000-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939575 | 2000-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251053 | 1999-06-17 | Paper |
| Automaticity. II: Descriptional complexity in the unary case | 1998-07-22 | Paper |
| Fast and scalable parallel algorithms for knapsack-like problems. | 1997-08-07 | Paper |
| Separating words with machines and groups | 1996-11-17 | Paper |
| On the Generation of Random Binary Search Trees | 1996-02-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281688 | 1994-06-13 | Paper |
| Analytic variations on quadtrees | 1994-03-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138944 | 1993-10-20 | Paper |
| More languages of generalised star height 1 | 1993-04-22 | Paper |
| Deterministic simulation of a single tape turing machine by a random access machine in sub-linear time | 1992-09-27 | Paper |
| On O(Tlog T) reduction from RAM computations to satisfiability | 1991-01-01 | Paper |
| Strong time bounds: Non-computable bounds and a hierarchy theorem | 1990-01-01 | Paper |
| Random access machines with multi-dimensional memories | 1990-01-01 | Paper |
| Separating strings with small automata | 1989-01-01 | Paper |
| Algorithms for maximum independent sets | 1986-01-01 | Paper |
| Alternation with restrictions on looping | 1985-01-01 | Paper |
| N by N Checkers is Exptime Complete | 1984-01-01 | Paper |
| Fast probabilistic RAM simulation of single tape turing machine computations | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3721817 | 1984-01-01 | Paper |
| Storage allocation is NP-hard | 1980-01-01 | Paper |
| The emptiness of complement problem for semi extended regular expressions requires \(c^n\) space | 1979-01-01 | Paper |
| A bounded storage algorithm for copying cyclic structures | 1977-01-01 | Paper |
| A simple solution to the interleaved memory bandwidth problem | 1975-01-01 | Paper |
| Bounds for Some Functions Concerning Dynamic Storage Allocation | 1974-01-01 | Paper |
| An Estimate of the Store Size Necessary for Dynamic Storage Allocation | 1971-01-01 | Paper |
