Untersuchungen zur Struktur von NP und verwandten Komplexitätsklassen mit Hilfe verschiedener polynomieller Reduktionen. - Uwe Schöning (1981)

A note on complete sets for the polynomial-time hierarchy. - Uwe Schöning (SIGACT News, 1981)

On NP-decomposable sets. - Uwe Schöning (SIGACT News, 1982)

A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. - Uwe Schöning (Theor. Comput. Sci., 1982)

Immunity (Extended Abstract). - Uwe Schöning; Ronald V. Book (ICALP, 1983)

On the Dtructure of Deltap2. - Uwe Schöning (Inf. Process. Lett., 1983)

A Low and a High Hierarchy within NP. - Uwe Schöning (J. Comput. Syst. Sci., 1983)

Sparse Oracles and Uniform Complexity Classes - José L. Balcázar; Ronald V. Book; Timothy J. Long; Uwe Schöning; Alan L. Selman (FOCS, 1984)

Sparse Oracles, Lowness, and Highness. - José L. Balcázar; Ronald V. Book; Uwe Schöning (MFCS, 1984)

The Structure of Polynomial Complexity Cores (Extended Abstract). - Pekka Orponen; Uwe Schöning (MFCS, 1984)

Immunity, Relativizations, and Nondeterminism. - Uwe Schöning; Ronald V. Book (SIAM J. Comput., 1984)

Minimal pairs for P - Uwe Schöning (Theor. Comput. Sci., 1984)

On Small Generators - Uwe Schöning (Theor. Comput. Sci., 1984)

Polynomial Levelability and Maximal Complexity Cores. - Pekka Orponen; David A. Russo; Uwe Schöning (ICALP, 1985)

Bi-Immune Sets for Complexity Classes. - José L. Balcázar; Uwe Schöning (Math. Syst. Theory, 1985)

On Circuit-Size Complexity and the Low Hierarchy in NP. - Ker-I Ko; Uwe Schöning (SIAM J. Comput., 1985)

On Bounded Query Machines. - José L. Balcázar; Ronald V. Book; Uwe Schöning (Theor. Comput. Sci., 1985)

Robust Algorithms: A Different Approach to Oracles. - Uwe Schöning (Theor. Comput. Sci., 1985)

Complexity and Structure - Uwe Schöning (Springer, 1986)

What Is a Hard Instance of a Computational Problem?. - Ker-I Ko; Pekka Orponen; Uwe Schöning; Osamu Watanabe 001 (SCT, 1986)

Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). - Uwe Schöning (ICALP, 1986)

The polynomial-time hierarchy and sparse oracles. - José L. Balcázar; Ronald V. Book; Uwe Schöning (J. ACM, 1986)

Complete Sets and Closeness to Complexity Classes. - Uwe Schöning (Math. Syst. Theory, 1986)

Sparse Sets, Lowness and Highness. - José L. Balcázar; Ronald V. Book; Uwe Schöning (SIAM J. Comput., 1986)

Optimal Approximations and Polynomially Levelable Sets. - Pekka Orponen; David A. Russo; Uwe Schöning (SIAM J. Comput., 1986)

The Density and Complexity of Polynomial Cores for Intractable Sets. - Pekka Orponen; Uwe Schöning (Inf. Control., 1986)

Logik für Informatiker - Uwe Schöning (Bibliographisches Institut, 1987)

Complexity Cores and Hard-To-Prove Formulas. - Uwe Schöning (CSL, 1987)

The Difference and Truth-Table Hierarchies for NP. - Johannes Köbler; Uwe Schöning; Klaus W. Wagner (RAIRO Theor. Informatics Appl., 1987)

The power of counting. - Uwe Schöning (SCT, 1988)

Robust Orale Machines. - Uwe Schöning (MFCS, 1988)

Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. - Uwe Schöning; Klaus W. Wagner (STACS, 1988)

Graph Isomorphism is in the Low Hierarchy. - Uwe Schöning (J. Comput. Syst. Sci., 1988)

Logik für Informatiker, 2. Auflage - Uwe Schöning (Bibliographisches Institut, 1989)

On Counting and Approximation. - Johannes Köbler; Uwe Schöning; Jacobo Torán (Acta Informatica, 1989)

Probabilistic Complexity Classes and Lowness. - Uwe Schöning (J. Comput. Syst. Sci., 1989)

Complexity Cores and Hard Problem Instances. - Uwe Schöning (SIGAL International Symposium on Algorithms, 1990)

Logik für Informatiker, 3. Auflage - Uwe Schöning (Bibliographisches Institut, 1992)

Theoretische Informatik kurz gefasst. - Uwe Schöning (BI-Wissenschaftsverlag, 1992)

Reductions to Sets of Low Information Content. - Vikraman Arvind; Yenjo Han; Lane A. Hemachandra; Johannes Köbler; Antoni Lozano; Martin Mundhenk; Mitsunori Ogiwara; Uwe Schöning; Riccardo Silvestri; Thomas Thierauf (ICALP, 1992)

Graph Isomorphism is Low for PP. - Johannes Köbler; Uwe Schöning; Jacobo Torán (Comput. Complex., 1992)

Turing Machines with Few Accepting Computations and Low Sets for PP. - Johannes Köbler; Uwe Schöning; Seinosuke Toda; Jacobo Torán (J. Comput. Syst. Sci., 1992)

Logarithmic Advice Classes. - José L. Balcázar; Uwe Schöning (Theor. Comput. Sci., 1992)

The Graph Isomorphism Problem: Its Structural Complexity - Johannes Köbler; Uwe Schöning; Jacobo Torán (Birkhäuser/Springer, 1993)

On Random Reductions from Sparse Sets to Tally Sets. - Uwe Schöning (Inf. Process. Lett., 1993)

Instance Complexity. - Pekka Orponen; Ker-I Ko; Uwe Schöning; Osamu Watanabe 001 (J. ACM, 1994)

Perlen der theoretischen Informatik. - Uwe Schöning (BI-Wissenschaftsverlag, 1995)

Perlen der theoretischen Informatik - 9 weitere Themen. - Uwe Schöning (Universität, 1995)

Logik für Informatiker, 4. Auflage. - Uwe Schöning (Spektrum Akademischer Verlag, 1995)

Theoretische Informatik kurzgefaßt, 2. Auflage. - Uwe Schöning (Spektrum Akademischer Verlag, 1995)

If NP has Polynomial-Size Circuits, then MA=AM. - Vikraman Arvind; Johannes Köbler; Uwe Schöning; Rainer Schuler (Theor. Comput. Sci., 1995)

Algorithmen - kurz gefasst. - Uwe Schöning (Spektrum Akademischer Verlag, 1997)

Theoretische Informatik - kurzgefaßt, 3. Auflage. - Uwe Schöning (Spektrum Akademischer Verlag, 1997)

High Sets for NP. - Johannes Köbler; Uwe Schöning (Advances in Algorithms, Languages, and Complexity, 1997)

Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. - Uwe Schöning (MFCS, 1997)

Better Expanders and Superconcentrators by Kolmogorov Complexity. - Uwe Schöning (SIROCCO, 1997)

Complexity of Presburger Arithmetic with Fixed Quantifier Dimension. - Uwe Schöning (Theory Comput. Syst., 1997)

Gems of theoretical computer science. - Uwe Schöning; Randall J. Pruim (Springer, 1998)

A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. - Uwe Schöning (FOCS, 1999)

Logik für Informatiker, 5. Auflage. - Uwe Schöning (Spektrum Akadem. Verl., 2000)

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. - Evgeny Dantsin; Andreas Goerdt; Edward A. Hirsch; Uwe Schöning (ICALP, 2000)

Mastering the Master Theorem. - Uwe Schöning (Bull. EATCS, 2000)

Construction of expanders and superconcentrators using Kolmogorov complexity. - Uwe Schöning (Random Struct. Algorithms, 2000)

Algorithmik. - Uwe Schöning (Spektrum Akadem. Verl., 2001)

New Algorithms for k -SAT Based on the Local Search Principle. - Uwe Schöning (MFCS, 2001)

Ideen der Informatik: Grundlegende Modelle und Konzepte - Uwe Schöning (Oldenbourg, 2002)

A Probabilistic 3-SAT Algorithm Further Improved. - Thomas Hofmeister; Uwe Schöning; Rainer Schuler; Osamu Watanabe 001 (STACS, 2002)

A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. - Uwe Schöning (Algorithmica, 2002)

A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search. - Evgeny Dantsin; Andreas Goerdt; Edward A. Hirsch; Ravi Kannan; Jon M. Kleinberg; Christos H. Papadimitriou; Prabhakar Raghavan; Uwe Schöning (Theor. Comput. Sci., 2002)

Randomized Quicksort and the Entropy of the Random Number Generator - Beatrice List; Markus Maucher; Uwe Schöning; Rainer Schuler (Electron. Colloquium Comput. Complex., 2004)

Ideen der Informatik - grundlegende Modelle und Konzepte, 2. Auflage. - Uwe Schöning (Oldenbourg, 2005)

New Algorithmic Paradigms in Exponential Time Algorithms. - Uwe Schöning (CiE, 2005)

Randomized Quicksort and the Entropy of the Random Source. - Beatrice List; Markus Maucher; Uwe Schöning; Rainer Schuler (COCOON, 2005)

Algorithmics in Exponential Time. - Uwe Schöning (STACS, 2005)

A note on the size of Craig Interpolants. - Uwe Schöning; Jacobo Torán (Circuits, Logic, and Games, 2006)

Smaller superconcentrators of density 28. - Uwe Schöning (Inf. Process. Lett., 2006)

Principles of Stochastic Local Search. - Uwe Schöning (UC, 2007)

Randomized Algorithms for 3-SAT. - Thomas Hofmeister; Uwe Schöning; Rainer Schuler; Osamu Watanabe 001 (Theory Comput. Syst., 2007)

Mathe-Toolbox - Mathematische Notationen, Grundbegriffe und Beweismethoden. - Uwe Schöning; Hans A. Kestler (Lehmanns Media, 2010)

Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. - Uwe Schöning (CSR, 2010)

Using Stochastic Indexed Grammars for RNA Structure PredictionWith Pseudoknots. - Uwe Schöning; Monika von Knop (Bull. EATCS, 2010)

Das SAT-Problem. - Uwe Schöning (Inform. Spektrum, 2010)

Search heuristics and the influence of non-perfect randomness: examining Genetic Algorithms and Simulated Annealing. - Markus Maucher; Uwe Schöning; Hans A. Kestler (Comput. Stat., 2011)

Das Erfüllbarkeitsproblem SAT - Algorithmen und Analysen. - Uwe Schöning; Jacobo Torán (Lehmann, 2012)

Kryptologie-Kompendium. - Uwe Schöning (Lehmanns Media, 2012)

Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break. - Adrian Balint; Uwe Schöning (SAT, 2012)

Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe. - Uwe Schöning; Wolfgang Thomas (Inform. Spektrum, 2012)

Structural RNA alignment by multi-objective optimization. - Thomas Schnattinger; Uwe Schöning; Hans A. Kestler (Bioinform., 2013)

RNA-Pareto: interactive analysis of Pareto-optimal RNA sequence-structure alignments. - Thomas Schnattinger; Uwe Schöning; Anita Marchfelder; Hans A. Kestler (Bioinform., 2013)

Information Theoretic Measures for Ant Colony Optimization. - Gunnar Völkel; Markus Maucher; Christoph Müssel; Uwe Schöning; Hans A. Kestler (ECDA, 2014)

Ant colony optimization with group learning. - Gunnar Völkel; Markus Maucher; Uwe Schöning; Hans A. Kestler (GECCO, 2014)

Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. - Adrian Balint; Armin Biere; Andreas Fröhlich; Uwe Schöning (SAT, 2014)

Engineering a Lightweight and Efficient Local Search SAT Solver. - Adrian Balint; Uwe Schöning (Algorithm Engineering, 2016)

Promise Problems on Probability Distributions. - Jan-Hendrik Lorenz; Uwe Schöning (Complexity and Approximation, 2020)