Harry B. Hunt
About
In The Last Decade
Harry B. Hunt
92 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 71
- Computational Theory and Mathematics 1.0k
- Computer Networks and Communications 693
- Artificial Intelligence 559
- Electrical and Electronic Engineering 224
- Molecular Biology 213
Countries citing papers authored by Harry B. Hunt
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).
Fields of papers citing papers by Harry B. Hunt
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 3 | |
| 2 | 9 | |
| 3 | 17 | |
| 4 | Computational aspects of analyzing social network dynamics | 7 |
| 5 | 37 | |
| 6 | 7 | |
| 7 | 31 | |
| 8 | Experimental Construction of a Fine-Grained Polyalgorithm for the FFT. | 1 |
| 9 | Towards syntactic characterizations of approximation schemes via predicate and graph decompositions | 1 |
| 10 | 61 | |
| 11 | 6 | |
| 12 | 30 | |
| 13 | 28 | |
| 14 | Compaction of Message Patterns into Space-Efficient Representations for Multiprocessor Interconnection Networks. | 1 |
| 15 | On the Computation of Detection Probability for Multiple Faults. | 7 |
| 16 | Monotone Boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures | 6 |
| 17 | 5 | |
| 18 | 4 | |
| 19 | Processing conjunctive predicates and queries | 81 |
| 20 | 72 |
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.