Viliam Geffert

1.0k total citations
46 papers, 350 citations indexed

About

Viliam Geffert is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Viliam Geffert has authored 46 papers receiving a total of 350 indexed citations (citations by other indexed papers that have themselves been cited), including 40 papers in Computational Theory and Mathematics, 36 papers in Artificial Intelligence and 16 papers in Molecular Biology. Recurrent topics in Viliam Geffert's work include semigroups and automata theory (37 papers), Algorithms and Data Compression (19 papers) and DNA and Biological Computing (15 papers). Viliam Geffert is often cited by papers focused on semigroups and automata theory (37 papers), Algorithms and Data Compression (19 papers) and DNA and Biological Computing (15 papers). Viliam Geffert collaborates with scholars based in Slovakia, Italy and Denmark. Viliam Geffert's co-authors include Carlo Mereghetti, Giovanni Pighizzini, Beatrice Palano, Jyrki Katajainen, A Min Tjoa, Kurt Mehlhorn and Helmut Alt and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Viliam Geffert

36 papers receiving 316 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Viliam Geffert Slovakia 11 298 251 173 17 13 46 350
Dora Giammarresi Italy 10 206 0.7× 177 0.7× 197 1.1× 25 1.5× 16 1.2× 27 290
Stavros Konstantinidis Canada 11 165 0.6× 163 0.6× 231 1.3× 10 0.6× 12 0.9× 49 298
Alexander Meduna Czechia 11 386 1.3× 360 1.4× 364 2.1× 15 0.9× 19 1.5× 101 456
Marcin Kubica Poland 7 90 0.3× 137 0.5× 57 0.3× 20 1.2× 2 0.2× 17 176
Yves Métivier France 12 242 0.8× 125 0.5× 50 0.3× 133 7.8× 12 0.9× 36 332
Luc Boasson France 12 469 1.6× 360 1.4× 154 0.9× 20 1.2× 6 0.5× 46 526
Tomasz Kociumaka Poland 9 113 0.4× 155 0.6× 77 0.4× 42 2.5× 54 224
Christian Choffrut France 12 352 1.2× 237 0.9× 115 0.7× 37 2.2× 5 0.4× 59 400
Noa Lewenstein Israel 7 72 0.2× 132 0.5× 83 0.5× 8 0.5× 2 0.2× 14 152
D. Liu United States 2 68 0.2× 131 0.5× 55 0.3× 27 1.6× 2 0.2× 4 153

Countries citing papers authored by Viliam Geffert

Since Specialization
Citations

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

Fields of papers citing papers by Viliam Geffert

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Viliam Geffert

This figure shows the co-authorship network connecting the top 25 collaborators of Viliam Geffert. A scholar is included among the top collaborators of Viliam Geffert 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 Viliam Geffert. Viliam Geffert 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.
Geffert, Viliam. (2017). Alternating space is closed under complement and other simulations for sublogarithmic space. Information and Computation. 253. 163–178. 1 indexed citations
2.
Geffert, Viliam, et al.. (2016). Two double-exponential gaps for automata with a limited pushdown. Information and Computation. 253. 381–398. 1 indexed citations
3.
Geffert, Viliam, et al.. (2014). Two-way automata making choices only at the endmarkers. Information and Computation. 239. 71–86. 2 indexed citations
4.
Geffert, Viliam. (2012). An alternating hierarchy for finite automata. Theoretical Computer Science. 445. 1–24. 7 indexed citations
5.
Geffert, Viliam & Giovanni Pighizzini. (2011). Two-way unary automata versus logarithmic space. Information and Computation. 209(7). 1016–1025. 11 indexed citations
6.
Geffert, Viliam. (2009). Translation from Classical Two-Way Automata to Pebble Two-Way Automata.
7.
Geffert, Viliam, et al.. (2008). Multiway blockwise in-place merging..
8.
Geffert, Viliam. (2007). Magic numbers in the state hierarchy of finite automata. Information and Computation. 205(11). 1652–1670. 20 indexed citations
9.
Geffert, Viliam, Carlo Mereghetti, & Giovanni Pighizzini. (2007). Complementing two-way finite automata. Information and Computation. 205(8). 1173–1187. 26 indexed citations
10.
Geffert, Viliam. (2005). (Non)determinism and the Size of One-Way Finite Automata.. 23–37. 4 indexed citations
11.
Geffert, Viliam. (2003). Space hierarchy theorem revised. Theoretical Computer Science. 295(1-3). 171–187. 7 indexed citations
12.
Geffert, Viliam, Carlo Mereghetti, & Giovanni Pighizzini. (2003). Converting two-way nondeterministic unary automata into simpler automata. Theoretical Computer Science. 295(1-3). 189–203. 31 indexed citations
13.
Geffert, Viliam. (2003). Translation of binary regular expressions into nondeterministic ε-free automata with O(nlogn) transitions. Journal of Computer and System Sciences. 66(3). 451–472. 8 indexed citations
14.
Geffert, Viliam. (2000). A variant of inductive counting. Theoretical Computer Science. 237(1-2). 465–475.
15.
Geffert, Viliam, et al.. (2000). Asymptotically efficient in-place merging. Theoretical Computer Science. 237(1-2). 159–181. 17 indexed citations
16.
Geffert, Viliam. (1998). A communication hierarchy of parallel computations. Theoretical Computer Science. 198(1-2). 99–130.
17.
Geffert, Viliam. (1998). Bridging across the log(n) Space Frontier. Information and Computation. 142(2). 127–158. 9 indexed citations
18.
Geffert, Viliam. (1993). Sublogarithmic $\sum _2$-space is not closed under complement and other separation results. RAIRO - Theoretical Informatics and Applications. 27(4). 349–366. 4 indexed citations
19.
Geffert, Viliam. (1991). How to Generate Languages Using Only Two Pairs of Parentheses.. Journal of automata, languages and combinatorics. 27. 303–315. 7 indexed citations
20.
Geffert, Viliam. (1988). A representation of recursively enumerable languages by two homomorphisms and a quotient. Theoretical Computer Science. 62(3). 235–249. 5 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

Breakdown of academic impact, for papers by Dora Giammarresi Breakdown of academic impact, for papers by Stavros Konstantinidis Breakdown of academic impact, for papers by Alexander Meduna Breakdown of academic impact, for papers by Marcin Kubica Breakdown of academic impact, for papers by Yves Métivier Breakdown of academic impact, for papers by Luc Boasson Breakdown of academic impact, for papers by Tomasz Kociumaka Breakdown of academic impact, for papers by Christian Choffrut Breakdown of academic impact, for papers by Noa Lewenstein Breakdown of academic impact, for papers by D. Liu
Rankless by CCL
2026