Остановите войну!
for scientists:
default search action
Hans Simon 0001
- > Home > Persons > Hans Simon 0001
Publications
- 2024
- [i9]Hans Ulrich Simon:
Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets. CoRR abs/2402.06729 (2024) - 2023
- [c70]Hans Ulrich Simon:
Tournaments, Johnson Graphs and NC-Teaching. ALT 2023: 1411-1428 - 2022
- [i7]Hans Ulrich Simon:
Tournaments, Johnson Graphs, and NC-Teaching. CoRR abs/2205.02792 (2022) - [i6]Hans Ulrich Simon:
Minimum Tournaments with the Strong Sk-Property and Implications for Teaching. CoRR abs/2205.08357 (2022) - 2018
- [c67]Hans Ulrich Simon:
On the Containment Problem for Linear Sets. STACS 2018: 55:1-55:12 - 2017
- [i2]Hans Ulrich Simon:
On the Containment Problem for Linear Sets. CoRR abs/1710.04533 (2017) - 2016
- [j46]Hans Ulrich Simon:
Efficient computation of approximate isomorphisms between Boolean functions. Inf. Process. Lett. 116(3): 237-240 (2016) - 2015
- [c61]Hans Ulrich Simon:
An Almost Optimal PAC Algorithm. COLT 2015: 1552-1563 - 2014
- [j44]Hans Ulrich Simon:
PAC-learning in the presence of one-sided classification noise. Ann. Math. Artif. Intell. 71(4): 283-300 (2014) - 2012
- [c54]Hans Ulrich Simon:
Boolean Composition of Visual Secret Sharing Schemes. CSR 2012: 314-325 - [c53]Hans Ulrich Simon:
PAC-Learning in the Presence of One-sided Classification Noise. ISAIM 2012 - 2009
- [c49]Hans Ulrich Simon:
Smart PAC-Learners. ALT 2009: 353-367 - 2007
- [j35]Hans Ulrich Simon:
On the complexity of working set selection. Theor. Comput. Sci. 382(3): 262-279 (2007) - [c45]Hans Ulrich Simon:
A Characterization of Strong Learnability in the Statistical Query Model. STACS 2007: 393-404 - 2006
- [c44]Hans Ulrich Simon:
Spectral Norm in Learning Theory: Some Selected Topics. ALT 2006: 13-27 - [c43]Hans Ulrich Simon:
Spectral Norm in Learning Theory: Some Selected Topics. Discovery Science 2006: 16 - 2005
- [c40]Hans Ulrich Simon:
Perfect Reconstruction of Black Pixels Revisited. FCT 2005: 221-232 - 2004
- [j30]Hans Ulrich Simon:
How Many Missing Answers Can Be Tolerated by Query Learners? Theory Comput. Syst. 37(1): 77-94 (2004) - [c39]Hans Ulrich Simon:
On the Complexity of Working Set Selection. ALT 2004: 324-337 - 2003
- [j29]Hans Ulrich Simon:
How Many Queries Are Needed to Learn One Bit of Information? Ann. Math. Artif. Intell. 39(3): 333-343 (2003) - 2002
- [c33]Hans Ulrich Simon:
How Many Missing Answers Can Be Tolerated by Query Learners? STACS 2002: 384-395 - 2001
- [c32]Hans Ulrich Simon:
How Many Queries Are Needed to Learn One Bit of Information? COLT/EuroCOLT 2001: 1-13 - 1997
- [j15]Hans Ulrich Simon:
Bounds on the Number of Examples Needed for Learning Functions. SIAM J. Comput. 26(3): 751-763 (1997) - 1996
- [j13]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
- [c16]Hans Ulrich Simon:
Learning decision lists and trees with equivalence-queries. EuroCOLT 1995: 322-336 - 1993
- [c14]Hans Ulrich Simon:
General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. COLT 1993: 402-411 - [c13]Hans Ulrich Simon:
Bounds on the number of examples needed for learning functions. EuroCOLT 1993: 83-94 - 1992
- [p1]Hans Ulrich Simon:
Bemerkungen zum Schätzen von Bayesschen Diskriminantenfunktionen. Informatik 1992: 381-385 - 1991
- [j10]Hans Ulrich Simon:
The Vapnik-Chervonenkis Dimension of Decision Trees with Bounded Rank. Inf. Process. Lett. 39(3): 137-141 (1991) - [j9]Hans Ulrich Simon:
Neuronales Lernen auf der Basis empirischer Daten / Neural Learning Based on Empirical Data. it Inf. Technol. 33(6): 323-328 (1991) - [c9]Hans Ulrich Simon:
Algorithmisches Lernen auf der Basis empirischer Daten. Wissensbasierte Systeme 1991: 467-475 - 1990
- [j8]Hans Ulrich Simon:
On Approximate Solutions for Combinatorial Optimization Problems. SIAM J. Discret. Math. 3(2): 294-310 (1990) - [c6]Hans Ulrich Simon:
On the Number of Examples and Stages Needed for Learning Decision Trees. COLT 1990: 303-313 - 1989
- [j7]Hans Ulrich Simon:
Continuous Reductions Among Combinatorial Optimization Problems. Acta Informatica 26(8): 771-785 (1989) - [c4]Hans Ulrich Simon:
Approximation Algorithms for Channel Assignment in Cellular Radio Networks. FCT 1989: 405-415 - 1988
- [j6]Hans Ulrich Simon:
A Continuous Bound on the Performance of Critical-Path Schedules. J. Inf. Process. Cybern. 24(4/5): 171-187 (1988) - 1983
- [j4]Hans Ulrich Simon:
Pattern Matching in Trees and Nets. Acta Informatica 20: 227-248 (1983) - [j3]Hans Ulrich Simon:
The Structure of the Monoid (N, X) of Logic Circuits. J. Inf. Process. Cybern. 19(6): 279-296 (1983) - [j2]Hans Ulrich Simon:
Classes of X-functions Reducing Pattern Matching on Nets to Pattern Matching on Forests of Binary Trees. J. Inf. Process. Cybern. 19(9): 465-479 (1983) - [c2]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 - 1982
- [j1]Hans Ulrich Simon:
A Tight Omega(log log n)-Bound on the Time for Parallel RAM's to Compute Nondegenerated Boolean Functions. Inf. Control. 55(1-3): 102-106 (1982) - 1981
- [b1]Hans Ulrich Simon:
Komplexitätsbetrachtungen rationaler Baum- und Netzmengen. Saarland University, Saarbrücken, Germany, 1981, pp. 1-147 - 1979
- [c1]Hans Ulrich Simon:
Word problems for groups and contextfree recognition. FCT 1979: 417-422
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-21 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint