| Publication | Date of Publication | Type |
|---|
On the optimality of the exponential mechanism
Lecture Notes in Computer Science | 2022-06-15 | Paper |
Preference-based teaching of unions of geometric objects
| 2019-01-10 | Paper |
Hierarchical design of fast minimum disagreement algorithms
Theoretical Computer Science | 2018-03-12 | Paper |
On the teaching complexity of linear sets
Theoretical Computer Science | 2018-03-12 | Paper |
A lower bound on the release of differentially private integer partitions
Information Processing Letters | 2017-10-18 | Paper |
Distinguishing pattern languages with membership examples
Information and Computation | 2017-09-28 | Paper |
Preference-based teaching
| 2017-09-27 | Paper |
Regular languages viewed from a graph-theoretic perspective
Information and Computation | 2017-03-16 | Paper |
Unlabeled data does provably help
| 2017-01-30 | Paper |
On the Teaching Complexity of Linear Sets
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Hierarchical design of fast minimum disagreement algorithms
Lecture Notes in Computer Science | 2016-11-30 | Paper |
Order compression schemes
Theoretical Computer Science | 2016-02-26 | Paper |
Efficient computation of approximate isomorphisms between Boolean functions
Information Processing Letters | 2016-01-05 | Paper |
Complexity Analysis: Transformation Monoids of Finite Automata
Developments in Language Theory | 2015-11-10 | Paper |
PAC-learning in the presence of one-sided classification~noise
Annals of Mathematics and Artificial Intelligence | 2015-02-05 | Paper |
Recursive teaching dimension, VC-dimension and sample compression
| 2014-12-08 | Paper |
DFA with a Bounded Activity Level
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Supervised learning and co-training
Theoretical Computer Science | 2014-01-13 | Paper |
Order compression schemes
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Boolean composition of visual secret sharing schemes
Computer Science – Theory and Applications | 2012-09-10 | Paper |
Supervised learning and co-training
Lecture Notes in Computer Science | 2011-10-19 | Paper |
scientific article; zbMATH DE number 5957295 (Why is no real title available?)
| 2011-10-12 | Paper |
scientific article; zbMATH DE number 5957430 (Why is no real title available?)
| 2011-10-12 | Paper |
Smart PAC-learners
Theoretical Computer Science | 2011-04-14 | Paper |
Complexity theoretic aspects of some cryptographic functions
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Recursive teaching dimension, learning complexity, and maximum classes
Lecture Notes in Computer Science | 2010-10-01 | Paper |
One-inclusion hypergraph density revisited
Information Processing Letters | 2010-09-07 | Paper |
Discriminative learning can succeed where generative learning fails
Information Processing Letters | 2010-03-24 | Paper |
Smart PAC-learners
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Spectral Norm in Learning Theory: Some Selected Topics
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Stability of k-Means Clustering
Learning Theory | 2008-01-03 | Paper |
On the complexity of working set selection
Theoretical Computer Science | 2007-09-18 | Paper |
A Characterization of Strong Learnability in the Statistical Query Model
STACS 2007 | 2007-09-03 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes
Theoretical Computer Science | 2006-03-20 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Threshold circuit lower bounds on cryptographic functions
Journal of Computer and System Sciences | 2005-08-03 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
How many missing answers can be tolerated by query learners?
Theory of Computing Systems | 2005-01-25 | Paper |
Sample-efficient strategies for learning in the presence of noise
Journal of the ACM | 2005-01-25 | Paper |
10.1162/153244303321897681
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
scientific article; zbMATH DE number 2086401 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2081103 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2076151 (Why is no real title available?)
| 2004-06-18 | Paper |
How many queries are needed to learn one bit of information?
Annals of Mathematics and Artificial Intelligence | 2003-08-21 | Paper |
scientific article; zbMATH DE number 1966630 (Why is no real title available?)
| 2003-08-18 | Paper |
scientific article; zbMATH DE number 1966611 (Why is no real title available?)
| 2003-08-18 | Paper |
Estimating the optimal margins of embeddings in Euclidean half spaces
Machine Learning | 2003-06-25 | Paper |
The consistency dimension and distribution-dependent learning from queries.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1827092 (Why is no real title available?)
| 2002-11-25 | Paper |
scientific article; zbMATH DE number 1827091 (Why is no real title available?)
| 2002-11-12 | Paper |
scientific article; zbMATH DE number 1804094 (Why is no real title available?)
| 2002-09-22 | Paper |
The computational complexity of densest region detection
Journal of Computer and System Sciences | 2002-07-04 | Paper |
scientific article; zbMATH DE number 1445313 (Why is no real title available?)
| 2001-05-28 | Paper |
General lower bounds on the query complexity within the exact learning model
Discrete Applied Mathematics | 2001-03-20 | Paper |
Learning deterministic finite automata from smallest counterexamples
SIAM Journal on Discrete Mathematics | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1512696 (Why is no real title available?)
| 2001-03-18 | Paper |
Structural results about exact learning with unspecified attribute values
Journal of Computer and System Sciences | 2001-02-18 | Paper |
Robust trainability of single neurons
Journal of Computer and System Sciences | 2000-07-04 | Paper |
scientific article; zbMATH DE number 1453030 (Why is no real title available?)
| 2000-05-25 | Paper |
scientific article; zbMATH DE number 1303603 (Why is no real title available?)
| 2000-02-09 | Paper |
scientific article; zbMATH DE number 1256729 (Why is no real title available?)
| 1999-03-01 | Paper |
Using computational learning strategies as a tool for combinatorial optimization
Annals of Mathematics and Artificial Intelligence | 1998-10-13 | Paper |
On restricted-focus-of-attention learnability of Boolean functions
Machine Learning | 1998-04-02 | Paper |
scientific article; zbMATH DE number 1088271 (Why is no real title available?)
| 1998-03-10 | Paper |
Bounds on the Number of Examples Needed for Learning Functions
SIAM Journal on Computing | 1997-05-26 | Paper |
General bounds on the number of examples needed for learning probabilistic concepts
Journal of Computer and System Sciences | 1996-12-08 | Paper |
Probably almost Bayes decisions
Information and Computation | 1996-12-01 | Paper |
scientific article; zbMATH DE number 139795 (Why is no real title available?)
| 1993-03-28 | Paper |
On Learning Ring-Sum-Expansions
SIAM Journal on Computing | 1992-06-28 | Paper |
The Vapnik-Chervonenkis dimension of decision trees with bounded rank
Information Processing Letters | 1992-06-27 | Paper |
scientific article; zbMATH DE number 17557 (Why is no real title available?)
| 1992-06-26 | Paper |
On Approximate Solutions for Combinatorial Optimization Problems
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Continuous reductions among combinatorial optimization problems
Acta Informatica | 1989-01-01 | Paper |
Worst-case analysis of heuristics for the local microcode optimization problem
Operations Research Letters | 1988-01-01 | Paper |
How robust is the n-cube?
Information and Computation | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4072371 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 3871197 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3829252 (Why is no real title available?)
| 1983-01-01 | Paper |
Pattern matching in trees and nets
Acta Informatica | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3852455 (Why is no real title available?)
| 1983-01-01 | Paper |
A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
Information and Control | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3642708 (Why is no real title available?)
| 1979-01-01 | Paper |
