This map shows the geographic impact of Jan Flokstra'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 Jan Flokstra with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Flokstra more than expected).
This network shows the impact of papers produced by Jan Flokstra. 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 Jan Flokstra. The network helps show where Jan Flokstra may publish in the future.
Co-authorship network of co-authors of Jan Flokstra
This figure shows the co-authorship network connecting the top 25 collaborators of Jan Flokstra.
A scholar is included among the top collaborators of Jan Flokstra 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 Jan Flokstra. Jan Flokstra 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.
Bruijnes, Merijn, et al.. (2018). Flipper 2.0. University of Twente Research Information. 43–50.20 indexed citations
2.
Keulen, Maurice van, et al.. (2016). JudgeD: a probabilistic datalog with dependencies. University of Twente Research Information.2 indexed citations
Hiemstra, Djoerd, et al.. (2008). Sound Ranking algorithms for XML search. University of Twente Research Information. 15–21.3 indexed citations
6.
Hiemstra, Djoerd, et al.. (2006). PFTijah: text search in an XML database system. Radboud Repository (Radboud University). 12–17.34 indexed citations
7.
Keulen, Maurice van, et al.. (2002). Moa: extensibility and efficiency in querying nested data. Data Archiving and Networked Services (DANS). 1–31.3 indexed citations
8.
Wilschut, A.N., et al.. (1998). Road collapse in Magnum. University of Twente Research Information. 20–27.7 indexed citations
Wilschut, A.N., Jan Flokstra, & Peter M. G. Apers. (1995). Parallel evaluation of multi-join queries. University of Twente Research Information. 115–126.37 indexed citations
Flokstra, Jan, et al.. (1994). Object-Oriented Programming. Lecture notes in computer science.3 indexed citations
13.
Grefen, Paul & Jan Flokstra. (1994). Extending a multi-set relational algebra to a parallel environment. University of Twente Research Information. 94(50).1 indexed citations
14.
Flokstra, Jan, et al.. (1994). The IMPRESS DDT. University of Twente Research Information. 506–506.3 indexed citations
15.
Wilschut, A.N., Jan Flokstra, & Peter M. G. Apers. (1992). Parallelism in a Main-Memory DBMS: The Performance of PRISMA/DB. Very Large Data Bases. 521–532.36 indexed citations
Houtsma, M.A.W., A.N. Wilschut, & Jan Flokstra. (1992). Implementation and performance evaluation of a parallel transitive closure algorithm on PRISMA/DB. University of Twente Research Information. 92(45).12 indexed citations
18.
Wilschut, A.N., Jan Flokstra, & Peter M. G. Apers. (1992). Parallelism in a main-memory system: The performance of PRISMA/DB.. University of Twente Research Information. 92(45).3 indexed citations
19.
Grefen, Paul, A.N. Wilschut, & Jan Flokstra. (1991). PRISMA DB1 User manual. University of Twente Research Information. 1(6).2 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.