| On the Containment Problem for Linear Sets. | 0 | 0.34 | 2018 |
| On the Teaching Complexity of Linear Sets. | 0 | 0.34 | 2018 |
| Distinguishing pattern languages with membership examples. | 3 | 0.41 | 2017 |
| Preference-based Teaching of Unions of Geometric Objects. | 0 | 0.34 | 2017 |
| Regular languages viewed from a graph-theoretic perspective. | 0 | 0.34 | 2017 |
| Efficient computation of approximate isomorphisms between Boolean functions. | 0 | 0.34 | 2016 |
| An Almost Optimal PAC Algorithm | 4 | 0.46 | 2015 |
| Complexity Analysis: Transformation Monoids Of Finite Automata | 3 | 0.58 | 2015 |
| Open Problem: Recursive Teaching Dimension Versus VC Dimension | 4 | 0.45 | 2015 |
| A Close Look to Margin Complexity and Related Parameters. | 5 | 0.41 | 2011 |
| SVM-Optimization and Steepest-Descent Line Search | 13 | 10.60 | 2009 |
| Dimension and Margin Bounds for Reflection-invariant Kernels | 0 | 0.34 | 2008 |
| Introduction to the special issue on COLT 2006. | 0 | 0.34 | 2007 |
| Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings | 40 | 5.07 | 2006 |
| Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings | 34 | 4.20 | 2005 |
| How Many Missing Answers Can Be Tolerated by Query Learners? | 0 | 0.34 | 2004 |
| Bayesian Networks and Inner Product Spaces | 1 | 0.35 | 2004 |
| A General Convergence Theorem for the Decomposition Method | 18 | 3.33 | 2004 |
| How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution | 4 | 0.71 | 2002 |
| On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution | 3 | 1.64 | 2002 |
| The consistency dimension and distribution-dependent learning from queries | 12 | 1.12 | 2002 |
| How Many Missing Answers Can Be Tolerated by Query Learners? | 2 | 0.36 | 2002 |
| Limitations of Learning via Embeddings in Euclidean Half-Spaces | 43 | 5.37 | 2001 |
| Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces | 24 | 6.32 | 2001 |
| Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity | 45 | 2.73 | 2001 |
| How Many Queries Are Needed to Learn One Bit of Information? | 1 | 0.37 | 2001 |
| Contrast-optimal k out of n secret sharing schemes in visual cryptography | 50 | 7.72 | 2000 |
| Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography | 21 | 1.51 | 2000 |
| The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract) | 6 | 0.68 | 1999 |
| Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings | 18 | 5.62 | 1999 |
| On restricted-focus-of-attention learnability of Boolean functions | 13 | 0.68 | 1998 |
| Bounds on the number of examples needed for learning functions | 7 | 8.32 | 1997 |
| Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise | 1 | 0.41 | 1997 |
| Learning decision lists and trees with equivalence-queries | 17 | 0.91 | 1995 |
| Neural Discriminant Analysis | 0 | 0.34 | 1993 |
| Algorithmisches Lernen auf der Basis empirischer Daten | 1 | 0.37 | 1991 |
| Neural Control Within the BMFT-Project NERES | 1 | 0.63 | 1991 |
| On Approximate Solutions For Combinatorial Optimization Problems | 52 | 10.42 | 1990 |
| Approximation Algorithms for Channel Assignment in Cellular Radio Networks | 3 | 1.78 | 1989 |
| How robust is the n-cube? | 78 | 11.58 | 1988 |
| How Robust Is the n-Cube? (Extended Abstract) | 0 | 0.34 | 1986 |
| Pattern matching in trees and nets | 0 | 0.34 | 1983 |
| The Structure of the Monoid (N, X) of Logic Circuits | 0 | 0.34 | 1983 |
| A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions | 21 | 2.17 | 1983 |
| Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees | 0 | 0.34 | 1983 |
| A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions | 6 | 1.41 | 1982 |
| Word problems for groups and contextfree recognition | 13 | 1.43 | 1979 |
