Negative Results about the Length Problem. - Martin Kummer (Computation Theory and Logic, 1987)

Numberings of R1 union F. - Martin Kummer (CSL, 1988)

The Length Problem for Co-R.E. Sets. - Martin Kummer (Math. Log. Q., 1988)

A Note on Direct Sums of Friedbergnumberings. - Martin Kummer (J. Symb. Log., 1989)

Beiträge zur Theorie der Numerierungen: eindeutige Numerierungen. - Martin Kummer (1989)

Some applications of computable one-one numberings. - Martin Kummer (Arch. Math. Log., 1990)

An Easy Priority-Free Proof of a Theorem of Friedberg. - Martin Kummer (Theor. Comput. Sci., 1990)

Diagonals and Semihyperhypersimple Sets. - Martin Kummer (J. Symb. Log., 1991)

Degrees of Inferability. - Peter Cholak; Efim B. Kinber; Rodney G. Downey; Martin Kummer; Lance Fortnow; Stuart A. Kurtz; William I. Gasarch; Theodore A. Slaman (COLT, 1992)

Degrees of Unsolvability in Abstract Complexity Theory. - Martin Kummer (Complexity Theory: Current Research, 1992)

Frequency Computations and the Cardinality Theorem. - Valentina S. Harizanov; Martin Kummer; James C. Owings (J. Symb. Log., 1992)

A Proof of Beigel's Cardinality Conjecture. - Martin Kummer (J. Symb. Log., 1992)

Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). - Martin Kummer; Frank Stephan 001 (Kurt Gödel Colloquium, 1993)

Weakly Semirecursive Sets and r.e. Orderings. - Martin Kummer; Frank Stephan 001 (Ann. Pure Appl. Log., 1993)

Herbrand's Theorem for Nonstandard Inference Operations (Abstract). - Jürgen Dix; Martin Kummer (J. Symb. Log., 1993)

The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract). - Martin Kummer (COLT, 1994)

Inclusion Problems in Parallel Learning and Games (Extended Abstract). - Martin Kummer; Frank Stephan 001 (COLT, 1994)

Extremes in the Degrees of Inferability. - Lance Fortnow; William I. Gasarch; Sanjay Jain 001; Efim B. Kinber; Martin Kummer; Stuart A. Kurtz; Mark Pleszkovich; Theodore A. Slaman; Robert Solovay; Frank Stephan 001 (Ann. Pure Appl. Log., 1994)

Diagonals and D-Maximal Sets. - Eberhard Herrmann; Martin Kummer (J. Symb. Log., 1994)

Herbrand's Theorem for Nonstandard Inference Operations. - Jürgen Dix; Martin Kummer (J. Log. Comput., 1994)

Effective Search Problems. - Frank Stephan 001; Martin Kummer (Math. Log. Q., 1994)

The Instance Complexity Conjecture. - Martin Kummer (SCT, 1995)

Effective Strategies for Enumeration Games. - Martin Kummer; Matthias Ott (CSL, 1995)

The Power of Frequency Computation (Extended Abstract). - Martin Kummer; Frank Stephan 001 (FCT, 1995)

Measure, Category and Learning Theory. - Lance Fortnow; Rusins Freivalds; William I. Gasarch; Martin Kummer; Stuart A. Kurtz; Carl H. Smith; Frank Stephan 001 (ICALP, 1995)

Resource-Bounded Instance Complexity (Extended Abstract). - Lance Fortnow; Martin Kummer (STACS, 1995)

Computability of Convex Sets (Extended Abstract). - Martin Kummer; Marcus Schäfer 001 (STACS, 1995)

A Learning-Theoretic Characterization of Classes of Recursive Functions. - Martin Kummer (Inf. Process. Lett., 1995)

Quantifying the Amount of Verboseness - Richard Beigel; Martin Kummer; Frank Stephan 001 (Inf. Comput., 1995)

Recursion Theoretic Properties of Frequency Computation and Bounded Queries - Martin Kummer; Frank Stephan 001 (Inf. Comput., 1995)

Approximable Sets - Richard Beigel; Martin Kummer; Frank Stephan 001 (Inf. Comput., 1995)

Learning Branches and Learning to Win Closed Games. - Martin Kummer; Matthias Ott (COLT, 1996)

On the Query Complexity of Sets. - Richard Beigel; William I. Gasarch; Martin Kummer; Timothy H. McNicholl; Frank Stephan 001 (MFCS, 1996)

On the Complexity of Random Strings (Extended Abstract). - Martin Kummer (STACS, 1996)

On a Quantitative Notion of Uniformity. - Susanne Kaufmann; Martin Kummer (Fundam. Informaticae, 1996)

On the Structure of Degrees of Inferability. - Martin Kummer; Frank Stephan 001 (J. Comput. Syst. Sci., 1996)

Inclusion Problems in Parallel Learning and Games. - Martin Kummer; Frank Stephan 001 (J. Comput. Syst. Sci., 1996)

Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets. - Martin Kummer (SIAM J. Comput., 1996)

On Resource-Bounded Instance Complexity. - Lance Fortnow; Martin Kummer (Theor. Comput. Sci., 1996)

Learning Recursive Functions from Approximations. - John Case; Susanne Kaufmann; Efim B. Kinber; Martin Kummer (J. Comput. Syst. Sci., 1997)

On the Relative Sizes of Learnable Sets. - Lance Fortnow; Rusins Freivalds; William I. Gasarch; Martin Kummer; Stuart A. Kurtz; Carl H. Smith; Frank Stephan 001 (Theor. Comput. Sci., 1998)

A Unified Approach to Linear and Nonlinear Normal Forms for Hamiltonian Systems. - Richard C. Churchill; Martin Kummer (J. Symb. Comput., 1999)

The Comlexity of OddAn. - Richard Beigel; William I. Gasarch; Martin Kummer; Georgia Martin; Timothy H. McNicholl; Frank Stephan 001 (J. Symb. Log., 2000)

Cuppability of Simple and Hypersimple Sets. - Martin Kummer; Marcus Schäfer 001 (Notre Dame J. Formal Log., 2007)