Uwe Schöning

Publication Activity (10 Years)

Years Active: 1981-2020
Publications (10 Years): 1

Top Venues

Bioinform.

SAT

Inform. Spektrum

ECDA

University of Stuttgart, Germany (PHD)

Education History

University of Stuttgart, Germany

PHD

Publications

Jan-Hendrik Lorenz, Uwe Schöning
Promise Problems on Probability Distributions. Complexity and Approximation (2020)
Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. SAT (2014)
Gunnar Völkel, Markus Maucher, Christoph Müssel, Uwe Schöning, Hans A. Kestler
Information Theoretic Measures for Ant Colony Optimization. ECDA (2014)
Gunnar Völkel, Markus Maucher, Uwe Schöning, Hans A. Kestler
Ant colony optimization with group learning. GECCO (2014)
Thomas Schnattinger, Uwe Schöning, Hans A. Kestler
Structural RNA alignment by multi-objective optimization. Bioinform. 29 (13) (2013)
Thomas Schnattinger, Uwe Schöning, Anita Marchfelder, Hans A. Kestler
RNA-Pareto: interactive analysis of Pareto-optimal RNA sequence-structure alignments. Bioinform. 29 (23) (2013)
Adrian Balint, Uwe Schöning
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break. SAT (2012)
Uwe Schöning, Wolfgang Thomas
Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe. Inform. Spektrum 35 (4) (2012)
Markus Maucher, Uwe Schöning, Hans A. Kestler
Search heuristics and the influence of non-perfect randomness: examining Genetic Algorithms and Simulated Annealing. Comput. Stat. 26 (2) (2011)
Uwe Schöning
Das SAT-Problem. Inform. Spektrum 33 (5) (2010)
Uwe Schöning
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. CSR (2010)
Uwe Schöning, Monika von Knop
Using Stochastic Indexed Grammars for RNA Structure PredictionWith Pseudoknots. Bull. EATCS 101 (2010)
Uwe Schöning
Principles of Stochastic Local Search. UC (2007)
Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40 (3) (2007)
Uwe Schöning
Smaller superconcentrators of density 28. Inf. Process. Lett. 98 (4) (2006)
Uwe Schöning, Jacobo Torán
A note on the size of Craig Interpolants. Circuits, Logic, and Games (2006)
Uwe Schöning
Algorithmics in Exponential Time. STACS (2005)
Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
Randomized Quicksort and the Entropy of the Random Source. COCOON (2005)
Uwe Schöning
New Algorithmic Paradigms in Exponential Time Algorithms. CiE (2005)
Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
Randomized QuickSort and the Entropy of the Random Source. Algebraic Methods in Computational Complexity (2004)
Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
Randomized Quicksort and the Entropy of the Random Number Generator Electron. Colloquium Comput. Complex. (059) (2004)
Uwe Schöning
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. Algorithmica 32 (4) (2002)
Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
A Probabilistic 3-SAT Algorithm Further Improved. STACS (2002)
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
algorithm for k-SAT based on local search. Theor. Comput. Sci. 289 (1) (2002)
Uwe Schöning
New Algorithms for k -SAT Based on the Local Search Principle. MFCS (2001)
Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
-SAT Based on Covering Codes and Local Search. ICALP (2000)
Uwe Schöning
Construction of expanders and superconcentrators using Kolmogorov complexity. Random Struct. Algorithms 17 (1) (2000)
Uwe Schöning
Mastering the Master Theorem. Bull. EATCS 71 (2000)
Uwe Schöning
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. FOCS (1999)
Johannes Köbler, Uwe Schöning
High Sets for NP. Advances in Algorithms, Languages, and Complexity (1997)
Uwe Schöning
Complexity of Presburger Arithmetic with Fixed Quantifier Dimension. Theory Comput. Syst. 30 (4) (1997)
Uwe Schöning
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. MFCS (1997)
Uwe Schöning
Better Expanders and Superconcentrators by Kolmogorov Complexity. SIROCCO (1997)
Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
If NP has Polynomial-Size Circuits, then MA=AM. Theor. Comput. Sci. 137 (2) (1995)
Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe
Instance Complexity. J. ACM 41 (1) (1994)
Uwe Schöning
On Random Reductions from Sparse Sets to Tally Sets. Inf. Process. Lett. 46 (5) (1993)
Johannes Köbler, Uwe Schöning, Jacobo Torán
Graph Isomorphism is Low for PP. Comput. Complex. 2 (1992)
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. Complexity Theory: Current Research (1992)
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. ICALP (1992)
José L. Balcázar, Uwe Schöning
Logarithmic Advice Classes. Theor. Comput. Sci. 99 (2) (1992)
Johannes Köbler, Uwe Schöning, Jacobo Torán
Graph Isomorphism is Low for PP. STACS (1992)
Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
Turing Machines with Few Accepting Computations and Low Sets for PP. J. Comput. Syst. Sci. 44 (2) (1992)
Uwe Schöning
Complexity Cores and Hard Problem Instances. SIGAL International Symposium on Algorithms (1990)
Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
Turing Machines with few Accepting Computations and low Sets for PP. Computational Complexity Conference (1989)
Johannes Köbler, Uwe Schöning, Jacobo Torán
On Counting and Approximation. Acta Informatica 26 (4) (1989)
Uwe Schöning
Probabilistic Complexity Classes and Lowness. J. Comput. Syst. Sci. 39 (1) (1989)
Uwe Schöning
The power of counting. Computational Complexity Conference (1988)
Johannes Köbler, Uwe Schöning, Jacobo Torán
On Counting and Approximation. CAAP (1988)
Uwe Schöning
Graph Isomorphism is in the Low Hierarchy. J. Comput. Syst. Sci. 37 (3) (1988)
Uwe Schöning
Robust Orale Machines. MFCS (1988)
Uwe Schöning, Klaus W. Wagner
Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. STACS (1988)
Uwe Schöning
Graph Isomorphism is in the Low Hierarchy. STACS (1987)
Uwe Schöning
Lowness and probabilistic complexity classes. Computational Complexity Conference (1987)
Uwe Schöning
Complexity Cores and Hard-To-Prove Formulas. CSL (1987)
Johannes Köbler, Uwe Schöning, Klaus W. Wagner
The Difference and Truth-Table Hierarchies for NP. RAIRO Theor. Informatics Appl. 21 (4) (1987)
Pekka Orponen, David A. Russo, Uwe Schöning
Optimal Approximations and Polynomially Levelable Sets. SIAM J. Comput. 15 (2) (1986)
Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe
What Is a Hard Instance of a Computational Problem?. Computational Complexity Conference (1986)
Uwe Schöning
Complete Sets and Closeness to Complexity Classes. Math. Syst. Theory 19 (1) (1986)
José L. Balcázar, Ronald V. Book, Uwe Schöning
The polynomial-time hierarchy and sparse oracles. J. ACM 33 (3) (1986)
Pekka Orponen, Uwe Schöning
The Density and Complexity of Polynomial Cores for Intractable Sets. Inf. Control. 70 (1) (1986)
José L. Balcázar, Ronald V. Book, Uwe Schöning
Sparse Sets, Lowness and Highness. SIAM J. Comput. 15 (3) (1986)
Uwe Schöning
Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). ICALP (1986)
José L. Balcázar, Uwe Schöning
Bi-Immune Sets for Complexity Classes. Math. Syst. Theory 18 (1) (1985)
Ker-I Ko, Uwe Schöning
On Circuit-Size Complexity and the Low Hierarchy in NP. SIAM J. Comput. 14 (1) (1985)
José L. Balcázar, Ronald V. Book, Uwe Schöning
On Bounded Query Machines. Theor. Comput. Sci. 40 (1985)
Pekka Orponen, David A. Russo, Uwe Schöning
Polynomial Levelability and Maximal Complexity Cores. ICALP (1985)
Uwe Schöning
Robust Algorithms: A Different Approach to Oracles. Theor. Comput. Sci. 40 (1985)
Uwe Schöning
Minimal pairs for P Theor. Comput. Sci. 31 (1984)
Uwe Schöning
Robust Algorithms: A Different Approach to Oracles. ICALP (1984)
Pekka Orponen, Uwe Schöning
The Structure of Polynomial Complexity Cores (Extended Abstract). MFCS (1984)
Uwe Schöning, Ronald V. Book
Immunity, Relativizations, and Nondeterminism. SIAM J. Comput. 13 (2) (1984)
José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
Sparse Oracles and Uniform Complexity Classes FOCS (1984)
José L. Balcázar, Ronald V. Book, Uwe Schöning
Sparse Oracles, Lowness, and Highness. MFCS (1984)
Uwe Schöning
On Small Generators Theor. Comput. Sci. 34 (3) (1984)
Uwe Schöning
A Low and a High Hierarchy within NP. J. Comput. Syst. Sci. 27 (1) (1983)
Uwe Schöning, Ronald V. Book
Immunity (Extended Abstract). ICALP (1983)
Uwe Schöning
. Inf. Process. Lett. 16 (4) (1983)
Uwe Schöning
On NP-decomposable sets. SIGACT News 14 (1) (1982)
Uwe Schöning
A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. Theor. Comput. Sci. 18 (1982)
Uwe Schöning
A note on complete sets for the polynomial-time hierarchy. SIGACT News 13 (1) (1981)

Uwe Schöning.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Uwe Schöning