| Publication | Date of Publication | Type |
|---|
| Breaking the 2-competitiveness barrier for two servers in a tree | 2023-10-17 | Paper |
| Analysis of a memory-efficient self-stabilizing BFS spanning tree construction | 2023-04-12 | Paper |
| Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091108 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091109 | 2022-07-21 | Paper |
| Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees | 2022-07-04 | Paper |
| Linear time distributed swap edge algorithms | 2020-08-04 | Paper |
| Loosely-stabilizing leader election with polylogarithmic convergence time | 2020-01-16 | Paper |
| The Optimal Alphabetic Tree problem revisited | 2019-04-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4621130 | 2019-02-08 | Paper |
| Constant-space self-stabilizing token distribution in trees | 2019-01-30 | Paper |
| A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem | 2018-11-29 | Paper |
| Self-stabilizing leader election in dynamic networks | 2018-07-23 | Paper |
| Self-Stabilizing Weak Leader Election in Anonymous Trees Using Constant Memory per Edge | 2017-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5363807 | 2017-09-29 | Paper |
| Self-stabilizing silent disjunction in an anonymous network | 2017-02-06 | Paper |
| Self-stabilizing Silent Disjunction in an Anonymous Network | 2016-12-19 | Paper |
| A better lower bound on the competitive ratio of the randomized 2-server problem | 2016-05-26 | Paper |
| Competitive self-stabilizing \(k\)-clustering | 2016-03-31 | Paper |
| R-LINE: a better randomized 2-server algorithm on the line | 2015-10-30 | Paper |
| The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity | 2014-11-18 | Paper |
| Self-stabilizing labeling and ranking in ordered trees | 2014-01-13 | Paper |
| R–LINE: A Better Randomized 2-Server Algorithm on the Line | 2013-09-13 | Paper |
| Linear Time Distributed Swap Edge Algorithms | 2013-06-07 | Paper |
| A self-stabilizing \(k\)-clustering algorithm for weighted graphs | 2012-03-07 | Paper |
| An \(O(n)\)-time self-stabilizing leader election algorithm | 2011-11-10 | Paper |
| Self-stabilizing leader election in optimal space under an arbitrary scheduler | 2011-10-10 | Paper |
| Knowledge state algorithms | 2011-06-30 | Paper |
| SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS | 2011-05-10 | Paper |
| A randomized algorithm for two servers in cross polytope spaces | 2011-02-21 | Paper |
| The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity | 2010-08-16 | Paper |
| Space efficient and time optimal distributed BFS tree construction | 2010-06-09 | Paper |
| Uniform metrical task systems with a limited number of states | 2010-03-24 | Paper |
| Optimally competitive list batching | 2009-09-10 | Paper |
| KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS | 2009-04-14 | Paper |
| A quadratic time 2-approximation algorithm for block sorting | 2009-03-17 | Paper |
| Self-stabilizing Space Optimal Synchronization Algorithms on Trees | 2009-03-12 | Paper |
| Equitable Revisited | 2008-09-25 | Paper |
| On Self-stabilizing Search Trees | 2008-09-09 | Paper |
| A Randomized Algorithm for Two Servers in Cross Polytope Spaces | 2008-02-20 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Block Sorting is Hard | 2005-10-19 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| The algebraic Monge property and path problems | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708562 | 2003-06-18 | Paper |
| On the complexity of pattern matching for highly compressed two-dimensional texts. | 2003-05-14 | Paper |
| The 3-server problem in the plane. | 2003-01-21 | Paper |
| A randomized algorithm for two servers on the line. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779149 | 2002-11-25 | Paper |
| Trackless online algorithms for the server problem | 2002-07-25 | Paper |
| Limited bookmark randomized online algorithms for the paging problem | 2002-07-25 | Paper |
| Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property | 2002-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252022 | 2000-04-06 | Paper |
| The Optimal Alphabetic Tree Problem Revisited | 1998-10-21 | Paper |
| Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages | 1998-08-13 | Paper |
| Correctness of constructing optimal alphabetic trees revisited | 1998-07-22 | Paper |
| Page Migration Algorithms Using Work Functions | 1997-08-25 | Paper |
| A parallel algorithm for optimum height-limited alphabetic binary trees | 1996-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875166 | 1996-06-16 | Paper |
| Constructing Huffman Trees in Parallel | 1996-02-25 | Paper |
| An optimal sublinear time parallel algorithm for some dynamic programming problems | 1995-07-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763407 | 1995-04-11 | Paper |
| A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees | 1995-04-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138908 | 1994-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138930 | 1994-04-13 | Paper |
| Generosity Helps or an 11-Competitive Algorithm for Three Servers | 1994-03-22 | Paper |
| HARMONIC is 3-competitive for two servers | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010306 | 1992-09-27 | Paper |
| On fast algorithms for two servers | 1992-06-28 | Paper |
| The Traveler's Problem | 1992-06-28 | Paper |
| A note on the server problem and a benevolent adversary | 1992-06-26 | Paper |
| A New Approach to the Server Problem | 1992-06-25 | Paper |
| An Optimal On-Line Algorithm for K Servers on Trees | 1991-01-01 | Paper |
| On-line dynamic programming with applications to the prediction of RNA secondary structure | 1991-01-01 | Paper |
| An optimal algorithm with unknown time complexity for convex matrix searching | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361888 | 1990-01-01 | Paper |
| A fast algorithm for optimal length-limited Huffman codes | 1990-01-01 | Paper |
| Efficient Parallel Algorithms for String Editing and Related Problems | 1990-01-01 | Paper |
| The set-set LCS problem | 1989-01-01 | Paper |
| Minimum Delay Codes | 1989-01-01 | Paper |
| Construction of optimal binary split trees in the presence of bounded access probabilities | 1988-01-01 | Paper |
| The set LCS problem | 1987-01-01 | Paper |
| Packing items from a triangular distribution | 1987-01-01 | Paper |
| A subquadratic algorithm for constructing approximately optimal binary search trees | 1987-01-01 | Paper |
| The Least Weight Subsequence Problem | 1987-01-01 | Paper |
| Height Restricted Optimal Binary Trees | 1987-01-01 | Paper |
| Average Case Analysis of Marking Algorithms | 1986-01-01 | Paper |
| On the fundamental group of a space of sections. | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3868477 | 1979-01-01 | Paper |
| Isotopy Groups | 1978-01-01 | Paper |
| Enumerating normal bundles of immersions and embeddings of projective spaces | 1977-01-01 | Paper |
| Enumerating immersions and embeddings of projective spaces | 1976-01-01 | Paper |
| Real n-plane bundles over an (n+1)-complex | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4776623 | 1974-01-01 | Paper |
| Obstructions to embedding and isotopy in the metastable range | 1973-01-01 | Paper |
| Group extensions and twisted cohomology theories | 1973-01-01 | Paper |
| The Cohomology of (Λ2X, ΔX) | 1973-01-01 | Paper |
| Group Extensions and Principal Fibrations. | 1972-01-01 | Paper |
| Twisted cohomology theories and the single obstruction to lifting | 1972-01-01 | Paper |
| A universal countable first-countable Hausdorff space | 1972-01-01 | Paper |
| Mappings into loop spaces and central group extensions | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5182302 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5628929 | 1970-01-01 | Paper |
| The first obstruction to embedding a 1-complex in a 2-manifold | 1970-01-01 | Paper |
| Twisted cohomology and enumeration of vector bundles | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5536119 | 1967-01-01 | Paper |
