Gerd Wechsung

922 total citations
34 papers, 368 citations indexed

About

Gerd Wechsung is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Gerd Wechsung has authored 34 papers receiving a total of 368 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 10 papers in Artificial Intelligence and 4 papers in Computer Networks and Communications. Recurrent topics in Gerd Wechsung's work include Complexity and Algorithms in Graphs (14 papers), Computability, Logic, AI Algorithms (11 papers) and Formal Methods in Verification (9 papers). Gerd Wechsung is often cited by papers focused on Complexity and Algorithms in Graphs (14 papers), Computability, Logic, AI Algorithms (11 papers) and Formal Methods in Verification (9 papers). Gerd Wechsung collaborates with scholars based in Germany, United States and France. Gerd Wechsung's co-authors include Lane A. Hemachandra, Jin‐Yi Cai, Vivian Sewelson, Klaus W. Wagner, Juris Hartmanis, Lane A. Hemaspaandra, Edith Hemaspaandra, Richard Beigel, Burkhard Monien and Walter Unger and has published in prestigious journals such as Annals of Surgical Oncology, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Gerd Wechsung

29 papers receiving 321 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Gerd Wechsung Germany	10	308	164	72	32	16	34	368
Andreas Goerdt Germany	11	309 1.0×	186 1.1×	174 2.4×	7 0.2×	11 0.7×	23	388
Sebastian Ordyniak Austria	11	208 0.7×	190 1.2×	96 1.3×	13 0.4×	13 0.8×	73	364
Robin A. Moser Switzerland	4	191 0.6×	78 0.5×	55 0.8×	21 0.7×	23 1.4×	5	259
Dieter van Melkebeek United States	11	417 1.4×	245 1.5×	68 0.9×	28 0.9×	8 0.5×	47	451
Celia Wrathall United States	9	388 1.3×	269 1.6×	37 0.5×	17 0.5×	47 2.9×	19	450
Gwenaël Joret Belgium	10	182 0.6×	37 0.2×	47 0.7×	26 0.8×	38 2.4×	55	242
Yushi Uno Japan	8	188 0.6×	38 0.2×	70 1.0×	52 1.6×	13 0.8×	39	246
Damian Niwiński Poland	12	311 1.0×	264 1.6×	45 0.6×	6 0.2×	26 1.6×	36	374
Jesper Nederlof Netherlands	9	337 1.1×	71 0.4×	132 1.8×	48 1.5×	14 0.9×	35	373
Garth Isaak United States	11	216 0.7×	38 0.2×	43 0.6×	45 1.4×	56 3.5×	31	305

Countries citing papers authored by Gerd Wechsung

Since Specialization

Citations

This map shows the geographic impact of Gerd Wechsung'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 Gerd Wechsung with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gerd Wechsung more than expected).

Fields of papers citing papers by Gerd Wechsung

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gerd Wechsung. 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 Gerd Wechsung. The network helps show where Gerd Wechsung may publish in the future.

Co-authorship network of co-authors of Gerd Wechsung

This figure shows the co-authorship network connecting the top 25 collaborators of Gerd Wechsung. A scholar is included among the top collaborators of Gerd Wechsung 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 Gerd Wechsung. Gerd Wechsung 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.

Glaßer, Christian & Gerd Wechsung. (2020). Relativizing Function Classes. Zenodo (CERN European Organization for Nuclear Research). 9. 34–50.

2.

Beigel, Richard, Lane A. Hemachandra, & Gerd Wechsung. (2003). On the power of probabilistic polynomial time: P/sup NP(log)/ contained in PP. 225–227. 2 indexed citations

3.

Hemaspaandra, Lane A., Mitsunori Ogihara, & Gerd Wechsung. (2002). Reducing the Number of Solutions of NP Functions. Journal of Computer and System Sciences. 64(2). 311–328. 6 indexed citations

4.

Hemaspaandra, Edith & Gerd Wechsung. (2002). The Minimization Problem for Boolean Formulas. SIAM Journal on Computing. 31(6). 1948–1958. 9 indexed citations

5.

Wechsung, Gerd. (2000). Vorlesungen zur Komplexitätstheorie.

6.

Cai, Jin‐Yi, Lane A. Hemaspaandra, & Gerd Wechsung. (1999). Robust Reductions. arXiv (Cornell University). 2 indexed citations

7.

Cai, Jin‐Yi, Lane A. Hemaspaandra, & Gerd Wechsung. (1998). Robust Reductions. 174–183. 2 indexed citations

8.

Monien, Burkhard, et al.. (1998). Embedding ladders and caterpillars into the hypercube. Discrete Applied Mathematics. 83(1-3). 21–29. 32 indexed citations

9.

Wechsung, Gerd, et al.. (1997). Time Bounded Frequency Computations. Information and Computation. 139(2). 234–257. 3 indexed citations

10.

Hemaspaandra, Lane A., et al.. (1997). Easy sets and hard certificate schemes. Acta Informatica. 34(11). 859–879. 15 indexed citations

11.

Hemaspaandra, Lane A., et al.. (1995). Query Order and Self-Specifying Machines. Annals of Surgical Oncology. 3 indexed citations

12.

Hemachandra, Lane A. & Gerd Wechsung. (1991). Kolmogorov characterizations of complexity classes. Theoretical Computer Science. 83(2). 313–322. 6 indexed citations

13.

Beigel, Richard, Lane A. Hemachandra, & Gerd Wechsung. (1989). On the Power of Probabilistic Polynomial Time: P NP[log] subseteq PP.. 225–227. 3 indexed citations

14.

Hemachandra, Lane A. & Gerd Wechsung. (1989). Using Randomness to Characterize the Complexity of Computation. UR Research (University of Rochester). 281–286. 3 indexed citations

15.

Wechsung, Gerd, et al.. (1987). Counting classes with finite acceptance types. Computing and Informatics / Computers and Artificial Intelligence. 6(5). 395–409. 13 indexed citations

16.

Wechsung, Gerd. (1984). Frege conference 1984 : proceedings of the international conference held at Schwerin(GDR), September 10-14, 1984. Akademie Verlag eBooks. 1 indexed citations

17.

Wechsung, Gerd. (1980). A Note on the Return Complexity.. Journal of automata, languages and combinatorics. 16(19). 139–146. 2 indexed citations

18.

Wechsung, Gerd & Andreas Brandstädt. (1979). A relation between space, return and dual return complexities. Theoretical Computer Science. 9(1). 127–140. 6 indexed citations

19.

Wechsung, Gerd. (1979). The oscillation complexity and a hierarchy of context-free languages.. 3(24). 508–515. 3 indexed citations

20.

Wechsung, Gerd. (1975). Minimale und optimale Blumsche Maße.. Journal of automata, languages and combinatorics. 11. 673–679.

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