Uwe Schöning

Cited by

	All	Since 2018
Citations	6778	788
h-index	39	12
i10-index	65	14

380

190

285

198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320 29 69 68 122 102 116 113 143 168 142 153 130 113 156 94 134 182 157 219 246 372 270 260 269 267 244 234 222 231 186 199 208 195 162 138 152 158 135 43

Public access

View all

7 articles

5 articles

available

not available

Based on funding mandates

Co-authors

Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University BerlinVerified email at informatik.hu-berlin.de
Jacobo ToranProfessor for theoretical computer science, University of UlmVerified email at uni-ulm.de
Randall PruimProfessor of Mathematics and Statistics, Calvin CollegeVerified email at calvin.edu
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de CatalunyaVerified email at upc.edu
Rainer SchulerVerified email at uni-ulm.de
Osamu WatanabeTokyo Institute of TechnologyVerified email at c.titech.ac.jp
Pekka OrponenProfessor of Computer Science, Aalto UniversityVerified email at aalto.fi
Adrian BalintUlm UniversityVerified email at uni-ulm.de
Hans A. KestlerProfessor, Institute of Medical Systems Biology, Ulm UniversityVerified email at uni-ulm.de
Edward A. HirschTechnionVerified email at technion.ac.il
Evgeny DantsinProfessor of Computer Science, Roosevelt UniversityVerified email at roosevelt.edu
Jon KleinbergProfessor of Computer Science, Cornell UniversityVerified email at cs.cornell.edu
Christos H PAPADIMITRIOUColumbia UniversityVerified email at columbia.edu
Prabhakar RaghavanGoogleVerified email at google.com
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Antoni LozanoProfessor of Computer Science, Universitat Politècnica de CatalunyaVerified email at cs.upc.edu
Fernando OrejasUniversitat Politècnica de CatalunyaVerified email at lsi.upc.edu
Jan van LeeuwenUtrecht UniversityVerified email at uu.nl

Uwe Schöning

Professor of Computer Science, Ulm University, retired

Verified email at uni-ulm.de - Homepage

Theoretical Computer Science Algorithms Complexity Bioinformatics


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The graph isomorphism problem: its structural complexity J Kobler, U Schöning, J Torán Springer Science & Business Media, 2012	706	2012
Theoretische Informatik-kurz gefasst U Schöning Spektrum Akademischer Verlag 36 (46), 118, 2008	595*	2008
A probabilistic algorithm for k-SAT and constraint satisfaction problems U Schöning Foundations of Computer Science, 1999. 40th Annual Symposium on, 410-414, 1999	583	1999
Logik für Informatiker. Spektrum U Schöning Akademischer Verlag, 2000	384*	2000
Graph isomorphism is in the low hierarchy U Schöning Sympos. on Theoretical Aspects of Comp. Sci. (STACS), 114-124, 1987	370*	1987
A deterministic (2− 2/(k+ 1)) n algorithm for k-SAT based on local search E Dantsin, A Goerdt, EA Hirsch, R Kannan, J Kleinberg, C Papadimitriou, ... Theoretical Computer Science 289 (1), 69-83, 2002	262	2002
Complexity and structure U Schöning Springer Berlin Heidelberg, 1986	217	1986
A low and a high hierarchy within NP U Schöning Journal of Computer and System Sciences 27 (1), 14-28, 1983	208	1983
Logic for computer scientists U Schöning Springer Science & Business Media, 2008	186	2008
The difference and truth-table hierarchies for NP J Köbler, U Schöning, KW Wagner RAIRO Informatique théorique et applications 21 (4), 419-435, 1987	177	1987
Probabilistic complexity classes and lowness U Schöning Structure in Complexity Theory Conference, 2-8, 1987	157	1987
A probabilistic algorithm for k-SAT based on limited local search and restart U Schöning ALGORITHMICA-NEW YORK- 32 (4), 615-623, 2002	151	2002
Choosing probability distributions for stochastic local search and the role of make versus break A Balint, U Schöning Theory and Applications of Satisfiability Testing–SAT 2012: 15th …, 2012	136	2012
Bi-immune sets for complexity classes JL Balcázar, U Schöning Mathematical Systems Theory 18 (1), 1-10, 1985	133	1985
1 Algorithmik U Schöning Ideen der Informatik, 1-29, 2009	130	2009
The polynomial-time hierarchy and sparse oracles JL Balcázar, RV Book, U Schöning Journal of the ACM (JACM) 33 (3), 603-617, 1986	120	1986
On circuit-size complexity and the low hierarchy in NP K Ko, U Schöning	119	1985
A Probabilistic 3—SAT Algorithm Further Improved T Hofmeister, U Schöning, R Schuler, O Watanabe STACS 2002: 19th Annual Symposium on Theoretical Aspects of Computer Science …, 2002	110	2002
Turing machines with few accepting computations and low sets for PP J Köbler, U Schöning, S Toda, J Toran Journal of Computer and Systems Sciences (JCSS) 44, 272-286, 1992	104	1992
A uniform approach to obtain diagonal sets in complexity classes U Schöning Theoretical Computer Science 18 (1), 95-103, 1982	103	1982

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors