World's Best Scientists 2026 revealed!
Uwe Schöning

Uwe Schöning

D-Index & Metrics

Computer Science

D-Index
32
Citations
5732
World Ranking
12996
National Ranking
633

Overview

Uwe Schöning is affiliated with the University of Ulm in Germany and works primarily within the field of Computer Science. Their research spans several subfields, including Computational Theory and Mathematics, Signal Processing, and Artificial Intelligence.

Their work addresses a range of topics, mainly focused on algorithms and complexity. Key areas of study include:

  • Complexity and Algorithms in Graphs
  • Data Management and Algorithms
  • Machine Learning and Algorithms

Collaboration plays a part in their research output, with Jan-Hendrik Lorenz noted as a frequent coauthor.

Best Publications

  • The Graph Isomorphism Problem : Its Structural Complexity

    Johannes Köbler;Uwe Schöning;Jacobo Torán

  • Graph isomorphism is in the low hierarchy

    Uwe Schöning

  • The Graph Isomorphism Problem

    Johannes Köbler;Uwe Schöning;Jacobo Torán

  • Graph isomorphism is in the low hierarchy

    U. Schöning

  • A deterministic (2 - 2/( k + 1)) n algorithm for k -SAT based on local search

    Evgeny Dantsin;Andreas Goerdt;Edward A. Hirsch;Ravi Kannan

  • Complexity and structure

    Uwe Schöning

  • A low and a high hierarchy within NP

    Uwe Schöning

  • The difference and truth-table hierarchies for NP

    Johannes Köbler;Uwe Schöning;Klaus W. Wagner

  • Logic for computer scientists

    Uwe Schoning;Robert Constable;John C. Cherniavsky;Richard Platek

  • A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart

    Uwe Schöning

  • Choosing probability distributions for stochastic local search and the role of make versus break

    Adrian Balint;Uwe Schöning

  • Bi-immune sets for complexity classes

    José L. Balcázar;Uwe Schöning

  • Reductions to sets of low information content

    V. Arvind;Y. Han;L. Hemachandra;J. Köbler

  • The polynomial-time hierarchy and sparse oracles

    Jose L. Balcázar;Ronald V. Book;Uwe Schöning

  • Probabilistic complexity classes and lowness

    Unknown

  • On Circuit-Size Complexity and the Low Hierarchy in NP

    Ker-I Ko;Uwe Schöning

  • A Probabilistic 3-SAT Algorithm Further Improved

    Thomas Hofmeister;Uwe Schöning;Rainer Schuler;Osamu Watanabe

  • On counting and approximation

    Johannes Köbler;Uwe Schöning;Jacobo Torán

  • Turing machines with few accepting computations and low sets for PP

    Johannes Köbler;Uwe Schöning;Seinosuke Toda;Jacobo Torán

  • A uniform approach to obtain diagonal sets in complexity classes

    Uwe Schöning

  • Sparse sets lowness and highness

    José Balcázar;Ronald V Book;Uwe Schöning

  • Graph isomorphism is low for PP

    Johannes Köbler;Uwe Schöning;Jacobo Torán

  • Instance complexity

    Pekka Orponen;Ker-i Ko;Uwe Schöning;Osamu Watanabe

Frequent Co-Authors

Hans A. Kestler
Hans A. Kestler University of Ulm
Osamu Watanabe
Osamu Watanabe Tokyo Institute of Technology
Ravi Kannan
Ravi Kannan Microsoft (United States)
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)
Christos H. Papadimitriou
Christos H. Papadimitriou Columbia University
Armin Biere
Armin Biere University of Freiburg
Jon Kleinberg
Jon Kleinberg Cornell University
Wolfgang Thomas
Wolfgang Thomas RWTH Aachen University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

The field of computer science offers various online degrees and certification paths to fit different career goals. If you’re aiming for a quick entry into the tech workforce, an online associate degree in computer science can provide foundational knowledge and skills in as little as two years.

Those looking to specialize further or gain a competitive edge may consider the most valuable masters degrees that are currently in high demand. Some universities offer shortest masters degree programs online, allowing you to complete your education faster and accelerate your career progress.

Additionally, earning certifications for jobs can help demonstrate your expertise in specific technologies or programming languages. Certifications are a fast way to boost your resume and can open doors to well-paying tech positions.

Exploring these different online degrees and certifications can help you tailor your educational journey to your personal aspirations, schedule, and desired career pathway in computer science.

Best Scientists Citing Uwe Schöning

Trending Scientists

Recently Published Articles