Hans Ulrich Simon

ORCID

Publication Activity (10 Years)

Years Active: 1979-2024
Publications (10 Years): 23

Top Venues

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Hans Ulrich Simon
Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets. CoRR (2024)
Shaun M. Fallat, David G. Kirkpatrick, Hans Ulrich Simon, Abolghasem Soltani, Sandra Zilles
On Batch Teaching Without Collusion. J. Mach. Learn. Res. 24 (2023)
Hans Ulrich Simon, Jan Arne Telle
MAP- and MLE-Based Teaching. CoRR (2023)
Hans Ulrich Simon
Tournaments, Johnson Graphs and NC-Teaching. ALT (2023)
Hans Ulrich Simon
Tournaments, Johnson Graphs, and NC-Teaching. CoRR (2022)
Hans Ulrich Simon
-Property and Implications for Teaching. CoRR (2022)
David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles
Optimal Collusion-Free Teaching. ALT (2019)
David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles
Optimal Collusion-Free Teaching. CoRR (2019)
Francesco Aldà, Hans Ulrich Simon
A lower bound on the release of differentially private integer partitions. Inf. Process. Lett. 129 (2018)
Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles
On the teaching complexity of linear sets. Theor. Comput. Sci. 716 (2018)
Malte Darnstädt, Christoph Ries, Hans Ulrich Simon
Hierarchical design of fast Minimum Disagreement algorithms. Theor. Comput. Sci. 716 (2018)
Ronald Ortner, Hans Ulrich Simon
Guest Editors' Foreword. Theor. Comput. Sci. 742 (2018)
Hans Ulrich Simon
On the Containment Problem for Linear Sets. STACS (2018)
Hans Ulrich Simon
On the Containment Problem for Linear Sets. CoRR (2017)
Ziyuan Gao, Zeinab Mazadi, Regan Meloche, Hans Ulrich Simon, Sandra Zilles
Distinguishing pattern languages with membership examples. Inf. Comput. 256 (2017)
Francesco Aldà, Hans Ulrich Simon
On the Optimality of the Exponential Mechanism. CSCML (2017)
Marius Konitzer, Hans Ulrich Simon
Regular languages viewed from a graph-theoretic perspective. Inf. Comput. 253 (2017)
Ziyuan Gao, David G. Kirkpatrick, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
Preference-based Teaching of Unions of Geometric Objects. ALT (2017)
Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
Preference-based Teaching. CoRR (2017)
Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
Preference-based Teaching. J. Mach. Learn. Res. 18 (2017)
Malte Darnstädt, Thorsten Kiss, Hans Ulrich Simon, Sandra Zilles
Order compression schemes. Theor. Comput. Sci. 620 (2016)
Ziyuan Gao, Christoph Ries, Hans Ulrich Simon, Sandra Zilles
Preference-based Teaching. COLT (2016)
Hans Ulrich Simon
Efficient computation of approximate isomorphisms between Boolean functions. Inf. Process. Lett. 116 (3) (2016)
Malte Darnstädt, Christoph Ries, Hans Ulrich Simon
Hierarchical Design of Fast Minimum Disagreement Algorithms. ALT (2015)
Christian Brandl, Hans Ulrich Simon
Complexity Analysis: Transformation Monoids of Finite Automata. DLT (2015)
Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles
On the Teaching Complexity of Linear Sets. ALT (2015)
Hans Ulrich Simon, Sandra Zilles
Open Problem: Recursive Teaching Dimension Versus VC Dimension. COLT (2015)
Hans Ulrich Simon
An Almost Optimal PAC Algorithm. COLT (2015)
Thorsten Doliwa, Gaojian Fan, Hans Ulrich Simon, Sandra Zilles
Recursive teaching dimension, VC-dimension and sample compression. J. Mach. Learn. Res. 15 (1) (2014)
Francesco Aldà, Hans Ulrich Simon
Randomized Response Schemes, Privacy and Usefulness. AISec@CCS (2014)
Hans Ulrich Simon
PAC-learning in the presence of one-sided classification noise. Ann. Math. Artif. Intell. 71 (4) (2014)
Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi
Supervised learning and Co-training. Theor. Comput. Sci. 519 (2014)
Marius Konitzer, Hans Ulrich Simon
DFA with a Bounded Activity Level. LATA (2014)
Malte Darnstädt, Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles
Order Compression Schemes. ALT (2013)
Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi
Unlabeled Data Does Provably Help. STACS (2013)
Hans Ulrich Simon
PAC-Learning in the Presence of One-sided Classification Noise. ISAIM (2012)
Hans Ulrich Simon
Boolean Composition of Visual Secret Sharing Schemes. CSR (2012)
Malte Darnstädt, Hans Ulrich Simon, Balázs Szörényi
Supervised Learning and Co-training. ALT (2011)
Michael Kallweit, Hans Ulrich Simon
A Close Look to Margin Complexity and Related Parameters. COLT (2011)
Malte Darnstädt, Hans Ulrich Simon
Smart PAC-learners. Theor. Comput. Sci. 412 (19) (2011)
Hans Ulrich Simon, Balázs Szörényi
One-inclusion hypergraph density revisited. Inf. Process. Lett. 110 (8-9) (2010)
Thorsten Doliwa, Hans Ulrich Simon, Sandra Zilles
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes. ALT (2010)
Hans Ulrich Simon
Smart PAC-Learners. ALT (2009)
Lisa Hellerstein, Hans Ulrich Simon
Special Issue: Learning Theory 2006. J. Comput. Syst. Sci. 75 (1) (2009)
Hans Ulrich Simon, Nikolas List
SVM-Optimization and Steepest-Descent Line Search. COLT (2009)
Thorsten Doliwa, Michael Kallweit, Hans Ulrich Simon
Dimension and Margin Bounds for Reflection-invariant Kernels. COLT (2008)
Hans Ulrich Simon
On the complexity of working set selection. Theor. Comput. Sci. 382 (3) (2007)
Avrim Blum, Gábor Lugosi, Hans Ulrich Simon
Introduction to the special issue on COLT 2006. Mach. Learn. 69 (2-3) (2007)
Philip M. Long, Rocco A. Servedio, Hans Ulrich Simon
Discriminative learning can succeed where generative learning fails. Inf. Process. Lett. 103 (4) (2007)
Hans Ulrich Simon, Etsuji Tomita
Guest editors' foreword. Theor. Comput. Sci. 387 (1) (2007)
Hans Ulrich Simon
A Characterization of Strong Learnability in the Statistical Query Model. STACS (2007)
Nikolas List, Hans Ulrich Simon
General Polynomial Time Decomposition Algorithms. J. Mach. Learn. Res. 8 (2007)
Shai Ben-David, Dávid Pál, Hans Ulrich Simon
-Means Clustering. COLT (2007)
Hans Ulrich Simon
Spectral Norm in Learning Theory: Some Selected Topics. Discovery Science (2006)
Jürgen Forster, Hans Ulrich Simon
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes. Theor. Comput. Sci. 350 (1) (2006)
Hans Ulrich Simon
Spectral Norm in Learning Theory: Some Selected Topics. ALT (2006)
Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita
Editors' Introduction. ALT (2005)
Eike Kiltz, Hans Ulrich Simon
Threshold circuit lower bounds on cryptographic functions. J. Comput. Syst. Sci. 71 (2) (2005)
Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans Ulrich Simon
Inner Product Spaces for Bayesian Networks. J. Mach. Learn. Res. 6 (2005)
Nikolas List, Hans Ulrich Simon
General Polynomial Time Decomposition Algorithms. COLT (2005)
Hans Ulrich Simon
Perfect Reconstruction of Black Pixels Revisited. FCT (2005)
Hans Ulrich Simon
On the Complexity of Working Set Selection. ALT (2004)
Hans Ulrich Simon
How Many Missing Answers Can Be Tolerated by Query Learners? Theory Comput. Syst. 37 (1) (2004)
Nikolas List, Hans Ulrich Simon
A General Convergence Theorem for the Decomposition Method. COLT (2004)
Atsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans Ulrich Simon
Bayesian Networks and Inner Product Spaces. COLT (2004)
Eike Kiltz, Hans Ulrich Simon
Complexity Theoretic Aspects of Some Cryptographic Functions. COCOON (2003)
Jürgen Forster, Niels Schmitt, Hans Ulrich Simon, Thorsten Suttorp
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. Mach. Learn. 51 (3) (2003)
Hans Ulrich Simon
How Many Queries Are Needed to Learn One Bit of Information? Ann. Math. Artif. Intell. 39 (3) (2003)
Matthias Krause, Hans Ulrich Simon
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography. Comb. Probab. Comput. 12 (3) (2003)
Dietrich Braess, Jürgen Forster, Tomas Sauer, Hans Ulrich Simon
How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution. ALT (2002)
Paul Fischer, Hans Ulrich Simon, Carl Smith
Foreword. Theor. Comput. Sci. 284 (1) (2002)
Hans Ulrich Simon
How Many Missing Answers Can Be Tolerated by Query Learners? STACS (2002)
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
The Computational Complexity of Densest Region Detection. J. Comput. Syst. Sci. 64 (1) (2002)
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
Limitations of Learning Via Embeddings in Euclidean Half Spaces. J. Mach. Learn. Res. 3 (2002)
José L. Balcázar, Jorge Castro, David Guijarro, Hans Ulrich Simon
The consistency dimension and distribution-dependent learning from queries. Theor. Comput. Sci. 288 (2) (2002)
Jürgen Forster, Hans Ulrich Simon
On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution. ALT (2002)
Hans Ulrich Simon
How Many Queries Are Needed to Learn One Bit of Information? COLT/EuroCOLT (2001)
Jürgen Forster, Matthias Krause, Satyanarayana V. Lokam, Rustam Mubarakzjanov, Niels Schmitt, Hans Ulrich Simon
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity. FSTTCS (2001)
Jürgen Forster, Niels Schmitt, Hans Ulrich Simon
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. COLT/EuroCOLT (2001)
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
Limitations of Learning via Embeddings in Euclidean Half-Spaces. COLT/EuroCOLT (2001)
Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon
Contrast-optimal k out of n secret sharing schemes in visual cryptography. Theor. Comput. Sci. 240 (2) (2000)
Norbert Klasner, Hans Ulrich Simon
General lower bounds on the query complexity within the exact learning model. Discret. Appl. Math. 107 (1-3) (2000)
Christian Kuhlmann, Hans Ulrich Simon
Construction of visual secret sharing schemes with almost optimal contrast. SODA (2000)
Matthias Krause, Hans Ulrich Simon
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography. LATIN (2000)
Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
The Computational Complexity of Densest Region Detection. COLT (2000)
Shai Ben-David, Hans Ulrich Simon
Efficient Learning of Linear Perceptrons. NIPS (2000)
Matthias Krause, Hans Ulrich Simon
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography Electron. Colloquium Comput. Complex. 7 (3) (2000)
Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon
Learning Deterministic Finite Automata from Smallest Counterexamples. SIAM J. Discret. Math. 13 (4) (2000)
Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon
Structural Results about Exact Learning with Unspecified Attribute Values. J. Comput. Syst. Sci. 60 (2) (2000)
Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans Ulrich Simon
Sample-Efficient Strategies for Learning in the Presence of Noise. J. ACM 46 (5) (1999)
José L. Balcázar, Jorge Castro, David Guijarro, Hans Ulrich Simon
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract). ALT (1999)
Andreas Birkendorf, Hans Ulrich Simon
Using Computational Learning Strategies as a Tool for Combinatorial Optimization. Ann. Math. Artif. Intell. 22 (3-4) (1998)
Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon
Learning Deterministic Finite Automata from Smallest Counterexamples. SODA (1998)
Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon
Structural Results about Exact Learning with Unspecified Attribute Values. COLT (1998)
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon
On Restricted-Focus-of-Attention Learnability of Boolean Functions. Mach. Learn. 30 (1) (1998)
Nicolò Cesa-Bianchi, Paul Fischer, Eli Shamir, Hans Ulrich Simon
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise. EuroCOLT (1997)
Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography. COCOON (1997)
Hans Ulrich Simon
Bounds on the Number of Examples Needed for Learning Functions. SIAM J. Comput. 26 (3) (1997)
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans Ulrich Simon
On Restricted-Focus-of-Attention Learnability of Boolean Functions. COLT (1996)
Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Hans Ulrich Simon
Noise-Tolerant Learning Near the Information-Theoretic Bound. STOC (1996)

Hans Ulrich Simon.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hans Ulrich Simon