dblp.uni-trier.dewww.uni-trier.de

Hans-Ulrich Simon Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
89EEHans-Ulrich Simon: Smart PAC-Learners. ALT 2009: 353-367
88EELisa Hellerstein, Hans-Ulrich Simon: Special Issue: Learning Theory 2006. J. Comput. Syst. Sci. 75(1): 1 (2009)
2008
87EEThorsten Doliwa, Michael Kallweit, Hans-Ulrich Simon: Dimension and Margin Bounds for Reflection-invariant Kernels. COLT 2008: 157-168
2007
86EEShai Ben-David, Dávid Pál, Hans-Ulrich Simon: Stability of k -Means Clustering. COLT 2007: 20-34
85EEHans-Ulrich Simon: A Characterization of Strong Learnability in the Statistical Query Model. STACS 2007: 393-404
84EEPhilip M. Long, Rocco A. Servedio, Hans-Ulrich Simon: Discriminative learning can succeed where generative learning fails. Inf. Process. Lett. 103(4): 131-135 (2007)
83EENikolas List, Hans-Ulrich Simon: General Polynomial Time Decomposition Algorithms. Journal of Machine Learning Research 8: 303-321 (2007)
82EEAvrim Blum, Gábor Lugosi, Hans-Ulrich Simon: Introduction to the special issue on COLT 2006. Machine Learning 69(2-3): 75-77 (2007)
81EEHans-Ulrich Simon: On the complexity of working set selection. Theor. Comput. Sci. 382(3): 262-279 (2007)
80EEHans-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
78EEHans-Ulrich Simon: Spectral Norm in Learning Theory: Some Selected Topics. ALT 2006: 13-27
77EEHans-Ulrich Simon: Spectral Norm in Learning Theory: Some Selected Topics. Discovery Science 2006: 16
76EEJü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
74EESanjay Jain, Hans-Ulrich Simon, Etsuji Tomita: Editors' Introduction. ALT 2005: 1-9
73EENikolas List, Hans-Ulrich Simon: General Polynomial Time Decomposition Algorithms. COLT 2005: 308-322
72EEHans-Ulrich Simon: Perfect Reconstruction of Black Pixels Revisited. FCT 2005: 221-232
71EEEike Kiltz, Hans-Ulrich Simon: Threshold circuit lower bounds on cryptographic functions. J. Comput. Syst. Sci. 71(2): 185-212 (2005)
70EEAtsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans-Ulrich Simon: Inner Product Spaces for Bayesian Networks. Journal of Machine Learning Research 6: 1383-1403 (2005)
2004
69EEHans-Ulrich Simon: On the Complexity of Working Set Selection. ALT 2004: 324-337
68EENikolas List, Hans-Ulrich Simon: A General Convergence Theorem for the Decomposition Method. COLT 2004: 363-377
67EEAtsuyoshi Nakamura, Michael Schmitt, Niels Schmitt, Hans-Ulrich Simon: Bayesian Networks and Inner Product Spaces. COLT 2004: 518-533
66EEHans-Ulrich Simon: How Many Missing Answers Can Be Tolerated by Query Learners? Theory Comput. Syst. 37(1): 77-94 (2004)
2003
65EEEike 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)
62EEJü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
61EEJü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
60EEDietrich 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
59EEHans-Ulrich Simon: How Many Missing Answers Can Be Tolerated by Query Learners? STACS 2002: 384-395
58EEShai Ben-David, Nadav Eiron, Hans-Ulrich Simon: The Computational Complexity of Densest Region Detection. J. Comput. Syst. Sci. 64(1): 22-47 (2002)
57EEShai 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)
56EEPaul 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
54EEHans-Ulrich Simon: How Many Queries Are Needed to Learn One Bit of Information? COLT/EuroCOLT 2001: 1-13
53EEShai Ben-David, Nadav Eiron, Hans-Ulrich Simon: Limitations of Learning via Embeddings in Euclidean Half-Spaces. COLT/EuroCOLT 2001: 385-401
52EEJürgen Forster, Niels Schmitt, Hans-Ulrich Simon: Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces. COLT/EuroCOLT 2001: 402-415
51EEJü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
47EEChristian 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)
45EEMatthias 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)
43EEAndreas Birkendorf, Andreas Böker, Hans-Ulrich Simon: Learning Deterministic Finite Automata from Smallest Counterexamples. SIAM J. Discrete Math. 13(4): 465-491 (2000)
42EEThomas 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
40EEJosé 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
39EENicolò 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
38EEAndreas 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
31EEAndreas Birkendorf, Eli Dichterman, Jeffrey C. Jackson, Norbert Klasner, Hans-Ulrich Simon: On Restricted-Focus-of-Attention Learnability of Boolean Functions. COLT 1996: 205-216
30EENicolò 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
27EENorbert 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
23EEHans-Ulrich Simon: General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. COLT 1993: 402-411
1992
22EESvetlana Anoulova, Paul Fischer, Stefan Pölt, Hans-Ulrich Simon: PAB-Decisions for Boolean and Real-Valued Features. COLT 1992: 353-362
21EEKlaus-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
19EEPaul 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
15EEPaul Fischer, Hans-Ulrich Simon: On Learning Ring-Sum-Expansions. COLT 1990: 130-143
14EEHans-Ulrich Simon: On the Number of Examples and Stages Needed for Learning Decision Trees. COLT 1990: 303-313
13EEPaul 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

Coauthor Index

1Svetlana Anoulova [22] [29]
2José L. Balcázar [40] [55]
3Bernd Becker [7] [8]
4Shai Ben-David [48] [50] [53] [57] [58] [86]
5Andreas Birkendorf [31] [35] [36] [37] [38] [43] [44]
6Avrim Blum [82]
7Andreas Böker [37] [43]
8Dietrich Braess [60]
9Jorge Castro [40] [55]
10Nicolò Cesa-Bianchi [30] [33] [39]
11Jorge Ricardo Cuellar [24]
12Eli Dichterman [30] [31] [35] [39]
13Thorsten Doliwa [87]
14Nadav Eiron [50] [53] [57] [58]
15Paul Fischer [13] [15] [19] [20] [22] [29] [30] [33] [39] [41] [56]
16Jürgen Forster [51] [52] [60] [61] [62] [76]
17David Guijarro [40] [55]
18H. Hackbarth [17]
19Lisa Hellerstein [88]
20Daniel Hernández [17]
21Gerd Hirzinger [17]
22Klaus-Uwe Höffgen [21] [25]
23Thomas Hofmeister [34] [42]
24Kevin S. Van Horn [25]
25Jeffrey C. Jackson [31] [35]
26Sanjay Jain [74] [75]
27Michael Kallweit [87]
28Eike Kiltz [65] [71]
29Norbert Klasner [27] [31] [35] [38] [44] [46]
30Matthias Krause [34] [42] [45] [49] [51] [63]
31Christian Kuhlmann [38] [44] [47]
32Nikolas List [68] [73] [83]
33Satyanarayana V. Lokam [51]
34Philip M. Long [84]
35Gábor Lugosi [79] [82]
36Rustam Mubarakzjanov [51]
37Atsuyoshi Nakamura [67] [70]
38Dávid Pál [86]
39Stefan Pölt [19] [22] [29]
40Tomas Sauer [60]
41Michael Schmitt [67] [70]
42Niels Schmitt [51] [52] [62] [67] [70]
43Bernd Schürmann [17]
44Rocco A. Servedio [84]
45Eli Shamir [33] [39]
46Carl Smith [56]
47Thorsten Suttorp [62]
48Etsuji Tomita [74] [75] [80]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)