Hans Ulrich Simon

141 papers A* 25A 4B 25C 2Misc 4Journal 66Unranked 12

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Formal Models of Active Learning from Contrastive Examples. CoRR Farnam Mansouri, Hans Ulrich Simon, Adish Singla, Yuxin Chen, Sandra Zilles
2025	J	`jnl`	RTD-Conjecture and Concept Classes Induced by Graphs. CoRR Hans Ulrich Simon
2025	J	`jnl`	The Hierarchy of Saturating Matching Numbers. CoRR Hans Ulrich Simon, Jan Arne Telle
2024	J	`jnl`	Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets. CoRR Hans Ulrich Simon
2024	J	`jnl`	MAP- and MLE-Based Teaching. J. Mach. Learn. Res. Hans Ulrich Simon, Jan Arne Telle
2023	J	`jnl`	MAP- and MLE-Based Teaching. CoRR Hans Ulrich Simon, Jan Arne Telle
2023	J	`jnl`	On Batch Teaching Without Collusion. J. Mach. Learn. Res. Shaun M. Fallat, David G. Kirkpatrick, Hans Ulrich Simon, Abolghasem Soltani, Sandra Zilles
2023	B	`conf`	Tournaments, Johnson Graphs and NC-Teaching. ALT Hans Ulrich Simon
2022	J	`jnl`	Minimum Tournaments with the Strong S CoRR Hans Ulrich Simon
2022	J	`jnl`	Tournaments, Johnson Graphs, and NC-Teaching. CoRR Hans Ulrich Simon
2019	B	`conf`	Optimal Collusion-Free Teaching. ALT David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles
2019	J	`jnl`	Optimal Collusion-Free Teaching. CoRR David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles
2018	J	`jnl`	A lower bound on the release of differentially private integer partitions. Inf. Process. Lett. Francesco Aldà, Hans Ulrich Simon
2018	J	`jnl`	Guest Editors' Foreword. Theor. Comput. Sci. Ronald Ortner, Hans Ulrich Simon
2018	J	`jnl`	Hierarchical design of fast Minimum Disagreement algorithms. Theor. Comput. Sci. Malte Darnstädt, Christoph Ries, Hans Ulrich Simon
2018	A	`conf`	On the Containment Problem for Linear Sets. STACS Hans Ulrich Simon
2018	J	`jnl`	On the teaching complexity of linear sets. Theor. Comput. Sci. Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles
2017	J	`jnl`	Distinguishing pattern languages with membership examples. Inf. Comput. Ziyuan Gao, Zeinab Mazadi, Regan Meloche, Hans Ulrich Simon, Sandra Zilles
2017	J	`jnl`	On the Containment Problem for Linear Sets. CoRR Hans Ulrich Simon
2017	—	`conf`	On the Optimality of the Exponential Mechanism. CSCML Francesco Aldà, Hans Ulrich Simon
2017	B	`conf`	Preference-based Teaching of Unions of Geometric Objects. ALT Ziyuan Gao, David G. Kirkpatrick, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
2017	J	`jnl`	Preference-based Teaching. CoRR Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
2017	J	`jnl`	Preference-based Teaching. J. Mach. Learn. Res. Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
2017	J	`jnl`	Regular languages viewed from a graph-theoretic perspective. Inf. Comput. Marius Konitzer, Hans Ulrich Simon
2016	B	`ed.`	Algorithmic Learning Theory - 27th International Conference, ALT 2016, Bari, Italy, October 19-21, 2016, Proceedings ALT Ronald Ortner, Hans Ulrich Simon, Sandra Zilles
2016	J	`jnl`	Efficient computation of approximate isomorphisms between Boolean functions. Inf. Process. Lett. Hans Ulrich Simon
2016	J	`jnl`	Order compression schemes. Theor. Comput. Sci. Malte Darnstädt, Thorsten Kiss, Hans Ulrich Simon, Sandra Zilles
2016	A*	`conf`	Preference-based Teaching. COLT Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
2015	A*	`conf`	An Almost Optimal PAC Algorithm. COLT Hans Ulrich Simon
2015	C	`conf`	Complexity Analysis: Transformation Monoids of Finite Automata. DLT Christian Brandl, Hans Ulrich Simon
2015	B	`conf`	Hierarchical Design of Fast Minimum Disagreement Algorithms. ALT Malte Darnstädt, Christoph Ries, Hans Ulrich Simon
2015	B	`conf`	On the Teaching Complexity of Linear Sets. ALT Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles
2015	A*	`conf`	Open Problem: Recursive Teaching Dimension Versus VC Dimension. COLT Hans Ulrich Simon, Sandra Zilles
2014	C	`conf`	DFA with a Bounded Activity Level. LATA Marius Konitzer, Hans Ulrich Simon
2014	J	`jnl`	PAC-learning in the presence of one-sided classification noise. Ann. Math. Artif. Intell. Hans Ulrich Simon
2014	—	`conf`	Randomized Response Schemes, Privacy and Usefulness. AISec@CCS Francesco Aldà, Hans Ulrich Simon
2014	J	`jnl`	Recursive teaching dimension, VC-dimension and sample compression. J. Mach. Learn. Res. Thorsten Doliwa, Gaojian Fan, Hans Ulrich Simon, Sandra Zilles
2014	J	`jnl`	Supervised learning and Co-training. Theor. Comput. Sci. Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi
2013	B	`conf`	Order Compression Schemes. ALT Malte Darnstädt, Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles
2013	A	`conf`	Unlabeled Data Does Provably Help. STACS Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi
2012	Misc	`conf`	Boolean Composition of Visual Secret Sharing Schemes. CSR Hans Ulrich Simon
2012	Misc	`conf`	PAC-Learning in the Presence of One-sided Classification Noise. ISAIM Hans Ulrich Simon
2011	A*	`conf`	A Close Look to Margin Complexity and Related Parameters. COLT Michael Kallweit, Hans Ulrich Simon
2011	J	`jnl`	Smart PAC-learners. Theor. Comput. Sci. Malte Darnstädt, Hans Ulrich Simon
2011	B	`conf`	Supervised Learning and Co-training. ALT Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi
2010	J	`jnl`	One-inclusion hypergraph density revisited. Inf. Process. Lett. Hans Ulrich Simon, Balázs Szörényi
2010	B	`conf`	Recursive Teaching Dimension, Learning Complexity, and Maximum Classes. ALT Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles
2009	A*	`conf`	SVM-Optimization and Steepest-Descent Line Search. COLT Hans Ulrich Simon, Nikolas List
2009	B	`conf`	Smart PAC-Learners. ALT Hans Ulrich Simon
2009	J	`jnl`	Special Issue: Learning Theory 2006. J. Comput. Syst. Sci. Lisa Hellerstein, Hans Ulrich Simon
2008	A*	`conf`	Dimension and Margin Bounds for Reflection-invariant Kernels. COLT Thorsten Doliwa, Michael Kallweit, Hans Ulrich Simon
2007	A	`conf`	A Characterization of Strong Learnability in the Statistical Query Model. STACS Hans Ulrich Simon
2007	J	`jnl`	Discriminative learning can succeed where generative learning fails. Inf. Process. Lett. Philip M. Long, Rocco A. Servedio, Hans Ulrich Simon
2007	J	`jnl`	General Polynomial Time Decomposition Algorithms. J. Mach. Learn. Res. Nikolas List, Hans Ulrich Simon
2007	J	`jnl`	Guest editors' foreword. Theor. Comput. Sci. Hans Ulrich Simon, Etsuji Tomita
2007	J	`jnl`	Introduction to the special issue on COLT 2006. Mach. Learn. Avrim Blum, Gábor Lugosi, Hans Ulrich Simon
2007	J	`jnl`	On the complexity of working set selection. Theor. Comput. Sci. Hans Ulrich Simon
2007	A*	`conf`	Stability of COLT Shai Ben-David, Dávid Pál, Hans Ulrich Simon
2006	A*	`ed.`	Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings COLT Gábor Lugosi, Hans Ulrich Simon
2006	J	`jnl`	On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theor. Comput. Sci. Jürgen Forster, Hans Ulrich Simon
2006	B	`conf`	Spectral Norm in Learning Theory: Some Selected Topics. ALT Hans Ulrich Simon
2006	B	`conf`	Spectral Norm in Learning Theory: Some Selected Topics. Discovery Science Hans Ulrich Simon
2005	B	`ed.`	Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings ALT Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita
2005	B	`conf`	Editors' Introduction. ALT Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita
2005	A*	`conf`	General Polynomial Time Decomposition Algorithms. COLT Nikolas List, Hans Ulrich Simon
2005	J	`jnl`	Inner Product Spaces for Bayesian Networks. J. Mach. Learn. Res. Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans Ulrich Simon
2005	B	`conf`	Perfect Reconstruction of Black Pixels Revisited. FCT Hans Ulrich Simon
2005	J	`jnl`	Threshold circuit lower bounds on cryptographic functions. J. Comput. Syst. Sci. Eike Kiltz, Hans Ulrich Simon
2004	A*	`conf`	A General Convergence Theorem for the Decomposition Method. COLT Nikolas List, Hans Ulrich Simon
2004	A*	`conf`	Bayesian Networks and Inner Product Spaces. COLT Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans Ulrich Simon
2004	J	`jnl`	How Many Missing Answers Can Be Tolerated by Query Learners? Theory Comput. Syst. Hans Ulrich Simon
2004	B	`conf`	On the Complexity of Working Set Selection. ALT Hans Ulrich Simon
2003	Misc	`conf`	Complexity Theoretic Aspects of Some Cryptographic Functions. COCOON Eike Kiltz, Hans Ulrich Simon
2003	J	`jnl`	Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. Comb. Probab. Comput. Matthias Krause, Hans Ulrich Simon
2003	J	`jnl`	Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. Mach. Learn. Jürgen Forster, Niels Schmitt, Hans Ulrich Simon, Thorsten Suttorp
2003	J	`jnl`	How Many Queries Are Needed to Learn One Bit of Information? Ann. Math. Artif. Intell. Hans Ulrich Simon
2002	J	`jnl`	Foreword. Theor. Comput. Sci. Paul Fischer, Hans Ulrich Simon, Carl Smith
2002	A	`conf`	How Many Missing Answers Can Be Tolerated by Query Learners? STACS Hans Ulrich Simon
2002	B	`conf`	How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. ALT Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans Ulrich Simon
2002	J	`jnl`	Limitations of Learning Via Embeddings in Euclidean Half Spaces. J. Mach. Learn. Res. Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
2002	B	`conf`	On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution. ALT Jürgen Forster, Hans Ulrich Simon
2002	J	`jnl`	The Computational Complexity of Densest Region Detection. J. Comput. Syst. Sci. Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
2002	J	`jnl`	The consistency dimension and distribution-dependent learning from queries. Theor. Comput. Sci. José L. Balcázar, Jorge Castro, David Guijarro, Hans Ulrich Simon
2001	—	`conf`	Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. COLT/EuroCOLT Jürgen Forster, Niels Schmitt, Hans Ulrich Simon
2001	—	`conf`	How Many Queries Are Needed to Learn One Bit of Information? COLT/EuroCOLT Hans Ulrich Simon
2001	—	`conf`	Limitations of Learning via Embeddings in Euclidean Half-Spaces. COLT/EuroCOLT Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
2001	—	`conf`	Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. FSTTCS Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon
2000	A*	`conf`	Construction of visual secret sharing schemes with almost optimal contrast. SODA Christian Kuhlmann, Hans Ulrich Simon
2000	J	`jnl`	Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor. Comput. Sci. Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon
2000	J	`jnl`	Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography Electron. Colloquium Comput. Complex. Matthias Krause, Hans Ulrich Simon
2000	B	`conf`	Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. LATIN Matthias Krause, Hans Ulrich Simon
2000	—	`conf`	Efficient Learning of Linear Perceptrons. NIPS Shai Ben-David, Hans Ulrich Simon
2000	J	`jnl`	General lower bounds on the query complexity within the exact learning model. Discret. Appl. Math. Norbert Klasner, Hans Ulrich Simon
2000	J	`jnl`	Learning Deterministic Finite Automata from Smallest Counterexamples. SIAM J. Discret. Math. Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon
2000	J	`jnl`	Structural Results about Exact Learning with Unspecified Attribute Values. J. Comput. Syst. Sci. Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon
2000	A*	`conf`	The Computational Complexity of Densest Region Detection. COLT Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
1999	—	`ed.`	Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings EuroCOLT Paul Fischer, Hans Ulrich Simon
1999	J	`jnl`	Sample-Efficient Strategies for Learning in the Presence of Noise. J. ACM Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans Ulrich Simon
1999	B	`conf`	The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). ALT José L. Balcázar, Jorge Castro, David Guijarro, Hans Ulrich Simon
1998	A*	`conf`	Learning Deterministic Finite Automata from Smallest Counterexamples. SODA Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon
1998	J	`jnl`	On Restricted-Focus-of-Attention Learnability of Boolean Functions. Mach. Learn. Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon
1998	A*	`conf`	Structural Results about Exact Learning with Unspecified Attribute Values. COLT Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon
1998	J	`jnl`	Using Computational Learning Strategies as a Tool for Combinatorial Optimization. Ann. Math. Artif. Intell. Andreas Birkendorf, Hans Ulrich Simon
1997	J	`jnl`	Bounds on the Number of Examples Needed for Learning Functions. SIAM J. Comput. Hans Ulrich Simon
1997	Misc	`conf`	Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon
1997	—	`conf`	Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon
1996	J	`jnl`	General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. J. Comput. Syst. Sci. Hans Ulrich Simon
1996	A*	`conf`	Noise-Tolerant Learning Near the Information-Theoretic Bound. STOC Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon
1996	A*	`conf`	On Restricted-Focus-of-Attention Learnability of Boolean Functions. COLT Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon
1996	J	`jnl`	Probably Almost Bayes Decisions. Inf. Comput. Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans Ulrich Simon
1995	A*	`conf`	From Noise-Free to Noise-Tolerant and from On-line to Batch Learning. COLT Norbert Klasner, Hans Ulrich Simon
1995	—	`conf`	Learning decision lists and trees with equivalence-queries. EuroCOLT Hans Ulrich Simon
1995	J	`jnl`	Robust Trainability of Single Neurons. J. Comput. Syst. Sci. Klaus-Uwe Höffgen, Hans Ulrich Simon, Kevin S. Van Horn
1993	—	`conf`	Bounds on the number of examples needed for learning functions. EuroCOLT Hans Ulrich Simon
1993	A*	`conf`	General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. COLT Hans Ulrich Simon
1993	B	`conf`	Neural Discriminant Analysis. ALT Jorge Ricardo Cuellar, Hans Ulrich Simon
1992	—	`ch.`	Bemerkungen zum Schätzen von Bayesschen Diskriminantenfunktionen. Informatik Hans Ulrich Simon
1992	J	`jnl`	On Learning Ring-Sum-Expansions. SIAM J. Comput. Paul Fischer, Hans Ulrich Simon
1992	A*	`conf`	PAB-Decisions for Boolean and Real-Valued Features. COLT Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans Ulrich Simon
1992	A*	`conf`	Robust Trainability of Single Neurons. COLT Klaus-Uwe Höffgen, Hans Ulrich Simon
1991	—	`conf`	Algorithmisches Lernen auf der Basis empirischer Daten. Wissensbasierte Systeme Hans Ulrich Simon
1991	—	`conf`	Neural Control Within the BMFT-Project NERES. Wissensbasierte Systeme Bernd Schürmann, Gerd Hirzinger, Daniel Hernández, Hans Ulrich Simon, Heidi Hackbarth
1991	J	`jnl`	Neuronales Lernen auf der Basis empirischer Daten / Neural Learning Based on Empirical Data. it Inf. Technol. Hans Ulrich Simon
1991	A*	`conf`	Probably Almost Bayes Decisions. COLT Paul Fischer, Stefan Pölt, Hans Ulrich Simon
1991	J	`jnl`	The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank. Inf. Process. Lett. Hans Ulrich Simon
1990	J	`jnl`	On Approximate Solutions for Combinatorial Optimization Problems. SIAM J. Discret. Math. Hans Ulrich Simon
1990	A*	`conf`	On Learning Ring-Sum-Expansions. COLT Paul Fischer, Hans Ulrich Simon
1990	A*	`conf`	On the Number of Examples and Stages Needed for Learning Decision Trees. COLT Hans Ulrich Simon
1990	B	`conf`	Separation Problems and Circular Arc Systems. WG Paul Fischer, Hans Ulrich Simon
1989	B	`conf`	Approximation Algorithms for Channel Assignment in Cellular Radio Networks. FCT Hans Ulrich Simon
1989	J	`jnl`	Continuous Reductions Among Combinatorial Optimization Problems. Acta Informatica Hans Ulrich Simon
1988	J	`jnl`	A Continuous Bound on the Performance of Critical-Path Schedules. J. Inf. Process. Cybern. Hans Ulrich Simon
1988	J	`jnl`	How Robust Is The n-Cube? Inf. Comput. Bernd Becker, Hans Ulrich Simon
1986	A*	`conf`	How Robust Is the n-Cube? (Extended Abstract) FOCS Bernd Becker, Hans Ulrich Simon
1983	B	`conf`	A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions. FCT Hans Ulrich Simon
1983	J	`jnl`	Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees. J. Inf. Process. Cybern. Hans Ulrich Simon
1983	J	`jnl`	Pattern Matching in Trees and Nets. Acta Informatica Hans Ulrich Simon
1983	J	`jnl`	The Structure of the Monoid (N, X) of Logic Circuits. J. Inf. Process. Cybern. Hans Ulrich Simon
1982	J	`jnl`	A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions Inf. Control. Hans Ulrich Simon
1981	—	`—`	Komplexitätsbetrachtungen rationaler Baum- und Netzmengen. Hans Ulrich Simon
1979	B	`conf`	Word problems for groups and contextfree recognition. FCT Hans Ulrich Simon