Martin Kummer - RankMe

49 papers A* 6A 3B 5Misc 1Journal 27Unranked 6

Year	Rank	Type	Title / Venue / Authors
2007	J	`jnl`	Cuppability of Simple and Hypersimple Sets. Notre Dame J. Formal Log. Martin Kummer, Marcus Schäfer
2000	J	`jnl`	The Comlexity of Odd J. Symb. Log. Richard Beigel, William I. Gasarch, Martin Kummer, Georgia Martin, Timothy H. McNicholl, Frank Stephan
1999	J	`jnl`	A Unified Approach to Linear and Nonlinear Normal Forms for Hamiltonian Systems. J. Symb. Comput. Richard C. Churchill, Martin Kummer
1998	J	`jnl`	On the Relative Sizes of Learnable Sets. Theor. Comput. Sci. Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
1997	J	`jnl`	Learning Recursive Functions from Approximations. J. Comput. Syst. Sci. John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer
1996	J	`jnl`	Inclusion Problems in Parallel Learning and Games. J. Comput. Syst. Sci. Martin Kummer, Frank Stephan
1996	J	`jnl`	Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets. SIAM J. Comput. Martin Kummer
1996	A*	`conf`	Learning Branches and Learning to Win Closed Games. COLT Martin Kummer, Matthias Ott
1996	J	`jnl`	On Resource-Bounded Instance Complexity. Theor. Comput. Sci. Lance Fortnow, Martin Kummer
1996	J	`jnl`	On a Quantitative Notion of Uniformity. Fundam. Informaticae Susanne Kaufmann, Martin Kummer
1996	A	`conf`	On the Complexity of Random Strings (Extended Abstract). STACS Martin Kummer
1996	B	`conf`	On the Query Complexity of Sets. MFCS Richard Beigel, William I. Gasarch, Martin Kummer, Timothy H. McNicholl, Frank Stephan
1996	J	`jnl`	On the Structure of Degrees of Inferability. J. Comput. Syst. Sci. Martin Kummer, Frank Stephan
1995	J	`jnl`	A Learning-Theoretic Characterization of Classes of Recursive Functions. Inf. Process. Lett. Martin Kummer
1995	J	`jnl`	Approximable Sets Inf. Comput. Richard Beigel, Martin Kummer, Frank Stephan
1995	A	`conf`	Computability of Convex Sets (Extended Abstract). STACS Martin Kummer, Marcus Schäfer
1995	B	`conf`	Effective Strategies for Enumeration Games. CSL Martin Kummer, Matthias Ott
1995	—	`conf`	Learning recursive functions from approximations. EuroCOLT John Case, Susanne Kaufmann, Efim B. Kinber, Martin Kummer
1995	A*	`conf`	Measure, Category and Learning Theory. ICALP Lance Fortnow, Rusins Freivalds, William I. Gasarch, Martin Kummer, Stuart A. Kurtz, Carl H. Smith, Frank Stephan
1995	B	`conf`	On a Quantitative Notion of Uniformity. MFCS Susanne Kaufmann, Martin Kummer
1995	J	`jnl`	Quantifying the Amount of Verboseness Inf. Comput. Richard Beigel, Martin Kummer, Frank Stephan
1995	J	`jnl`	Recursion Theoretic Properties of Frequency Computation and Bounded Queries Inf. Comput. Martin Kummer, Frank Stephan
1995	A	`conf`	Resource-Bounded Instance Complexity (Extended Abstract). STACS Lance Fortnow, Martin Kummer
1995	—	`conf`	The Instance Complexity Conjecture. SCT Martin Kummer
1995	B	`conf`	The Power of Frequency Computation (Extended Abstract). FCT Martin Kummer, Frank Stephan
1994	—	`conf`	Approximable Sets. SCT Richard Beigel, Martin Kummer, Frank Stephan
1994	J	`jnl`	Diagonals and D-Maximal Sets. J. Symb. Log. Eberhard Herrmann, Martin Kummer
1994	J	`jnl`	Effective Search Problems. Math. Log. Q. Frank Stephan, Martin Kummer
1994	J	`jnl`	Extremes in the Degrees of Inferability. Ann. Pure Appl. Log. Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan
1994	J	`jnl`	Herbrand's Theorem for Nonstandard Inference Operations. J. Log. Comput. Jürgen Dix, Martin Kummer
1994	A*	`conf`	Inclusion Problems in Parallel Learning and Games (Extended Abstract). COLT Martin Kummer, Frank Stephan
1994	A*	`conf`	The Strength of Noninclusions for Teams of Finite Learners (Extended Abstract). COLT Martin Kummer
1993	J	`jnl`	Herbrand's Theorem for Nonstandard Inference Operations (Abstract). J. Symb. Log. Jürgen Dix, Martin Kummer
1993	A*	`conf`	On the Structure of Degrees of Inferability. COLT Martin Kummer, Frank Stephan
1993	—	`conf`	Recursion Theoretic Properties of Frequency Computation and Bounded Queries (Extended Abstract). Kurt Gödel Colloquium Martin Kummer, Frank Stephan
1993	J	`jnl`	Weakly Semirecursive Sets and r.e. Orderings. Ann. Pure Appl. Log. Martin Kummer, Frank Stephan
1992	J	`jnl`	A Proof of Beigel's Cardinality Conjecture. J. Symb. Log. Martin Kummer
1992	A*	`conf`	Degrees of Inferability. COLT Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman
1992	—	`conf`	Degrees of Unsolvability in Abstract Complexity Theory. Complexity Theory: Current Research Martin Kummer
1992	J	`jnl`	Frequency Computations and the Cardinality Theorem. J. Symb. Log. Valentina S. Harizanov, Martin Kummer, James C. Owings
1992	Misc	`conf`	Quantifying the Amount of Verboseness. LFCS Richard Beigel, Martin Kummer, Frank Stephan
1991	J	`jnl`	Diagonals and Semihyperhypersimple Sets. J. Symb. Log. Martin Kummer
1990	J	`jnl`	An Easy Priority-Free Proof of a Theorem of Friedberg. Theor. Comput. Sci. Martin Kummer
1990	J	`jnl`	Some applications of computable one-one numberings. Arch. Math. Log. Martin Kummer
1989	J	`jnl`	A Note on Direct Sums of Friedbergnumberings. J. Symb. Log. Martin Kummer
1989	—	`—`	Beiträge zur Theorie der Numerierungen: eindeutige Numerierungen. Martin Kummer
1988	B	`conf`	Numberings of R CSL Martin Kummer
1988	J	`jnl`	The Length Problem for Co-R.E. Sets. Math. Log. Q. Martin Kummer
1987	—	`conf`	Negative Results about the Length Problem. Computation Theory and Logic Martin Kummer