The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Uwe Schöning: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Johannes Köbler, Uwe Schöning
    High Sets for NP. [Citation Graph (0, 0)][DBLP]
    Advances in Algorithms, Languages, and Complexity, 1997, pp:139-156 [Conf]
  2. Johannes Köbler, Uwe Schöning, Jacobo Torán
    On Counting and Approximation. [Citation Graph (0, 0)][DBLP]
    CAAP, 1988, pp:40-51 [Conf]
  3. Uwe Schöning
    New Algorithmic Paradigms in Exponential Time Algorithms. [Citation Graph (0, 0)][DBLP]
    CiE, 2005, pp:429-429 [Conf]
  4. Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe
    What Is a Hard Instance of a Computational Problem?. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:197-217 [Conf]
  5. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with few Accepting Computations and low Sets for PP. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:208-215 [Conf]
  6. Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
    Randomized Quicksort and the Entropy of the Random Source. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:450-460 [Conf]
  7. Uwe Schöning
    Complexity Cores and Hard-To-Prove Formulas. [Citation Graph (0, 0)][DBLP]
    CSL, 1987, pp:273-280 [Conf]
  8. Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
    Reductions to Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:1-46 [Conf]
  9. Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
    Randomized QuickSort and the Entropy of the Random Source. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods in Computational Complexity, 2004, pp:- [Conf]
  10. José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
    Sparse Oracles and Uniform Complexity Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:308-311 [Conf]
  11. Uwe Schöning
    A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:410-414 [Conf]
  12. Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
    Reductions to Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:162-173 [Conf]
  13. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
    Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:236-247 [Conf]
  14. Pekka Orponen, David A. Russo, Uwe Schöning
    Polynomial Levelability and Maximal Complexity Cores. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:435-444 [Conf]
  15. Uwe Schöning
    Robust Algorithms: A Different Approach to Oracles. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:448-453 [Conf]
  16. Uwe Schöning
    Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:370-375 [Conf]
  17. Uwe Schöning, Ronald V. Book
    Immunity (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:653-661 [Conf]
  18. José L. Balcázar, Ronald V. Book, Uwe Schöning
    Sparse Oracles, Lowness, and Highness. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:185-193 [Conf]
  19. Pekka Orponen, Uwe Schöning
    The Structure of Polynomial Complexity Cores (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:452-458 [Conf]
  20. Uwe Schöning
    New Algorithms for k -SAT Based on the Local Search Principle. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:87-95 [Conf]
  21. Uwe Schöning
    Robust Orale Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:93-106 [Conf]
  22. Uwe Schöning
    Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:110-116 [Conf]
  23. Uwe Schöning
    Complexity Cores and Hard Problem Instances. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:232-240 [Conf]
  24. Uwe Schöning
    Better Expanders and Superconcentrators by Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1997, pp:138-150 [Conf]
  25. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
    A Probabilistic 3-SAT Algorithm Further Improved. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:192-202 [Conf]
  26. Johannes Köbler, Uwe Schöning, Jacobo Torán
    Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:401-411 [Conf]
  27. Uwe Schöning
    Graph Isomorphism is in the Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1987, pp:114-124 [Conf]
  28. Uwe Schöning, Klaus W. Wagner
    Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:91-97 [Conf]
  29. Uwe Schöning
    Algorithmics in Exponential Time. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:36-43 [Conf]
  30. Johannes Köbler, Uwe Schöning, Jacobo Torán
    On Counting and Approximation. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1989, v:26, n:4, pp:363-379 [Journal]
  31. Uwe Schöning
    A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:32, n:4, pp:615-623 [Journal]
  32. Johannes Köbler, Uwe Schöning, Jacobo Torán
    Graph Isomorphism is Low for PP. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:301-330 [Journal]
  33. Uwe Schöning
    Mastering the Master Theorem. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:71, n:, pp:165-166 [Journal]
  34. Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
    Randomized Quicksort and the Entropy of the Random Number Generator [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:059, pp:- [Journal]
  35. Pekka Orponen, Uwe Schöning
    The Density and Complexity of Polynomial Cores for Intractable [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:70, n:1, pp:54-68 [Journal]
  36. Uwe Schöning
    Smaller superconcentrators of density 28. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:98, n:4, pp:127-129 [Journal]
  37. Uwe Schöning
    On the Dtructure of Deltap2. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:16, n:4, pp:209-211 [Journal]
  38. Uwe Schöning
    On Random Reductions from Sparse Sets to Tally Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:5, pp:239-241 [Journal]
  39. Johannes Köbler, Uwe Schöning, Klaus W. Wagner
    The Difference and Truth-Table Hierarchies for NP. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:4, pp:419-435 [Journal]
  40. José L. Balcázar, Ronald V. Book, Uwe Schöning
    The polynomial-time hierarchy and sparse oracles. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1986, v:33, n:3, pp:603-617 [Journal]
  41. Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe
    Instance Complexity. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:1, pp:96-121 [Journal]
  42. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
    Turing Machines with Few Accepting Computations and Low Sets for PP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:2, pp:272-286 [Journal]
  43. Uwe Schöning
    A Low and a High Hierarchy within NP. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:27, n:1, pp:14-28 [Journal]
  44. Uwe Schöning
    Graph Isomorphism is in the Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:3, pp:312-323 [Journal]
  45. Uwe Schöning
    Probabilistic Complexity Classes and Lowness. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:84-100 [Journal]
  46. José L. Balcázar, Uwe Schöning
    Bi-Immune Sets for Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1985, v:18, n:1, pp:1-10 [Journal]
  47. Uwe Schöning
    Complete Sets and Closeness to Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1986, v:19, n:1, pp:29-41 [Journal]
  48. Uwe Schöning
    Complexity of Presburger Arithmetic with Fixed Quantifier Dimension. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:4, pp:423-428 [Journal]
  49. Uwe Schöning
    Construction of expanders and superconcentrators using Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:1, pp:64-77 [Journal]
  50. José L. Balcázar, Ronald V. Book, Uwe Schöning
    Sparse Sets, Lowness and Highness. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:3, pp:739-747 [Journal]
  51. Ker-I Ko, Uwe Schöning
    On Circuit-Size Complexity and the Low Hierarchy in NP. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:41-51 [Journal]
  52. Pekka Orponen, David A. Russo, Uwe Schöning
    Optimal Approximations and Polynomially Levelable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:399-408 [Journal]
  53. Uwe Schöning, Ronald V. Book
    Immunity, Relativizations, and Nondeterminism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:329-337 [Journal]
  54. Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
    If NP has Polynomial-Size Circuits, then MA=AM. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:137, n:2, pp:279-282 [Journal]
  55. José L. Balcázar, Ronald V. Book, Uwe Schöning
    On Bounded Query Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:40, n:, pp:237-243 [Journal]
  56. José L. Balcázar, Uwe Schöning
    Logarithmic Advice Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:99, n:2, pp:279-290 [Journal]
  57. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
    A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:69-83 [Journal]
  58. Uwe Schöning
    A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:95-103 [Journal]
  59. Uwe Schöning
    Minimal pairs for P [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:31, n:, pp:41-48 [Journal]
  60. Uwe Schöning
    On Small Generators [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:3, pp:337-341 [Journal]
  61. Uwe Schöning
    Robust Algorithms: A Different Approach to Oracles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:40, n:, pp:57-66 [Journal]
  62. Uwe Schöning
    Principles of Stochastic Local Search. [Citation Graph (0, 0)][DBLP]
    UC, 2007, pp:178-187 [Conf]
  63. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
    Randomized Algorithms for 3-SAT. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2007, v:40, n:3, pp:249-262 [Journal]

  64. Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  65. A note on the size of Craig Interpolants. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.010secs
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