The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Kummer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.071secs, Finished in 0.074secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002