| Publication | Date of Publication | Type |
|---|
| On Interval Routing Schemes and treewidth | 2024-02-28 | Paper |
| The file distribution problem for processor networks | 2022-12-09 | Paper |
| Algorithms, Complexity, and Hans | 2022-10-19 | Paper |
| Finite state machines with feedback: an architecture supporting minimal machine consciousness | 2020-05-12 | Paper |
| Question answering by humans and machines: a complexity-theoretic view | 2019-06-18 | Paper |
| Turing Machines with One-sided Advice and Acceptance of the co-RE Languages | 2018-01-05 | Paper |
| Shortcutting directed and undirected networks with a degree constraint | 2017-02-06 | Paper |
| Separating the Classes of Recursively Enumerable Languages Based on Machine Size | 2015-12-11 | Paper |
| Pure Nash equilibria in graphical games and treewidth | 2015-05-04 | Paper |
| What is Computation: An Epistemic Approach | 2015-02-20 | Paper |
| Integer representations of convex polygon intersection graphs | 2014-03-24 | Paper |
| Treewidth and Pure Nash Equilibria | 2013-12-10 | Paper |
| Integer Representations of Convex Polygon Intersection Graphs | 2013-06-27 | Paper |
| A Theory of Interactive Computation | 2013-06-18 | Paper |
| Structure of polynomial-time approximation | 2012-12-06 | Paper |
| Computer-assisted proof of performance ratios for the differencing method | 2012-07-12 | Paper |
| Computation as an unbounded process | 2012-05-30 | Paper |
| Name Resolution by Rewriting in Dynamic Networks of Mobile Entities | 2011-05-27 | Paper |
| Convex Polygon Intersection Graphs | 2011-02-11 | Paper |
| The complexity of interval routing on random graphs | 2010-06-17 | Paper |
| Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint | 2008-07-15 | Paper |
| How We Think of Computing Today | 2008-06-19 | Paper |
| Performance ratios of the Karmarkar-Karp differencing method | 2007-02-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5708542 | 2005-11-18 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473975 | 2004-08-04 | Paper |
| Approximations for -Colorings of Graphs | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437108 | 2003-12-07 | Paper |
| Finding a \(\Delta\)-regular supergraph of minimum order | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418683 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4803420 | 2003-04-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536346 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762165 | 2002-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536457 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501549 | 2002-04-08 | Paper |
| The Complexity of Interval Routing on Random Graphs | 1999-01-25 | Paper |
| On interval routing schemes and treewidth | 1998-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4385515 | 1998-05-04 | Paper |
| Prefix routing schemes in dynamic networks | 1994-09-05 | Paper |
| Maintenance of 2- and 3-edge-connected components of graphs. I | 1993-10-24 | Paper |
| Uniform d‐emulations of rings, with an application to distributed virtual ring construction | 1993-08-23 | Paper |
| Interval Heaps | 1993-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4694138 | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028911 | 1993-03-28 | Paper |
| On models for propositional dynamic logic | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4712661 | 1992-06-25 | Paper |
| Computational complexity of norm-maximization | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3833600 | 1989-01-01 | Paper |
| Efficient elections in chordal ring networks | 1989-01-01 | Paper |
| On estimating the complexity of logarithmic decomposition | 1988-01-01 | Paper |
| Fast Simulation of Turing Machines by Random Access Machines | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813313 | 1988-01-01 | Paper |
| The derivation of graph marking algorithms from distributed termination detection protocols | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753473 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3758865 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785907 | 1987-01-01 | Paper |
| Interval Routing | 1987-01-01 | Paper |
| Diameter increase caused by edge deletion | 1987-01-01 | Paper |
| Array processing machines: an abstract model | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3819997 | 1987-01-01 | Paper |
| On Linear Skewing Schemes and d-Ordered Vectors | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742712 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711761 | 1986-01-01 | Paper |
| Simulation of large networks on smaller networks | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3681950 | 1985-01-01 | Paper |
| The Structure of Periodic Storage Schemes for Parallel Memories | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692870 | 1985-01-01 | Paper |
| Worst-case Analysis of Set Union Algorithms | 1984-01-01 | Paper |
| Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino | 1984-01-01 | Paper |
| Systolische Berechnungen und VLSI | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3343924 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693533 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326823 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3309031 | 1983-01-01 | Paper |
| Stratified balanced search trees | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745253 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3666269 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956385 | 1982-01-01 | Paper |
| Dynamic multi-dimensional data structures based on quad- and k-d trees | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216469 | 1982-01-01 | Paper |
| Efficient recognition of rational relations | 1982-01-01 | Paper |
| Maintenance of configurations in the plane | 1981-01-01 | Paper |
| Worst-case optimal insertion and deletion methods for decomposable searching problems | 1981-01-01 | Paper |
| The measure problem for rectangular ranges in d-space | 1981-01-01 | Paper |
| Two general methods for dynamizing decomposable searching problems | 1981-01-01 | Paper |
| The complexity of basic complex operations | 1981-01-01 | Paper |
| Some principles for dynamizing decomposable searching problems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3907084 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911410 | 1981-01-01 | Paper |
| Stack Machines and Classes of Nonnested Macro Languages | 1980-01-01 | Paper |
| Further comments on Bykat's convex hull algorithm | 1980-01-01 | Paper |
| Über Programmeffizienz und algebraische Komplexitaet | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3039427 | 1980-01-01 | Paper |
| On the complexity of decision trees, the quasi-optimizer, and the power of heuristic rules | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4179039 | 1979-01-01 | Paper |
| On compromising statistical data-bases with a few known elements | 1979-01-01 | Paper |
| A useful lemma for context-free programmed grammars | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4153605 | 1978-01-01 | Paper |
| Effective constructions in well-partially-ordered free monoids | 1978-01-01 | Paper |
| Deciding Associativity for Partial Multiplication Tables of Order 3 | 1978-01-01 | Paper |
| Some elementary proofs of lower bounds in complexity theory | 1978-01-01 | Paper |
| An extension of Hansen's theorem for star chains. | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4127400 | 1977-01-01 | Paper |
| On efficiently computing the product of two binary relations | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131006 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140383 | 1976-01-01 | Paper |
| A decomposition theorem for hyper-algebraic extensions of language families | 1976-01-01 | Paper |
| The halting problem for linear Turing assemblers | 1976-01-01 | Paper |
| The complexity of vector-products | 1976-01-01 | Paper |
| On the fixpoints of monogenic functions in free monoids | 1975-01-01 | Paper |
| The membership question for ETOL-languages is polynomially complete | 1975-01-01 | Paper |
| The tape-complexity of context-independent developmental languages | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4088273 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4045664 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4136592 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4051631 | 1974-01-01 | Paper |
