# Dominik Scheder
**Wikidata**: [Q64167617](https://www.wikidata.org/wiki/Q64167617)  
**Source**: https://4ort.xyz/entity/dominik-scheder

## Summary
Dominik Scheder is a German computer scientist and university teacher recognized for his research in theoretical computer science. His work focuses on the boolean satisfiability problem, algorithm design, and communication complexity. He has held academic positions at prominent institutions including ETH Zurich, Aarhus University, and Shanghai Jiao Tong University.

## Biography
*   **Nationality:** Germany
*   **Education:**
    *   Doctor of Science, ETH Zurich (2005–2011)
    *   Master of Science in Computer Science, University of Colorado Boulder (2003–2005)
    *   Studies at Friedrich-Alexander-Universität Erlangen-Nürnberg (1999–2003)
*   **Known for:** Research in boolean satisfiability problems, algorithms, and communication complexity.
*   **Employer(s):**
    *   Shanghai Jiao Tong University (Start date: September 2014)
    *   Tsinghua University
    *   University of California, Berkeley
    *   Aarhus University
    *   ETH Zurich
*   **Field(s):** Computer Science
*   **Languages:** German

## Contributions
Dominik Scheder has made distinct contributions to the field of theoretical computer science, particularly within the domain of algorithms and complexity theory. His doctoral work, completed at ETH Zurich under the supervision of Emo Welzl, advanced the understanding of fundamental computational problems.

Scheder’s research portfolio is heavily centered on the **boolean satisfiability problem (SAT)**, a cornerstone of computational complexity. He investigates the structural and algorithmic aspects of these problems, which are critical for computer-aided verification, artificial intelligence, and electronic design automation. Additionally, his work encompasses **communication complexity**, analyzing the amount of communication required to solve distributed computational problems.

Beyond research, Scheder has contributed to higher education across multiple continents. He has served as a faculty member and researcher at **Shanghai Jiao Tong University** in China since September 2014. His academic trajectory includes affiliations with **Tsinghua University**, **Aarhus University** in Denmark, and **ETH Zurich** in Switzerland. He has also been associated with the **University of California, Berkeley**. His academic influence is tracked by various scholarly databases, including DBLP and zbMath, and he holds an Erdős number of 2, indicating a close collaborative distance to the mathematician Paul Erdős.

## FAQs

### Q: What is Dominik Scheder's primary research focus?
A: Dominik Scheder specializes in theoretical computer science, with a specific focus on the boolean satisfiability problem, algorithm development, and communication complexity.

### Q: Where did Dominik Scheder complete his doctoral studies?
A: He completed his Doctorate at ETH Zurich in Switzerland between 2005 and 2011. His doctoral advisor was the computer scientist Emo Welzl.

### Q: Which universities has Dominik Scheder been affiliated with?
A: Scheder has been affiliated with Shanghai Jiao Tong University, Tsinghua University, the University of California, Berkeley, Aarhus University, and ETH Zurich.

## Why They Matter
Dominik Scheder plays a significant role in the global academic community of theoretical computer science. His matter stems from his deep engagement with the boolean satisfiability problem, a central issue in computing that influences everything from cryptography to circuit design. By exploring the limits and capabilities of algorithms, his work helps define the boundaries of what computers can solve efficiently.

Furthermore, his career trajectory represents a vital link between European, American, and Asian academic institutions. Having studied in Germany, the USA, and Switzerland, and subsequently teaching in China, he exemplifies the international nature of modern scientific inquiry. His collaboration distance from Paul Erdős (Erdős number 2) places him within the inner circle of influential mathematical researchers, underscoring the relevance of his contributions to the broader mathematical and computer science community.

## Notable For
*   **Erdős Number 2:** Recognized for having a collaborative distance of two from the famous mathematician Paul Erdős.
*   **Expertise in SAT Solving:** Specialized in the boolean satisfiability problem, a critical area in complexity theory.
*   **Doctoral Advisor:** Studied under Emo Welzl, a renowned computer scientist and mathematician.
*   **International Academic Career:** Has held positions at top-tier universities in Europe, the USA, and China.

## Body

### Educational Background
Dominik Scheder pursued a rigorous academic path in computer science and mathematics. He began his studies at **Friedrich-Alexander-Universität Erlangen-Nürnberg** in 1999, completing that phase of his education in 2003. He subsequently moved to the United States to earn a **Master of Science in Computer Science** from the **University of Colorado Boulder**, which he completed in 2005.

He pursued his doctorate at **ETH Zurich** in Switzerland starting in 2005 and concluding in 2011. During this time, he conducted research under the guidance of **Emo Welzl**, a prominent figure in computational geometry and combinatorics.

### Academic Appointments
Following his doctorate, Scheder built an international academic portfolio. His curriculum vitae indicates associations with **Aarhus University** in Denmark and the **University of California, Berkeley** in the United States.

In September 2014, Scheder joined the faculty of **Shanghai Jiao Tong University (SJTU)** in China. He is also affiliated with **Tsinghua University**, a major research university in Beijing. His professional identifiers include a DBLP author ID (56/6665) and an zbMath author ID (scheder.dominik).

### Research and Publications
Scheder’s research interests lie at the intersection of mathematics and computer science. His key areas of inquiry include:
*   **Boolean Satisfiability Problem (SAT):** Investigating methods for determining if the variables of a Boolean formula can be assigned to make the formula true.
*   **Algorithms:** Designing and analyzing efficient procedures for calculation and data processing.
*   **Communication Complexity:** Studying the amount of communication needed for distributed systems to perform tasks.

He maintains a research website at `basics.sjtu.edu.cn/~dominik/`, which archives his publications and curriculum vitae.

## Schema Markup
```json
{
  "@context": "https://schema.org",
  "@type": "Person",
  "name": "Dominik Scheder",
  "alternateName": "Dominik Alban Scheder",
  "jobTitle": "University Teacher",
  "nationality": {
    "@type": "Country",
    "name": "Germany"
  },
  "alumniOf": [
    {
      "@type": "EducationalOrganization",
      "name": "ETH Zurich"
    },
    {
      "@type": "EducationalOrganization",
      "name": "University of Colorado Boulder"
    },
    {
      "@type": "EducationalOrganization",
      "name": "Friedrich-Alexander-Universität Erlangen-Nürnberg"
    }
  ],
  "worksFor": {
    "@type": "Organization",
    "name": "Shanghai Jiao Tong University"
  },
  "knowsAbout": [
    "Computer Science",
    "Boolean satisfiability problem",
    "Algorithm",
    "Communication complexity"
  ],
  "url": "http://basics.sjtu.edu.cn/~dominik/"
}

## References

1. [Source](https://basics.sjtu.edu.cn/~dominik/scheder-cv.pdf)
2. [Source](https://zbmath.org/collaboration-distance/?a=scheder.dominik&b=paul%20erd%C3%B6s)
3. Mathematics Genealogy Project