Uwe Schöning

4.1k total citations
57 papers, 1.8k citations indexed

About

Uwe Schöning is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Uwe Schöning has authored 57 papers receiving a total of 1.8k indexed citations (citations by other indexed papers that have themselves been cited), including 48 papers in Computational Theory and Mathematics, 24 papers in Artificial Intelligence and 6 papers in Computer Networks and Communications. Recurrent topics in Uwe Schöning's work include Computability, Logic, AI Algorithms (24 papers), Complexity and Algorithms in Graphs (20 papers) and semigroups and automata theory (13 papers). Uwe Schöning is often cited by papers focused on Computability, Logic, AI Algorithms (24 papers), Complexity and Algorithms in Graphs (20 papers) and semigroups and automata theory (13 papers). Uwe Schöning collaborates with scholars based in Germany, United States and Spain. Uwe Schöning's co-authors include Johannes Köbler, Jacobo Torán, José L. Balcázar, Ronald V. Book, Ker‐I Ko, Roger Jones, Nimish Vakil, Tore Lind, Ola Junghard and Peter Bytzer and has published in prestigious journals such as Bioinformatics, Gut and Journal of the ACM.

In The Last Decade

Uwe Schöning

54 papers receiving 1.6k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Uwe Schöning Germany	20	1.3k	813	233	233	224	57	1.8k
Maurice Bruynooghe Belgium	28	963 0.8×	2.0k 2.4×	499 2.1×	1 0.0×	33 0.1×	202	2.5k
Andrea Asperti Italy	16	474 0.4×	596 0.7×	94 0.4×	12 0.1×	2 0.0×	80	811
Łukasz Kowalik Poland	11	807 0.6×	156 0.2×	314 1.3×		15 0.1×	44	1.1k
Andrei Kelarev Australia	22	957 0.8×	458 0.6×	206 0.9×		30 0.1×	144	2.0k
Richard Peng United States	20	549 0.4×	437 0.5×	270 1.2×		9 0.0×	56	1.0k
Csaba D. Tóth United States	15	268 0.2×	167 0.2×	154 0.7×	2 0.0×	5 0.0×	140	848
Daniel Simón United States	12	281 0.2×	933 1.1×	504 2.2×		72 0.3×	23	1.3k
G. B. Preston United States	12	2.5k 2.0×	408 0.5×	45 0.2×		35 0.2×	45	3.1k
Enes Pašalić Slovenia	19	196 0.2×	973 1.2×	194 0.8×		13 0.1×	109	1.2k
Johannes Blömer Germany	15	126 0.1×	366 0.5×	594 2.5×		18 0.1×	37	1.2k

Countries citing papers authored by Uwe Schöning

Since Specialization

Citations

This map shows the geographic impact of Uwe Schöning's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Uwe Schöning with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Uwe Schöning more than expected).

Fields of papers citing papers by Uwe Schöning

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Uwe Schöning. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Uwe Schöning. The network helps show where Uwe Schöning may publish in the future.

Co-authorship network of co-authors of Uwe Schöning

This figure shows the co-authorship network connecting the top 25 collaborators of Uwe Schöning. A scholar is included among the top collaborators of Uwe Schöning based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Uwe Schöning. Uwe Schöning is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Schöning, Uwe, et al.. (2011). Search heuristics and the influence of non-perfect randomness: examining Genetic Algorithms and Simulated Annealing. Computational Statistics. 26(2). 303–319. 6 indexed citations

2.

Dent, John, Nimish Vakil, Roger Jones, et al.. (2010). Accuracy of the diagnosis of GORD by questionnaire, physicians and a trial of proton pump inhibitor treatment: the Diamond Study. Gut. 59(6). 714–721. 243 indexed citations

3.

Schöning, Uwe. (2008). Logic for Computer Scientists. Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)). 5 indexed citations

4.

Schöning, Uwe, et al.. (2004). Randomized Quicksort and the Entropy of the Random Number Generator. Electronic colloquium on computational complexity. 1 indexed citations

5.

Dantsin, Evgeny, Andreas Goerdt, Edward Hirsch, et al.. (2002). A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search. Theoretical Computer Science. 289(1). 69–83. 78 indexed citations

6.

Schöning, Uwe. (1997). Better Expanders and Superconcentrators by Kolmogorov Complexity.. 138–150. 2 indexed citations

7.

Schöning, Uwe. (1995). Complexity theory and interaction. Springer eBooks. 519–536. 2 indexed citations

8.

Schöning, Uwe. (1995). Logik für Informatiker. 6 indexed citations

9.

Ambos‐Spies, Klaus, Steven Homer, & Uwe Schöning. (1993). Complexity theory: current research. Cambridge University Press eBooks. 34 indexed citations

10.

Köbler, Johannes, Uwe Schöning, & Jacobo Torán. (1989). On counting and approximation. Acta Informatica. 26(4). 363–379. 23 indexed citations

11.

Schöning, Uwe. (1989). Probabilistic complexity classes and lowness. Journal of Computer and System Sciences. 39(1). 84–100. 66 indexed citations

12.

Schöning, Uwe. (1988). Robust Orale Machines. 93–106. 1 indexed citations

13.

Schöning, Uwe. (1987). Lowness and probabilistic complexity classes.. 3 indexed citations

14.

Balcázar, José L., Ronald V. Book, & Uwe Schöning. (1986). The polynomial-time hierarchy and sparse oracles. Journal of the ACM. 33(3). 603–617. 54 indexed citations

15.

Schöning, Uwe. (1985). Robust algorithms: A different approach to oracles. Theoretical Computer Science. 40. 57–66. 18 indexed citations

16.

Balcázar, José L., Ronald V. Book, & Uwe Schöning. (1985). On bounded query machines. Theoretical Computer Science. 40. 237–243. 9 indexed citations

17.

Balcázar, José L. & Uwe Schöning. (1985). Bi-immune sets for complexity classes. Theory of Computing Systems. 18(1). 1–10. 62 indexed citations

18.

Schöning, Uwe. (1984). On small generators. Theoretical Computer Science. 34(3). 337–341. 15 indexed citations

19.

Schöning, Uwe. (1983). A low and a high hierarchy within NP. Journal of Computer and System Sciences. 27(1). 14–28. 86 indexed citations

20.

Schöning, Uwe. (1982). A uniform approach to obtain diagonal sets in complexity classes. Theoretical Computer Science. 18(1). 95–103. 47 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact