Hal Sudborough

414 total citations
11 papers, 130 citations indexed

About

Hal Sudborough is a scholar working on Artificial Intelligence, Genetics and Electrical and Electronic Engineering. According to data from OpenAlex, Hal Sudborough has authored 11 papers receiving a total of 130 indexed citations (citations by other indexed papers that have themselves been cited), including 4 papers in Artificial Intelligence, 4 papers in Genetics and 3 papers in Electrical and Electronic Engineering. Recurrent topics in Hal Sudborough's work include Genome Rearrangement Algorithms (4 papers), Algorithms and Data Compression (4 papers) and graph theory and CDMA systems (3 papers). Hal Sudborough is often cited by papers focused on Genome Rearrangement Algorithms (4 papers), Algorithms and Data Compression (4 papers) and graph theory and CDMA systems (3 papers). Hal Sudborough collaborates with scholars based in United States and Japan. Hal Sudborough's co-authors include Qian‐Ping Gu, Shietung Peng, David A. Schmidt, Burkhard Monien, Neil D. Jones, Torben Æ. Mogensen, Bhadrachalam Chitturi, Linda Morales, Xiaojun Shen and Qing Hu and has published in prestigious journals such as Advances in experimental medicine and biology, Theoretical Computer Science and Information Processing Letters.

In The Last Decade

Hal Sudborough

11 papers receiving 121 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Hal Sudborough United States 5 68 56 49 39 32 11 130
K. Yu. Gorbunov Russia 7 84 1.2× 47 0.8× 106 2.2× 31 0.8× 81 2.5× 31 200
Riccardo Dondi Italy 11 111 1.6× 97 1.7× 178 3.6× 20 0.5× 44 1.4× 27 267
Linda Morales United States 7 34 0.5× 69 1.2× 23 0.5× 141 3.6× 17 0.5× 22 211
Sylvain Guillemot France 8 49 0.7× 32 0.6× 89 1.8× 35 0.9× 88 2.8× 15 189
H. K. Dai United States 6 35 0.5× 81 1.4× 251 5.1× 35 0.9× 11 0.3× 18 347
Laurent Bulteau France 8 111 1.6× 76 1.4× 95 1.9× 25 0.6× 39 1.2× 30 221
Tzvika Hartman Israel 10 192 2.8× 174 3.1× 177 3.6× 26 0.7× 26 0.8× 16 324
Mathias Weller France 8 14 0.2× 30 0.5× 34 0.7× 40 1.0× 87 2.7× 22 169
Ricardo Rocha Portugal 8 66 1.0× 144 2.6× 84 1.7× 72 1.8× 31 1.0× 47 315
Fabien de Montgolfier France 6 11 0.2× 24 0.4× 15 0.3× 48 1.2× 71 2.2× 17 129

Countries citing papers authored by Hal Sudborough

Since Specialization
Citations

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

Fields of papers citing papers by Hal Sudborough

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Hal Sudborough

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

All Works

11 of 11 papers shown
1.
Bereg, Sergey, et al.. (2017). Parallel Partition and Extension. 53. 1–6. 2 indexed citations
2.
Bereg, Sergey, et al.. (2017). Kronecker product and tiling of permutation arrays for hamming distances. 4. 2198–2202. 2 indexed citations
3.
Morales, Linda & Hal Sudborough. (2010). A quadratic lower bound for Topswops. Theoretical Computer Science. 411(44-46). 3965–3970. 1 indexed citations
4.
Chitturi, Bhadrachalam, et al.. (2010). Sorting Circular Permutations by Bounded Transpositions. Advances in experimental medicine and biology. 680. 725–736. 13 indexed citations
5.
Mogensen, Torben Æ., David A. Schmidt, Hal Sudborough, & Neil D. Jones. (2002). The essence of computation : complexity, analysis, transformation : essays dedicated to Neil D. Jones. Springer eBooks. 18 indexed citations
6.
Sudborough, Hal, et al.. (2002). Parallel algorithm for quadtree medial axis transform. iii. 266–271. 1 indexed citations
7.
Sudborough, Hal, et al.. (2002). Efficient parallel sibling finding for quadtree data structure. iii. 141–148. 1 indexed citations
8.
Sudborough, Hal, et al.. (2000). International Symposium on Parallel Architectures, Algorithms and Networks. 16 indexed citations
9.
Gu, Qian‐Ping, Shietung Peng, & Hal Sudborough. (1999). A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoretical Computer Science. 210(2). 327–339. 62 indexed citations
10.
Gu, Qian‐Ping, Shietung Peng, & Hal Sudborough. (1996). Approximation Algorithms for Genome Rearrangements. Proceedings Genome Informatics Workshop/Genome informatics. 7. 13–22. 2 indexed citations
11.
Shen, Xiaojun, et al.. (1993). The 4-star graph is not a subgraph of any hypercube. Information Processing Letters. 45(4). 199–203. 12 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

Rankless by CCL
2026