| Publication | Date of Publication | Type |
|---|
| Dynamic kernels for hitting sets and set packing | 2024-02-12 | Paper |
The complexity of broadcasting in planar and decomposable graphs
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Data transmission in processor networks
Distributed Algorithms | 2023-12-01 | Paper |
The complexity of scheduling problems with communication delays for trees
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Learning residual alternating automata
Information and Computation | 2022-12-08 | Paper |
Dynamic kernels for hitting sets and set packing
Algorithmica | 2022-10-27 | Paper |
Area efficient methods to increase the reliability of combinatorial circuits
STACS 89 | 2022-08-16 | Paper |
The kangaroo problem
Theoretical Computer Science | 2021-12-01 | Paper |
Hardness of \(k\)-anonymous microaggregation
Discrete Applied Mathematics | 2021-09-15 | Paper |
Proper learning of \(k\)-term DNF formulas from satisfying assignments
Journal of Computer and System Sciences | 2019-08-30 | Paper |
The average case complexity of the parallel prefix problem
Automata, Languages and Programming | 2019-04-29 | Paper |
Malign distributions for average case circuit complexity
STACS 95 | 2017-12-04 | Paper |
Observable clock synchronization extended abstract
Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
Security levels in steganography -- insecurity does not imply detectability
Theoretical Computer Science | 2017-09-05 | Paper |
Circuit complexity: from the worst case to the average case
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Steganography based on pattern languages
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Algorithmic learning for steganography: proper learning of k-term DNF formulas from positive samples
Algorithms and Computation | 2016-01-11 | Paper |
Grey-box steganography
Theoretical Computer Science | 2014-01-16 | Paper |
Grey-box steganography
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Knowledge state algorithms
Algorithmica | 2011-06-30 | Paper |
Robust inference of relevant attributes
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Learning a subclass of regular patterns in polynomial time
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2009-08-07 | Paper |
KNOWLEDGE STATES FOR THE CACHING PROBLEM IN SHARED MEMORY MULTIPROCESSOR SYSTEMS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
Improving the average delay of sorting
Theoretical Computer Science | 2009-03-20 | Paper |
When Does Greedy Learning of Relevant Attributes Succeed?
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Improving the Average Delay of Sorting
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Learning juntas in the presence of noise
Theoretical Computer Science | 2007-09-28 | Paper |
Smoothed analysis of binary search trees
Theoretical Computer Science | 2007-07-09 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Approximating schedules for dynamic process graphs efficiently
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Learning a subclass of regular patterns in polynomial time
Theoretical Computer Science | 2007-01-09 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Space efficient algorithms for directed series–parallel graphs
Journal of Algorithms | 2006-10-05 | Paper |
The intractability of computing the Hamming distance
Theoretical Computer Science | 2005-06-30 | Paper |
| scientific article; zbMATH DE number 1966600 (Why is no real title available?) | 2003-08-18 | Paper |
| scientific article; zbMATH DE number 1962807 (Why is no real title available?) | 2003-08-11 | Paper |
Malign distributions for average case circuit complexity.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1696537 (Why is no real title available?) | 2002-07-09 | Paper |
| scientific article; zbMATH DE number 1696654 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1689046 (Why is no real title available?) | 2002-01-09 | Paper |
On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games
Computational Complexity | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1511697 (Why is no real title available?) | 2000-09-27 | Paper |
An average-case optimal one-variable pattern language learner
Journal of Computer and System Sciences | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1361470 (Why is no real title available?) | 2000-02-01 | Paper |
| scientific article; zbMATH DE number 1379106 (Why is no real title available?) | 1999-12-15 | Paper |
The complexity of broadcasting in planar and decomposable graphs
Discrete Applied Mathematics | 1998-12-02 | Paper |
| scientific article; zbMATH DE number 1216160 (Why is no real title available?) | 1998-10-29 | Paper |
| scientific article; zbMATH DE number 1072535 (Why is no real title available?) | 1998-01-07 | Paper |
| scientific article; zbMATH DE number 1088262 (Why is no real title available?) | 1997-11-17 | Paper |
An average complexity measure that yields tight hierarchies
Computational Complexity | 1997-08-17 | Paper |
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines
SIAM Journal on Computing | 1997-06-09 | Paper |
| scientific article; zbMATH DE number 953280 (Why is no real title available?) | 1997-04-13 | Paper |
The Sublogarithmic Alternating Space World
SIAM Journal on Computing | 1997-03-03 | Paper |
| scientific article; zbMATH DE number 512811 (Why is no real title available?) | 1994-11-13 | Paper |
| scientific article; zbMATH DE number 512870 (Why is no real title available?) | 1994-11-13 | Paper |
Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences | 1994-06-29 | Paper |
Different Modes of Communication
SIAM Journal on Computing | 1994-03-13 | Paper |
| scientific article; zbMATH DE number 44418 (Why is no real title available?) | 1993-01-23 | Paper |
Renaming in an asynchronous environment
Journal of the ACM | 1990-01-01 | Paper |
Early stopping in Byzantine agreement
Journal of the ACM | 1990-01-01 | Paper |
Relations between communication complexity classes
Journal of Computer and System Sciences | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4050994 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3938553 (Why is no real title available?) | 1986-01-01 | Paper |
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
SIAM Journal on Computing | 1986-01-01 | Paper |
Coding Strings by Pairs of Strings
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
A new solution for the Byzantine generals problem
Information and Control | 1985-01-01 | Paper |
Probabilistic Parallel Algorithms for Sorting and Selection
SIAM Journal on Computing | 1985-01-01 | Paper |
Bounds on information exchange for Byzantine agreement
Journal of the ACM | 1985-01-01 | Paper |
Two nonlinear lower bounds for on-line computations
Information and Control | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3841220 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3868616 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3868617 (Why is no real title available?) | 1983-01-01 | Paper |
A fast implementation of a multidimensional storage into a tree storage
Theoretical Computer Science | 1982-01-01 | Paper |
On time versus space. II
Journal of Computer and System Sciences | 1981-01-01 | Paper |
On alternation
Acta Informatica | 1980-01-01 | Paper |
On alternation. II. A graph theoretic approach to determinism versus nondeterminism
Acta Informatica | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3692650 (Why is no real title available?) | 1980-01-01 | Paper |
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game
Journal of the ACM | 1980-01-01 | Paper |
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game
Journal of the ACM | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3619319 (Why is no real title available?) | 1979-01-01 | Paper |
