| Publication | Date of Publication | Type |
|---|
| Corrigendum to: ``Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework | 2023-07-26 | Paper |
| An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm | 2023-03-29 | Paper |
| Learning residual alternating automata | 2022-12-08 | Paper |
| Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes | 2022-11-09 | Paper |
| The generic combinatorial algorithm for image matching with classes of projective transformations | 2020-12-15 | Paper |
| On the universal steganography of optimal rate | 2020-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111755 | 2020-05-27 | Paper |
| Proper learning of \(k\)-term DNF formulas from satisfying assignments | 2019-08-30 | Paper |
| Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework | 2019-08-28 | Paper |
| On the gold standard for security of universal steganography | 2018-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636498 | 2018-04-19 | Paper |
| Security levels in steganography -- insecurity does not imply detectability | 2017-09-05 | Paper |
| Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples | 2016-01-11 | Paper |
| A new upper bound for the traveling salesman problem in cubic graphs | 2014-07-07 | Paper |
| Grey-box steganography | 2014-01-16 | Paper |
| Grey-Box Steganography | 2011-07-01 | Paper |
| New complexity bounds for image matching under rotation and scaling | 2011-05-03 | Paper |
| Privacy in non-private environments | 2011-04-01 | Paper |
| Fundamentals of Computation Theory | 2010-04-20 | Paper |
| A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation | 2009-11-18 | Paper |
| New lower and upper bounds for the competitive ratio of transmission protocols | 2009-07-09 | Paper |
| New Complexity Bounds for Image Matching under Rotation and Scaling | 2009-07-07 | Paper |
| Improving the average delay of sorting | 2009-03-20 | Paper |
| Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations | 2009-02-03 | Paper |
| Multiparty Computations in Non-private Environments | 2009-01-22 | Paper |
| Susceptible Two-Party Quantum Computations | 2009-01-09 | Paper |
| Two-Dimensional Pattern Matching with Combined Scaling and Rotation | 2008-06-17 | Paper |
| Provably Secure Steganography and the Complexity of Sampling | 2008-04-24 | Paper |
| Revealing Additional Information in Two-Party Computations | 2008-03-18 | Paper |
| Improving the Average Delay of Sorting | 2007-11-13 | Paper |
| On the Complexity of Affine Image Matching | 2007-09-03 | Paper |
| Approximating schedules for dynamic process graphs efficiently | 2007-04-26 | Paper |
| Private computation: \(k\)-connected versus 1-connected networks | 2006-11-03 | Paper |
| Space efficient algorithms for directed series–parallel graphs | 2006-10-05 | Paper |
| Privacy in Non-private Environments | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737163 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474122 | 2004-08-04 | Paper |
| The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418642 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409119 | 2003-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766685 | 2002-07-09 | 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/Q4699288 | 2000-02-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4359462 | 1998-01-07 | Paper |
| The Sublogarithmic Alternating Space World | 1997-03-03 | Paper |
| On the power of 1-tape off-line ATMs running in a bounded number of reversals | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281504 | 1994-11-13 | Paper |
| On the relationship between deterministic time and deterministic reversal | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974874 | 1992-06-26 | Paper |
| Reversal Complexity Classes for Alternating Turing Machines | 1990-01-01 | Paper |
| Fast Simulations of Time-Bounded One-Tape Turing Machines by Space-Bounded Ones | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3809270 | 1988-01-01 | Paper |
| Alternating real-time computations | 1988-01-01 | Paper |
| On reversal bounded alternating Turing machines | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723715 | 1986-01-01 | Paper |
