| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6192475 | 2024-02-12 | Paper |
| The complexity of broadcasting in planar and decomposable graphs | 2024-01-05 | Paper |
| Data transmission in processor networks | 2023-12-01 | Paper |
| The complexity of scheduling problems with communication delays for trees | 2022-12-09 | Paper |
| Learning residual alternating automata | 2022-12-08 | Paper |
| Dynamic kernels for hitting sets and set packing | 2022-10-27 | Paper |
| Area efficient methods to increase the reliability of combinatorial circuits | 2022-08-16 | Paper |
| The kangaroo problem | 2021-12-01 | Paper |
| Hardness of \(k\)-anonymous microaggregation | 2021-09-15 | Paper |
| Proper learning of \(k\)-term DNF formulas from satisfying assignments | 2019-08-30 | Paper |
| The average case complexity of the parallel prefix problem | 2019-04-29 | Paper |
| Malign distributions for average case circuit complexity | 2017-12-04 | Paper |
| Observable clock synchronization extended abstract | 2017-09-29 | Paper |
| Security levels in steganography -- insecurity does not imply detectability | 2017-09-05 | Paper |
| Circuit complexity | 2016-09-01 | Paper |
| Steganography Based on Pattern Languages | 2016-04-13 | Paper |
| Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples | 2016-01-11 | Paper |
| Grey-box steganography | 2014-01-16 | Paper |
| Grey-Box Steganography | 2011-07-01 | Paper |
| Knowledge state algorithms | 2011-06-30 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Algorithmic Learning Theory | 2010-02-23 | Paper |
| Algorithms and Computation | 2009-08-07 | Paper |
| KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS | 2009-04-14 | Paper |
| Improving the average delay of sorting | 2009-03-20 | Paper |
| When Does Greedy Learning of Relevant Attributes Succeed? | 2009-03-06 | Paper |
| Improving the Average Delay of Sorting | 2007-11-13 | Paper |
| Learning juntas in the presence of noise | 2007-09-28 | Paper |
| Smoothed analysis of binary search trees | 2007-07-09 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| Approximating schedules for dynamic process graphs efficiently | 2007-04-26 | Paper |
| Learning a subclass of regular patterns in polynomial time | 2007-01-09 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Space efficient algorithms for directed series–parallel graphs | 2006-10-05 | Paper |
| The intractability of computing the Hamming distance | 2005-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420734 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418642 | 2003-08-11 | Paper |
| Malign distributions for average case circuit complexity. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766685 | 2002-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766848 | 2002-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762791 | 2002-01-09 | Paper |
| On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505383 | 2000-09-27 | Paper |
| An average-case optimal one-variable pattern language learner | 2000-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699288 | 2000-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703441 | 1999-12-15 | Paper |
| The complexity of broadcasting in planar and decomposable graphs | 1998-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4215791 | 1998-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359462 | 1998-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364577 | 1997-11-17 | Paper |
| An average complexity measure that yields tight hierarchies | 1997-08-17 | Paper |
| Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4718226 | 1997-04-13 | Paper |
| The Sublogarithmic Alternating Space World | 1997-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281504 | 1994-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281567 | 1994-11-13 | Paper |
| Exact lower time bounds for computing Boolean functions on CREW PRAMs | 1994-06-29 | Paper |
| Different Modes of Communication | 1994-03-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3993545 | 1993-01-23 | Paper |
| Relations between communication complexity classes | 1990-01-01 | Paper |
| Renaming in an asynchronous environment | 1990-01-01 | Paper |
| Early stopping in Byzantine agreement | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3787484 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3709880 | 1986-01-01 | Paper |
| Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes | 1986-01-01 | Paper |
| Coding Strings by Pairs of Strings | 1985-01-01 | Paper |
| A new solution for the Byzantine generals problem | 1985-01-01 | Paper |
| Probabilistic Parallel Algorithms for Sorting and Selection | 1985-01-01 | Paper |
| Bounds on information exchange for Byzantine agreement | 1985-01-01 | Paper |
| Two nonlinear lower bounds for on-line computations | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3311651 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334988 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334989 | 1983-01-01 | Paper |
| A fast implementation of a multidimensional storage into a tree storage | 1982-01-01 | Paper |
| On time versus space. II | 1981-01-01 | Paper |
| On alternation | 1980-01-01 | Paper |
| On alternation. II. A graph theoretic approach to determinism versus nondeterminism | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886864 | 1980-01-01 | Paper |
| Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game | 1980-01-01 | Paper |
| Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181967 | 1979-01-01 | Paper |
