default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUwe Schöning
Person information
- affiliation: University of Ulm, Institute for Theoretical Informatics, Germany
- affiliation (PhD 1981): University of Stuttgart, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c37]Jan-Hendrik Lorenz, Uwe Schöning:
Promise Problems on Probability Distributions. Complexity and Approximation 2020: 57-66
2010 – 2019
- 2016
- [p1]Adrian Balint, Uwe Schöning:
Engineering a Lightweight and Efficient Local Search SAT Solver. Algorithm Engineering 2016: 1-18 - 2014
- [c36]Gunnar Völkel, Markus Maucher, Christoph Müssel, Uwe Schöning, Hans A. Kestler
:
Information Theoretic Measures for Ant Colony Optimization. ECDA 2014: 519-530 - [c35]Gunnar Völkel, Markus Maucher, Uwe Schöning, Hans A. Kestler:
Ant colony optimization with group learning. GECCO 2014: 57-64 - [c34]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: 302-316 - 2013
- [j40]Thomas Schnattinger, Uwe Schöning, Hans A. Kestler:
Structural RNA alignment by multi-objective optimization. Bioinform. 29(13): 1607-1613 (2013) - [j39]Thomas Schnattinger, Uwe Schöning, Anita Marchfelder, Hans A. Kestler:
RNA-Pareto: interactive analysis of Pareto-optimal RNA sequence-structure alignments. Bioinform. 29(23): 3102-3104 (2013) - 2012
- [b21]Uwe Schöning, Jacobo Torán:
Das Erfüllbarkeitsproblem SAT - Algorithmen und Analysen. Mathematik für Anwendungen 1, Lehmann 2012, ISBN 978-3-86541-473-1, pp. 1-187 - [b20]Uwe Schöning:
Kryptologie-Kompendium. Mathematik für Anwendungen 2, Lehmanns Media 2012, ISBN 978-3-86541-515-8, pp. 1-136 - [j38]Uwe Schöning, Wolfgang Thomas:
Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe. Inform. Spektrum 35(4): 253-260 (2012) - [c33]Adrian Balint, Uwe Schöning:
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break. SAT 2012: 16-29 - 2011
- [j37]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): 303-319 (2011) - 2010
- [b19]Uwe Schöning, Hans A. Kestler:
Mathe-Toolbox - Mathematische Notationen, Grundbegriffe und Beweismethoden. Lehmanns Media 2010, ISBN 978-3-86541-369-7, pp. 1-143 - [j36]Uwe Schöning, Monika von Knop:
Using Stochastic Indexed Grammars for RNA Structure PredictionWith Pseudoknots. Bull. EATCS 101: 185-188 (2010) - [j35]Uwe Schöning:
Das SAT-Problem. Inform. Spektrum 33(5): 479-483 (2010) - [c32]Uwe Schöning:
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. CSR 2010: 344-349
2000 – 2009
- 2007
- [j34]Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
Randomized Algorithms for 3-SAT. Theory Comput. Syst. 40(3): 249-262 (2007) - [c31]Uwe Schöning:
Principles of Stochastic Local Search. UC 2007: 178-187 - 2006
- [j33]Uwe Schöning:
Smaller superconcentrators of density 28. Inf. Process. Lett. 98(4): 127-129 (2006) - [i3]Uwe Schöning, Jacobo Torán:
A note on the size of Craig Interpolants. Circuits, Logic, and Games 2006 - 2005
- [b18]Uwe Schöning:
Ideen der Informatik - grundlegende Modelle und Konzepte, 2. Auflage. Oldenbourg 2005, ISBN 978-3-486-57833-1, pp. I-X, 1-260 - [c30]Uwe Schöning:
New Algorithmic Paradigms in Exponential Time Algorithms. CiE 2005: 429-429 - [c29]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized Quicksort and the Entropy of the Random Source. COCOON 2005: 450-460 - [c28]Uwe Schöning:
Algorithmics in Exponential Time. STACS 2005: 36-43 - 2004
- [i2]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized QuickSort and the Entropy of the Random Source. Algebraic Methods in Computational Complexity 2004 - [i1]Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler:
Randomized Quicksort and the Entropy of the Random Number Generator. Electron. Colloquium Comput. Complex. TR04 (2004) - 2002
- [b17]Uwe Schöning:
Ideen der Informatik: Grundlegende Modelle und Konzepte. Oldenbourg 2002, ISBN 3-486-25899-0 - [j32]Uwe Schöning:
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. Algorithmica 32(4): 615-623 (2002) - [j31]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. Theor. Comput. Sci. 289(1): 69-83 (2002) - [c27]Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe:
A Probabilistic 3-SAT Algorithm Further Improved. STACS 2002: 192-202 - 2001
- [b16]Uwe Schöning:
Algorithmik. Spektrum Akadem. Verl. 2001, ISBN 978-3-8274-1092-4, pp. 1-384 - [c26]Uwe Schöning:
New Algorithms for k -SAT Based on the Local Search Principle. MFCS 2001: 87-95 - 2000
- [b15]Uwe Schöning:
Logik für Informatiker, 5. Auflage. Spektrum-Hochschultaschenbuch, Spektrum Akadem. Verl. 2000, ISBN 978-3-8274-1005-4, pp. 1-200 - [j30]Uwe Schöning:
Mastering the Master Theorem. Bull. EATCS 71: 165-166 (2000) - [j29]Uwe Schöning:
Construction of expanders and superconcentrators using Kolmogorov complexity. Random Struct. Algorithms 17(1): 64-77 (2000) - [c25]Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning:
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search. ICALP 2000: 236-247
1990 – 1999
- 1999
- [c24]Uwe Schöning:
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. FOCS 1999: 410-414 - 1998
- [b14]Uwe Schöning, Randall Pruim:
Gems of theoretical computer science. Springer 1998, ISBN 978-3-540-64425-5, pp. I-X, 1-320 - 1997
- [b13]Uwe Schöning:
Algorithmen - kurz gefasst. Hochschultaschenbuch, Spektrum Akademischer Verlag 1997, ISBN 978-3-8274-0232-5, pp. 1-221 - [b12]Uwe Schöning:
Theoretische Informatik - kurzgefaßt, 3. Auflage. Hochschultaschenbuch, Spektrum Akademischer Verlag 1997, ISBN 978-3-8274-0250-9, pp. 1-196 - [j28]Uwe Schöning:
Complexity of Presburger Arithmetic with Fixed Quantifier Dimension. Theory Comput. Syst. 30(4): 423-428 (1997) - [c23]Johannes Köbler, Uwe Schöning:
High Sets for NP. Advances in Algorithms, Languages, and Complexity 1997: 139-156 - [c22]Uwe Schöning:
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. MFCS 1997: 110-116 - [c21]Uwe Schöning:
Better Expanders and Superconcentrators by Kolmogorov Complexity. SIROCCO 1997: 138-150 - 1995
- [b11]Uwe Schöning:
Perlen der theoretischen Informatik. BI-Wissenschaftsverlag 1995, ISBN 978-3-411-17331-0, pp. 1-332 - [b10]Uwe Schöning:
Perlen der theoretischen Informatik - 9 weitere Themen. Universität 1995, pp. 1-58 - [b9]Uwe Schöning:
Logik für Informatiker, 4. Auflage. Reihe Informatik, Spektrum Akademischer Verlag 1995, ISBN 978-3-86025-684-8, pp. 1-207 - [b8]Uwe Schöning:
Theoretische Informatik kurzgefaßt, 2. Auflage. Spektrum Akademischer Verlag 1995, ISBN 978-3-86025-711-1, pp. 1-188 - [j27]Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler:
If NP has Polynomial-Size Circuits, then MA=AM. Theor. Comput. Sci. 137(2): 279-282 (1995) - 1994
- [j26]Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe:
Instance Complexity. J. ACM 41(1): 96-121 (1994) - 1993
- [b7]Johannes Köbler, Uwe Schöning, Jacobo Torán:
The Graph Isomorphism Problem: Its Structural Complexity. Progress in Theoretical Computer Science, Birkhäuser/Springer 1993, ISBN 978-1-4612-6712-6 - [j25]Uwe Schöning:
On Random Reductions from Sparse Sets to Tally Sets. Inf. Process. Lett. 46(5): 239-241 (1993) - [e1]Klaus Ambos-Spies, Steven Homer, Uwe Schöning:
Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992. Cambridge University Press 1993, ISBN 0-521-44220-6 [contents] - 1992
- [b6]Uwe Schöning:
Logik für Informatiker, 3. Auflage. Reihe Informatik 56, Bibliographisches Institut 1992, ISBN 3-411-14013-5 - [b5]Uwe Schöning:
Theoretische Informatik kurz gefasst. BI-Wissenschaftsverlag 1992, ISBN 978-3-411-15641-2, pp. 1-188 - [j24]Johannes Köbler, Uwe Schöning, Jacobo Torán:
Graph Isomorphism is Low for PP. Comput. Complex. 2: 301-330 (1992) - [j23]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): 272-286 (1992) - [j22]José L. Balcázar, Uwe Schöning:
Logarithmic Advice Classes. Theor. Comput. Sci. 99(2): 279-290 (1992) - [c20]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: 1-46 - [c19]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: 162-173 - [c18]Johannes Köbler, Uwe Schöning, Jacobo Torán:
Graph Isomorphism is Low for PP. STACS 1992: 401-411 - 1990
- [c17]Uwe Schöning:
Complexity Cores and Hard Problem Instances. SIGAL International Symposium on Algorithms 1990: 232-240
1980 – 1989
- 1989
- [b4]Uwe Schöning:
Logik für Informatiker, 2. Auflage. Reihe Informatik 56, Bibliographisches Institut 1989, ISBN 3-411-14012-7 - [j21]Johannes Köbler, Uwe Schöning, Jacobo Torán:
On Counting and Approximation. Acta Informatica 26(4): 363-379 (1989) - [j20]Uwe Schöning:
Probabilistic Complexity Classes and Lowness. J. Comput. Syst. Sci. 39(1): 84-100 (1989) - [c16]Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán:
Turing Machines with few Accepting Computations and low Sets for PP. SCT 1989: 208-215 - 1988
- [j19]Uwe Schöning:
Graph Isomorphism is in the Low Hierarchy. J. Comput. Syst. Sci. 37(3): 312-323 (1988) - [c15]Johannes Köbler, Uwe Schöning, Jacobo Torán:
On Counting and Approximation. CAAP 1988: 40-51 - [c14]Uwe Schöning:
The power of counting. SCT 1988: 2-9 - [c13]Uwe Schöning:
Robust Orale Machines. MFCS 1988: 93-106 - [c12]Uwe Schöning, Klaus W. Wagner:
Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. STACS 1988: 91-97 - 1987
- [b3]Uwe Schöning:
Logik für Informatiker. Reihe Informatik 56, Bibliographisches Institut 1987, ISBN 3-411-03164-6 - [j18]Johannes Köbler, Uwe Schöning, Klaus W. Wagner:
The Difference and Truth-Table Hierarchies for NP. RAIRO Theor. Informatics Appl. 21(4): 419-435 (1987) - [c11]Uwe Schöning:
Probabilistic complexity classes and lowness. SCT 1987: 2-8 - [c10]Uwe Schöning:
Complexity Cores and Hard-To-Prove Formulas. CSL 1987: 273-280 - [c9]Uwe Schöning:
Graph Isomorphism is in the Low Hierarchy. STACS 1987: 114-124 - 1986
- [b2]Uwe Schöning:
Complexity and Structure. Lecture Notes in Computer Science 211, Springer 1986, ISBN 3-540-16079-5 - [j17]Pekka Orponen, Uwe Schöning:
The Density and Complexity of Polynomial Cores for Intractable Sets. Inf. Control. 70(1): 54-68 (1986) - [j16]José L. Balcázar, Ronald V. Book, Uwe Schöning:
The polynomial-time hierarchy and sparse oracles. J. ACM 33(3): 603-617 (1986) - [j15]Uwe Schöning:
Complete Sets and Closeness to Complexity Classes. Math. Syst. Theory 19(1): 29-41 (1986) - [j14]Pekka Orponen, David A. Russo, Uwe Schöning:
Optimal Approximations and Polynomially Levelable Sets. SIAM J. Comput. 15(2): 399-408 (1986) - [j13]José L. Balcázar, Ronald V. Book, Uwe Schöning:
Sparse Sets, Lowness and Highness. SIAM J. Comput. 15(3): 739-747 (1986) - [c8]Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe:
What Is a Hard Instance of a Computational Problem?. SCT 1986: 197-217 - [c7]Uwe Schöning:
Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). ICALP 1986: 370-375 - 1985
- [j12]José L. Balcázar, Uwe Schöning:
Bi-Immune Sets for Complexity Classes. Math. Syst. Theory 18(1): 1-10 (1985) - [j11]Ker-I Ko, Uwe Schöning:
On Circuit-Size Complexity and the Low Hierarchy in NP. SIAM J. Comput. 14(1): 41-51 (1985) - [j10]Uwe Schöning:
Robust Algorithms: A Different Approach to Oracles. Theor. Comput. Sci. 40: 57-66 (1985) - [j9]José L. Balcázar, Ronald V. Book, Uwe Schöning:
On Bounded Query Machines. Theor. Comput. Sci. 40: 237-243 (1985) - [c6]Pekka Orponen, David A. Russo, Uwe Schöning:
Polynomial Levelability and Maximal Complexity Cores. ICALP 1985: 435-444 - 1984
- [j8]Uwe Schöning, Ronald V. Book:
Immunity, Relativizations, and Nondeterminism. SIAM J. Comput. 13(2): 329-337 (1984) - [j7]Uwe Schöning:
Minimal pairs for P. Theor. Comput. Sci. 31: 41-48 (1984) - [j6]Uwe Schöning:
On Small Generators. Theor. Comput. Sci. 34(3): 337-341 (1984) - [c5]José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman:
Sparse Oracles and Uniform Complexity Classes. FOCS 1984: 308-311 - [c4]Uwe Schöning:
Robust Algorithms: A Different Approach to Oracles. ICALP 1984: 448-453 - [c3]José L. Balcázar, Ronald V. Book, Uwe Schöning:
Sparse Oracles, Lowness, and Highness. MFCS 1984: 185-193 - [c2]Pekka Orponen, Uwe Schöning:
The Structure of Polynomial Complexity Cores (Extended Abstract). MFCS 1984: 452-458 - 1983
- [j5]Uwe Schöning:
On the Dtructure of Deltap2. Inf. Process. Lett. 16(4): 209-211 (1983) - [j4]Uwe Schöning:
A Low and a High Hierarchy within NP. J. Comput. Syst. Sci. 27(1): 14-28 (1983) - [c1]Uwe Schöning, Ronald V. Book:
Immunity (Extended Abstract). ICALP 1983: 653-661 - 1982
- [j3]Uwe Schöning:
On NP-decomposable sets. SIGACT News 14(1): 18-20 (1982) - [j2]Uwe Schöning:
A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. Theor. Comput. Sci. 18: 95-103 (1982) - 1981
- [b1]Uwe Schöning:
Untersuchungen zur Struktur von NP und verwandten Komplexitätsklassen mit Hilfe verschiedener polynomieller Reduktionen. University of Stuttgart, Germany, 1981, pp. 1-78 - [j1]Uwe Schöning:
A note on complete sets for the polynomial-time hierarchy. SIGACT News 13(1): 30-34 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
