Thomas Thierauf
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 10%
- Computer Networks and Communications
- Electrical and Electronic Engineering
- Atomic and Molecular Physics, and Optics
- Co-authors
- Lane A. HemaspaandraHarry BuhrmanLance FortnowStephen FennerManindra AgrawalPrajakta NimbhorkarSamir DattaAlan L. Selman
- Topics
- Complexity and Algorithms in Graphs (36 papers)Advanced Graph Theory Research (21 papers)Machine Learning and Algorithms (9 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Partner nations
- GermanyUnited StatesIndia
In The Last Decade
Thomas Thierauf
47 papers receiving 283 citations
Peers
Comparison fields: 5 of 32
- Computational Theory and Mathematics 281
- Artificial Intelligence 190
- Computer Networks and Communications 48
- Electrical and Electronic Engineering 25
- Atomic and Molecular Physics, and Optics 16
Countries citing papers authored by Thomas Thierauf
This map shows the geographic impact of Thomas Thierauf'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 Thomas Thierauf with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Thierauf more than expected).
Fields of papers citing papers by Thomas Thierauf
This network shows the impact of papers produced by Thomas Thierauf. 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 Thomas Thierauf. The network helps show where Thomas Thierauf may publish in the future.
Co-authorship network of co-authors of Thomas Thierauf
This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Thierauf. A scholar is included among the top collaborators of Thomas Thierauf 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 Thomas Thierauf. Thomas Thierauf is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 3 | |
| 4 | 4 | |
| 5 | Reachability in K {3, 3} -free and K 5 -free Graphs is in Unambiguous Logspace. | 2 |
| 6 | Deterministic Identity Testing for Sum of Read Once ABPs | 1 |
| 7 | Graph Isomorphism for K {3, 3} -free and K 5 -free graphs is in Log-space. | 4 |
| 8 | Reachability in K_{3, 3}-free Graphs and K_5-free Graphs is in Unambiguous Log-Space. | 3 |
| 9 | On the bipartite unique perfect matching problem | 0 |
| 10 | On Closure Properties of GapL | 1 |
| 11 | 6 | |
| 12 | 11 | |
| 13 | 16 | |
| 14 | Complements of Multivalued Functions. | 10 |
| 15 | 1 | |
| 16 | The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits. | 8 |
| 17 | Modulo Information from Nonadaptive Queries to NP | 1 |
| 18 | The Boolean Isomorphism Problem | 2 |
| 19 | 5 | |
| 20 | On closure properties of #P in the context of PF ○ #P | 1 |
About Thomas Thierauf
Thomas Thierauf is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Artificial Intelligence, having authored 51 papers that have together received 327 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (36 papers), Advanced Graph Theory Research (21 papers) and Machine Learning and Algorithms (9 papers). The work is most often cited by research in Computational Theory and Mathematics (281 citations), Artificial Intelligence (190 citations) and Discrete Mathematics and Combinatorics (10 citations). Thomas Thierauf has collaborated with scholars based in Germany, United States and India. Frequent co-authors include Lane A. Hemaspaandra, Harry Buhrman, Lance Fortnow, Stephen Fenner, Manindra Agrawal, Prajakta Nimbhorkar, Samir Datta, Alan L. Selman, Nutan Limaye and Johannes Köbler. Their work appears in journals such as Communications of the ACM, SIAM Journal on Computing and Theoretical Computer Science.
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.