This map shows the geographic impact of J.A. Bergstra'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 J.A. Bergstra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites J.A. Bergstra more than expected).
This network shows the impact of papers produced by J.A. Bergstra. 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 J.A. Bergstra. The network helps show where J.A. Bergstra may publish in the future.
Co-authorship network of co-authors of J.A. Bergstra
This figure shows the co-authorship network connecting the top 25 collaborators of J.A. Bergstra.
A scholar is included among the top collaborators of J.A. Bergstra 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 J.A. Bergstra. J.A. Bergstra is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bergstra, J.A. & C.A. Middelburg. (2006). Synchronous Cooperation for Explicit Multi-Threading. Data Archiving and Networked Services (DANS).5 indexed citations
11.
Bergstra, J.A. & Alban Ponse. (2004). Execution Architectures for Program Algebra. UvA-DARE (University of Amsterdam).1 indexed citations
12.
Bergstra, J.A., et al.. (1996). Sequential Data Algebra Primitives. UvA-DARE (University of Amsterdam).1 indexed citations
13.
Bergstra, J.A., J. C. M. Baeten, & Roland Bol. (1994). A real time process logic. Data Archiving and Networked Services (DANS).1 indexed citations
14.
Bergstra, J.A. & John V. Tucker. (1993). On bounds for the specification of finite data types of means of equations and conditional equations. John Wiley & Sons, Inc. eBooks. 103–122.
15.
Bergstra, J.A. & J. C. M. Baeten. (1992). Asynchronous communication in real space process algebra. Utrecht University Repository (Utrecht University).5 indexed citations
16.
Bergstra, J.A. & Jan Willem Klop. (1992). An introduction to process algebra. Utrecht University Repository (Utrecht University). 1–21.1 indexed citations
17.
Bergstra, J.A. & J. C. M. Baeten. (1990). Process algebra with a zero object. Utrecht University Repository (Utrecht University).15 indexed citations
18.
Bergstra, J.A. & Jan Willem Klop. (1983). An algebraic specification method for processes over a finite action set. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–13.1 indexed citations
19.
Bergstra, J.A. & J-J.Ch. Meyer. (1982). Equational specifications of finite minimal unoids, using unary hidden functions only. Utrecht University Repository (Utrecht University).2 indexed citations
20.
Bergstra, J.A., et al.. (1982). Hoare's logic is incomplete when it does not have to be. Lecture notes in computer science. 131. 9–23.1 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.