default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Kummer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j27]Martin Kummer, Marcus Schäfer:
Cuppability of Simple and Hypersimple Sets. Notre Dame J. Formal Log. 48(3): 349-369 (2007)- 2000
- [j26]Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan:
The Comlexity of OddAn. J. Symb. Log. 65(1): 1-18 (2000)
1990 – 1999
- 1999
- [j25]Richard C. Churchill, Martin Kummer:
A Unified Approach to Linear and Nonlinear Normal Forms for Hamiltonian Systems. J. Symb. Comput. 27(1): 49-131 (1999) - 1998
- [j24]Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
:
On the Relative Sizes of Learnable Sets. Theor. Comput. Sci. 197(1-2): 139-156 (1998) - 1997
- [j23]John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer:
Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. 55(1): 183-196 (1997) - 1996
- [j22]Susanne Kaufmann, Martin Kummer:
On a Quantitative Notion of Uniformity. Fundam. Informaticae 25(1): 59-78 (1996) - [j21]Martin Kummer, Frank Stephan:
On the Structure of Degrees of Inferability. J. Comput. Syst. Sci. 52(2): 214-238 (1996) - [j20]Martin Kummer, Frank Stephan:
Inclusion Problems in Parallel Learning and Games. J. Comput. Syst. Sci. 52(3): 403-420 (1996) - [j19]Martin Kummer:
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets. SIAM J. Comput. 25(6): 1123-1143 (1996) - [j18]Lance Fortnow, Martin Kummer:
On Resource-Bounded Instance Complexity. Theor. Comput. Sci. 161(1&2): 123-140 (1996) - [c21]Martin Kummer, Matthias Ott:
Learning Branches and Learning to Win Closed Games. COLT 1996: 280-291 - [c20]Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan:
On the Query Complexity of Sets. MFCS 1996: 206-217 - [c19]Martin Kummer:
On the Complexity of Random Strings (Extended Abstract). STACS 1996: 25-36 - 1995
- [j17]Richard Beigel, Martin Kummer, Frank Stephan:
Quantifying the Amount of Verboseness. Inf. Comput. 118(1): 73-90 (1995) - [j16]Martin Kummer, Frank Stephan:
Recursion Theoretic Properties of Frequency Computation and Bounded Queries. Inf. Comput. 120(1): 59-77 (1995) - [j15]Richard Beigel, Martin Kummer, Frank Stephan:
Approximable Sets. Inf. Comput. 120(2): 304-314 (1995) - [j14]Martin Kummer:
A Learning-Theoretic Characterization of Classes of Recursive Functions. Inf. Process. Lett. 54(4): 205-211 (1995) - [c18]Martin Kummer:
The Instance Complexity Conjecture. SCT 1995: 111-124 - [c17]Martin Kummer, Matthias Ott:
Effective Strategies for Enumeration Games. CSL 1995: 368-387 - [c16]John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer:
Learning recursive functions from approximations. EuroCOLT 1995: 140-153 - [c15]Martin Kummer, Frank Stephan:
The Power of Frequency Computation (Extended Abstract). FCT 1995: 323-332 - [c14]Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan:
Measure, Category and Learning Theory. ICALP 1995: 558-569 - [c13]Susanne Kaufmann, Martin Kummer:
On a Quantitative Notion of Uniformity. MFCS 1995: 169-178 - [c12]Martin Kummer, Marcus Schäfer:
Computability of Convex Sets (Extended Abstract). STACS 1995: 550-561 - [c11]Lance Fortnow, Martin Kummer:
Resource-Bounded Instance Complexity (Extended Abstract). STACS 1995: 597-608 - 1994
- [j13]Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan:
Extremes in the Degrees of Inferability. Ann. Pure Appl. Log. 66(3): 231-276 (1994) - [j12]Eberhard Herrmann, Martin Kummer:
Diagonals and D-Maximal Sets. J. Symb. Log. 59(1): 60-72 (1994) - [j11]Jürgen Dix, Martin Kummer:
Herbrand's Theorem for Nonstandard Inference Operations. J. Log. Comput. 4(2): 143-156 (1994) - [j10]Frank Stephan, Martin Kummer:
Effective Search Problems. Math. Log. Q. 40: 224-236 (1994) - [c10]Richard Beigel, Martin Kummer, Frank Stephan:
Approximable Sets. SCT 1994: 12-23 - [c9]Martin Kummer:
The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract). COLT 1994: 268-277 - [c8]Martin Kummer, Frank Stephan:
Inclusion Problems in Parallel Learning and Games (Extended Abstract). COLT 1994: 287-298 - 1993
- [j9]Martin Kummer, Frank Stephan:
Weakly Semirecursive Sets and r.e. Orderings. Ann. Pure Appl. Log. 60(2): 133-150 (1993) - [j8]Jürgen Dix, Martin Kummer:
Herbrand's Theorem for Nonstandard Inference Operations (Abstract). J. Symb. Log. 58(3): 1116-1117 (1993) - [c7]Martin Kummer, Frank Stephan:
On the Structure of Degrees of Inferability. COLT 1993: 117-126 - [c6]Martin Kummer, Frank Stephan:
Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). Kurt Gödel Colloquium 1993: 243-254 - 1992
- [j7]Martin Kummer:
A Proof of Beigel's Cardinality Conjecture. J. Symb. Log. 57(2): 677-681 (1992) - [j6]Valentina S. Harizanov, Martin Kummer, James C. Owings:
Frequency Computations and the Cardinality Theorem. J. Symb. Log. 57(2): 682-687 (1992) - [c5]Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman:
Degrees of Inferability. COLT 1992: 180-192 - [c4]Martin Kummer:
Degrees of Unsolvability in Abstract Complexity Theory. Complexity Theory: Current Research 1992: 227-243 - [c3]Richard Beigel, Martin Kummer, Frank Stephan:
Quantifying the Amount of Verboseness. LFCS 1992: 21-32 - 1991
- [j5]Martin Kummer:
Diagonals and Semihyperhypersimple Sets. J. Symb. Log. 56(3): 1068-1074 (1991) - 1990
- [j4]Martin Kummer:
Some applications of computable one-one numberings. Arch. Math. Log. 30(4): 219-230 (1990) - [j3]Martin Kummer:
An Easy Priority-Free Proof of a Theorem of Friedberg. Theor. Comput. Sci. 74(2): 249-251 (1990)
1980 – 1989
- 1989
- [b1]Martin Kummer:
Beiträge zur Theorie der Numerierungen: eindeutige Numerierungen. Karlsruhe Institute of Technology, Germany, 1989, pp. 1-113 - [j2]Martin Kummer:
A Note on Direct Sums of Friedbergnumberings. J. Symb. Log. 54(3): 1009-1010 (1989) - 1988
- [j1]Martin Kummer:
The Length Problem for Co-R.E. Sets. Math. Log. Q. 34(3): 277-282 (1988) - [c2]Martin Kummer:
Numberings of R1 union F. CSL 1988: 166-186 - 1987
- [c1]Martin Kummer:
Negative Results about the Length Problem. Computation Theory and Logic 1987: 237-248
Coauthor Index
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-04-25 05:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
