This map shows the geographic impact of R. Tijdeman'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 R. Tijdeman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites R. Tijdeman more than expected).
This network shows the impact of papers produced by R. Tijdeman. 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 R. Tijdeman. The network helps show where R. Tijdeman may publish in the future.
Co-authorship network of co-authors of R. Tijdeman
This figure shows the co-authorship network connecting the top 25 collaborators of R. Tijdeman.
A scholar is included among the top collaborators of R. Tijdeman 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 R. Tijdeman. R. Tijdeman is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Lint, J. H. van, R. Tijdeman, & Koninklijke Nederlandse Akademie van Wetenschappen. (1992). Cryptography and data protection : proceedings of a symposium at the Royal Netherlands Academy of Arts and Sciences on 19th December 1990. Data Archiving and Networked Services (DANS). 38.
8.
Tijdeman, R., et al.. (1990). Convergence properties of linear recurrence sequences. Leiden Repository (Leiden University). 4(4). 13–25.7 indexed citations
9.
Shorey, T. N. & R. Tijdeman. (1990). Perfect powers in products of terms in an arithmetical progression (II). Compositio Mathematica. 75(2). 119–136.24 indexed citations
10.
Tijdeman, R.. (1989). On the product of the terms of a finite arithmetic progression. Kyoto University Research Information Repository (Kyoto University). 708. 51–62.2 indexed citations
11.
Erdös, P., et al.. (1988). Some diophantine equations with many solutions. Compositio Mathematica. 66(1). 37–56.27 indexed citations
12.
Győry, Kálmán, C. L. Stewart, & R. Tijdeman. (1986). On prime factors of sums of integers I. Compositio Mathematica. 59(1). 81–88.11 indexed citations
13.
Beukers, Frits & R. Tijdeman. (1984). On the multiplicities of binary complex recurrences. Compositio Mathematica. 51(2). 193–213.11 indexed citations
14.
Lenstra, H. W. & R. Tijdeman. (1982). Computational methods in number theory.42 indexed citations
15.
Tijdeman, R. & Marc Voorhoeve. (1981). Bounded discrepancy sets. Compositio Mathematica. 42(3). 375–389.
Shorey, T. N. & R. Tijdeman. (1976). On the greatest prime factors of polynomials at integer points. Compositio Mathematica. 33(2). 187–195.5 indexed citations
18.
Tijdeman, R. & H.G. Meijer. (1974). On integers generated by a finite number of fixed primes. Compositio Mathematica. 29(3). 273–286.1 indexed citations
19.
Meijer, H.G. & R. Tijdeman. (1974). On additive functions. Compositio Mathematica. 29(3). 265–271.2 indexed citations
20.
Tijdeman, R.. (1973). On integers with many small prime factors. Compositio Mathematica. 26(3). 319–330.25 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.