Jeffrey Shallit

6.4k citations
199 papers · 2.4k indexed · 1 hit paper · h-index 22

Jeffrey Shallit

179 papers receiving 2.2k citations

Hit Papers

Automatic Sequences: Theory, Applications, Generalizations4392003202620102018100200300400

Peers

Jeffrey Shallit
Comparison fields: 5 of 85
  • Computational Theory and Mathematics 1.8k
  • Discrete Mathematics and Combinatorics 250
  • Algebra and Number Theory 334
  • Theoretical Computer Science 66
  • Mathematical Physics 522
Replace Jean‐Paul Allouche with:
Jean‐Paul Allouche France
Aviezri S. Fraenkel Israel
Helmut Prodinger South Africa
Robert F. Tichy Austria
Andreas Blass United States
Fred Richman United States
Bruno Salvy France
H. Jerome Keisler United States
Maurice Mignotte France
Rudolf Lidl Australia
Jeffrey Shallit relative to Jean‐Paul Allouche France Jean‐Paul Allouche's profile →
Citations per field
00.5×1.5×1.8×
Jean‐Paul Allouche · 1×
Citations per year

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).

Fields of papers citing papers by Jeffrey Shallit

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

The 25 scholars most cited alongside Jeffrey Shallit, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Jeffrey Shallit Line = papers co-authored together Jeffrey Shallit links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown
#Work
1 20250
2 20231
3 20191
4 20190
5 20171
6 20152
7
Descriptional complexity of formal systems : 17th International Workshop, DCFS 2015 Waterloo, ON, Canada, June 25-27, 2015 : proceedings
20151
8
Proving Darwin • Gregory Chaitin
20131
9
The Subword Complexity of k-Automatic Sequences is k-Synchronized
20125
10 20122
11 20111
12
Why Us? How Science Rediscovered the Mystery of Ourselves • James Le Fanu
20111
13 20095
14
New Directions in State Complexity.
20061
15 20064
16 20056
17 20042
18 199412
19 19936
20
The "3x + 1" Problem and Finite Automata.
19923

About Jeffrey Shallit

Jeffrey Shallit is a scholar working on Computational Theory and Mathematics, Algebra and Number Theory and Theoretical Computer Science, having authored 199 papers that have together received 2.4k indexed citations. Recurring topics across this work include semigroups and automata theory (118 papers), Algorithms and Data Compression (69 papers), Computability, Logic, AI Algorithms (47 papers), Coding theory and cryptography (27 papers), Mathematical Dynamics and Fractals (18 papers), Analytic Number Theory Research (17 papers), DNA and Biological Computing (16 papers) and Advanced Algebra and Logic (15 papers). The work is most often cited by research in Computational Theory and Mathematics (1.8k citations), Discrete Mathematics and Combinatorics (250 citations) and Algebra and Number Theory (334 citations). Jeffrey Shallit has collaborated with scholars based in Canada, United States and France. Frequent co-authors include Jean‐Paul Allouche, Eric Bach, Narad Rampersad, Ming‐Wei Wang, A. J. van der Poorten, Juhani Karhumäki, Michel Mendès France, L. Bruce Richmond, Luke Schaeffer and Jorge Stolfi. Their work appears in journals such as Theoretical Computer Science, Discrete Mathematics, The Electronic Journal of Combinatorics, Journal of Number Theory and Mathematics of Computation.

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026