Word problems for groups and contextfree recognition. - Hans Ulrich Simon (FCT, 1979)

Komplexitätsbetrachtungen rationaler Baum- und Netzmengen. - Hans Ulrich Simon (1981)

A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions - Hans Ulrich Simon (Inf. Control., 1982)

A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions. - Hans Ulrich Simon (FCT, 1983)

Pattern Matching in Trees and Nets. - Hans Ulrich Simon (Acta Informatica, 1983)

The Structure of the Monoid (N, X) of Logic Circuits. - Hans Ulrich Simon (J. Inf. Process. Cybern., 1983)

Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees. - Hans Ulrich Simon (J. Inf. Process. Cybern., 1983)

How Robust Is the n-Cube? (Extended Abstract) - Bernd Becker 001; Hans Ulrich Simon (FOCS, 1986)

A Continuous Bound on the Performance of Critical-Path Schedules. - Hans Ulrich Simon (J. Inf. Process. Cybern., 1988)

How Robust Is The n-Cube? - Bernd Becker 001; Hans Ulrich Simon (Inf. Comput., 1988)

Approximation Algorithms for Channel Assignment in Cellular Radio Networks. - Hans Ulrich Simon (FCT, 1989)

Continuous Reductions Among Combinatorial Optimization Problems. - Hans Ulrich Simon (Acta Informatica, 1989)

On the Number of Examples and Stages Needed for Learning Decision Trees. - Hans Ulrich Simon (COLT, 1990)

Separation Problems and Circular Arc Systems. - Paul Fischer; Hans Ulrich Simon (WG, 1990)

On Approximate Solutions for Combinatorial Optimization Problems. - Hans Ulrich Simon (SIAM J. Discret. Math., 1990)

Probably Almost Bayes Decisions. - Paul Fischer; Stefan Pölt; Hans Ulrich Simon (COLT, 1991)

Neural Control Within the BMFT-Project NERES. - Bernd Schürmann; Gerd Hirzinger; Daniel Hernández 001; Hans Ulrich Simon; Heidi Hackbarth (Wissensbasierte Systeme, 1991)

Algorithmisches Lernen auf der Basis empirischer Daten. - Hans Ulrich Simon (Wissensbasierte Systeme, 1991)

The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank. - Hans Ulrich Simon (Inf. Process. Lett., 1991)

Neuronales Lernen auf der Basis empirischer Daten / Neural Learning Based on Empirical Data. - Hans Ulrich Simon (it Inf. Technol., 1991)

Bemerkungen zum Schätzen von Bayesschen Diskriminantenfunktionen. - Hans Ulrich Simon (Informatik, 1992)

PAB-Decisions for Boolean and Real-Valued Features. - Svetlana Anoulova; Paul Fischer; Stefan Pölt; Hans Ulrich Simon (COLT, 1992)

Robust Trainability of Single Neurons. - Klaus-Uwe Höffgen; Hans Ulrich Simon (COLT, 1992)

On Learning Ring-Sum-Expansions. - Paul Fischer; Hans Ulrich Simon (SIAM J. Comput., 1992)

Neural Discriminant Analysis. - Jorge Ricardo Cuellar; Hans Ulrich Simon (ALT, 1993)

From Noise-Free to Noise-Tolerant and from On-line to Batch Learning. - Norbert Klasner; Hans Ulrich Simon (COLT, 1995)

Learning decision lists and trees with equivalence-queries. - Hans Ulrich Simon (EuroCOLT, 1995)

Robust Trainability of Single Neurons. - Klaus-Uwe Höffgen; Hans Ulrich Simon; Kevin S. Van Horn (J. Comput. Syst. Sci., 1995)

Noise-Tolerant Learning Near the Information-Theoretic Bound. - Nicolò Cesa-Bianchi; Eli Dichterman; Paul Fischer; Hans Ulrich Simon (STOC, 1996)

Probably Almost Bayes Decisions. - Svetlana Anoulova; Paul Fischer; Stefan Pölt; Hans Ulrich Simon (Inf. Comput., 1996)

General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. - Hans Ulrich Simon (J. Comput. Syst. Sci., 1996)

Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. - Nicolò Cesa-Bianchi; Paul Fischer; Eli Shamir 001; Hans Ulrich Simon (EuroCOLT, 1997)

Bounds on the Number of Examples Needed for Learning Functions. - Hans Ulrich Simon (SIAM J. Comput., 1997)

Using Computational Learning Strategies as a Tool for Combinatorial Optimization. - Andreas Birkendorf; Hans Ulrich Simon (Ann. Math. Artif. Intell., 1998)

On Restricted-Focus-of-Attention Learnability of Boolean Functions. - Andreas Birkendorf; Eli Dichterman; Jeffrey C. Jackson; Norbert Klasner; Hans Ulrich Simon (Mach. Learn., 1998)

The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). - José L. Balcázar; Jorge Castro; David Guijarro; Hans Ulrich Simon (ALT, 1999)

Sample-Efficient Strategies for Learning in the Presence of Noise. - Nicolò Cesa-Bianchi; Eli Dichterman; Paul Fischer; Eli Shamir 001; Hans Ulrich Simon (J. ACM, 1999)

Efficient Learning of Linear Perceptrons. - Shai Ben-David; Hans Ulrich Simon (NIPS, 2000)

Construction of visual secret sharing schemes with almost optimal contrast. - Christian Kuhlmann 001; Hans Ulrich Simon (SODA, 2000)

General lower bounds on the query complexity within the exact learning model. - Norbert Klasner; Hans Ulrich Simon (Discret. Appl. Math., 2000)

Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography - Matthias Krause 001; Hans Ulrich Simon (Electron. Colloquium Comput. Complex., 2000)

Structural Results about Exact Learning with Unspecified Attribute Values. - Andreas Birkendorf; Norbert Klasner; Christian Kuhlmann 001; Hans Ulrich Simon (J. Comput. Syst. Sci., 2000)

Learning Deterministic Finite Automata from Smallest Counterexamples. - Andreas Birkendorf; Andreas Böker; Hans Ulrich Simon (SIAM J. Discret. Math., 2000)

Contrast-optimal k out of n secret sharing schemes in visual cryptography. - Thomas Hofmeister; Matthias Krause 001; Hans Ulrich Simon (Theor. Comput. Sci., 2000)

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. - Jürgen Forster; Niels Schmitt; Hans Ulrich Simon (COLT/EuroCOLT, 2001)

Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. - Jürgen Forster; Matthias Krause 001; Satyanarayana V. Lokam; Rustam Mubarakzjanov; Niels Schmitt; Hans Ulrich Simon (FSTTCS, 2001)

How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. - Dietrich Braess; Jürgen Forster; Tomas Sauer; Hans Ulrich Simon (ALT, 2002)

On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution. - Jürgen Forster; Hans Ulrich Simon (ALT, 2002)

The Computational Complexity of Densest Region Detection. - Shai Ben-David; Nadav Eiron; Hans Ulrich Simon (J. Comput. Syst. Sci., 2002)

Limitations of Learning Via Embeddings in Euclidean Half Spaces. - Shai Ben-David; Nadav Eiron; Hans Ulrich Simon (J. Mach. Learn. Res., 2002)

The consistency dimension and distribution-dependent learning from queries. - José L. Balcázar; Jorge Castro; David Guijarro; Hans Ulrich Simon (Theor. Comput. Sci., 2002)

Foreword. - Paul Fischer; Hans Ulrich Simon; Carl Smith (Theor. Comput. Sci., 2002)

Complexity Theoretic Aspects of Some Cryptographic Functions. - Eike Kiltz; Hans Ulrich Simon (COCOON, 2003)

How Many Queries Are Needed to Learn One Bit of Information? - Hans Ulrich Simon (Ann. Math. Artif. Intell., 2003)

Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. - Jürgen Forster; Niels Schmitt; Hans Ulrich Simon; Thorsten Suttorp (Mach. Learn., 2003)

A General Convergence Theorem for the Decomposition Method. - Nikolas List; Hans Ulrich Simon (COLT, 2004)

Bayesian Networks and Inner Product Spaces. - Atsuyoshi Nakamura; Michael Schmitt 001; Niels Schmitt; Hans Ulrich Simon (COLT, 2004)

How Many Missing Answers Can Be Tolerated by Query Learners? - Hans Ulrich Simon (Theory Comput. Syst., 2004)

Editors' Introduction. - Sanjay Jain 001; Hans Ulrich Simon; Etsuji Tomita (ALT, 2005)

Perfect Reconstruction of Black Pixels Revisited. - Hans Ulrich Simon (FCT, 2005)

Threshold circuit lower bounds on cryptographic functions. - Eike Kiltz; Hans Ulrich Simon (J. Comput. Syst. Sci., 2005)

Inner Product Spaces for Bayesian Networks. - Atsuyoshi Nakamura; Michael Schmitt 001; Niels Schmitt; Hans Ulrich Simon (J. Mach. Learn. Res., 2005)

Spectral Norm in Learning Theory: Some Selected Topics. - Hans Ulrich Simon (ALT, 2006)

On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. - Jürgen Forster; Hans Ulrich Simon (Theor. Comput. Sci., 2006)

Stability of k -Means Clustering. - Shai Ben-David; Dávid Pál; Hans Ulrich Simon (COLT, 2007)

A Characterization of Strong Learnability in the Statistical Query Model. - Hans Ulrich Simon (STACS, 2007)

Discriminative learning can succeed where generative learning fails. - Philip M. Long; Rocco A. Servedio; Hans Ulrich Simon (Inf. Process. Lett., 2007)

General Polynomial Time Decomposition Algorithms. - Nikolas List; Hans Ulrich Simon (J. Mach. Learn. Res., 2007)

Introduction to the special issue on COLT 2006. - Avrim Blum; Gábor Lugosi; Hans Ulrich Simon (Mach. Learn., 2007)

On the complexity of working set selection. - Hans Ulrich Simon (Theor. Comput. Sci., 2007)

Guest editors' foreword. - Hans Ulrich Simon; Etsuji Tomita (Theor. Comput. Sci., 2007)

Dimension and Margin Bounds for Reflection-invariant Kernels. - Thorsten Doliwa; Michael Kallweit; Hans Ulrich Simon (COLT, 2008)

Smart PAC-Learners. - Hans Ulrich Simon (ALT, 2009)

SVM-Optimization and Steepest-Descent Line Search. - Hans Ulrich Simon; Nikolas List (COLT, 2009)

Special Issue: Learning Theory 2006. - Lisa Hellerstein; Hans Ulrich Simon (J. Comput. Syst. Sci., 2009)

Recursive Teaching Dimension, Learning Complexity, and Maximum Classes. - Thorsten Doliwa; Hans Ulrich Simon; Sandra Zilles (ALT, 2010)

One-inclusion hypergraph density revisited. - Hans Ulrich Simon; Balázs Szörényi (Inf. Process. Lett., 2010)

A Close Look to Margin Complexity and Related Parameters. - Michael Kallweit; Hans Ulrich Simon (COLT, 2011)

Smart PAC-learners. - Malte Darnstädt; Hans Ulrich Simon (Theor. Comput. Sci., 2011)

Boolean Composition of Visual Secret Sharing Schemes. - Hans Ulrich Simon (CSR, 2012)

Unlabeled Data Does Provably Help. - Malte Darnstädt; Hans Ulrich Simon; Balázs Szörényi (STACS, 2013)

Randomized Response Schemes, Privacy and Usefulness. - Francesco Aldà; Hans Ulrich Simon (AISec@CCS, 2014)

DFA with a Bounded Activity Level. - Marius Konitzer; Hans Ulrich Simon (LATA, 2014)

PAC-learning in the presence of one-sided classification noise. - Hans Ulrich Simon (Ann. Math. Artif. Intell., 2014)

Recursive teaching dimension, VC-dimension and sample compression. - Thorsten Doliwa; Gaojian Fan; Hans Ulrich Simon; Sandra Zilles (J. Mach. Learn. Res., 2014)

Supervised learning and Co-training. - Malte Darnstädt; Hans Ulrich Simon; Balázs Szörényi (Theor. Comput. Sci., 2014)

An Almost Optimal PAC Algorithm. - Hans Ulrich Simon (COLT, 2015)

Open Problem: Recursive Teaching Dimension Versus VC Dimension. - Hans Ulrich Simon; Sandra Zilles (COLT, 2015)

Complexity Analysis: Transformation Monoids of Finite Automata. - Christian Brandl; Hans Ulrich Simon (DLT, 2015)

Efficient computation of approximate isomorphisms between Boolean functions. - Hans Ulrich Simon (Inf. Process. Lett., 2016)

Order compression schemes. - Malte Darnstädt; Thorsten Kiss; Hans Ulrich Simon; Sandra Zilles (Theor. Comput. Sci., 2016)

Preference-based Teaching of Unions of Geometric Objects. - Ziyuan Gao; David G. Kirkpatrick; Christoph Ries; Hans Ulrich Simon; Sandra Zilles (ALT, 2017)

On the Optimality of the Exponential Mechanism. - Francesco Aldà; Hans Ulrich Simon (CSCML, 2017)

Distinguishing pattern languages with membership examples. - Ziyuan Gao; Zeinab Mazadi; Regan Meloche; Hans Ulrich Simon; Sandra Zilles (Inf. Comput., 2017)

Regular languages viewed from a graph-theoretic perspective. - Marius Konitzer; Hans Ulrich Simon (Inf. Comput., 2017)

Preference-based Teaching. - Ziyuan Gao; Christoph Ries; Hans Ulrich Simon; Sandra Zilles (J. Mach. Learn. Res., 2017)

On the Containment Problem for Linear Sets. - Hans Ulrich Simon (STACS, 2018)

A lower bound on the release of differentially private integer partitions. - Francesco Aldà; Hans Ulrich Simon (Inf. Process. Lett., 2018)

Hierarchical design of fast Minimum Disagreement algorithms. - Malte Darnstädt; Christoph Ries; Hans Ulrich Simon (Theor. Comput. Sci., 2018)

On the teaching complexity of linear sets. - Ziyuan Gao; Hans Ulrich Simon; Sandra Zilles (Theor. Comput. Sci., 2018)

Guest Editors' Foreword. - Ronald Ortner; Hans Ulrich Simon (Theor. Comput. Sci., 2018)

Optimal Collusion-Free Teaching. - David G. Kirkpatrick; Hans Ulrich Simon; Sandra Zilles (ALT, 2019)

On Batch Teaching with Sample Complexity Bounded by VCD. - Farnam Mansouri; Hans Simon 001; Adish Singla; Sandra Zilles (NeurIPS, 2022)

Minimum Tournaments with the Strong Sk-Property and Implications for Teaching. - Hans Ulrich Simon (CoRR, 2022)

Tournaments, Johnson Graphs and NC-Teaching. - Hans Ulrich Simon (ALT, 2023)

Primal and dual combinatorial dimensions. - Pieter Kleer; Hans Simon 001 (Discret. Appl. Math., 2023)

On Batch Teaching Without Collusion. - Shaun M. Fallat; David G. Kirkpatrick; Hans Ulrich Simon; Abolghasem Soltani; Sandra Zilles (J. Mach. Learn. Res., 2023)

Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets. - Hans Ulrich Simon (CoRR, 2024)

MAP- and MLE-Based Teaching. - Hans Ulrich Simon; Jan Arne Telle (J. Mach. Learn. Res., 2024)

RTD-Conjecture and Concept Classes Induced by Graphs. - Hans Ulrich Simon (CoRR, 2025)

The Hierarchy of Saturating Matching Numbers. - Hans Ulrich Simon; Jan Arne Telle (CoRR, 2025)

Formal Models of Active Learning from Contrastive Examples. - Farnam Mansouri; Hans Ulrich Simon; Adish Singla; Yuxin Chen 001; Sandra Zilles (CoRR, 2025)