Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Egon Börger'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 Egon Börger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Egon Börger more than expected).
This network shows the impact of papers produced by Egon Börger. 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 Egon Börger. The network helps show where Egon Börger may publish in the future.
Co-authorship network of co-authors of Egon Börger
This figure shows the co-authorship network connecting the top 25 collaborators of Egon Börger.
A scholar is included among the top collaborators of Egon Börger 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 Egon Börger. Egon Börger is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Börger, Egon, et al.. (2008). Abstract State Machines, B and Z - First International Conference ABZ 2008. ePrints Soton (University of Southampton).2 indexed citations
Börger, Egon & Diego Sona. (2001). A Neural Abstract Machine. Zenodo (CERN European Organization for Nuclear Research).4 indexed citations
6.
Stärk, Robert F., Egon Börger, & Joachim Schmid. (2001). Java and the Java Virtual Machine: Definition, Verification, Validation with Cdrom. Springer eBooks.77 indexed citations
7.
Börger, Egon & Reinhard Gotzhein. (2000). Requirements Engineering - The Light Control Case Study.. JUCS - Journal of Universal Computer Science. 6. 580–581.4 indexed citations
8.
Börger, Egon & James Huggins. (1998). Abstract State Machines 1988-1998: Commented ASM Bibliography. Bulletin of the European Association for Theoretical Computer Science. 64.17 indexed citations
9.
Börger, Egon. (1997). JUCS Special ASM Issue, Part II - Introduction.. JUCS - Journal of Universal Computer Science. 3. 414–415.1 indexed citations
Rosenzweig, Dean, et al.. (1995). The bakery algorithm: yet another specification and verification. Oxford University Press eBooks. 231–243.19 indexed citations
12.
Börger, Egon. (1995). Specification and validation methods. Oxford University Press eBooks. 1–460.139 indexed citations
13.
Börger, Egon, Igor Đurđanović, & Dean Rosenzweig. (1994). Occam: Specification and Compiler Correctness - Part I: The Primary Model. 489–508.7 indexed citations
14.
Börger, Egon, et al.. (1994). Towards A Mathematical Specification of the APE100 Architecture:the APESE Model. IFIP Congress. 396–401.4 indexed citations
15.
Börger, Egon, Francisco J. López-Fraguas, & Mario Rodríguez-Artalejo. (1994). A Model for Mathematical Analysis of Functional Logic Programs and Their Implementations.. IFIP Congress. 410–415.5 indexed citations
16.
Börger, Egon, et al.. (1994). A Formal Specification of the PVM Architecture. CINECA IRIS Institutial research information system (University of Pisa). 402–409.3 indexed citations
17.
Börger, Egon. (1994). Logic Programming: The Evolving Algebra Approach.. CINECA IRIS Institutial research information system (University of Pisa). 391–395.8 indexed citations
Börger, Egon & Elvinia Riccobene. (1993). A formal specification of PARLOG. CINECA IRIS Institutial research information system (University of Pisa). 1–42.4 indexed citations
20.
Börger, Egon & Dean Rosenzweig. (1993). Full Prolog in a nutshell. International Conference on Logic Programming. 832.
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.