Alfons Geser

629 total citations
25 papers, 203 citations indexed

About

Alfons Geser is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Aerospace Engineering. According to data from OpenAlex, Alfons Geser has authored 25 papers receiving a total of 203 indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Artificial Intelligence, 15 papers in Computational Theory and Mathematics and 5 papers in Aerospace Engineering. Recurrent topics in Alfons Geser's work include semigroups and automata theory (13 papers), Logic, programming, and type systems (12 papers) and Natural Language Processing Techniques (10 papers). Alfons Geser is often cited by papers focused on semigroups and automata theory (13 papers), Logic, programming, and type systems (12 papers) and Natural Language Processing Techniques (10 papers). Alfons Geser collaborates with scholars based in Germany, United States and Netherlands. Alfons Geser's co-authors include Hans Zantema, Gilles Dowek, Johannes Waldmann, Dieter Hofbauer, César Muñoz, Sergei Gorlatch, Ricky W. Butler, Aart Middeldorp, Enno Ohlebusch and Florent Kirchner and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Lecture notes in computer science.

In The Last Decade

Alfons Geser

24 papers receiving 181 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Alfons Geser Germany 8 124 100 63 26 19 25 203
Gabriele Fici Italy 9 143 1.2× 136 1.4× 24 0.4× 3 0.1× 22 1.2× 49 226
Nils Quetschlich Germany 7 130 1.0× 37 0.4× 2 0.0× 56 2.2× 17 0.9× 14 198
Kui Wang China 6 23 0.2× 9 0.1× 11 0.2× 3 0.1× 9 0.5× 18 95
Bettina Könighofer Austria 7 72 0.6× 68 0.7× 1 0.0× 10 0.4× 15 0.8× 15 134
Eiji Miyano Japan 8 36 0.3× 113 1.1× 3 0.0× 3 0.1× 6 0.3× 47 184
Kavosh Asadi United States 5 192 1.5× 11 0.1× 3 0.0× 4 0.2× 4 0.2× 8 215
Olivier Blazy France 7 117 0.9× 11 0.1× 13 0.2× 1 0.0× 6 0.3× 23 171
Jara Uitto Switzerland 7 52 0.4× 113 1.1× 1 0.0× 4 0.2× 12 0.6× 20 151
Karol Suchan Chile 7 26 0.2× 103 1.0× 5 0.1× 4 0.2× 2 0.1× 28 141
Gabriel Tanase United States 7 54 0.4× 11 0.1× 17 0.3× 2 0.1× 143 7.5× 15 211

Countries citing papers authored by Alfons Geser

Since Specialization
Citations

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

Fields of papers citing papers by Alfons Geser

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Alfons Geser

This figure shows the co-authorship network connecting the top 25 collaborators of Alfons Geser. A scholar is included among the top collaborators of Alfons Geser 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 Alfons Geser. Alfons Geser is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Geser, Alfons & Paul S. Miner. (2013). A New On-Line Diagnosis Protocol for the Spider Family of Byzantine Fault Tolerant Architectures. NASA Technical Reports Server (NASA). 2 indexed citations
2.
Butler, Ricky W., et al.. (2013). Formal Verification of a Conflict Resolution and Recovery Algorithm. 4 indexed citations
3.
Geser, Alfons, Dieter Hofbauer, Johannes Waldmann, & Hans Zantema. (2007). On tree automata that certify termination of left-linear term rewriting systems. Information and Computation. 205(4). 512–534. 14 indexed citations
4.
Geser, Alfons, Dieter Hofbauer, & Johannes Waldmann. (2005). Deciding Termination for Ancestor Match- Bounded String Rewriting Systems. NASA Technical Reports Server (NASA). 2 indexed citations
5.
Geser, Alfons, Dieter Hofbauer, Johannes Waldmann, & Hans Zantema. (2005). FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS. International Journal of Foundations of Computer Science. 16(3). 471–486. 3 indexed citations
6.
Butler, Ricky W., et al.. (2004). Formal analysis of air traffic management systems: the case of conflict resolution and recovery. 7. 906–914. 6 indexed citations
7.
Geser, Alfons, Dieter Hofbauer, Johannes Waldmann, & Hans Zantema. (2004). Tree automata that certify termination of term rewriting systems. TU/e Research Portal (Eindhoven University of Technology). 14–17. 1 indexed citations
8.
Geser, Alfons & César Muñoz. (2003). A geometric approach to strategic conflict detection and resolution [ATC]. 1. 6B1–1. 19 indexed citations
9.
Geser, Alfons. (2003). Termination of String Rewriting Rules That Have One Pair of Overlaps. Lecture notes in computer science. 410–423. 1 indexed citations
10.
Geser, Alfons, Aart Middeldorp, Enno Ohlebusch, & Hans Zantema. (2002). Relative Undecidability in Term RewritingI. The Termination Hierarchy. Information and Computation. 178(1). 101–131. 4 indexed citations
11.
Geser, Alfons, Aart Middeldorp, Enno Ohlebusch, & Hans Zantema. (2002). Relative Undecidability in Term RewritingII. The Confluence Hierarchy. Information and Computation. 178(1). 132–148. 4 indexed citations
12.
Geser, Alfons, Aart Middeldorp, Enno Ohlebusch, & Hans Zantema. (2002). Relative Undecidability in Term Rewriting. Information and Computation. 178(1). 132–148. 3 indexed citations
13.
Geser, Alfons, Aart Middeldorp, Enno Ohlebusch, & Hans Zantema. (2002). Relative Undecidability in Term Rewriting. Information and Computation. 178(1). 101–131. 1 indexed citations
14.
Geser, Alfons, César Muñoz, Gilles Dowek, & Florent Kirchner. (2002). Air Traffic Conflict Resolution and Recovery. Defense Technical Information Center (DTIC). 7 indexed citations
15.
Zantema, Hans & Alfons Geser. (2000). A Complete Characterization of Termination of 0 p 1 q → 1 r 0 s. Applicable Algebra in Engineering Communication and Computing. 11(1). 1–25. 8 indexed citations
16.
Geser, Alfons & Hans Zantema. (1999). Non-Looping String Rewriting. RAIRO - Theoretical Informatics and Applications. 33(3). 279–301. 11 indexed citations
17.
Geser, Alfons & Sergei Gorlatch. (1999). Parallelizing functional programs by generalization. Journal of Functional Programming. 9(6). 649–673. 21 indexed citations
18.
Geser, Alfons. (1997). Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems. Journal of Symbolic Computation. 23(4). 399–411. 4 indexed citations
19.
Geser, Alfons. (1996). An Improved General Path Order. Applicable Algebra in Engineering Communication and Computing. 7(6). 469–511. 5 indexed citations
20.
Zantema, Hans & Alfons Geser. (1996). Non-looping rewriting. Data Archiving and Networked Services (DANS). 9603(1-2). 85–103. 4 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

Rankless by CCL
2026