Uwe Schöning - RankMe

103 papers A* 8A 8B 7C 2Misc 2Journal 41Unranked 12

Year	Rank	Type	Title / Venue / Authors
2020	—	`conf`	Promise Problems on Probability Distributions. Complexity and Approximation Jan-Hendrik Lorenz, Uwe Schöning
2016	—	`ch.`	Engineering a Lightweight and Efficient Local Search SAT Solver. Algorithm Engineering Adrian Balint, Uwe Schöning
2014	A	`conf`	Ant colony optimization with group learning. GECCO Gunnar Völkel, Markus Maucher, Uwe Schöning, Hans A. Kestler
2014	A	`conf`	Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses. SAT Adrian Balint, Armin Biere, Andreas Fröhlich, Uwe Schöning
2014	—	`conf`	Information Theoretic Measures for Ant Colony Optimization. ECDA Gunnar Völkel, Markus Maucher, Christoph Müssel, Uwe Schöning, Hans A. Kestler
2013	J	`jnl`	RNA-Pareto: interactive analysis of Pareto-optimal RNA sequence-structure alignments. Bioinform. Thomas Schnattinger, Uwe Schöning, Anita Marchfelder, Hans A. Kestler
2013	J	`jnl`	Structural RNA alignment by multi-objective optimization. Bioinform. Thomas Schnattinger, Uwe Schöning, Hans A. Kestler
2012	A	`conf`	Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break. SAT Adrian Balint, Uwe Schöning
2012	—	`book`	Das Erfüllbarkeitsproblem SAT - Algorithmen und Analysen. Uwe Schöning, Jacobo Torán
2012	—	`book`	Kryptologie-Kompendium. Uwe Schöning
2012	J	`jnl`	Turings Arbeiten über Berechenbarkeit - eine Einführung und Lesehilfe. Inform. Spektrum Uwe Schöning, Wolfgang Thomas
2011	J	`jnl`	Search heuristics and the influence of non-perfect randomness: examining Genetic Algorithms and Simulated Annealing. Comput. Stat. Markus Maucher, Uwe Schöning, Hans A. Kestler
2010	Misc	`conf`	Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems. CSR Uwe Schöning
2010	J	`jnl`	Das SAT-Problem. Inform. Spektrum Uwe Schöning
2010	—	`book`	Mathe-Toolbox - Mathematische Notationen, Grundbegriffe und Beweismethoden. Uwe Schöning, Hans A. Kestler
2010	J	`jnl`	Using Stochastic Indexed Grammars for RNA Structure PredictionWith Pseudoknots. Bull. EATCS Uwe Schöning, Monika von Knop
2007	C	`conf`	Principles of Stochastic Local Search. UC Uwe Schöning
2007	J	`jnl`	Randomized Algorithms for 3-SAT. Theory Comput. Syst. Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
2006	—	`conf`	A note on the size of Craig Interpolants. Circuits, Logic, and Games Uwe Schöning, Jacobo Torán
2006	J	`jnl`	Smaller superconcentrators of density 28. Inf. Process. Lett. Uwe Schöning
2005	A	`conf`	Algorithmics in Exponential Time. STACS Uwe Schöning
2005	—	`book`	Ideen der Informatik - grundlegende Modelle und Konzepte, 2. Auflage. Uwe Schöning
2005	C	`conf`	New Algorithmic Paradigms in Exponential Time Algorithms. CiE Uwe Schöning
2005	Misc	`conf`	Randomized Quicksort and the Entropy of the Random Source. COCOON Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
2004	—	`conf`	Randomized QuickSort and the Entropy of the Random Source. Algebraic Methods in Computational Complexity Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
2004	J	`jnl`	Randomized Quicksort and the Entropy of the Random Number Generator Electron. Colloquium Comput. Complex. Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler
2002	A	`conf`	A Probabilistic 3-SAT Algorithm Further Improved. STACS Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
2002	J	`jnl`	A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart. Algorithmica Uwe Schöning
2002	J	`jnl`	A deterministic (2-2/(k+1)) Theor. Comput. Sci. Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Ravi Kannan, Jon M. Kleinberg, Christos H. Papadimitriou, Prabhakar Raghavan, Uwe Schöning
2002	—	`book`	Ideen der Informatik: Grundlegende Modelle und Konzepte Uwe Schöning
2001	—	`book`	Algorithmik. Uwe Schöning
2001	B	`conf`	New Algorithms for k -SAT Based on the Local Search Principle. MFCS Uwe Schöning
2000	J	`jnl`	Construction of expanders and superconcentrators using Kolmogorov complexity. Random Struct. Algorithms Uwe Schöning
2000	A*	`conf`	Deterministic Algorithms for ICALP Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning
2000	—	`book`	Logik für Informatiker, 5. Auflage. Uwe Schöning
2000	J	`jnl`	Mastering the Master Theorem. Bull. EATCS Uwe Schöning
1999	A*	`conf`	A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. FOCS Uwe Schöning
1998	—	`book`	Gems of theoretical computer science. Uwe Schöning, Randall J. Pruim
1997	—	`book`	Algorithmen - kurz gefasst. Uwe Schöning
1997	B	`conf`	Better Expanders and Superconcentrators by Kolmogorov Complexity. SIROCCO Uwe Schöning
1997	J	`jnl`	Complexity of Presburger Arithmetic with Fixed Quantifier Dimension. Theory Comput. Syst. Uwe Schöning
1997	—	`conf`	High Sets for NP. Advances in Algorithms, Languages, and Complexity Johannes Köbler, Uwe Schöning
1997	B	`conf`	Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. MFCS Uwe Schöning
1997	—	`book`	Theoretische Informatik - kurzgefaßt, 3. Auflage. Uwe Schöning
1995	J	`jnl`	If NP has Polynomial-Size Circuits, then MA=AM. Theor. Comput. Sci. Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
1995	—	`book`	Logik für Informatiker, 4. Auflage. Uwe Schöning
1995	—	`book`	Perlen der theoretischen Informatik - 9 weitere Themen. Uwe Schöning
1995	—	`book`	Perlen der theoretischen Informatik. Uwe Schöning
1995	—	`book`	Theoretische Informatik kurzgefaßt, 2. Auflage. Uwe Schöning
1994	J	`jnl`	Instance Complexity. J. ACM Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe
1993	—	`ed.`	Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 Complexity Theory: Current Research Klaus Ambos-Spies, Steven Homer, Uwe Schöning
1993	J	`jnl`	On Random Reductions from Sparse Sets to Tally Sets. Inf. Process. Lett. Uwe Schöning
1993	—	`book`	The Graph Isomorphism Problem: Its Structural Complexity Johannes Köbler, Uwe Schöning, Jacobo Torán
1992	A	`conf`	Graph Isomorphism is Low for PP. STACS Johannes Köbler, Uwe Schöning, Jacobo Torán
1992	J	`jnl`	Graph Isomorphism is Low for PP. Comput. Complex. Johannes Köbler, Uwe Schöning, Jacobo Torán
1992	J	`jnl`	Logarithmic Advice Classes. Theor. Comput. Sci. José L. Balcázar, Uwe Schöning
1992	—	`book`	Logik für Informatiker, 3. Auflage Uwe Schöning
1992	—	`conf`	Reductions to Sets of Low Information Content. Complexity Theory: Current Research Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1992	A*	`conf`	Reductions to Sets of Low Information Content. ICALP Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1992	—	`book`	Theoretische Informatik kurz gefasst. Uwe Schöning
1992	J	`jnl`	Turing Machines with Few Accepting Computations and Low Sets for PP. J. Comput. Syst. Sci. Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
1990	—	`conf`	Complexity Cores and Hard Problem Instances. SIGAL International Symposium on Algorithms Uwe Schöning
1989	—	`book`	Logik für Informatiker, 2. Auflage Uwe Schöning
1989	J	`jnl`	On Counting and Approximation. Acta Informatica Johannes Köbler, Uwe Schöning, Jacobo Torán
1989	J	`jnl`	Probabilistic Complexity Classes and Lowness. J. Comput. Syst. Sci. Uwe Schöning
1989	—	`conf`	Turing Machines with few Accepting Computations and low Sets for PP. SCT Johannes Köbler, Uwe Schöning, Seinosuke Toda, Jacobo Torán
1988	A	`conf`	Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many Queries. STACS Uwe Schöning, Klaus W. Wagner
1988	J	`jnl`	Graph Isomorphism is in the Low Hierarchy. J. Comput. Syst. Sci. Uwe Schöning
1988	—	`conf`	On Counting and Approximation. CAAP Johannes Köbler, Uwe Schöning, Jacobo Torán
1988	B	`conf`	Robust Orale Machines. MFCS Uwe Schöning
1988	—	`conf`	The power of counting. SCT Uwe Schöning
1987	B	`conf`	Complexity Cores and Hard-To-Prove Formulas. CSL Uwe Schöning
1987	A	`conf`	Graph Isomorphism is in the Low Hierarchy. STACS Uwe Schöning
1987	—	`book`	Logik für Informatiker Uwe Schöning
1987	—	`conf`	Probabilistic complexity classes and lowness. SCT Uwe Schöning
1987	J	`jnl`	The Difference and Truth-Table Hierarchies for NP. RAIRO Theor. Informatics Appl. Johannes Köbler, Uwe Schöning, Klaus W. Wagner
1986	J	`jnl`	Complete Sets and Closeness to Complexity Classes. Math. Syst. Theory Uwe Schöning
1986	—	`book`	Complexity and Structure Uwe Schöning
1986	A*	`conf`	Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). ICALP Uwe Schöning
1986	J	`jnl`	Optimal Approximations and Polynomially Levelable Sets. SIAM J. Comput. Pekka Orponen, David A. Russo, Uwe Schöning
1986	J	`jnl`	Sparse Sets, Lowness and Highness. SIAM J. Comput. José L. Balcázar, Ronald V. Book, Uwe Schöning
1986	J	`jnl`	The Density and Complexity of Polynomial Cores for Intractable Sets. Inf. Control. Pekka Orponen, Uwe Schöning
1986	J	`jnl`	The polynomial-time hierarchy and sparse oracles. J. ACM José L. Balcázar, Ronald V. Book, Uwe Schöning
1986	—	`conf`	What Is a Hard Instance of a Computational Problem?. SCT Ker-I Ko, Pekka Orponen, Uwe Schöning, Osamu Watanabe
1985	J	`jnl`	Bi-Immune Sets for Complexity Classes. Math. Syst. Theory José L. Balcázar, Uwe Schöning
1985	J	`jnl`	On Bounded Query Machines. Theor. Comput. Sci. José L. Balcázar, Ronald V. Book, Uwe Schöning
1985	J	`jnl`	On Circuit-Size Complexity and the Low Hierarchy in NP. SIAM J. Comput. Ker-I Ko, Uwe Schöning
1985	A*	`conf`	Polynomial Levelability and Maximal Complexity Cores. ICALP Pekka Orponen, David A. Russo, Uwe Schöning
1985	J	`jnl`	Robust Algorithms: A Different Approach to Oracles. Theor. Comput. Sci. Uwe Schöning
1984	J	`jnl`	Immunity, Relativizations, and Nondeterminism. SIAM J. Comput. Uwe Schöning, Ronald V. Book
1984	J	`jnl`	Minimal pairs for P Theor. Comput. Sci. Uwe Schöning
1984	J	`jnl`	On Small Generators Theor. Comput. Sci. Uwe Schöning
1984	A*	`conf`	Robust Algorithms: A Different Approach to Oracles. ICALP Uwe Schöning
1984	A*	`conf`	Sparse Oracles and Uniform Complexity Classes FOCS José L. Balcázar, Ronald V. Book, Timothy J. Long, Uwe Schöning, Alan L. Selman
1984	B	`conf`	Sparse Oracles, Lowness, and Highness. MFCS José L. Balcázar, Ronald V. Book, Uwe Schöning
1984	B	`conf`	The Structure of Polynomial Complexity Cores (Extended Abstract). MFCS Pekka Orponen, Uwe Schöning
1983	J	`jnl`	A Low and a High Hierarchy within NP. J. Comput. Syst. Sci. Uwe Schöning
1983	A*	`conf`	Immunity (Extended Abstract). ICALP Uwe Schöning, Ronald V. Book
1983	J	`jnl`	On the Dtructure of Delta Inf. Process. Lett. Uwe Schöning
1982	J	`jnl`	A Uniform Approach to Obtain Diagonal Sets in Complexity Classes. Theor. Comput. Sci. Uwe Schöning
1982	J	`jnl`	On NP-decomposable sets. SIGACT News Uwe Schöning
1981	J	`jnl`	A note on complete sets for the polynomial-time hierarchy. SIGACT News Uwe Schöning
1981	—	`—`	Untersuchungen zur Struktur von NP und verwandten Komplexitätsklassen mit Hilfe verschiedener polynomieller Reduktionen. Uwe Schöning