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.
Countries citing papers authored by Douglas R. Stinson
Since
Specialization
Citations
This map shows the geographic impact of Douglas R. Stinson'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 Douglas R. Stinson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Douglas R. Stinson more than expected).
Fields of papers citing papers by Douglas R. Stinson
This network shows the impact of papers produced by Douglas R. Stinson. 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 Douglas R. Stinson. The network helps show where Douglas R. Stinson may publish in the future.
Co-authorship network of co-authors of Douglas R. Stinson
This figure shows the co-authorship network connecting the top 25 collaborators of Douglas R. Stinson.
A scholar is included among the top collaborators of Douglas R. Stinson 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 Douglas R. Stinson. Douglas R. Stinson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Stinson, Douglas R., et al.. (2017). Computational results on invertible matrices with the maximum number of invertible 2×2 submatrices.. Australas. J Comb.. 69. 130–144.1 indexed citations
4.
Blackburn⋆, Simon R., Tuvi Etzion, Douglas R. Stinson, & Gregory M. Zaverucha. (2008). A bound on the size of separating hash families. Journal of Combinatorial Theory Series A. 115(7). 1246–1256.18 indexed citations
Dinitz, Jeffrey H., Alan C. H. Ling, & Douglas R. Stinson. (2007). Perfect hash families from transversal designs.. Australas. J Comb.. 37. 233–242.6 indexed citations
Stinson, Douglas R. & S.E. Tavares. (2000). Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography.6 indexed citations
10.
Rees, Rolf S., et al.. (1999). An application of covering designs: determining the maximum consistent set of shares in a threshold scheme.. Ars Combinatoria. 53.9 indexed citations
11.
Ateniese, Giuseppe, Carlo Blundo, Alfredo De Santis, & Douglas R. Stinson. (1996). Visual Cryptography for General Access Structures. Electronic colloquium on computational complexity. 3.11 indexed citations
12.
Stinson, Douglas R.. (1995). On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes. Electronic colloquium on computational complexity. 2.43 indexed citations
13.
Dinitz, Jeffrey H. & Douglas R. Stinson. (1992). Contemporary design theory : a collection of surveys. Wiley eBooks.346 indexed citations
14.
Stinson, Douglas R., et al.. (1991). On the existence of three MOLS with equal-sized holes.. Australas. J Comb.. 4. 33–48.12 indexed citations
15.
Kramer, Earl S., Spyros S. Magliveras, & Douglas R. Stinson. (1991). Some small large sets of t-designs.. Australas. J Comb.. 3. 191–206.14 indexed citations
16.
Stinson, Douglas R., et al.. (1990). Recent results on combinatorial constructions for threshold schemes.. Australas. J Comb.. 1. 29–48.23 indexed citations
Lindner, C.C. & Douglas R. Stinson. (1984). Steiner pentagon systems. Discrete Mathematics. 52(1). 67–74.42 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.