Martin Kummer Coauthor index DBLP Vis pubzone.org

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

DBLP keys2000
44no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy McNicholl, Frank Stephan: The Comlexity of OddAn. J. Symb. Log. 65(1): 1-18 (2000)
1998
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLance 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
42no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer: Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. 55(1): 183-196 (1997)
1996
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Matthias Ott: Learning Branches and Learning to Win Closed Games. COLT 1996: 280-291
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, William I. Gasarch, Martin Kummer, Timothy McNicholl, Frank Stephan: On the Query Complexity of Sets. MFCS 1996: 206-217
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: On the Complexity of Random Strings (Extended Abstract). STACS 1996: 25-36
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSusanne Kaufmann, Martin Kummer: On a Quantitative Notion of Uniformity. Fundam. Inform. 25(1): 59-78 (1996)
37no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: On the Structure of Degrees of Inferability. J. Comput. Syst. Sci. 52(2): 214-238 (1996)
36no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: Inclusion Problems in Parallel Learning and Games. J. Comput. Syst. Sci. 52(3): 403-420 (1996)
35no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets. SIAM J. Comput. 25(6): 1123-1143 (1996)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLance Fortnow, Martin Kummer: On Resource-Bounded Instance Complexity. Theor. Comput. Sci. 161(1&2): 123-140 (1996)
1995
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Matthias Ott: Effective Strategies for Enumeration Games. CSL 1995: 368-387
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohn Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer: Learning recursive functions from approximations. EuroCOLT 1995: 140-153
31no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: The Power of Frequency Computation (Extended Abstract). FCT 1995: 323-332
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLance 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
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSusanne Kaufmann, Martin Kummer: On a Quantitative Notion of Uniformity. MFCS 1995: 169-178
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Marcus Schäfer: Computability of Convex Sets (Extended Abstract). STACS 1995: 550-561
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLance Fortnow, Martin Kummer: Resource-Bounded Instance Complexity (Extended Abstract). STACS 1995: 597-608
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: The Instance Complexity Conjecture. Structure in Complexity Theory Conference 1995: 111-124
25no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, Martin Kummer, Frank Stephan: Quantifying the Amount of Verboseness Inf. Comput. 118(1): 73-90 (1995)
24no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: Recursion Theoretic Properties of Frequency Computation and Bounded Queries Inf. Comput. 120(1): 59-77 (1995)
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, Martin Kummer, Frank Stephan: Approximable Sets Inf. Comput. 120(2): 304-314 (1995)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: A Learning-Theoretic Characterization of Classes of Recursive Functions. Inf. Process. Lett. 54(4): 205-211 (1995)
1994
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract). COLT 1994: 268-277
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: Inclusion Problems in Parallel Learning and Games (Extended Abstract). COLT 1994: 287-298
19no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, Martin Kummer, Frank Stephan: Approximable Sets. Structure in Complexity Theory Conference 1994: 12-23
18no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLance 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. Logic 66(3): 231-276 (1994)
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJürgen Dix, Martin Kummer: Herbrand's Theorem for Nonstandard Inference Operations. J. Log. Comput. 4(2): 143-156 (1994)
16no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEberhard Herrmann, Martin Kummer: Diagonals and D-Maximal Sets. J. Symb. Log. 59(1): 60-72 (1994)
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank Stephan, Martin Kummer: Effective Search Problems. Math. Log. Q. 40: 224-236 (1994)
1993
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: On the Structure of Degrees of Inferability. COLT 1993: 117-126
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). Kurt Gödel Colloquium 1993: 243-254
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer, Frank Stephan: Weakly Semirecursive Sets and r.e. Orderings. Ann. Pure Appl. Logic 60(2): 133-150 (1993)
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJürgen Dix, Martin Kummer: Herbrand's Theorem for Nonstandard Inference Operations (Abstract). J. Symb. Log. 58(3): 1116-1117 (1993)
1992
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter 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
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: Degrees of Unsolvability in Abstract Complexity Theory. Complexity Theory: Current Research 1992: 227-243
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Beigel, Martin Kummer, Frank Stephan: Quantifying the Amount of Verboseness. LFCS 1992: 21-32
7no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: A Proof of Beigel's Cardinality Conjecture. J. Symb. Log. 57(2): 677-681 (1992)
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLValentina S. Harizanov, Martin Kummer, James C. Owings: Frequency Computations and the Cardinality Theorem. J. Symb. Log. 57(2): 682-687 (1992)
1991
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: Diagonals and Semihyperhypersimple Sets. J. Symb. Log. 56(3): 1068-1074 (1991)
1990
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: An Easy Priority-Free Proof of a Theorem of Friedberg. Theor. Comput. Sci. 74(2): 249-251 (1990)
1989
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: A Note on Direct Sums of Friedbergnumberings. J. Symb. Log. 54(3): 1009-1010 (1989)
1988
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: Numberings of R1 union F. CSL 1988: 166-186
1987
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Kummer: Negative Results about the Length Problem. Computation Theory and Logic 1987: 237-248

Coauthor Index

1Richard Beigel [8] [19] [23] [25] [40] [44]
2John Case [32] [42]
3Peter Cholak [10]
4Jürgen Dix [11] [17]
5Rodney G. Downey (Rod Downey) [10]
6Lance Fortnow [10] [18] [27] [30] [34] [43]
7Rusins Freivalds [30] [43]
8William I. Gasarch [10] [18] [30] [40] [43] [44]
9Valentina S. Harizanov [6]
10Eberhard Herrmann [16]
11Sanjay Jain [18]
12Susanne Kaufmann [29] [32] [38] [42]
13Efim B. Kinber [10] [18] [32] [42]
14Stuart A. Kurtz [10] [18] [30] [43]
15Georgia Martin [44]
16Timothy McNicholl [40] [44]
17Matthias Ott [33] [41]
18James C. Owings [6]
19Mark Pleszkovich [18]
20Marcus Schäfer [28]
21Theodore A. Slaman [10] [18]
22Carl H. Smith [30] [43]
23Robert Solovay [18]
24Frank Stephan [8] [12] [13] [14] [15] [18] [19] [20] [23] [24] [25] [30] [31] [36] [37] [40] [43] [44]

Colors in the list of coauthors

Copyright © Fri Nov 20 16:48:08 2009 by Michael Ley (ley@uni-trier.de)