Rüdiger Reischuk

Theor. Comput. Sci., 2022

Dynamic Kernels for Hitting Sets and Set Packing.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

Hardness of k-anonymous microaggregation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Scalable k-anonymous Microaggregation: Exploiting the Tradeoff between Computational Complexity and Information Loss.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Security and Cryptography, 2021

Improving Time Complexity and Utility of k-anonymous Microaggregation.

[BibT_eX]

[DOI]

Proceedings of the E-Business and Telecommunications - 18th International Conference, 2021

2019

Proper learning of <i>k</i>-term DNF formulas from satisfying assignments.

[BibT_eX]

[DOI]

Matthias Lutter

J. Comput. Syst. Sci., 2019

2018

Improving Anonymization Clustering.

[BibT_eX]

[DOI]

Proceedings of the Sicherheit 2018, 2018

2017

Security levels in steganography - Insecurity does not imply detectability.

[BibT_eX]

[DOI]

Ulrich Wölfel

Theor. Comput. Sci., 2017

Proper Learning of k-term DNF Formulas from Satisfying Assignments.

[BibT_eX]

[DOI]

Matthias Lutter

Electron. Colloquium Comput. Complex., 2017

Learning Residual Alternating Automata.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

2016

Steganography Based on Pattern Languages.

[BibT_eX]

[DOI]

Sebastian Berndt

Proceedings of the Language and Automata Theory and Applications, 2016

2015

Algorithmic Learning for Steganography: Proper Learning of k-term DNF Formulas from Positive Samples.

[BibT_eX]

[DOI]

Matthias Ernst

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

2014

Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2014

2013

Grey-box steganography.

[BibT_eX]

[DOI]

Ulrich Wölfel

Theor. Comput. Sci., 2013

2011

Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121).

[BibT_eX]

[DOI]

Dagstuhl Reports, 2011

Knowledge State Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2011

Stochastic Search with Locally Clustered Targets: Learning from T Cells.

[BibT_eX]

[DOI]

Johannes Textor

Proceedings of the Artificial Immune Systems - 10th International Conference, 2011

One-Way Functions - Mind the Trap - Escape Only for the Initiated.

[BibT_eX]

[DOI]

Markus Hinkelmann

Proceedings of the Algorithms Unplugged, 2011

2009

Improving the average delay of sorting.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Knowledge States for the Caching Problem in Shared Memory Multiprocessor Systems.

[BibT_eX]

[DOI]

Wolfgang W. Bein

Lawrence L. Larmore

Int. J. Found. Comput. Sci., 2009

2008

Einweg-Funktionen: Vorsicht Falle - Rückweg nur für Eingeweihte!.

[BibT_eX]

[DOI]

Markus Hinkelmann

Proceedings of the Taschenbuch der Algorithmen, 2008

Knowledge States: A Tool for Randomized Online Algorithms.

[BibT_eX]

[DOI]

Wolfgang W. Bein

Lawrence L. Larmore

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

08381 Executive Summary - Computational Complexity of Discrete Problems.

[BibT_eX]

[DOI]

Proceedings of the Computational Complexity of Discrete Problems, 14.09. - 19.09.2008, 2008

08381 Abstracts Collection - Computational Complexity of Discrete Problems.

[BibT_eX]

[DOI]

Proceedings of the Computational Complexity of Discrete Problems, 14.09. - 19.09.2008, 2008

2007

Smoothed analysis of binary search trees.

[BibT_eX]

[DOI]

Bodo Manthey

Theor. Comput. Sci., 2007

Learning juntas in the presence of noise.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Preface.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Knowledge State Algorithms: Randomization with Limited Information

[BibT_eX]

[DOI]

Wolfgang W. Bein

Lawrence L. Larmore

CoRR, 2007

When Does Greedy Learning of Relevant Attributes Succeed?

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

2006

Foreword.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Theor. Comput. Sci., 2006

Learning a subclass of regular patterns in polynomial time.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

When Does Greedy Learning of Relevant Features Succeed? --- A Fourier-based Characterization ---.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

On the Complexity of Optimal Grammar-Based Compression.

[BibT_eX]

[DOI]

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

06111 Abstracts Collection -- Complexity of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

06111 Executive Summary -- Complexity of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Complexity of Boolean Functions, 12.03. - 17.03.2006, 2006

2005

The intractability of computing the Hamming distance.

[BibT_eX]

[DOI]

Bodo Manthey

Theor. Comput. Sci., 2005

Smoothed Analysis of the Height of Binary Search Trees

[BibT_eX]

[DOI]

Bodo Manthey

Electron. Colloquium Comput. Complex., 2005

2004

Approximating schedules for dynamic process graphs efficiently.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

A Polynomial Time Learner for a Subclass of Regular Patterns

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2004

2003

Private Computations in Networks: Topology versus Randomness.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Robust Inference of Relevant Attributes.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 14th International Conference, 2003

2002

Space Efficient Algorithms for Directed Series-Parallel Graphs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2002

Editors' Introduction.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Masayuki Numao

Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2001

Dynamic Process Graphs and the Complexity of Scheduling

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

Approximating Schedules for Dynamic Graphs Efficiently

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2001

Space Efficient Algorithms for Series-Parallel Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

2000

Can large fanin circuits perform reliable computations in the presence of faults?

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

An Average-Case Optimal One-Variable Pattern Language Learner.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

The Expressive Power and Complexity of Dynamic Process Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

The Complexity of Physical Mapping with Strict Chimerism.

[BibT_eX]

[DOI]

Stephan Weis

Proceedings of the Computing and Combinatorics, 6th Annual International Conference, 2000

Average Case Complexity of Unbounded Fanin Circuits.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999

Malign Distributions for Average Case Circuit Complexity.

[BibT_eX]

[DOI]

Inf. Comput., 1999

On small space complexity classes of stochastic Turing machines and Arthur-Merlin-games.

[BibT_eX]

[DOI]

Comput. Complex., 1999

A Complete and Tight Average-Case Analysis of Learning Monomials.

[BibT_eX]

[DOI]

Proceedings of the STACS 99, 1999

Scheduling Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the STACS 99, 1999

1998

Can Large Fanin Circuits Perform Reliable Computations in the Presence of Noise?

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1998

The complexity of broadcasting in planar and decomposable graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Learning One-Variable Pattern Languages in Linear Average Time.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997

Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996.

[BibT_eX]

[DOI]

Real Time Syst., 1997

An Average Complexity Measure that Yields Tight Hierarchies.

[BibT_eX]

[DOI]

Comput. Complex., 1997

Computational Limitations of Stochastic Turing Machines and Arthur-Merlin Games with Small Space Bounds.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

1996

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 1996

1995

The Sublogarithmic Alternating Space World

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write PRAMs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 1995

Data Transmission in Processor Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

1994

Exact Lower Time Bounds for Computing Boolean Functions on CREW PRAMs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Circuit complexity: from the worst case to the average case.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Observable Clock Synchronization (Extended Abstract).

[BibT_eX]

[DOI]

H. Raymond Strong

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

The Average Case Complexity of the Parallel Prefix Problem.

[BibT_eX]

[DOI]

Stephan Weis

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

The Complexity World below Logarithmic Space.

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993

Different Modes of Communication.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Precise Average Case Complexity.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Separating the Lower Levels of the Sublogarithmic Space Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

1992

The Complexity of Scheduling Problems with Communication Delays for Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1992

Area Efficient Methods to Increase the Reliability of Circuits.

[BibT_eX]

[DOI]

Bernd Schmeltz

Proceedings of the Data Structures and Efficient Algorithms, 1992

Über den Nutzen von Orakelfragen bei nichtdeterministischen Kommunikationsprotokollen.

[BibT_eX]

[DOI]

Proceedings of the Informatik, Festschrift zum 60. Geburtstag von Günter Hotz, 1992

1991

Reliable Computation with Noisy Circuits and Decision Trees-A General n log n Lower Bound

[BibT_eX]

[DOI]

Bernd Schmeltz

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Graph Theoretical Methods for the Design of Parallel Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

Early Stopping in Byzantine Agreement

[BibT_eX]

[DOI]

H. Raymond Strong

J. ACM, October, 1990

Renaming in an Asynchronous Environment

[BibT_eX]

[DOI]

J. ACM, July, 1990

Relations between Communication Complexity Classes.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1990

Exact Time Bounds for Computing Boolean Functions on PRAMs Without Simultaneous Writes.

[BibT_eX]

[DOI]

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Einführung in die Komplexitätstheorie

[BibT_eX]

Teubner, ISBN: 3-519-02275-3, 1990

1989

Parallele Maschinenmodelle und Komplexitätsklassen.

[BibT_eX]

[DOI]

it Inf. Technol., 1989

Area Efficient Methods to Increase the Reliability of Combinatorial Circuits.

[BibT_eX]

[DOI]

Bernd Schmeltz

Proceedings of the STACS 89, 1989

1988

On Different Modes of Communication (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

Simultaneous WRITES of parallel random access machines do not help to compute simple arithmetic functions.

[BibT_eX]

[DOI]

J. ACM, 1987

Lower Bounds for Synchronous Networks and the Advantage of Local Information.

[BibT_eX]

[DOI]

Meinolf Koshors

Proceedings of the Distributed Algorithms, 1987

Konsistenz und Fehlertoleranz in Verteilten Systemen - Das Problem der Byzantinischen Generäle.

[BibT_eX]

[DOI]

Proceedings of the GI, 1987

Achievable Cases in an Asynchronous Environment (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986

Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes.

[BibT_eX]

[DOI]

Stephen A. Cook

Cynthia Dwork

SIAM J. Comput., 1986

Parallel Machines and their Communication Theoretical Limits.

[BibT_eX]

[DOI]

Proceedings of the STACS 86, 1986

1985

Bounds on Information Exchange for Byzantine Agreement

[BibT_eX]

[DOI]

J. ACM, January, 1985

Probabilistic Parallel Algorithms for Sorting and Selection.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

A New Solution for the Byzantine Generals Problem

[BibT_eX]

[DOI]

Friedhelm Meyer auf der Heide

Inf. Control., 1985

1984

Two Nonlinear Lower Bounds for On-Line Computations

[BibT_eX]

[DOI]

Inf. Control., 1984

On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication

[BibT_eX]

[DOI]

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Two Nonlinear Lower Bounds

[BibT_eX]

[DOI]

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

A New Solution for the Byzantine Generals Problem (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

1982

A Fast Implementation of a Multidimensional Storage Into a Tree Storage.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

'Eventual' Is Earlier than 'Immediate'

[BibT_eX]

[DOI]

H. Raymond Strong

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981

On Time versus Space II. (Turing Machines).

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

A Fast Probabilistic Parallel Sorting Algorithm

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game.

[BibT_eX]

[DOI]

J. ACM, 1980

On Alternation II. A Graph Theoretic Approach to Determinism Versus Nondeterminism.

[BibT_eX]

[DOI]

Acta Informatica, 1980

On Alternation.

[BibT_eX]

[DOI]

Ernst-Jürgen Prauß

Acta Informatica, 1980

1979

Beziehungen zwischen Rechenzeit, Speicherplatz und Speicherstruktur.

[BibT_eX]

[DOI]

PhD thesis, 1979

A Graph Theoretic Approach to Determinism versus Non-Determinism.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

On Time versus Space II

[BibT_eX]

[DOI]

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

On Alternation (Preliminary Version)

[BibT_eX]

[DOI]

Ernst-Jürgen Prauß