Hans Ulrich Simon
According to our database1, Hans Ulrich Simon
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:
On csauthors.net:
Bibliography
2018
On the teaching complexity of linear sets.
Theor. Comput. Sci., 2018
Hierarchical design of fast Minimum Disagreement algorithms.
Theor. Comput. Sci., 2018
A lower bound on the release of differentially private integer partitions.
Inf. Process. Lett., 2018
On the Containment Problem for Linear Sets.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018
2017
Preference-based Teaching.
Journal of Machine Learning Research, 2017
Regular languages viewed from a graph-theoretic perspective.
Inf. Comput., 2017
Distinguishing pattern languages with membership examples.
Inf. Comput., 2017
On the Containment Problem for Linear Sets.
CoRR, 2017
Preference-based Teaching.
CoRR, 2017
On the Optimality of the Exponential Mechanism.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2017
Preference-based Teaching of Unions of Geometric Objects.
Proceedings of the International Conference on Algorithmic Learning Theory, 2017
2016
Order compression schemes.
Theor. Comput. Sci., 2016
Efficient computation of approximate isomorphisms between Boolean functions.
Inf. Process. Lett., 2016
Preference-based Teaching.
Proceedings of the 29th Conference on Learning Theory, 2016
2015
Complexity Analysis: Transformation Monoids of Finite Automata.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015
Open Problem: Recursive Teaching Dimension Versus VC Dimension.
Proceedings of The 28th Conference on Learning Theory, 2015
An Almost Optimal PAC Algorithm.
Proceedings of The 28th Conference on Learning Theory, 2015
On the Teaching Complexity of Linear Sets.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015
Hierarchical Design of Fast Minimum Disagreement Algorithms.
Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015
2014
Supervised learning and Co-training.
Theor. Comput. Sci., 2014
Recursive teaching dimension, VC-dimension and sample compression.
Journal of Machine Learning Research, 2014
PAC-learning in the presence of one-sided classification noise.
Ann. Math. Artif. Intell., 2014
DFA with a Bounded Activity Level.
Proceedings of the Language and Automata Theory and Applications, 2014
Randomized Response Schemes, Privacy and Usefulness.
Proceedings of the 2014 Workshop on Artificial Intelligent and Security Workshop, 2014
2013
Unlabeled Data Does Provably Help.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013
Order Compression Schemes.
Proceedings of the Algorithmic Learning Theory - 24th International Conference, 2013
2012
PAC-Learning in the Presence of One-sided Classification Noise.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012
Boolean Composition of Visual Secret Sharing Schemes.
Proceedings of the Computer Science - Theory and Applications, 2012
2011
Smart PAC-learners.
Theor. Comput. Sci., 2011
A Close Look to Margin Complexity and Related Parameters.
Proceedings of the COLT 2011, 2011
Supervised Learning and Co-training.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011
2010
One-inclusion hypergraph density revisited.
Inf. Process. Lett., 2010
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes.
Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010
2009
Special Issue: Learning Theory 2006.
J. Comput. Syst. Sci., 2009
SVM-Optimization and Steepest-Descent Line Search.
Proceedings of the COLT 2009, 2009
Smart PAC-Learners.
Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009
2008
Dimension and Margin Bounds for Reflection-invariant Kernels.
Proceedings of the 21st Annual Conference on Learning Theory, 2008
2007
Guest editors' foreword.
Theor. Comput. Sci., 2007
On the complexity of working set selection.
Theor. Comput. Sci., 2007
Introduction to the special issue on COLT 2006.
Machine Learning, 2007
General Polynomial Time Decomposition Algorithms.
Journal of Machine Learning Research, 2007
Discriminative learning can succeed where generative learning fails.
Inf. Process. Lett., 2007
A Characterization of Strong Learnability in the Statistical Query Model.
Proceedings of the STACS 2007, 2007
Stability of k -Means Clustering.
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.
Theor. Comput. Sci., 2006
Spectral Norm in Learning Theory: Some Selected Topics.
Proceedings of the Discovery Science, 9th International Conference, 2006
Spectral Norm in Learning Theory: Some Selected Topics.
Proceedings of the Algorithmic Learning Theory, 17th International Conference, 2006
2005
Inner Product Spaces for Bayesian Networks.
Journal of Machine Learning Research, 2005
Threshold circuit lower bounds on cryptographic functions.
J. Comput. Syst. Sci., 2005
Perfect Reconstruction of Black Pixels Revisited.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005
General Polynomial Time Decomposition Algorithms.
Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005
Editors' Introduction.
Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005
2004
How Many Missing Answers Can Be Tolerated by Query Learners?
Theory Comput. Syst., 2004
Bayesian Networks and Inner Product Spaces.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004
A General Convergence Theorem for the Decomposition Method.
Proceedings of the Learning Theory, 17th Annual Conference on Learning Theory, 2004
On the Complexity of Working Set Selection.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004
2003
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
Machine Learning, 2003
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography.
Combinatorics, Probability & Computing, 2003
How Many Queries Are Needed to Learn One Bit of Information?
Ann. Math. Artif. Intell., 2003
Complexity Theoretic Aspects of Some Cryptographic Functions.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003
2002
Foreword.
Theor. Comput. Sci., 2002
The consistency dimension and distribution-dependent learning from queries.
Theor. Comput. Sci., 2002
Limitations of Learning Via Embeddings in Euclidean Half Spaces.
Journal of Machine Learning Research, 2002
The Computational Complexity of Densest Region Detection.
J. Comput. Syst. Sci., 2002
How Many Missing Answers Can Be Tolerated by Query Learners?
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002
On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002
2001
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001
How Many Queries Are Needed to Learn One Bit of Information?
Proceedings of the Computational Learning Theory, 2001
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
Proceedings of the Computational Learning Theory, 2001
Limitations of Learning via Embeddings in Euclidean Half-Spaces.
Proceedings of the Computational Learning Theory, 2001
2000
Contrast-optimal k out of n secret sharing schemes in visual cryptography.
Theor. Comput. Sci., 2000
Learning Deterministic Finite Automata from Smallest Counterexamples.
SIAM J. Discrete Math., 2000
Structural Results about Exact Learning with Unspecified Attribute Values.
J. Comput. Syst. Sci., 2000
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Electronic Colloquium on Computational Complexity (ECCC), 2000
General lower bounds on the query complexity within the exact learning model.
Discrete Applied Mathematics, 2000
Construction of visual secret sharing schemes with almost optimal contrast.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Efficient Learning of Linear Perceptrons.
Proceedings of the Advances in Neural Information Processing Systems 13, 2000
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography.
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
The Computational Complexity of Densest Region Detection.
Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28, 2000
1999
Sample-Efficient Strategies for Learning in the Presence of Noise.
J. ACM, 1999
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract).
Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999
1998
On Restricted-Focus-of-Attention Learnability of Boolean Functions.
Machine Learning, 1998
Using Computational Learning Strategies as a Tool for Combinatorial Optimization.
Ann. Math. Artif. Intell., 1998
Learning Deterministic Finite Automata from Smallest Counterexamples.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998
Structural Results about Exact Learning with Unspecified Attribute Values.
Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998
1997
Bounds on the Number of Examples Needed for Learning Functions.
SIAM J. Comput., 1997
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.
Proceedings of the Computational Learning Theory, Third European Conference, 1997
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997
1996
General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts.
J. Comput. Syst. Sci., 1996
Probably Almost Bayes Decisions.
Inf. Comput., 1996
Noise-Tolerant Learning Near the Information-Theoretic Bound.
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
On Restricted-Focus-of-Attention Learnability of Boolean Functions.
Proceedings of the Ninth Annual Conference on Computational Learning Theory, 1996
1995
Robust Trainability of Single Neurons.
J. Comput. Syst. Sci., 1995
Learning decision lists and trees with equivalence-queries.
Proceedings of the Computational Learning Theory, Second European Conference, 1995
From Noise-Free to Noise-Tolerant and from On-line to Batch Learning.
Proceedings of the Eigth Annual Conference on Computational Learning Theory, 1995
1993
General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts.
Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 1993
Neural Discriminant Analysis.
Proceedings of the Algorithmic Learning Theory, 4th International Workshop, 1993
1992
On Learning Ring-Sum-Expansions.
SIAM J. Comput., 1992
Robust Trainability of Single Neurons.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992
PAB-Decisions for Boolean and Real-Valued Features.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992
1991
Neuronales Lernen auf der Basis empirischer Daten / Neural Learning Based on Empirical Data.
it - Informationstechnik, 1991
The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank.
Inf. Process. Lett., 1991
Algorithmisches Lernen auf der Basis empirischer Daten.
Proceedings of the Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 1991
Neural Control Within the BMFT-Project NERES.
Proceedings of the Verteilte Künstliche Intelligenz und kooperatives Arbeiten, 1991
Probably Almost Bayes Decisions.
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, 1991
1990
On Approximate Solutions for Combinatorial Optimization Problems.
SIAM J. Discrete Math., 1990
Separation Problems and Circular Arc Systems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1990
On the Number of Examples and Stages Needed for Learning Decision Trees.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990
On Learning Ring-Sum-Expansions.
Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990
1989
Continuous Reductions Among Combinatorial Optimization Problems.
Acta Inf., 1989
Approximation Algorithms for Channel Assignment in Cellular Radio Networks.
Proceedings of the Fundamentals of Computation Theory, 1989
1988
How Robust Is The n-Cube?
Inf. Comput., May, 1988
A Continuous Bound on the Performance of Critical-Path Schedules.
Elektronische Informationsverarbeitung und Kybernetik, 1988
1986
How Robust Is the n-Cube? (Extended Abstract)
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.
Elektronische Informationsverarbeitung und Kybernetik, 1983
The Structure of the Monoid (N, X) of Logic Circuits.
Elektronische Informationsverarbeitung und Kybernetik, 1983
Pattern Matching in Trees and Nets.
Acta Inf., 1983
A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions.
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
Information and Control, 1982
1981
Komplexitätsbetrachtungen rationaler Baum- und Netzmengen.
PhD thesis, 1981
1979
Word problems for groups and contextfree recognition.
FCT, 1979