Andreas Goerdt
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 10%
- Computer Networks and Communications top 5%
- Discrete Mathematics and Combinatorics top 10%
- Signal Processing
- Co-authors
- Werner DammJon KleinbergEvgeny DantsinChristos H. PapadimitriouRavi KannanEdward HirschPrabhakar RaghavanUwe Schöning
- Topics
- Advanced Graph Theory Research (9 papers)Constraint Satisfaction and Optimization (8 papers)Logic, programming, and type systems (8 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Networks and Communications
- Journals
- SIAM Journal on ComputingTheoretical Computer ScienceJournal of Computer and System Sciences
- Partner nations
- GermanyUnited StatesPoland
In The Last Decade
Andreas Goerdt
22 papers receiving 341 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 309
- Artificial Intelligence 186
- Computer Networks and Communications 174
- Discrete Mathematics and Combinatorics 28
- Signal Processing 27
Countries citing papers authored by Andreas Goerdt
This map shows the geographic impact of Andreas Goerdt'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 Andreas Goerdt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andreas Goerdt more than expected).
Fields of papers citing papers by Andreas Goerdt
This network shows the impact of papers produced by Andreas Goerdt. 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 Andreas Goerdt. The network helps show where Andreas Goerdt may publish in the future.
Co-authorship network of co-authors of Andreas Goerdt
This figure shows the co-authorship network connecting the top 25 collaborators of Andreas Goerdt. A scholar is included among the top collaborators of Andreas Goerdt 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 Andreas Goerdt. Andreas Goerdt is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 9 | |
| 3 | 18 | |
| 4 | 14 | |
| 5 | 7 | |
| 6 | 6 | |
| 7 | 8 | |
| 8 | 78 | |
| 9 | Efficient recognition of random unsatisfiable k-SAT instances by spectral methods | 1 |
| 10 | 11 | |
| 11 | 5 | |
| 12 | 111 | |
| 13 | 17 | |
| 14 | 14 | |
| 15 | 15 | |
| 16 | 4 | |
| 17 | 12 | |
| 18 | 8 | |
| 19 | Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages | 2 |
| 20 | 32 |
About Andreas Goerdt
Andreas Goerdt is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Networks and Communications, having authored 23 papers that have together received 388 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (9 papers), Constraint Satisfaction and Optimization (8 papers) and Logic, programming, and type systems (8 papers). The work is most often cited by research in Computational Theory and Mathematics (309 citations), Discrete Mathematics and Combinatorics (28 citations) and Computer Networks and Communications (174 citations). Andreas Goerdt has collaborated with scholars based in Germany, United States and Poland. Frequent co-authors include Werner Damm, Jon Kleinberg, Evgeny Dantsin, Christos H. Papadimitriou, Ravi Kannan, Edward Hirsch, Prabhakar Raghavan, Uwe Schöning, Amin Coja‐Oghlan and Michael Krivelevich. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.
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.