This map shows the geographic impact of Harry B. Hunt'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 Harry B. Hunt with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Harry B. Hunt more than expected).
This network shows the impact of papers produced by Harry B. Hunt. 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 Harry B. Hunt. The network helps show where Harry B. Hunt may publish in the future.
Co-authorship network of co-authors of Harry B. Hunt
This figure shows the co-authorship network connecting the top 25 collaborators of Harry B. Hunt.
A scholar is included among the top collaborators of Harry B. Hunt 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 Harry B. Hunt. Harry B. Hunt is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Hunt, Harry B., et al.. (2024). Pumping Lemmas Can be “Harmful”. Theory of Computing Systems. 68(5). 1339–1352.3 indexed citations
Barrett, Chris, Harry B. Hunt, Madhav Marathe, et al.. (2007). Computational aspects of analyzing social network dynamics. International Joint Conference on Artificial Intelligence. 2268–2273.7 indexed citations
Hunt, Harry B., et al.. (1999). Experimental Construction of a Fine-Grained Polyalgorithm for the FFT.. Parallel and Distributed Processing Techniques and Applications. 1641–1647.1 indexed citations
10.
Hunt, Harry B., et al.. (1998). Towards syntactic characterizations of approximation schemes via predicate and graph decompositions. University of North Texas Digital Library (University of North Texas).1 indexed citations
11.
Hunt, Harry B., Madhav Marathe, Venkatesh Babu Radhakrishnan, & Richard E. Stearns. (1998). The Complexity of Planar Counting Problems. SIAM Journal on Computing. 27(4). 1142–1167.61 indexed citations
12.
Marathe, Madhav, Venkatesh Babu Radhakrishnan, Harry B. Hunt, & S. S. Ravi. (1997). Hierarchically specified unit disk graphs. Theoretical Computer Science. 174(1-2). 23–65.6 indexed citations
Hunt, Harry B., et al.. (1989). Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks.. Proceedings of the International Conference on Parallel Processing. 111–115.1 indexed citations
15.
Chakravarty, Sreejit & Harry B. Hunt. (1986). On the Computation of Detection Probability for Multiple Faults.. International Test Conference. 252–262.7 indexed citations
16.
Hunt, Harry B. & Richard E. Stearns. (1986). Monotone Boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures. 277–290.6 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.