Hans-Ulrich Simon

Fakultät für Informatik, Lehrstuhl Mathematik und Informatik, Ruhr-Universitaet Bochum, D-44780 Bochum, Germany

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Education

Bio

None

Papers55 papers

Sort

By YearBy Citation

On the Teaching Complexity of Linear Sets

Ziyuan Gao,Hans Ulrich Simon,Sandra Zilles

Theor. Comput. Sci., (2018): 107-123

Cited by9EIBibtex

On the Containment Problem for Linear Sets

Hans Ulrich Simon

Leibniz International Proceedings in Informatics, (2018)

Cited by2EIBibtex

Distinguishing pattern languages with membership examples

Ziyuan Gao, Zeinab Mazadi, Regan Meloche,Hans Ulrich Simon,Sandra Zilles

Information and Computation, (2017): 348-371

Cited by3EIBibtex

Preference-based Teaching of Unions of Geometric Objects

Ziyuan Gao,David G. Kirkpatrick, Christoph Ries,Hans Ulrich Simon,Sandra Zilles

ALT, pp.185-207, (2017)

Cited by1EIBibtex

Regular languages viewed from a graph-theoretic perspective

Marius Konitzer,Hans Ulrich Simon

Inf. Comput., no. P3 (2017): 484-496

EIBibtex

Efficient computation of approximate isomorphisms between Boolean functions

Hans Ulrich Simon

Information Processing Letters, no. 3 (2016): 237-240

EIBibtex

Open Problem: Recursive Teaching Dimension Versus VC Dimension

Hans Ulrich Simon,Sandra Zilles

COLT, (2015)

Cited by14EIBibtex

An Almost Optimal PAC Algorithm

Hans Ulrich Simon

COLT, (2015)

Cited by16EIBibtex

Complexity Analysis: Transformation Monoids of Finite Automata

Christian Brandl,Hans Ulrich Simon

DLT, (2015)

Cited by5EIBibtex

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

Smart PAC-Learners

Hans-ulrich Simon

Algorithmic Learning Theory, pp.353-367, (2009)

Cited by2EIBibtex

SVM-Optimization and Steepest-Descent Line Search

Nikolas List,Hans Ulrich Simon

(2009)

Cited by32Bibtex

SVM-Optimization and Steepest-Descent Line Search

Hans-Ulrich Simon,Nikolas List

COLT, (2009)

Cited by11EIBibtex

Dimension and Margin Bounds for Reflection-invariant Kernels

Thorsten Doliwa,Michael Kallweit,Hans Ulrich Simon, Andrew Mccallum

COLT, pp.157-168, (2008)

Cited by2EIBibtex

Introduction to the special issue on COLT 2006

Avrim Blum,Gábor Lugosi,Hans-Ulrich Simon

Machine Learning, no. 2-3 (2007): 75-77

EIBibtex

Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings

Gábor Lugosi,Hans-Ulrich Simon

COLT, (2006)

EIBibtex

Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings

Sanjay Jain,Hans-Ulrich Simon,Etsuji Tomita

ALT, (2005)

Cited by35EIBibtex

Bayesian Networks and Inner Product Spaces

Atsuyoshi Nakamura,Michael Schmitt,Niels Schmitt,Hans-ulrich Simon

LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, (2004): 518-533

Cited by2EIBibtex

How Many Missing Answers Can Be Tolerated by Query Learners

Hans Ulrich Simon

Symposium on Theoretical Aspects of Computer Science, no. 1 (2004): 77-94

Cited by5EIBibtex

A General Convergence Theorem for the Decomposition Method

Nikolas List,Hans-ulrich Simon

LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, (2004): 363-377

Cited by33EIBibtex

View All

Base Info Papers Patents Projects

Hans-Ulrich SimonBinding

Papers55 papers

Hans-Ulrich Simon