| 2014 | GECCO | Ant colony optimization with group learning. | Gunnar Vlkel, Markus Maucher, Uwe Schning, Hans A. Kestler |
| 2014 | SAT | Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. | Adrian Balint, Armin Biere, Andreas Frhlich, Uwe Schning |
| 2012 | SAT | Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break. | Adrian Balint, Uwe Schning |
| 2010 | CSR | Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. | Uwe Schning |
| 2007 | UC | Principles of Stochastic Local Search. | Uwe Schning |
| 2005 | CiE | New Algorithmic Paradigms in Exponential Time Algorithms. | Uwe Schning |
| 2005 | COCOON | Randomized Quicksort and the Entropy of the Random Source. | Beatrice List, Markus Maucher, Uwe Schning, Rainer Schuler |
| 2005 | STACS | Algorithmics in Exponential Time. | Uwe Schning |
| 2002 | STACS | A Probabilistic 3-SAT Algorithm Further Improved. | Thomas Hofmeister, Uwe Schning, Rainer Schuler, Osamu Watanabe |
| 2001 | MFCS | New Algorithms for k -SAT Based on the Local Search Principle. | Uwe Schning |
| 2000 | ICALP | Deterministic Algorithms for | Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schning |
| 1999 | FOCS | A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. | Uwe Schning |
| 1997 | MFCS | Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. | Uwe Schning |
| 1997 | SIROCCO | Better Expanders and Superconcentrators by Kolmogorov Complexity. | Uwe Schning |
| 1992 | ICALP | Reductions to Sets of Low Information Content. | Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Kbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schning, Riccardo Silvestri, Thomas Thierauf |
| 1992 | STACS | Graph Isomorphism is Low for PP. | Johannes Kbler, Uwe Schning, Jacobo Torn |
| 1988 | MFCS | Robust Orale Machines. | Uwe Schning |
| 1988 | STACS | Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. | Uwe Schning, Klaus W. Wagner |
| 1987 | CSL | Complexity Cores and Hard-To-Prove Formulas. | Uwe Schning |
| 1987 | STACS | Graph Isomorphism is in the Low Hierarchy. | Uwe Schning |
| 1986 | ICALP | Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). | Uwe Schning |
| 1985 | ICALP | Polynomial Levelability and Maximal Complexity Cores. | Pekka Orponen, David A. Russo, Uwe Schning |
| 1984 | FOCS | Sparse Oracles and Uniform Complexity Classes | Jos L. Balczar, Ronald V. Book, Timothy J. Long, Uwe Schning, Alan L. Selman |
| 1984 | ICALP | Robust Algorithms: A Different Approach to Oracles. | Uwe Schning |
| 1984 | MFCS | Sparse Oracles, Lowness, and Highness. | Jos L. Balczar, Ronald V. Book, Uwe Schning |
| 1984 | MFCS | The Structure of Polynomial Complexity Cores (Extended Abstract). | Pekka Orponen, Uwe Schning |
| 1983 | ICALP | Immunity (Extended Abstract). | Uwe Schning, Ronald V. Book |