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 Jeffrey Shallit
Since
Specialization
Citations
This map shows the geographic impact of Jeffrey Shallit'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 Jeffrey Shallit with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeffrey Shallit more than expected).
This network shows the impact of papers produced by Jeffrey Shallit. 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 Jeffrey Shallit. The network helps show where Jeffrey Shallit may publish in the future.
Co-authorship network of co-authors of Jeffrey Shallit
This figure shows the co-authorship network connecting the top 25 collaborators of Jeffrey Shallit.
A scholar is included among the top collaborators of Jeffrey Shallit 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 Jeffrey Shallit. Jeffrey Shallit is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Shallit, Jeffrey, et al.. (2015). Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015 Waterloo, ON, Canada, June 25-27, 2015 : proceedings. Springer eBooks.1 indexed citations
Shallit, Jeffrey. (2011). Why Us? How Science Rediscovered the Mystery of Ourselves • James Le Fanu. 31(6).1 indexed citations
12.
Rampersad, Narad, Jeffrey Shallit, & Arseny M. Shur. (2011). Fife's Theorem for (7/3)-Powers. SHILAP Revista de lepidopterología. 63. 189–198.1 indexed citations
13.
Shallit, Jeffrey, et al.. (2008). The Frobenius Problem in a Free Monoid. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 432.4 indexed citations
14.
Shallit, Jeffrey. (2006). New Directions in State Complexity.. 41–45.1 indexed citations
Shallit, Jeffrey, et al.. (1999). An efficient algorithm for computing the i th letter of 4 n a. Symposium on Discrete Algorithms. 768–775.1 indexed citations
Shallit, Jeffrey & David A. Wilson. (1992). The "3x + 1" Problem and Finite Automata.. Bulletin of the European Association for Theoretical Computer Science. 46. 182–185.3 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.