| Publication | Date of Publication | Type |
|---|
| Sorting by parallel insertion on a one-dimensional subbus array | 2018-07-09 | Paper |
| Optimizing static calendar queues | 2018-06-12 | Paper |
| Algorithms for dynamic multicast key distribution trees | 2015-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501815 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501263 | 2015-08-03 | Paper |
| A general buffer scheme for the windows scheduling problem | 2014-04-01 | Paper |
| Windows scheduling of arbitrary-length jobs on multiple machines | 2014-02-05 | Paper |
| Windows scheduling as a restricted version of bin packing | 2010-08-14 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| Scheduling techniques for media-on-demand | 2009-05-13 | Paper |
| Optimal delay for media-on-demand with pre-loading and pre-buffering | 2008-06-24 | Paper |
| Algorithms for dynamic multicast key distribution | 2008-06-20 | Paper |
| Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging | 2008-01-11 | Paper |
| Semi-matchings for bipartite graphs and load balancing | 2006-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5485342 | 2006-08-29 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Irredundant intervals | 2005-08-04 | Paper |
| Efficient Algorithms for Optimal Stream Merging for Media-on-Demand | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828965 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471373 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4460268 | 2004-05-18 | Paper |
| Competitive on-line stream merging algorithms for media-on-demand | 2004-03-14 | Paper |
| Windows Scheduling Problems for Broadcast Systems | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417673 | 2003-07-29 | Paper |
| Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract) | 2002-06-23 | Paper |
| Fast nearest neighbor search of entropy-constrained vector quantization | 2001-06-11 | Paper |
| Multiresolution banded refinement to accelerate surface reconstruction from polygons | 2000-02-17 | Paper |
| The Influence of Caches on the Performance of Sorting | 2000-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252340 | 1999-06-17 | Paper |
| Counting protocols for reliable end-to-end transmission | 1999-06-13 | Paper |
| Recoverable sequence transmission protocols | 1998-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886094 | 1996-10-21 | Paper |
| Complexity of Sub-Bus Mesh Computations | 1996-07-23 | Paper |
| Interactive proof systems with polynomially bounded strategies | 1996-04-16 | Paper |
| The complexity of computing symmetric functions using threshold circuits | 1992-09-27 | Paper |
| Safety and liveness of \(\omega\)-context-free languages | 1991-01-01 | Paper |
| Polynomial Space Counting Problems | 1989-01-01 | Paper |
| Probabilistic game automata | 1988-01-01 | Paper |
| Estimating the multiplicities of conflicts to speed their resolution in multiple access channels | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4720789 | 1986-01-01 | Paper |
| Solitaire automata | 1985-01-01 | Paper |
| Signsolvability revisited | 1984-01-01 | Paper |
| Alternating Pushdown and Stack Automata | 1984-01-01 | Paper |
| Alternation bounded auxiliary pushdown automata | 1984-01-01 | Paper |
| Binary Search in a Multiprocessing Environment | 1983-01-01 | Paper |
| Efficient parallel algorithms for linear recurrence computation | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3327726 | 1981-01-01 | Paper |
| Parallel Prefix Computation | 1980-01-01 | Paper |
| Testing the universal instance assumption | 1980-01-01 | Paper |
| The complexity of problems in systems of communicating sequential processes | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3887443 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3904052 | 1980-01-01 | Paper |
| Propositional dynamic logic of regular programs | 1979-01-01 | Paper |
| The Computational Complexity of Provability in Systems of Modal Propositional Logic | 1977-01-01 | Paper |
| Application of model theoretic games to discrete linear orders and finite automata | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197339 | 1977-01-01 | Paper |
| Relativization of questions about log space computability | 1976-01-01 | Paper |
| On the Structure of Polynomial Time Reducibility | 1975-01-01 | Paper |
| A comparison of polynomial time reducibilities | 1975-01-01 | Paper |
| The weak truth table degrees of recursively enumerable sets | 1975-01-01 | Paper |
| Space bounds for processing contentless inputs | 1975-01-01 | Paper |
| A Completely Mitotic Nonrecursive R.E. Degree | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162480 | 1974-01-01 | Paper |
| Mitotic recursively enumerable sets | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4061961 | 1973-01-01 | Paper |
