The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans-Ulrich Simon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  82. Smart PAC-Learners. [Citation Graph (, )][DBLP]


  83. Recursive Teaching Dimension, Learning Complexity, and Maximum Classes. [Citation Graph (, )][DBLP]


  84. Dimension and Margin Bounds for Reflection-invariant Kernels. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002