Andreas Goerdt

1.4k total citations
23 papers, 388 citations indexed

About

Andreas Goerdt is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Andreas Goerdt has authored 23 papers receiving a total of 388 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 10 papers in Computer Networks and Communications. Recurrent topics in Andreas Goerdt's work include Advanced Graph Theory Research (9 papers), Constraint Satisfaction and Optimization (8 papers) and Logic, programming, and type systems (8 papers). Andreas Goerdt is often cited by papers focused on Advanced Graph Theory Research (9 papers), Constraint Satisfaction and Optimization (8 papers) and Logic, programming, and type systems (8 papers). Andreas Goerdt collaborates with scholars based in Germany, United States and Poland. Andreas Goerdt's 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 and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Andreas Goerdt

22 papers receiving 341 citations

Peers

Andreas Goerdt

CTM

AI

CNC

DMC

SP

Anuj Dawar United Kingdom

Richard Statman United States

Benjamin Rossman United States

Yechezkel Zalcstein United States

Jochen Alber Germany

Eugenio G. Omodeo Italy

Mark R. Brown United States

Robin A. Moser Switzerland

Stephan Kreutzer Germany

Andreĭ A. Bulatov Canada

Anuj Dawar United Kingdom

Andreas Goerdt

591 ×1.9

CTM

327 ×1.8

AI

119 ×0.7

CNC

62 ×2.2

DMC

25 ×0.9

SP

Citations per year, relative to Andreas Goerdt Andreas Goerdt (= 1×) peers Anuj Dawar

Countries citing papers authored by Andreas Goerdt

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

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

20 of 20 papers shown

1.

Goerdt, Andreas. (2010). On Random Betweenness Constraints. Combinatorics Probability Computing. 19(5-6). 775–790. 1 indexed citations

2.

Coja‐Oghlan, Amin, et al.. (2006). Strong Refutation Heuristics for Random k-SAT. Combinatorics Probability Computing. 16(1). 5–28. 9 indexed citations

3.

Friedman, Joel, Andreas Goerdt, & Michael Krivelevich. (2005). Recognizing More Unsatisfiable Random k-SAT Instances Efficiently. SIAM Journal on Computing. 35(2). 408–430. 18 indexed citations

4.

Coja‐Oghlan, Amin, et al.. (2004). Techniques from combinatorial approximation algorithms yield efficient algorithms for random2k-SAT. Theoretical Computer Science. 329(1-3). 1–45. 14 indexed citations

5.

Goerdt, Andreas, et al.. (2004). An approximation hardness result for bipartite Clique. Electronic colloquium on computational complexity. 25(4). 192–6. 7 indexed citations

6.

Goerdt, Andreas, et al.. (2003). Analysis of edge deletion processes on faulty random regular graphs. Theoretical Computer Science. 297(1-3). 241–260. 6 indexed citations

7.

Goerdt, Andreas, et al.. (2003). Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures. Combinatorics Probability Computing. 12(3). 245–267. 8 indexed citations

8.

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

9.

Goerdt, Andreas & Michael Krivelevich. (2001). Efficient recognition of random unsatisfiable k-SAT instances by spectral methods. 1 indexed citations

10.

Goerdt, Andreas. (2001). The giant component threshold for random regular graphs with edge faults H. Prodinger. Theoretical Computer Science. 259(1-2). 307–321. 11 indexed citations

11.

Goerdt, Andreas. (1999). A remark on random 2-SAT. Discrete Applied Mathematics. 96-97. 107–110. 5 indexed citations

12.

Goerdt, Andreas. (1996). A Threshold for Unsatisfiability. Journal of Computer and System Sciences. 53(3). 469–486. 111 indexed citations

13.

Goerdt, Andreas. (1993). Regular Resolution Versus Unrestricted Resolution. SIAM Journal on Computing. 22(4). 661–683. 17 indexed citations

14.

Goerdt, Andreas. (1992). Characterizing complexity classes by higher type primitive recursive definitions. Theoretical Computer Science. 100(1). 45–66. 14 indexed citations

15.

Goerdt, Andreas. (1992). Unrestricted resolution versus N-resolution. Theoretical Computer Science. 93(1). 159–167. 15 indexed citations

16.

Goerdt, Andreas. (1992). Characterizing complexity classes by general recursive definitions in higher types. Information and Computation. 101(2). 202–218. 4 indexed citations

17.

Goerdt, Andreas. (1992). Davis-Putnam resolution versus unrestricted resolution. Annals of Mathematics and Artificial Intelligence. 6(1-3). 169–184. 12 indexed citations

18.

Goerdt, Andreas & Helmut Seidl. (1990). Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, Part II. Mini-Reviews in Medicinal Chemistry. 15(9). 148–158. 8 indexed citations

19.

Goerdt, Andreas. (1987). Hoare Logic for Lambda-Terms as Basis of Hoare Logic for Imperative Languages. 293–299. 2 indexed citations

20.

Damm, Werner & Andreas Goerdt. (1986). An automata-theoretical characterization of the OI-hierarchy. Information and Control. 71(1-2). 1–32. 32 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