Hans Ulrich Simon

Proceedings of the Algorithmic Learning Theory, 2019

2018

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Ronald Ortner

Theor. Comput. Sci., 2018

On the teaching complexity of linear sets.

[BibT_eX]

[DOI]

Ziyuan Gao

Theor. Comput. Sci., 2018

Hierarchical design of fast Minimum Disagreement algorithms.

[BibT_eX]

[DOI]

Christoph Ries

Theor. Comput. Sci., 2018

A lower bound on the release of differentially private integer partitions.

[BibT_eX]

[DOI]

Francesco Aldà

Inf. Process. Lett., 2018

On the Containment Problem for Linear Sets.

[BibT_eX]

[DOI]

Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

2017

Preference-based Teaching.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2017

Regular languages viewed from a graph-theoretic perspective.

[BibT_eX]

[DOI]

Marius Konitzer

Inf. Comput., 2017

Distinguishing pattern languages with membership examples.

[BibT_eX]

[DOI]

Inf. Comput., 2017

On the Optimality of the Exponential Mechanism.

[BibT_eX]

[DOI]

Francesco Aldà

Proceedings of the Cyber Security Cryptography and Machine Learning, 2017

Preference-based Teaching of Unions of Geometric Objects.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 2017

2016

Order compression schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Efficient computation of approximate isomorphisms between Boolean functions.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

2015

Complexity Analysis: Transformation Monoids of Finite Automata.

[BibT_eX]

[DOI]

Christian Brandl

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Open Problem: Recursive Teaching Dimension Versus VC Dimension.

[BibT_eX]

[DOI]

Proceedings of The 28th Conference on Learning Theory, 2015

An Almost Optimal PAC Algorithm.

[BibT_eX]

[DOI]

Proceedings of The 28th Conference on Learning Theory, 2015

2014

Supervised learning and Co-training.

[BibT_eX]

[DOI]

Balázs Szörényi

Theor. Comput. Sci., 2014

Recursive teaching dimension, VC-dimension and sample compression.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2014

PAC-learning in the presence of one-sided classification noise.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2014

DFA with a Bounded Activity Level.

[BibT_eX]

[DOI]

Marius Konitzer

Proceedings of the Language and Automata Theory and Applications, 2014

Randomized Response Schemes, Privacy and Usefulness.

[BibT_eX]

[DOI]

Francesco Aldà

Proceedings of the 2014 Workshop on Artificial Intelligent and Security Workshop, 2014

2013

Unlabeled Data Does Provably Help.

[BibT_eX]

[DOI]

Balázs Szörényi

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

2012

Boolean Composition of Visual Secret Sharing Schemes.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2012

2011

Smart PAC-learners.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

A Close Look to Margin Complexity and Related Parameters.

[BibT_eX]

[DOI]

Michael Kallweit

Proceedings of the COLT 2011, 2011

2010

One-inclusion hypergraph density revisited.

[BibT_eX]

[DOI]

Balázs Szörényi

Inf. Process. Lett., 2010

Recursive Teaching Dimension, Learning Complexity, and Maximum Classes.

[BibT_eX]

[DOI]

Thorsten Doliwa

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Special Issue: Learning Theory 2006.

[BibT_eX]

[DOI]

Lisa Hellerstein

J. Comput. Syst. Sci., 2009

SVM-Optimization and Steepest-Descent Line Search.

[BibT_eX]

[DOI]

Nikolas List

Proceedings of the COLT 2009, 2009

Smart PAC-Learners.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2008

Dimension and Margin Bounds for Reflection-invariant Kernels.

[BibT_eX]

[DOI]

Thorsten Doliwa

Michael Kallweit

Proceedings of the 21st Annual Conference on Learning Theory, 2008

2007

Guest editors' foreword.

[BibT_eX]

[DOI]

Etsuji Tomita

Theor. Comput. Sci., 2007

On the complexity of working set selection.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Introduction to the special issue on COLT 2006.

[BibT_eX]

[DOI]

Avrim Blum

Gábor Lugosi

Mach. Learn., 2007

General Polynomial Time Decomposition Algorithms.

[BibT_eX]

[DOI]

Nikolas List

J. Mach. Learn. Res., 2007

Discriminative learning can succeed where generative learning fails.

[BibT_eX]

[DOI]

Philip M. Long

Rocco A. Servedio

Inf. Process. Lett., 2007

A Characterization of Strong Learnability in the Statistical Query Model.

[BibT_eX]

[DOI]

Proceedings of the STACS 2007, 2007

Stability of <i>k</i> -Means Clustering.

[BibT_eX]

[DOI]

Dávid Pál

Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006

On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Spectral Norm in Learning Theory: Some Selected Topics.

[BibT_eX]

[DOI]

Proceedings of the Discovery Science, 9th International Conference, 2006

2005

Inner Product Spaces for Bayesian Networks.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2005

Threshold circuit lower bounds on cryptographic functions.

[BibT_eX]

[DOI]

Eike Kiltz

J. Comput. Syst. Sci., 2005

Perfect Reconstruction of Black Pixels Revisited.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Editors' Introduction.

[BibT_eX]

[DOI]

Sanjay Jain

Etsuji Tomita

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2004

How Many Missing Answers Can Be Tolerated by Query Learners?

[BibT_eX]

[DOI]

Theory Comput. Syst., 2004

Bayesian Networks and Inner Product Spaces.

[BibT_eX]

[DOI]

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

A General Convergence Theorem for the Decomposition Method.

[BibT_eX]

[DOI]

Nikolas List

Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004

2003

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.

[BibT_eX]

[DOI]

Mach. Learn., 2003

Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography.

[BibT_eX]

[DOI]

Matthias Krause

Comb. Probab. Comput., 2003

How Many Queries Are Needed to Learn One Bit of Information?

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2003

Complexity Theoretic Aspects of Some Cryptographic Functions.

[BibT_eX]

[DOI]

Eike Kiltz

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002

Foreword.

[BibT_eX]

[DOI]

Carl Smith

Theor. Comput. Sci., 2002

The consistency dimension and distribution-dependent learning from queries.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Limitations of Learning Via Embeddings in Euclidean Half Spaces.

[BibT_eX]

[DOI]

Nadav Eiron

J. Mach. Learn. Res., 2002

The Computational Complexity of Densest Region Detection.

[BibT_eX]

[DOI]

Nadav Eiron

J. Comput. Syst. Sci., 2002

On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution.

[BibT_eX]

[DOI]

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

How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution.

[BibT_eX]

[DOI]

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

2001

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.

[BibT_eX]

[DOI]

Matthias Krause

Satyanarayana V. Lokam

Rustam Mubarakzjanov

Niels Schmitt

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.

[BibT_eX]

[DOI]

Niels Schmitt

Proceedings of the Computational Learning Theory, 2001

2000

Contrast-optimal k out of n secret sharing schemes in visual cryptography.

[BibT_eX]

[DOI]

Thomas Hofmeister

Matthias Krause

Theor. Comput. Sci., 2000

Learning Deterministic Finite Automata from Smallest Counterexamples.

[BibT_eX]

[DOI]

Andreas Birkendorf

Andreas Böker

SIAM J. Discret. Math., 2000

Structural Results about Exact Learning with Unspecified Attribute Values.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

General lower bounds on the query complexity within the exact learning model.

[BibT_eX]

[DOI]

Norbert Klasner

Discret. Appl. Math., 2000

Construction of visual secret sharing schemes with almost optimal contrast.

[BibT_eX]

[DOI]

Christian Kuhlmann

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Efficient Learning of Linear Perceptrons.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 13, 2000

1999

Sample-Efficient Strategies for Learning in the Presence of Noise.

[BibT_eX]

[DOI]

J. ACM, 1999

The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1998

On Restricted-Focus-of-Attention Learnability of Boolean Functions.

[BibT_eX]

[DOI]

Mach. Learn., 1998

Using Computational Learning Strategies as a Tool for Combinatorial Optimization.

[BibT_eX]

[DOI]

Andreas Birkendorf

Ann. Math. Artif. Intell., 1998

1997

Bounds on the Number of Examples Needed for Learning Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, Third European Conference, 1997

1996

General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1996

Probably Almost Bayes Decisions.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Noise-Tolerant Learning Near the Information-Theoretic Bound.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

Robust Trainability of Single Neurons.

[BibT_eX]

[DOI]

Klaus-Uwe Höffgen

Kevin S. Van Horn

J. Comput. Syst. Sci., 1995

Learning decision lists and trees with equivalence-queries.

[BibT_eX]

[DOI]

Proceedings of the Computational Learning Theory, Second European Conference, 1995

From Noise-Free to Noise-Tolerant and from On-line to Batch Learning.

[BibT_eX]

[DOI]

Norbert Klasner

Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995

1993

Neural Discriminant Analysis.

[BibT_eX]

[DOI]

Jorge Ricardo Cuellar

Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993

1992

On Learning Ring-Sum-Expansions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1992

Robust Trainability of Single Neurons.

[BibT_eX]

[DOI]

Klaus-Uwe Höffgen

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

PAB-Decisions for Boolean and Real-Valued Features.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

Bemerkungen zum Schätzen von Bayesschen Diskriminantenfunktionen.

[BibT_eX]

[DOI]

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

1991

Neuronales Lernen auf der Basis empirischer Daten / Neural Learning Based on Empirical Data.

[BibT_eX]

[DOI]

it Inf. Technol., 1991

The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

Algorithmisches Lernen auf der Basis empirischer Daten.

[BibT_eX]

[DOI]

Proceedings of the Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 1991

Neural Control Within the BMFT-Project NERES.

[BibT_eX]

[DOI]

Proceedings of the Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 1991

Probably Almost Bayes Decisions.

[BibT_eX]

[DOI]

Stefan Pölt

Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991

1990

On Approximate Solutions for Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Separation Problems and Circular Arc Systems.

[BibT_eX]

[DOI]

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

On the Number of Examples and Stages Needed for Learning Decision Trees.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990

1989

Continuous Reductions Among Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Acta Informatica, 1989

Approximation Algorithms for Channel Assignment in Cellular Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1988

How Robust Is The n-Cube?

[BibT_eX]

[DOI]

Bernd Becker

Inf. Comput., May, 1988

A Continuous Bound on the Performance of Critical-Path Schedules.

[BibT_eX]

J. Inf. Process. Cybern., 1988

1986

How Robust Is the n-Cube? (Extended Abstract)

[BibT_eX]

[DOI]

Bernd Becker

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1983

Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees.

[BibT_eX]

J. Inf. Process. Cybern., 1983

The Structure of the Monoid (N, X) of Logic Circuits.

[BibT_eX]

J. Inf. Process. Cybern., 1983

Pattern Matching in Trees and Nets.

[BibT_eX]

[DOI]

Acta Informatica, 1983

A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1983

1982

A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions

[BibT_eX]

[DOI]

Inf. Control., 1982

1981

Komplexitätsbetrachtungen rationaler Baum- und Netzmengen.

[BibT_eX]

[DOI]

PhD thesis, 1981

1979

Word problems for groups and contextfree recognition.

[BibT_eX]