| Publication | Date of Publication | Type |
|---|
| On the Optimality of the Exponential Mechanism | 2022-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645644 | 2019-01-10 | Paper |
| Hierarchical design of fast minimum disagreement algorithms | 2018-03-12 | Paper |
| On the teaching complexity of linear sets | 2018-03-12 | Paper |
| A lower bound on the release of differentially private integer partitions | 2017-10-18 | Paper |
| Distinguishing pattern languages with membership examples | 2017-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5361292 | 2017-09-27 | Paper |
| Regular languages viewed from a graph-theoretic perspective | 2017-03-16 | Paper |
| Unlabeled Data Does Provably Help | 2017-01-30 | Paper |
| On the Teaching Complexity of Linear Sets | 2016-11-30 | Paper |
| Hierarchical Design of Fast Minimum Disagreement Algorithms | 2016-11-30 | Paper |
| Order compression schemes | 2016-02-26 | Paper |
| Efficient computation of approximate isomorphisms between Boolean functions | 2016-01-05 | Paper |
| Complexity Analysis: Transformation Monoids of Finite Automata | 2015-11-10 | Paper |
| PAC-learning in the presence of one-sided classification~noise | 2015-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934114 | 2014-12-08 | Paper |
| DFA with a Bounded Activity Level | 2014-03-31 | Paper |
| Supervised learning and co-training | 2014-01-13 | Paper |
| Order Compression Schemes | 2013-11-06 | Paper |
| Boolean Composition of Visual Secret Sharing Schemes | 2012-09-10 | Paper |
| Supervised Learning and Co-training | 2011-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093301 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174081 | 2011-10-12 | Paper |
| Smart PAC-learners | 2011-04-14 | Paper |
| Complexity Theoretic Aspects of Some Cryptographic Functions | 2011-03-18 | Paper |
| Recursive Teaching Dimension, Learning Complexity, and Maximum Classes | 2010-10-01 | Paper |
| One-inclusion hypergraph density revisited | 2010-09-07 | Paper |
| Discriminative learning can succeed where generative learning fails | 2010-03-24 | Paper |
| Smart PAC-Learners | 2009-12-01 | Paper |
| Spectral Norm in Learning Theory: Some Selected Topics | 2008-09-04 | Paper |
| Stability of k-Means Clustering | 2008-01-03 | Paper |
| On the complexity of working set selection | 2007-09-18 | Paper |
| A Characterization of Strong Learnability in the Statistical Query Model | 2007-09-03 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes | 2006-03-20 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| Threshold circuit lower bounds on cryptographic functions | 2005-08-03 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| How many missing answers can be tolerated by query learners? | 2005-01-25 | Paper |
| Sample-efficient strategies for learning in the presence of noise | 2005-01-25 | Paper |
| 10.1162/153244303321897681 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736856 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474216 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471153 | 2004-06-18 | Paper |
| How many queries are needed to learn one bit of information? | 2003-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420745 | 2003-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4420764 | 2003-08-18 | Paper |
| Estimating the optimal margins of embeddings in Euclidean half spaces | 2003-06-25 | Paper |
| The consistency dimension and distribution-dependent learning from queries. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4781230 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4781229 | 2002-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148796 | 2002-09-22 | Paper |
| The computational complexity of densest region detection | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952626 | 2001-05-28 | Paper |
| General lower bounds on the query complexity within the exact learning model | 2001-03-20 | Paper |
| Learning Deterministic Finite Automata from Smallest Counterexamples | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4508385 | 2001-03-18 | Paper |
| Structural results about exact learning with unspecified attribute values | 2001-02-18 | Paper |
| Robust trainability of single neurons | 2000-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955302 | 2000-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250229 | 2000-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4228464 | 1999-03-01 | Paper |
| Using computational learning strategies as a tool for combinatorial optimization | 1998-10-13 | Paper |
| On restricted-focus-of-attention learnability of Boolean functions | 1998-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364587 | 1998-03-10 | Paper |
| Bounds on the Number of Examples Needed for Learning Functions | 1997-05-26 | Paper |
| General bounds on the number of examples needed for learning probabilistic concepts | 1996-12-08 | Paper |
| Probably almost Bayes decisions | 1996-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028120 | 1993-03-28 | Paper |
| On Learning Ring-Sum-Expansions | 1992-06-28 | Paper |
| The Vapnik-Chervonenkis dimension of decision trees with bounded rank | 1992-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974882 | 1992-06-26 | Paper |
| On Approximate Solutions for Combinatorial Optimization Problems | 1990-01-01 | Paper |
| Continuous reductions among combinatorial optimization problems | 1989-01-01 | Paper |
| How robust is the n-cube? | 1988-01-01 | Paper |
| Worst-case analysis of heuristics for the local microcode optimization problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804184 | 1988-01-01 | Paper |
| Pattern matching in trees and nets | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3321490 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338110 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3674058 | 1983-01-01 | Paper |
| A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048248 | 1979-01-01 | Paper |
