| Publication | Date of Publication | Type |
|---|
| Diagonalization Games | 2024-12-12 | Paper |
| A lower bound for linear interval routing | 2024-07-11 | Paper |
| On the robustness of \(h^r_m\) (preliminary version) | 2024-07-11 | Paper |
| Diagonalization Games | 2023-01-05 | Paper |
| Elementary Derivations of the Euclidean Hurwitz Algebras Adapted from Gadi Moran’s last paper | 2021-09-27 | Paper |
| MinMax algorithms for stabilizing consensus | 2021-09-06 | Paper |
| Closed schedulers: a novel technique for analyzing asynchronous protocols | 2020-11-30 | Paper |
| The Firing Squad Problem Revisited. | 2020-08-05 | Paper |
| The firing squad problem revisited | 2019-10-07 | Paper |
| Towards optimal distance functions for stochastic substitution models | 2018-11-26 | Paper |
| Comparing evolutionary distances via adaptive distance functions | 2018-07-05 | Paper |
| A lower bound on wait-free counting | 2017-09-29 | Paper |
| Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract) | 2017-09-29 | Paper |
| Concurrent counting | 2017-08-21 | Paper |
| Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract) | 2016-09-29 | Paper |
| Simple and optimal randomized fault-tolerant rumor spreading | 2016-05-23 | Paper |
| Resource bounds for self stabilizing message driven protocols | 2015-06-19 | Paper |
| Partial convex recolorings of trees and galled networks | 2014-09-09 | Paper |
| Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges | 2012-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579481 | 2010-08-06 | Paper |
| Optimal implementations of UPGMA and other common clustering algorithms | 2010-03-24 | Paper |
| Bit complexity of breaking and achieving symmetry in chains and rings | 2008-12-21 | Paper |
| Convex recolorings of strings and trees: Definitions, hardness results and algorithms | 2008-06-26 | Paper |
| On the hardness of inferring phylogenies from triplet-dissimilarities | 2008-01-07 | Paper |
| Efficient approximation of convex recolorings | 2007-08-27 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
| Competitive caching of query results in search engines | 2004-11-23 | Paper |
| Exact communication costs for consensus and leader in a tree | 2004-08-06 | Paper |
| Public data structures: counters as a special case. | 2003-01-21 | Paper |
| The complexity of the characterization of networks supporting shortest-path interval routing. | 2003-01-21 | Paper |
| Computing in totally anonymous asynchronous shared memory systems | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766866 | 2002-01-28 | Paper |
| Minimum propositional proof length is NP-hard to linearly approximate | 2002-01-21 | Paper |
| On the total\(_k\)-diameter of connection networks | 2000-10-26 | Paper |
| Simple and efficient network decomposition and synchronization | 2000-08-21 | Paper |
| Impossibility results in the presence of multiple faulty processes | 2000-08-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942030 | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4262693 | 1999-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218098 | 1999-03-02 | Paper |
| A Lower Bound on Wait-Free Counting | 1998-05-25 | Paper |
| Resource Bounds for Self-Stabilizing Message-Driven Protocols | 1997-08-03 | Paper |
| Average and Randomized Complexity of Distributed Problems | 1997-06-09 | Paper |
| The Wakeup Problem | 1997-06-09 | Paper |
| Concurrent counting | 1997-03-31 | Paper |
| Tight bounds on the round complexity of distributed 1-solvable tasks | 1997-02-28 | Paper |
| Self-stabilization of dynamic systems assuming only read/write atomicity | 1995-11-22 | Paper |
| Possibility and impossibility results in a shared memory environment | 1995-11-19 | Paper |
| A lower bound on the period length of a distributed scheduler | 1994-05-15 | Paper |
| The distributed bit complexity of the ring: From the anonymous to the non-anonymous case | 1994-02-22 | Paper |
| Two-page book embedding of trees under vertex-neighborhood constraints | 1993-08-10 | Paper |
| Gap Theorems for Distributed Computation | 1993-05-17 | Paper |
| Rotating-table games and derivatives of words | 1993-05-16 | Paper |
| Space-efficient asynchronous consensus without shared memory initialization | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028117 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028879 | 1993-03-28 | Paper |
| Optimal covering of cacti by vertex-disjoint paths | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974855 | 1992-06-26 | Paper |
| One-Page Book Embedding under Vertex-Neighborhood Constraints | 1992-06-25 | Paper |
| Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight | 1990-01-01 | Paper |
| A combinatorial characterization of the distributed 1-solvable tasks | 1990-01-01 | Paper |
| Initial failures in distributed computations | 1989-01-01 | Paper |
| Optimal lower bounds for some distributed algorithms for a complete network of processors | 1989-01-01 | Paper |
| Proving properties of interactive proofs by a generalized counting technique | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355219 | 1989-01-01 | Paper |
| Message complexity versus space complexity in fault tolerant broadcast protocols | 1989-01-01 | Paper |
| Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes | 1988-01-01 | Paper |
| Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays | 1988-01-01 | Paper |
| Geometric applications of a matrix-searching algorithm | 1987-01-01 | Paper |
| Generalized lower bounds derived from Hastad's main lemma | 1987-01-01 | Paper |
| Extremal problems on permutations under cyclic equivalence | 1987-01-01 | Paper |
| The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors | 1987-01-01 | Paper |
| Sequential Machine Characterizations of Trellis and Cellular Automata and Applications | 1985-01-01 | Paper |
| Some independence results in complexity theory† | 1985-01-01 | Paper |
| Applications of Ramsey's theorem to decision tree complexity | 1985-01-01 | Paper |
| On approximation problems related to the independent set and vertex cover problems | 1984-01-01 | Paper |
| On the length of optimal TSP circuits in sets of bounded diameter | 1984-01-01 | Paper |
| On the control power of integer division | 1983-01-01 | Paper |
| On the complexity of designing optimal partial-match retrieval systems | 1983-01-01 | Paper |
| Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp> | 1983-01-01 | Paper |
| Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs | 1983-01-01 | Paper |
| On some decision problems for RAM programs | 1982-01-01 | Paper |
| On the complexity of simple arithmetic expressions | 1982-01-01 | Paper |
| Fair derivations in context-free grammars | 1982-01-01 | Paper |
| On the Accepting Density Hierarchy in NP | 1982-01-01 | Paper |
| A generalization of the fast LUP matrix decomposition algorithm and applications | 1982-01-01 | Paper |
| Probabilistic algorithms and straight-line programs for some rank decision problems | 1981-01-01 | Paper |
| Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication | 1981-01-01 | Paper |
| A note on 'Is shortest path problem not harder than matrix multiplication?' | 1981-01-01 | Paper |
| General approximation algorithms for some arithmetical combinatorial problems | 1981-01-01 | Paper |
| Some results on relativized deterministic and nondeterministic time hierarchies | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912020 | 1981-01-01 | Paper |
| The complexity of identifying redundant and essential elements | 1981-01-01 | Paper |
