Hans Ulrich Simon

Fakultät für Mathematik, Ruhr-Universität Bochum, Bochum, Germany

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers52 papers

Sort

By YearBy Citation

Optimal Collusion-Free Teaching

David G. Kirkpatrick,Hans Ulrich Simon,Sandra Zilles

ALT, (2019): 506-528

Cited by1EIBibtex

Hierarchical Design of Fast Minimum Disagreement Algorithms

Malte Darnstädt, Christoph Ries,Hans Ulrich Simon

Theor. Comput. Sci., (2018): 70-88

EIBibtex

Guest Editors' Foreword

Ronald Ortner,Hans Ulrich Simon

Theor. Comput. Sci., (2018): 1-2

EIBibtex

On the Optimality of the Exponential Mechanism

Francesco Aldà,Hans Ulrich Simon

CSCML, pp.68-85, (2017)

Cited by1EIBibtex

Preference-based Teaching

Ziyuan Gao, Christoph Ries,Hans Ulrich Simon,Sandra Zilles

The Journal of Machine Learning Research, (2017)

Cited by19EIBibtex

Order compression schemes

Malte Darnstädt, Thorsten Kiss,Hans Ulrich Simon,Sandra Zilles

Theor. Comput. Sci., (2016): 73-90

Cited by11EIBibtex

Order Compression Schemes

Malte Darnstädt,Thorsten Doliwa,Hans Ulrich Simon,Sandra Zilles

Theoretical Computer Science, no. C (2016): 73-90

Cited by11EIBibtex

PAC-learning in the presence of one-sided classification noise

Hans Ulrich Simon

Annals of Mathematics and Artificial Intelligence, no. 4 (2014): 283-300

Cited by10EIBibtex

DFA with a Bounded Activity Level

Marius Konitzer,Hans Ulrich Simon

Lecture Notes in Computer Science, (2014): 478-489

Cited by2EIBibtex

Recursive teaching dimension, VC-dimension and sample compression

Thorsten Doliwa,Gaojian Fan,Hans Ulrich Simon,Sandra Zilles

Journal of Machine Learning Research, no. 1 (2014): 3107-3131

Cited by44EIBibtex

Order Compression Schemes

Malte Darnstaedt, Thorsten Doliwa,Hans Ulrich Simon,Sandra Zilles

Algorithmic Learning Theory (ALT 2013), (2013): 173.0-187.0

Bibtex

Unlabeled Data Does Provably Help

Malte Darnstädt,Hans Ulrich Simon,Balázs Szörényi

STACS, pp.185-196, (2013)

Cited by3EIBibtex

Boolean Composition of Visual Secret Sharing Schemes

Hans Ulrich Simon

CSR, pp.314-325, (2012)

Cited by1EIBibtex

A Close Look to Margin Complexity and Related Parameters

Michael Kallweit,Hans Ulrich Simon,Michael Kallweit,Hans Ulrich Simon

COLT, pp.437-456, (2011)

Cited by8EIBibtex

Supervised Learning and Co-training

Malte Darnstaedt,Hans Ulrich Simon, Balazs Szoerenyi

ALGORITHMIC LEARNING THEORY, (2011): 425-+

Bibtex

Supervised learning and co-training

Malte Darnstädt,Hans Ulrich Simon,Balázs Szörényi

Theoretical Computer Science, pp.425-439, (2011)

Cited by9EIBibtex

Smart PAC-learners

Malte Darnstädt,Hans Ulrich Simon

Theor. Comput. Sci., no. 19 (2011): 1756-1766

Cited by2EIBibtex

One-inclusion hypergraph density revisited

Hans Ulrich Simon,Balázs Szörényi

Inf. Process. Lett., no. 8-9 (2010): 341-344

Cited by5EIBibtex

Recursive teaching dimension, learning complexity, and maximum classes

Thorsten Doliwa,Hans Ulrich Simon,Sandra Zilles

ALT, (2010): 209-223

Cited by29EIBibtex

On the complexity of working set selection

Hans Ulrich Simon

Theor. Comput. Sci., no. 3 (2007): 262-279

Cited by14EIBibtex

View All

Base Info Papers Patents Projects

Hans Ulrich SimonBinding

Papers52 papers

Hans Ulrich Simon