Joe Sawada

1.4k total citations
62 papers, 578 citations indexed

About

Joe Sawada is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Joe Sawada has authored 62 papers receiving a total of 578 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Artificial Intelligence, 42 papers in Computational Theory and Mathematics and 16 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Joe Sawada's work include Algorithms and Data Compression (39 papers), semigroups and automata theory (24 papers) and Coding theory and cryptography (19 papers). Joe Sawada is often cited by papers focused on Algorithms and Data Compression (39 papers), semigroups and automata theory (24 papers) and Coding theory and cryptography (19 papers). Joe Sawada collaborates with scholars based in Canada, United States and South Korea. Joe Sawada's co-authors include Frank Ruskey, Aaron Williams, Chı́nh T. Hoàng, Marcin Kamiński, C. Robert Miers, Vadim Lozin, Kevin Cattell, M. Serra, L. Sunil Chandran and Yue Li and has published in prestigious journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Joe Sawada

57 papers receiving 527 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Joe Sawada Canada	14	376	294	170	118	54	62	578
Renzo Pinzani Italy	15	339 0.9×	239 0.8×	452 2.7×	66 0.6×	79 1.5×	78	778
Louigi Addario‐Berry Canada	14	339 0.9×	62 0.2×	126 0.7×	153 1.3×	53 1.0×	49	684
Harold Fredricksen United States	11	346 0.9×	428 1.5×	104 0.6×	222 1.9×	61 1.1×	17	611
Danièle Gardy France	10	147 0.4×	223 0.8×	157 0.9×	62 0.5×	39 0.7×	33	586
Andreas Björklund Sweden	12	497 1.3×	125 0.4×	105 0.6×	54 0.5×	34 0.6×	35	668
Vincent Vajnovszki France	8	181 0.5×	176 0.6×	67 0.4×	53 0.4×	45 0.8×	25	349
Pinar Heggernes Norway	16	790 2.1×	106 0.4×	122 0.7×	96 0.8×	44 0.8×	90	940
Celina M.H. de Figueiredo Brazil	14	589 1.6×	52 0.2×	201 1.2×	146 1.2×	30 0.6×	134	663
Yngve Villanger Norway	17	604 1.6×	97 0.3×	81 0.5×	44 0.4×	61 1.1×	46	675
Elena Barcucci Italy	13	251 0.7×	161 0.5×	335 2.0×	35 0.3×	35 0.6×	53	595

Countries citing papers authored by Joe Sawada

Since Specialization

Citations

This map shows the geographic impact of Joe Sawada'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 Joe Sawada with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Joe Sawada more than expected).

Fields of papers citing papers by Joe Sawada

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Joe Sawada. 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 Joe Sawada. The network helps show where Joe Sawada may publish in the future.

Co-authorship network of co-authors of Joe Sawada

This figure shows the co-authorship network connecting the top 25 collaborators of Joe Sawada. A scholar is included among the top collaborators of Joe Sawada 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 Joe Sawada. Joe Sawada is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Sawada, Joe, et al.. (2025). Constructing k-ary orientable sequences with asymptotically optimal length. Designs Codes and Cryptography. 93(7). 2349–2367. 1 indexed citations

Sawada, Joe, et al.. (2020). Efficient universal cycle constructions for weak orders. Discrete Mathematics. 343(10). 112022–112022. 2 indexed citations

Fici, Gabriele, et al.. (2020). Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theoretical Computer Science. 842. 86–99.

Sawada, Joe, et al.. (2019). A Successor Rule Framework for Constructing $k$ -Ary de Bruijn Sequences and Universal Cycles. IEEE Transactions on Information Theory. 66(1). 679–687. 13 indexed citations

Sawada, Joe, et al.. (2019). Ranking and unranking fixed-density necklaces and Lyndon words. Theoretical Computer Science. 791. 36–47. 2 indexed citations

Sawada, Joe, et al.. (2018). A framework for constructing de Bruijn sequences via simple successor rules. Discrete Mathematics. 341(11). 2977–2987. 16 indexed citations

Sawada, Joe, et al.. (2018). Constructing de Bruijn sequences with co-lexicographic order: Thek-ary Grandmama sequence. European Journal of Combinatorics. 72. 1–11. 12 indexed citations

Sawada, Joe & Aaron Williams. (2017). Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences. Journal of Discrete Algorithms. 43. 95–110. 4 indexed citations

Sawada, Joe, et al.. (2017). Necklaces and Lyndon words in colexicographic and binary reflected Gray code order. Journal of Discrete Algorithms. 46-47. 25–35. 4 indexed citations

10.

Sawada, Joe, et al.. (2016). A simple shift rule for k-ary de Bruijn sequences. Discrete Mathematics. 340(3). 524–531. 8 indexed citations

11.

Sawada, Joe & Aaron Williams. (2016). Greedy flipping of pancakes and burnt pancakes. Discrete Applied Mathematics. 210. 61–74. 6 indexed citations

12.

Sawada, Joe, et al.. (2015). A surprisingly simple de Bruijn sequence construction. Discrete Mathematics. 339(1). 127–131. 21 indexed citations

13.

Hoàng, Chı́nh T., et al.. (2014). Constructions ofk-criticalP5-free graphs. Discrete Applied Mathematics. 182. 91–98. 22 indexed citations

14.

Sawada, Joe & Aaron Williams. (2012). A Gray code for fixed-density necklaces and Lyndon words in constant amortized time. Theoretical Computer Science. 502. 46–54. 18 indexed citations

15.

Hoàng, Chı́nh T., Marcin Kamiński, Joe Sawada, & R. Sritharan. (2012). Finding and listing induced paths and cycles. Discrete Applied Mathematics. 161(4-5). 633–641. 6 indexed citations

16.

Sawada, Joe, et al.. (2012). Generating bracelets with fixed content. Theoretical Computer Science. 475. 103–112. 3 indexed citations

17.

Ruskey, Frank, Joe Sawada, & Aaron Williams. (2011). Binary bubble languages and cool-lex order. Journal of Combinatorial Theory Series A. 119(1). 155–169. 19 indexed citations

18.

Sawada, Joe. (2003). A fast algorithm to generate necklaces with fixed content. Theoretical Computer Science. 301(1-3). 477–489. 20 indexed citations

19.

Ruskey, Frank & Joe Sawada. (2000). A fast algorithm to generate unlabeled necklaces. Symposium on Discrete Algorithms. 256–262. 1 indexed citations

20.

Sawada, Joe & Frank Ruskey. (1999). An efficient algorithm for generating necklaces with fixed density. Symposium on Discrete Algorithms. 752–758. 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.

Explore authors with similar magnitude of impact