|
|
|
 |
Lehrstuhl Mathematik & Informatik
Publications in Journals |
|
| |
| |
|
 |
|
|
- Nikolas List, Hans Ulrich Simon
General Polynomial Time Decomposition Algorithms.
Journal of Machine Learning Research 8:303-321, 2007
[view abstract] [article (PS)]
- Hans Ulrich Simon
On the Complexity of Working Set Selection.
Theoretical Computer Science 382 (3):262-279, 2007
[view abstract] [article (PS)]
- Phil Long, Rocco Servedio, Hans Ulrich Simon
Discriminative Learning can succeed where generative learning fails.
Information Processing Letters 103:131-135, 2007
[view abstract] [article (PS)]
- Jürgen Forster, Hans Ulrich Simon
On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes
Theoretical Computer Science 350 (1):40-48, 2006
[view abstract] [article (PS)]
- Eike Kiltz, Hans Ulrich Simon
Complexity Theoretic Aspects of some Cryptographic Functions
Journal of Computer and System Sciences 71:185-212, 2005
[view abstract] [article (PS)]
- Atsuyoshi Nakamura, Niels Schmitt, Michael Schmitt, Hans Ulrich Simon
Bayesian Networks an Inner Product spaces
Journal of Machine Learning Research 6:1383-1403, 2005
[view abstract] [article (PS)]
- Hans Ulrich Simon
How many missing answers can be tolerated by query learners?
Theory of Computing Systems 37(1):77-94, 2004
[view abstract] [article (PS)]
- Jürgen Forster, Niels Schmitt, Hans Ulrich Simon, Thorsten Suttorp
Estimating the Optimal Margins of Embeddings in Euclidean Half-Spaces
Journal of Machine Learning Research 51(3):263-281, 2003
[view abstract] [article (PS)]
- Matthias Krause, Hans Ulrich Simon
Determining the optimal contrast for secret sharing schemes in visual cryptography
Combinatorics, Probability and Computing 12(3):285-299, 2003
[view abstract] [article (PS)]
- Hans Ulrich Simon
How many queries are needed to learn one bit of information?
The Annals of Mathematics and Artificial Intelligience 39:333:343, 2003
[view abstract] [article (PS)]
- José L. Balcazar, Jorge Castro, David Guijarro, Hans Ulrich Simon
The consistency dimension and distribution-dependent learning from queries
Theoretical Computer Science 288(2):197-215, 2002
[view abstract] [article (PS)]
- Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
The Computational Complexity of Densest Region Detection
Journal of Computer and System Sciences 64 (1):22-47, 2002
[view abstract] [article (PS)]
- Shai Ben-David, Nadav Eiron, Hans Ulrich Simon
Limitations of Learning via Embeddings in Euclidean Half-Spaces
Journal of Machine Learning Research 3(Nov):441-461, 2002
[view abstract]
- Thomas Hofmeister, Matthias Krause, Hans Ulrich Simon
Contrast-optimal k-out-of-n secret sharing schemes in visual cryptography
Theoretical Computer Science 240(2):471-485, 2000
[view abstract]
- Andreas Birkendorf, Norbert Klasner, Christian Kuhlmann, Hans Ulrich Simon
Structural Results about Exact Learning with Unspecified Attribute Values
Journal of Computer and System Sciences 60(2):258-277, 2000
[view abstract]
- Andreas Birkendorf, Andreas Böker, Hans Ulrich Simon
Learning Deterministic Finite Automata from Smallest Counterexamples
SIAM Journal on Discrete Mathematics 13(4):465-491, 2000
[view abstract]
- Norbert Klasner, Hans Ulrich Simon
General Lower Bounds on the Query Complexity within the Exact LearningModel
Discrete Applied Mathematics 107(1-3):61-81, 2000
[view abstract]
- Nicolò Cesa-Bianchi, Eli Dichterman, Paul Fischer, Eli Shamir, Hans Ulrich Simon
Sample-efficient Strategies for Learning in the Presence of Noise
Journal of the ACM 46(5):684-719, 1999
[view abstract] [article (PS)]
- Andreas Birkendorf, Eli Dichterman, Jeffrey Jackson, Norbert Klasner, Hans Ulrich Simon
On restricted-focus-of-attention learnability of boolean functions
Machine Learning 30:89-123, 1998
[view abstract]
- Andreas Birkendorf, Hans Ulrich Simon
Using computational learning strategies as a tool in combinatorial optimization
The Annals of Mathematics and Artificial Intelligience 22:237-257, 1998
[view abstract]
- Hans Ulrich Simon
A continuous bound on the performance of critical-path schedules.
Journal of Information Processing and Cybernetics 24(4/5):171-189, 1998
[view abstract]
- Hans Ulrich Simon
Bounds on the number of examples needed for learning functions.
SIAM Journal on Discrete Mathematics 26(3):751-763, 1997
[view abstract]
- Svetlana Anoulova, Paul Fischer, Stefan Pölt, Hans Ulrich Simon
Probably almost Bayes decisions
Information and Computation 129(1):63-71, 1996
[view abstract]
- Hans Ulrich Simon
General bounds on the number of examples needed for learning probabilistic concepts
Journal of Computer and System Sciences 52(2):239-255, 1996
[view abstract]
- Klaus Uwe Höffgen, Hans Ulrich Simon, Kevin S. Van Horn
Robust trainability of single neurons
Journal of Computer and System Sciences 50(1):114-125, 1995
[view abstract]
- Paul Fischer, Hans Ulrich Simon
On learning ring-sum-expansions.
SIAM Journal on Discrete Mathematics 21(1):191-193, 1992
[view abstract]
- Hans Ulrich Simon
The Vapnik-Chervonenkis-Dimension of decision trees with bounded rank.
Information Processing Letters 39:137-141, 1991
[view abstract]
- Hans Ulrich Simon
On approximate solutions for combinatorial optimization problems.
SIAM Journal on Discrete Mathematics 3(2):294-310, 1990
[view abstract]
- Hans Ulrich Simon
Continuous reductions among combinatorial optimization problems.
Acta Informatica 26:771-785, 1989
[view abstract]
- Axel Böttcher, Gisbert Lawitzky, Hans Ulrich Simon
Worst-case analysis of heuristics for the local microcode optimization problem
Operations Research Letters 7(3):129-130, 1988
[view abstract]
- Bernd Becker, Hans Ulrich Simon
How robust is the n-cube?
Information and Computation 77(2):162-178, 1988
[view abstract]
- Hans Ulrich Simon
Pattern matching in trees and nets.
Acta Informatica 20:227-248, 1983
[view abstract]
- Hans Ulrich Simon
Classes of X-functors reducing pattern matching on nets to pattern matching on forests of binary trees
Journal of Information Processing and Cybernetics 19(9):465-479, 1983
[view abstract]
- Hans Ulrich Simon
The structure of the monoid (N,X) of logic circuits.
Journal of Information Processing and Cybernetics 19(6):279-296, 1983
[view abstract]
- Hans Ulrich Simon
A tight \omega(\log \log n) Bound on the time for parallel RAM's to Compute Nondegenerated Boolean Function
Information and Control 55(1-3):102-107, 1982
[view abstract]
|
|
| |
|
|
