Countries citing papers authored by Ludwig Staiger
Since
Specialization
Citations
This map shows the geographic impact of Ludwig Staiger'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 Ludwig Staiger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ludwig Staiger more than expected).
This network shows the impact of papers produced by Ludwig Staiger. 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 Ludwig Staiger. The network helps show where Ludwig Staiger may publish in the future.
Co-authorship network of co-authors of Ludwig Staiger
This figure shows the co-authorship network connecting the top 25 collaborators of Ludwig Staiger.
A scholar is included among the top collaborators of Ludwig Staiger 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 Ludwig Staiger. Ludwig Staiger 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.
Freund, Rudolf, et al.. (2016). Going Beyond Turing with P Automata: Regular Observer ω-Languages and Partial Adult Halting.. International journal of unconventional computing. 12. 51–69.1 indexed citations
2.
Staiger, Ludwig. (2016). Bounds on the Kolmogorov complexity function for infinite words (Rev1). ResearchSpace (University of Auckland). 23. 13.1 indexed citations
3.
Staiger, Ludwig. (2006). On Maximal Prefix Codes.. ResearchSpace (University of Auckland). 91. 205–207.1 indexed citations
4.
Calude, Cristian S., Ludwig Staiger, & Sebastiaan A. Terwijn. (2005). On partial randomness. Annals of Pure and Applied Logic. 138(1-3). 20–30.25 indexed citations
Jürgensen, Helmut & Ludwig Staiger. (1999). Finite automata : encoding geometric figures. publish.UP (University of Potsdam).1 indexed citations
9.
Staiger, Ludwig. (1998). The Hausdorff Measure of Regular Omega-Languages is Computable. ResearchSpace (University of Auckland). 66. 178–182.2 indexed citations
Staiger, Ludwig & Klaus W. Wagner. (1974). Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen.. Journal of automata, languages and combinatorics. 10. 379–392.26 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.