The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Klaus Ambos-Spies: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Klaus Ambos-Spies
    Minimal Pairs for Polynomial Time Reducibilities. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:1-13 [Conf]
  2. Klaus Ambos-Spies
    Randomness, Relativizations, and Polynomial Reducibilities. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:23-34 [Conf]
  3. Klaus Ambos-Spies
    Resource-Bounded Genericity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:162-181 [Conf]
  4. Klaus Ambos-Spies, Levke Bentzien
    Separating NP-Completeness Notions under Strong Hypotheses. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:121-127 [Conf]
  5. Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan
    Hausdorff Dimension in Exponential Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:210-217 [Conf]
  6. Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng
    A Comparison of Weak Completeness Notions. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:171-178 [Conf]
  7. Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
    Diagonalizing over Deterministic Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CSL, 1987, pp:1-16 [Conf]
  8. Klaus Ambos-Spies, Jürgen Kämper
    On Disjunctive Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    CSL, 1988, pp:1-13 [Conf]
  9. Klaus Ambos-Spies, Dongping Yang
    Honest Polynomial-Time Degrees of Elementary Recursive Sets. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:1-15 [Conf]
  10. Klaus Ambos-Spies, Edgar Busse
    Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:97-108 [Conf]
  11. Klaus Ambos-Spies
    Three Theorems on Polynomial Degrees of NP-Sets [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:51-55 [Conf]
  12. Klaus Ambos-Spies
    P-Generic Sets. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:58-68 [Conf]
  13. Klaus Ambos-Spies
    On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:384-392 [Conf]
  14. Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng
    Resource Bounded Randomness and Weakly Complete Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:369-377 [Conf]
  15. Klaus Ambos-Spies
    P-mitotic sets. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:1-23 [Conf]
  16. Klaus Ambos-Spies
    Measure Theoretic Completeness Notions for the Exponential Time Classes. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:152-161 [Conf]
  17. Klaus Ambos-Spies
    Problems with Cannot Be Reduced to Any Proper Subproblems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:162-168 [Conf]
  18. Klaus Ambos-Spies, Edgar Busse
    Computational Aspects of Disjunctive Sequences. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:711-722 [Conf]
  19. Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt
    Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:465-473 [Conf]
  20. Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn
    Genericity and Measure for Exponential Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:221-232 [Conf]
  21. Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng
    Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:63-74 [Conf]
  22. Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
    Almost Complete Sets. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:419-430 [Conf]
  23. Klaus Ambos-Spies, André Nies
    The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:209-218 [Conf]
  24. Klaus Ambos-Spies
    On the Structure of Polynomial Time Degrees. [Citation Graph (0, 0)][DBLP]
    STACS, 1984, pp:198-208 [Conf]
  25. Klaus Ambos-Spies
    On the Relative Complexity of Subproblems of Intractable Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:1-12 [Conf]
  26. Klaus Ambos-Spies, Steven Homer, Robert I. Soare
    Minimal Pairs and Complete Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:24-36 [Conf]
  27. Klaus Ambos-Spies, Peter A. Fejer
    Embedding of N5 and the contiguous degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2001, v:112, n:2-3, pp:151-188 [Journal]
  28. Klaus Ambos-Spies, Denis R. Hirschfeldt, Richard A. Shore
    Undecidability and 1-types in intervals of the computably enumerable degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2000, v:106, n:1-3, pp:1-47 [Journal]
  29. Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare
    The Continuity of Cupping to 0'. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:64, n:3, pp:195-209 [Journal]
  30. Klaus Ambos-Spies, Robert I. Soare
    The Recursively Enumerable Degrees have Infinitely Many One-Types. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1989, v:44, n:1-2, pp:1-23 [Journal]
  31. Klaus Ambos-Spies, Richard A. Shore
    Undecidability and 1-Types in the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1993, v:63, n:1, pp:3-37 [Journal]
  32. Klaus Ambos-Spies
    Sublattices of the Polynomial Time Degrees [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:65, n:1, pp:63-84 [Journal]
  33. Klaus Ambos-Spies
    Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:3, pp:113-117 [Journal]
  34. Klaus Ambos-Spies
    A Note on the Complete Problems for Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:5, pp:227-230 [Journal]
  35. Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
    Weakly Computable Real Numbers. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:4, pp:676-690 [Journal]
  36. Klaus Ambos-Spies
    Honest Polynomial Time Reducibilities and the P = ? NP Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:3, pp:250-281 [Journal]
  37. Klaus Ambos-Spies, Levke Bentzien
    Separating NP-Completeness Notions under Strong Hypotheses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:61, n:3, pp:335-361 [Journal]
  38. Klaus Ambos-Spies
    An Extension of the Nondiamond Theorem in Classical and alpha-Recursion Theory. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1984, v:49, n:2, pp:586-607 [Journal]
  39. Klaus Ambos-Spies, Peter A. Fejer
    Degree Theoretical Splitting Properties of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1988, v:53, n:4, pp:1110-1137 [Journal]
  40. Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman
    Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1996, v:61, n:3, pp:880-905 [Journal]
  41. Klaus Ambos-Spies, Manuel Lerman
    Lattice Embeddings into the Recursively Enumerable Degrees. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1986, v:51, n:2, pp:257-272 [Journal]
  42. Klaus Ambos-Spies, Manuel Lerman
    Lattice Embeddings into the Recursively Enumerable Degrees II. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1989, v:54, n:3, pp:735-760 [Journal]
  43. Klaus Ambos-Spies, André Nies, Richard A. Shore
    The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1992, v:57, n:3, pp:864-874 [Journal]
  44. Decheng Ding, Klaus Ambos-Spies
    Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1994, v:40, n:, pp:287-317 [Journal]
  45. Klaus Ambos-Spies
    An Inhomogeneity in the Structure of Karp Degrees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:958-963 [Journal]
  46. Klaus Ambos-Spies
    On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:63, n:1, pp:43-61 [Journal]
  47. Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
    Diagonalizations over Polynomial Time Computable Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:177-204 [Journal]
  48. Klaus Ambos-Spies, Steven Homer, Robert I. Soare
    Minimal Pairs and Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:132, n:2, pp:229-241 [Journal]
  49. Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn
    Almost complete sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:306, n:1-3, pp:177-194 [Journal]
  50. Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn
    Genericity and Measure for Exponential Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:1, pp:3-19 [Journal]
  51. Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng
    Resource Bounded Randomness and Weakly Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:195-207 [Journal]

  52. Weak Completeness Notions for Exponential Time. [Citation Graph (, )][DBLP]


  53. On a Question of Frank Stephan. [Citation Graph (, )][DBLP]


  54. Quantitative Aspects of Speed-Up and Gap Phenomena. [Citation Graph (, )][DBLP]


  55. Nontriviality for Exponential Time w.r.t. Weak Reducibilities. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.012secs
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