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