Martin Kummer

Publication Activity (10 Years)

Years Active: 1987-2007
Publications (10 Years): 0

Karlsruhe Institute of Technology, Germany (PHD)

Education History

Karlsruhe Institute of Technology, Germany

PHD

Publications

Martin Kummer, Marcus Schäfer
Cuppability of Simple and Hypersimple Sets. Notre Dame J. Formal Log. 48 (3) (2007)
Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan
. J. Symb. Log. 65 (1) (2000)
R. C. Churchill, Martin Kummer
A Unified Approach to Linear and Nonlinear Normal Forms for Hamiltonian Systems. J. Symb. Comput. 27 (1) (1999)
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) (1998)
John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer
Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. 55 (1) (1997)
Lance Fortnow, Martin Kummer
On Resource-Bounded Instance Complexity. Theor. Comput. Sci. 161 (1&2) (1996)
Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan
On the Query Complexity of Sets. MFCS (1996)
Martin Kummer
On the Complexity of Random Strings (Extended Abstract). STACS (1996)
Susanne Kaufmann, Martin Kummer
On a Quantitative Notion of Uniformity. Fundam. Informaticae 25 (1) (1996)
Martin Kummer, Matthias Ott
Learning Branches and Learning to Win Closed Games. COLT (1996)
Martin Kummer, Frank Stephan
On the Structure of Degrees of Inferability. J. Comput. Syst. Sci. 52 (2) (1996)
Martin Kummer, Frank Stephan
Inclusion Problems in Parallel Learning and Games. J. Comput. Syst. Sci. 52 (3) (1996)
Martin Kummer
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets. SIAM J. Comput. 25 (6) (1996)
Martin Kummer, Matthias Ott
Effective Strategies for Enumeration Games. CSL (1995)
John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer
Learning recursive functions from approximations. EuroCOLT (1995)
Martin Kummer
A Learning-Theoretic Characterization of Classes of Recursive Functions. Inf. Process. Lett. 54 (4) (1995)
Martin Kummer, Frank Stephan
The Power of Frequency Computation (Extended Abstract). FCT (1995)
Martin Kummer
The Instance Complexity Conjecture. Computational Complexity Conference (1995)
Richard Beigel, Martin Kummer, Frank Stephan
Quantifying the Amount of Verboseness Inf. Comput. 118 (1) (1995)
Martin Kummer, Frank Stephan
Recursion Theoretic Properties of Frequency Computation and Bounded Queries Inf. Comput. 120 (1) (1995)
Lance Fortnow, Martin Kummer
Resource-Bounded Instance Complexity (Extended Abstract). STACS (1995)
Susanne Kaufmann, Martin Kummer
On a Quantitative Notion of Uniformity. MFCS (1995)
Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
Measure, Category and Learning Theory. ICALP (1995)
Richard Beigel, Martin Kummer, Frank Stephan
Approximable Sets Inf. Comput. 120 (2) (1995)
Martin Kummer, Marcus Schäfer
Computability of Convex Sets (Extended Abstract). STACS (1995)
Eberhard Herrmann, Martin Kummer
Diagonals and D-Maximal Sets. J. Symb. Log. 59 (1) (1994)
Frank Stephan, Martin Kummer
Effective Search Problems. Math. Log. Q. 40 (1994)
Richard Beigel, Martin Kummer, Frank Stephan
Approximable Sets. Computational Complexity Conference (1994)
Jürgen Dix, Martin Kummer
Herbrand's Theorem for Nonstandard Inference Operations. J. Log. Comput. 4 (2) (1994)
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) (1994)
Martin Kummer, Frank Stephan
Inclusion Problems in Parallel Learning and Games (Extended Abstract). COLT (1994)
Martin Kummer
The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract). COLT (1994)
Martin Kummer, Frank Stephan
Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). Kurt Gödel Colloquium (1993)
Martin Kummer, Frank Stephan
Weakly Semirecursive Sets and r.e. Orderings. Ann. Pure Appl. Log. 60 (2) (1993)
Martin Kummer, Frank Stephan
On the Structure of Degrees of Inferability. COLT (1993)
Jürgen Dix, Martin Kummer
Herbrand's Theorem for Nonstandard Inference Operations (Abstract). J. Symb. Log. 58 (3) (1993)
Martin Kummer
A Proof of Beigel's Cardinality Conjecture. J. Symb. Log. 57 (2) (1992)
Valentina S. Harizanov, Martin Kummer, James C. Owings
Frequency Computations and the Cardinality Theorem. J. Symb. Log. 57 (2) (1992)
Richard Beigel, Martin Kummer, Frank Stephan
Quantifying the Amount of Verboseness. LFCS (1992)
Martin Kummer
Degrees of Unsolvability in Abstract Complexity Theory. Complexity Theory: Current Research (1992)
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)
Martin Kummer
Diagonals and Semihyperhypersimple Sets. J. Symb. Log. 56 (3) (1991)
Martin Kummer
An Easy Priority-Free Proof of a Theorem of Friedberg. Theor. Comput. Sci. 74 (2) (1990)
Martin Kummer
Some applications of computable one-one numberings. Arch. Math. Log. 30 (4) (1990)
Martin Kummer
A Note on Direct Sums of Friedbergnumberings. J. Symb. Log. 54 (3) (1989)
Martin Kummer
union F. CSL (1988)
Martin Kummer
The Length Problem for Co-R.E. Sets. Math. Log. Q. 34 (3) (1988)
Martin Kummer
Negative Results about the Length Problem. Computation Theory and Logic (1987)

Martin Kummer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Martin Kummer