| 2023 | ALT | Tournaments, Johnson Graphs and NC-Teaching. | Hans Ulrich Simon |
| 2019 | ALT | Optimal Collusion-Free Teaching. | David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles |
| 2018 | STACS | On the Containment Problem for Linear Sets. | Hans Ulrich Simon |
| 2017 | ALT | Preference-based Teaching of Unions of Geometric Objects. | Ziyuan Gao, David G. Kirkpatrick, Christoph Ries, Hans Ulrich Simon, Sandra Zilles |
| 2016 | COLT | Preference-based Teaching. | Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles |
| 2015 | ALT | Hierarchical Design of Fast Minimum Disagreement Algorithms. | Malte Darnstdt, Christoph Ries, Hans Ulrich Simon |
| 2015 | ALT | On the Teaching Complexity of Linear Sets. | Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles |
| 2015 | COLT | An Almost Optimal PAC Algorithm. | Hans Ulrich Simon |
| 2015 | COLT | Open Problem: Recursive Teaching Dimension Versus VC Dimension. | Hans Ulrich Simon, Sandra Zilles |
| 2015 | DLT | Complexity Analysis: Transformation Monoids of Finite Automata. | Christian Brandl, Hans Ulrich Simon |
| 2014 | CCS | Randomized Response Schemes, Privacy and Usefulness. | Francesco Ald, Hans Ulrich Simon |
| 2014 | LATA | DFA with a Bounded Activity Level. | Marius Konitzer, Hans Ulrich Simon |
| 2013 | ALT | Order Compression Schemes. | Malte Darnstdt, Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles |
| 2013 | STACS | Unlabeled Data Does Provably Help. | Malte Darnstdt, Hans Ulrich Simon, Balzs Szrnyi |
| 2012 | CSR | Boolean Composition of Visual Secret Sharing Schemes. | Hans Ulrich Simon |
| 2012 | ISAIM | PAC-Learning in the Presence of One-sided Classification Noise. | Hans Ulrich Simon |
| 2011 | ALT | Supervised Learning and Co-training. | Malte Darnstdt, Hans Ulrich Simon, Balzs Szrnyi |
| 2010 | ALT | Recursive Teaching Dimension, Learning Complexity, and Maximum Classes. | Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles |
| 2009 | ALT | Smart PAC-Learners. | Hans Ulrich Simon |
| 2009 | COLT | SVM-Optimization and Steepest-Descent Line Search. | Hans Ulrich Simon, Nikolas List |
| 2008 | COLT | Dimension and Margin Bounds for Reflection-invariant Kernels. | Thorsten Doliwa, Michael Kallweit, Hans Ulrich Simon |
| 2007 | COLT | Stability of | Shai Ben-David, Dvid Pl, Hans Ulrich Simon |
| 2007 | STACS | A Characterization of Strong Learnability in the Statistical Query Model. | Hans Ulrich Simon |
| 2006 | ALT | Spectral Norm in Learning Theory: Some Selected Topics. | Hans Ulrich Simon |
| 2006 | DIS | Spectral Norm in Learning Theory: Some Selected Topics. | Hans Ulrich Simon |
| 2005 | ALT | Editors' Introduction. | Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita |
| 2005 | COLT | General Polynomial Time Decomposition Algorithms. | Nikolas List, Hans Ulrich Simon |
| 2005 | FCT | Perfect Reconstruction of Black Pixels Revisited. | Hans Ulrich Simon |
| 2004 | ALT | On the Complexity of Working Set Selection. | Hans Ulrich Simon |
| 2004 | COLT | A General Convergence Theorem for the Decomposition Method. | Nikolas List, Hans Ulrich Simon |
| 2004 | COLT | Bayesian Networks and Inner Product Spaces. | Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans Ulrich Simon |
| 2003 | COCOON | Complexity Theoretic Aspects of Some Cryptographic Functions. | Eike Kiltz, Hans Ulrich Simon |
| 2002 | ALT | How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. | Dietrich Braess, Jrgen Forster, Tomas Sauer, Hans Ulrich Simon |
| 2002 | ALT | On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution. | Jrgen Forster, Hans Ulrich Simon |
| 2002 | STACS | How Many Missing Answers Can Be Tolerated by Query Learners? | Hans Ulrich Simon |
| 2001 | COLT | Limitations of Learning via Embeddings in Euclidean Half-Spaces. | Shai Ben-David, Nadav Eiron, Hans Ulrich Simon |
| 2001 | COLT | Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. | Jrgen Forster, Niels Schmitt, Hans Ulrich Simon |
| 2001 | COLT | How Many Queries Are Needed to Learn One Bit of Information? | Hans Ulrich Simon |
| 2000 | COLT | The Computational Complexity of Densest Region Detection. | Shai Ben-David, Nadav Eiron, Hans Ulrich Simon |
| 2000 | LATIN | Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. | Matthias Krause, Hans Ulrich Simon |
| 2000 | SODA | Construction of visual secret sharing schemes with almost optimal contrast. | Christian Kuhlmann, Hans Ulrich Simon |
| 1999 | ALT | The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). | Jos L. Balczar, Jorge Castro, David Guijarro, Hans Ulrich Simon |
| 1998 | COLT | Structural Results about Exact Learning with Unspecified Attribute Values. | Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon |
| 1998 | SODA | Learning Deterministic Finite Automata from Smallest Counterexamples. | Andreas Birkendorf, Andreas Bker, Hans Ulrich Simon |
| 1997 | COCOON | Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. | Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon |
| 1996 | COLT | On Restricted-Focus-of-Attention Learnability of Boolean Functions. | Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon |
| 1996 | STOC | Noise-Tolerant Learning Near the Information-Theoretic Bound. | Nicol Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon |
| 1995 | COLT | From Noise-Free to Noise-Tolerant and from On-line to Batch Learning. | Norbert Klasner, Hans Ulrich Simon |
| 1993 | ALT | Neural Discriminant Analysis. | Jorge Ricardo Cuellar, Hans Ulrich Simon |
| 1993 | COLT | General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. | Hans Ulrich Simon |
| 1992 | COLT | PAB-Decisions for Boolean and Real-Valued Features. | Svetlana Anoulova, Paul Fischer, Stefan Plt, Hans Ulrich Simon |
| 1992 | COLT | Robust Trainability of Single Neurons. | Klaus-Uwe Hffgen, Hans Ulrich Simon |
| 1991 | COLT | Probably Almost Bayes Decisions. | Paul Fischer, Stefan Plt, Hans Ulrich Simon |
| 1991 | WI | Neural Control Within the BMFT-Project NERES. | Bernd Schrmann, Gerd Hirzinger, Daniel Hernndez, Hans Ulrich Simon, Heidi Hackbarth |
| 1991 | WI | Algorithmisches Lernen auf der Basis empirischer Daten. | Hans Ulrich Simon |
| 1990 | COLT | On Learning Ring-Sum-Expansions. | Paul Fischer, Hans Ulrich Simon |
| 1990 | COLT | On the Number of Examples and Stages Needed for Learning Decision Trees. | Hans Ulrich Simon |
| 1990 | WG | Separation Problems and Circular Arc Systems. | Paul Fischer, Hans Ulrich Simon |
| 1989 | FCT | Approximation Algorithms for Channel Assignment in Cellular Radio Networks. | Hans Ulrich Simon |
| 1986 | FOCS | How Robust Is the n-Cube? (Extended Abstract) | Bernd Becker, Hans Ulrich Simon |
| 1983 | FCT | A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions. | Hans Ulrich Simon |
| 1979 | FCT | Word problems for groups and contextfree recognition. | Hans Ulrich Simon |