| 1996 | COLT | Learning Branches and Learning to Win Closed Games. | Martin Kummer, Matthias Ott |
| 1996 | MFCS | On the Query Complexity of Sets. | Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan |
| 1996 | STACS | On the Complexity of Random Strings (Extended Abstract). | Martin Kummer |
| 1995 | CSL | Effective Strategies for Enumeration Games. | Martin Kummer, Matthias Ott |
| 1995 | FCT | The Power of Frequency Computation (Extended Abstract). | Martin Kummer, Frank Stephan |
| 1995 | ICALP | Measure, Category and Learning Theory. | Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan |
| 1995 | MFCS | On a Quantitative Notion of Uniformity. | Susanne Kaufmann, Martin Kummer |
| 1995 | STACS | Resource-Bounded Instance Complexity (Extended Abstract). | Lance Fortnow, Martin Kummer |
| 1995 | STACS | Computability of Convex Sets (Extended Abstract). | Martin Kummer, Marcus Schfer |
| 1994 | COLT | The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract). | Martin Kummer |
| 1994 | COLT | Inclusion Problems in Parallel Learning and Games (Extended Abstract). | Martin Kummer, Frank Stephan |
| 1993 | COLT | On the Structure of Degrees of Inferability. | Martin Kummer, Frank Stephan |
| 1992 | COLT | Degrees of Inferability. | Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman |
| 1992 | LFCS | Quantifying the Amount of Verboseness. | Richard Beigel, Martin Kummer, Frank Stephan |
| 1988 | CSL | Numberings of R | Martin Kummer |