| 2009 |
|---|
| 88 | EE | Lisa Hellerstein,
Hans-Ulrich Simon:
Special Issue: Learning Theory 2006.
J. Comput. Syst. Sci. 75(1): 1 (2009) |
| 2008 |
|---|
| 87 | EE | Thorsten Doliwa,
Michael Kallweit,
Hans-Ulrich Simon:
Dimension and Margin Bounds for Reflection-invariant Kernels.
COLT 2008: 157-168 |
| 2007 |
|---|
| 86 | EE | Shai Ben-David,
Dávid Pál,
Hans-Ulrich Simon:
Stability of k -Means Clustering.
COLT 2007: 20-34 |
| 85 | EE | Hans-Ulrich Simon:
A Characterization of Strong Learnability in the Statistical Query Model.
STACS 2007: 393-404 |
| 84 | EE | Philip M. Long,
Rocco A. Servedio,
Hans-Ulrich Simon:
Discriminative learning can succeed where generative learning fails.
Inf. Process. Lett. 103(4): 131-135 (2007) |
| 83 | EE | Nikolas List,
Hans-Ulrich Simon:
General Polynomial Time Decomposition Algorithms.
Journal of Machine Learning Research 8: 303-321 (2007) |
| 82 | EE | Avrim Blum,
Gábor Lugosi,
Hans-Ulrich Simon:
Introduction to the special issue on COLT 2006.
Machine Learning 69(2-3): 75-77 (2007) |
| 81 | EE | Hans-Ulrich Simon:
On the complexity of working set selection.
Theor. Comput. Sci. 382(3): 262-279 (2007) |
| 80 | EE | Hans-Ulrich Simon,
Etsuji Tomita:
Guest editors' foreword.
Theor. Comput. Sci. 387(1): 1-3 (2007) |
| 2006 |
|---|
| 79 | | Gábor Lugosi,
Hans-Ulrich Simon:
Learning Theory, 19th Annual Conference on Learning Theory, COLT 2006, Pittsburgh, PA, USA, June 22-25, 2006, Proceedings
Springer 2006 |
| 78 | EE | Hans-Ulrich Simon:
Spectral Norm in Learning Theory: Some Selected Topics.
ALT 2006: 13-27 |
| 77 | EE | Hans-Ulrich Simon:
Spectral Norm in Learning Theory: Some Selected Topics.
Discovery Science 2006: 16 |
| 76 | EE | 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): 40-48 (2006) |
| 2005 |
|---|
| 75 | | Sanjay Jain,
Hans-Ulrich Simon,
Etsuji Tomita:
Algorithmic Learning Theory, 16th International Conference, ALT 2005, Singapore, October 8-11, 2005, Proceedings
Springer 2005 |
| 74 | EE | Sanjay Jain,
Hans-Ulrich Simon,
Etsuji Tomita:
Editors' Introduction.
ALT 2005: 1-9 |
| 73 | EE | Nikolas List,
Hans-Ulrich Simon:
General Polynomial Time Decomposition Algorithms.
COLT 2005: 308-322 |
| 72 | EE | Hans-Ulrich Simon:
Perfect Reconstruction of Black Pixels Revisited.
FCT 2005: 221-232 |
| 71 | EE | Eike Kiltz,
Hans-Ulrich Simon:
Threshold circuit lower bounds on cryptographic functions.
J. Comput. Syst. Sci. 71(2): 185-212 (2005) |
| 70 | EE | Atsuyoshi Nakamura,
Michael Schmitt,
Niels Schmitt,
Hans-Ulrich Simon:
Inner Product Spaces for Bayesian Networks.
Journal of Machine Learning Research 6: 1383-1403 (2005) |
| 2004 |
|---|
| 69 | EE | Hans-Ulrich Simon:
On the Complexity of Working Set Selection.
ALT 2004: 324-337 |
| 68 | EE | Nikolas List,
Hans-Ulrich Simon:
A General Convergence Theorem for the Decomposition Method.
COLT 2004: 363-377 |
| 67 | EE | Atsuyoshi Nakamura,
Michael Schmitt,
Niels Schmitt,
Hans-Ulrich Simon:
Bayesian Networks and Inner Product Spaces.
COLT 2004: 518-533 |
| 66 | EE | Hans-Ulrich Simon:
How Many Missing Answers Can Be Tolerated by Query Learners?
Theory Comput. Syst. 37(1): 77-94 (2004) |
| 2003 |
|---|
| 65 | EE | Eike Kiltz,
Hans-Ulrich Simon:
Complexity Theoretic Aspects of Some Cryptographic Functions.
COCOON 2003: 294-303 |
| 64 | | Hans-Ulrich Simon:
How Many Queries Are Needed to Learn One Bit of Information?
Ann. Math. Artif. Intell. 39(3): 333-343 (2003) |
| 63 | | Matthias Krause,
Hans-Ulrich Simon:
Determining The Optimal Contrast For Secret Sharing Schemes In Visual Cryptography.
Combinatorics, Probability & Computing 12(3): (2003) |
| 62 | EE | Jürgen Forster,
Niels Schmitt,
Hans-Ulrich Simon,
Thorsten Suttorp:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
Machine Learning 51(3): 263-281 (2003) |
| 2002 |
|---|
| 61 | EE | 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: 128-138 |
| 60 | EE | 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: 380-394 |
| 59 | EE | Hans-Ulrich Simon:
How Many Missing Answers Can Be Tolerated by Query Learners?
STACS 2002: 384-395 |
| 58 | EE | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
The Computational Complexity of Densest Region Detection.
J. Comput. Syst. Sci. 64(1): 22-47 (2002) |
| 57 | EE | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
Limitations of Learning Via Embeddings in Euclidean Half Spaces.
Journal of Machine Learning Research 3: 441-461 (2002) |
| 56 | EE | Paul Fischer,
Hans-Ulrich Simon,
Carl Smith:
Foreword.
Theor. Comput. Sci. 284(1): 1-2 (2002) |
| 55 | | 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): 197-215 (2002) |
| 2001 |
|---|
| 54 | EE | Hans-Ulrich Simon:
How Many Queries Are Needed to Learn One Bit of Information?
COLT/EuroCOLT 2001: 1-13 |
| 53 | EE | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
Limitations of Learning via Embeddings in Euclidean Half-Spaces.
COLT/EuroCOLT 2001: 385-401 |
| 52 | EE | Jürgen Forster,
Niels Schmitt,
Hans-Ulrich Simon:
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces.
COLT/EuroCOLT 2001: 402-415 |
| 51 | EE | 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: 171-182 |
| 2000 |
|---|
| 50 | | Shai Ben-David,
Nadav Eiron,
Hans-Ulrich Simon:
The Computational Complexity of Densest Region Detection.
COLT 2000: 255-265 |
| 49 | | Matthias Krause,
Hans-Ulrich Simon:
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography.
LATIN 2000: 280-291 |
| 48 | | Shai Ben-David,
Hans-Ulrich Simon:
Efficient Learning of Linear Perceptrons.
NIPS 2000: 189-195 |
| 47 | EE | Christian Kuhlmann,
Hans-Ulrich Simon:
Construction of visual secret sharing schemes with almost optimal contrast.
SODA 2000: 263-272 |
| 46 | | Norbert Klasner,
Hans-Ulrich Simon:
General lower bounds on the query complexity within the exact learning model.
Discrete Applied Mathematics 107(1-3): 61-81 (2000) |
| 45 | EE | Matthias Krause,
Hans-Ulrich Simon:
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
Electronic Colloquium on Computational Complexity (ECCC) 7(3): (2000) |
| 44 | | Andreas Birkendorf,
Norbert Klasner,
Christian Kuhlmann,
Hans-Ulrich Simon:
Structural Results about Exact Learning with Unspecified Attribute Values.
J. Comput. Syst. Sci. 60(2): 258-277 (2000) |
| 43 | EE | Andreas Birkendorf,
Andreas Böker,
Hans-Ulrich Simon:
Learning Deterministic Finite Automata from Smallest Counterexamples.
SIAM J. Discrete Math. 13(4): 465-491 (2000) |
| 42 | EE | Thomas Hofmeister,
Matthias Krause,
Hans-Ulrich Simon:
Contrast-optimal k out of n secret sharing schemes in visual cryptography.
Theor. Comput. Sci. 240(2): 471-485 (2000) |
| 1999 |
|---|
| 41 | | Paul Fischer,
Hans-Ulrich Simon:
Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings
Springer 1999 |
| 40 | EE | José L. Balcázar,
Jorge Castro,
David Guijarro,
Hans-Ulrich Simon:
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract).
ATL 1999: 77-92 |
| 39 | EE | 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): 684-719 (1999) |
| 1998 |
|---|
| 38 | EE | Andreas Birkendorf,
Norbert Klasner,
Christian Kuhlmann,
Hans-Ulrich Simon:
Structural Results about Exact Learning with Unspecified Attribute Values.
COLT 1998: 144-153 |
| 37 | | Andreas Birkendorf,
Andreas Böker,
Hans-Ulrich Simon:
Learning Deterministic Finite Automata from Smallest Counterexamples.
SODA 1998: 599-608 |
| 36 | | Andreas Birkendorf,
Hans-Ulrich Simon:
Using Computational Learning Strategies as a Tool for Combinatorial Optimization.
Ann. Math. Artif. Intell. 22(3-4): 237-257 (1998) |
| 35 | | Andreas Birkendorf,
Eli Dichterman,
Jeffrey C. Jackson,
Norbert Klasner,
Hans-Ulrich Simon:
On Restricted-Focus-of-Attention Learnability of Boolean Functions.
Machine Learning 30(1): 89-123 (1998) |
| 1997 |
|---|
| 34 | | Thomas Hofmeister,
Matthias Krause,
Hans-Ulrich Simon:
Contrast-Optimal k out of n Secret Sharing Schemes in Visual Cryptography.
COCOON 1997: 176-185 |
| 33 | | Nicolò Cesa-Bianchi,
Paul Fischer,
Eli Shamir,
Hans-Ulrich Simon:
Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise.
EuroCOLT 1997: 119-133 |
| 32 | | Hans-Ulrich Simon:
Bounds on the Number of Examples Needed for Learning Functions.
SIAM J. Comput. 26(3): 751-763 (1997) |
| 1996 |
|---|
| 31 | EE | Andreas Birkendorf,
Eli Dichterman,
Jeffrey C. Jackson,
Norbert Klasner,
Hans-Ulrich Simon:
On Restricted-Focus-of-Attention Learnability of Boolean Functions.
COLT 1996: 205-216 |
| 30 | EE | Nicolò Cesa-Bianchi,
Eli Dichterman,
Paul Fischer,
Hans-Ulrich Simon:
Noise-Tolerant Learning Near the Information-Theoretic Bound.
STOC 1996: 141-150 |
| 29 | | Svetlana Anoulova,
Paul Fischer,
Stefan Pölt,
Hans-Ulrich Simon:
Probably Almost Bayes Decisions.
Inf. Comput. 129(1): 63-71 (1996) |
| 28 | | Hans-Ulrich Simon:
General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts.
J. Comput. Syst. Sci. 52(2): 239-254 (1996) |
| 1995 |
|---|
| 27 | EE | Norbert Klasner,
Hans-Ulrich Simon:
From Noise-Free to Noise-Tolerant and from On-line to Batch Learning.
COLT 1995: 250-257 |
| 26 | | Hans-Ulrich Simon:
Learning decision lists and trees with equivalence-queries.
EuroCOLT 1995: 322-336 |
| 25 | | Klaus-Uwe Höffgen,
Hans-Ulrich Simon,
Kevin S. Van Horn:
Robust Trainability of Single Neurons.
J. Comput. Syst. Sci. 50(1): 114-125 (1995) |
| 1993 |
|---|
| 24 | | Jorge Ricardo Cuellar,
Hans-Ulrich Simon:
Neural Discriminant Analysis.
ALT 1993: 223-236 |
| 23 | EE | Hans-Ulrich Simon:
General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts.
COLT 1993: 402-411 |
| 1992 |
|---|
| 22 | EE | Svetlana Anoulova,
Paul Fischer,
Stefan Pölt,
Hans-Ulrich Simon:
PAB-Decisions for Boolean and Real-Valued Features.
COLT 1992: 353-362 |
| 21 | EE | Klaus-Uwe Höffgen,
Hans-Ulrich Simon:
Robust Trainability of Single Neurons.
COLT 1992: 428-439 |
| 20 | | Paul Fischer,
Hans-Ulrich Simon:
On Learning Ring-Sum-Expansions.
SIAM J. Comput. 21(1): 181-192 (1992) |
| 1991 |
|---|
| 19 | EE | Paul Fischer,
Stefan Pölt,
Hans-Ulrich Simon:
Probably Almost Bayes Decisions.
COLT 1991: 88-94 |
| 18 | | Hans-Ulrich Simon:
Algorithmisches Lernen auf der Basis empirischer Daten.
Wissensbasierte Systeme 1991: 467-475 |
| 17 | | Bernd Schürmann,
Gerd Hirzinger,
Daniel Hernández,
Hans-Ulrich Simon,
H. Hackbarth:
Neural Control Within the BMFT-Project NERES.
Wissensbasierte Systeme 1991: 533-544 |
| 16 | | Hans-Ulrich Simon:
The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank.
Inf. Process. Lett. 39(3): 137-141 (1991) |
| 1990 |
|---|
| 15 | EE | Paul Fischer,
Hans-Ulrich Simon:
On Learning Ring-Sum-Expansions.
COLT 1990: 130-143 |
| 14 | EE | Hans-Ulrich Simon:
On the Number of Examples and Stages Needed for Learning Decision Trees.
COLT 1990: 303-313 |
| 13 | | Paul Fischer,
Hans-Ulrich Simon:
Separation Problems and Circular Arc Systems.
WG 1990: 251-259 |
| 12 | | Hans-Ulrich Simon:
On Approximate Solutions for Combinatorial Optimization Problems.
SIAM J. Discrete Math. 3(2): 294-310 (1990) |
| 1989 |
|---|
| 11 | | Hans-Ulrich Simon:
Approximation Algorithms for Channel Assignment in Cellular Radio Networks.
FCT 1989: 405-415 |
| 10 | | Hans-Ulrich Simon:
Continuous Reductions Among Combinatorial Optimization Problems.
Acta Inf. 26(8): 771-785 (1989) |
| 1988 |
|---|
| 9 | | Hans-Ulrich Simon:
A Continuous Bound on the Performance of Critical-Path Schedules.
Elektronische Informationsverarbeitung und Kybernetik 24(4/5): 171-187 (1988) |
| 8 | | Bernd Becker,
Hans-Ulrich Simon:
How Robust Is The n-Cube?
Inf. Comput. 77(2): 162-178 (1988) |
| 1986 |
|---|
| 7 | | Bernd Becker,
Hans-Ulrich Simon:
How Robust Is the n-Cube? (Extended Abstract)
FOCS 1986: 283-291 |
| 1983 |
|---|
| 6 | | Hans-Ulrich Simon:
A Tight Omega(loglog n)-Bound on the Time for Parallel Ram's to Compute Nondegenerated Boolean Functions.
FCT 1983: 439-444 |
| 5 | | Hans-Ulrich Simon:
Pattern Matching in Trees and Nets.
Acta Inf. 20: 227-248 (1983) |
| 4 | | Hans-Ulrich Simon:
The Structure of the Monoid (N, X) of Logic Circuits.
Elektronische Informationsverarbeitung und Kybernetik 19(6): 279-296 (1983) |
| 3 | | Hans-Ulrich Simon:
Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees.
Elektronische Informationsverarbeitung und Kybernetik 19(9): 465-479 (1983) |
| 1982 |
|---|
| 2 | | Hans-Ulrich Simon:
A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions
Information and Control 55(1-3): 102-106 (1982) |
| 1979 |
|---|
| 1 | | Hans-Ulrich Simon:
Word problems for groups and contextfree recognition.
FCT 1979: 417-422 |
