J. Hartmanis

709 total citations
24 papers, 453 citations indexed

About

J. Hartmanis is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Molecular Biology. According to data from OpenAlex, J. Hartmanis has authored 24 papers receiving a total of 453 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 16 papers in Computational Theory and Mathematics and 2 papers in Molecular Biology. Recurrent topics in J. Hartmanis's work include Computability, Logic, AI Algorithms (12 papers), semigroups and automata theory (6 papers) and Machine Learning and Algorithms (5 papers). J. Hartmanis is often cited by papers focused on Computability, Logic, AI Algorithms (12 papers), semigroups and automata theory (6 papers) and Machine Learning and Algorithms (5 papers). J. Hartmanis collaborates with scholars based in United States. J. Hartmanis's co-authors include Richard E. Stearns, Vivian Sewelson, Neil Immerman, L. Berman, Robert L. Constable, Hans Langmaack, C. A. R. Hoare, Dines Bjørner, Scott A. Vanstone and Jin‐Yi Cai and has published in prestigious journals such as Mathematics of Computation, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

J. Hartmanis

24 papers receiving 384 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
J. Hartmanis United States 12 367 240 64 61 54 24 453
F. C. Hennie United States 7 361 1.0× 220 0.9× 68 1.1× 53 0.9× 38 0.7× 7 453
Norbert Blüm Germany 7 182 0.5× 145 0.6× 43 0.7× 23 0.4× 98 1.8× 22 301
Peter Emde Boas Netherlands 2 117 0.3× 179 0.7× 34 0.5× 61 1.0× 125 2.3× 2 325
Martti Penttonen Finland 10 162 0.4× 216 0.9× 30 0.5× 45 0.7× 103 1.9× 29 337
Walter S. Brainerd United States 7 181 0.5× 204 0.8× 9 0.1× 47 0.8× 43 0.8× 14 309
Eitan M. Gurari United States 11 315 0.9× 217 0.9× 20 0.3× 12 0.2× 54 1.0× 27 393
Stephen R. Mahaney United States 12 427 1.2× 248 1.0× 14 0.2× 34 0.6× 105 1.9× 21 529
Gideon Ehrlich Israel 4 117 0.3× 151 0.6× 102 1.6× 17 0.3× 48 0.9× 6 306
Mark R. Brown United States 7 83 0.2× 157 0.7× 18 0.3× 34 0.6× 103 1.9× 9 244
A. C. McKellar United States 6 89 0.2× 117 0.5× 37 0.6× 164 2.7× 183 3.4× 9 326

Countries citing papers authored by J. Hartmanis

Since Specialization
Citations

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

Fields of papers citing papers by J. Hartmanis

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of J. Hartmanis

This figure shows the co-authorship network connecting the top 25 collaborators of J. Hartmanis. A scholar is included among the top collaborators of J. Hartmanis 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 J. Hartmanis. J. Hartmanis 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.
Beth, Thomas, et al.. (1992). Public-Key Cryptography State. Springer eBooks. 2 indexed citations
2.
Yager, Ronald R., et al.. (1991). Uncertainty in Knowledge Bases: Third International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU '90, Paris, France, July, 1990 Proceedings. Springer eBooks. 4 indexed citations
3.
Menezes, Alfred, et al.. (1991). Advances in Cryptology: Crypto, 90 : Proceedings. Medical Entomology and Zoology. 4 indexed citations
4.
Bjørner, Dines, et al.. (1990). VDM '90. VDM and Z - Formal Methods in Software Development: Third International Symposium of VDM Europe, Kiel, FRG, April 17-21, 1990, Proceedings. Medical Entomology and Zoology. 9 indexed citations
5.
Hartmanis, J., Neil Immerman, & Vivian Sewelson. (1985). Sparse sets in NP-P: EXPTIME versus NEXPTIME. Information and Control. 65(2-3). 158–181. 73 indexed citations
6.
Hartmanis, J.. (1982). A note on natural complete sets and Gödel numberings. Theoretical Computer Science. 17(1). 75–89. 9 indexed citations
7.
Hartmanis, J., et al.. (1978). Matrix Eigensystem Routines-EISPACK Guide.. Mathematics of Computation. 32(141). 312–312. 11 indexed citations
8.
Hartmanis, J. & L. Berman. (1975). A note on tape bounds for sla language processing. 3. 65–70. 6 indexed citations
9.
Constable, Robert L. & J. Hartmanis. (1971). Complexity of formal translations and speed-up results. 244–250. 5 indexed citations
10.
Hartmanis, J.. (1969). On the Complexity of Undecidable Problems in Automata Theory. Journal of the ACM. 16(1). 160–167. 4 indexed citations
11.
Hartmanis, J.. (1968). Tape-reversal bounded turing machine computations. Journal of Computer and System Sciences. 2(2). 117–135. 29 indexed citations
12.
Hartmanis, J.. (1967). On the complexity of undecidable problems in automata theory. 1. 112–116. 3 indexed citations
13.
Hartmanis, J. & Richard E. Stearns. (1964). Pair algebra and its application to automata theory. Information and Control. 7(4). 485–507. 33 indexed citations
14.
Hartmanis, J. & Richard E. Stearns. (1964). Computational complexity of recursive sequnces. 82–90. 11 indexed citations
15.
Stearns, Richard E. & J. Hartmanis. (1963). Regularity preserving modifications of regular expressions. Information and Control. 6(1). 55–69. 29 indexed citations
16.
Hartmanis, J. & Richard E. Stearns. (1962). Some dangers in state reduction of sequential machines. Information and Control. 5(3). 252–260. 30 indexed citations
17.
Hartmanis, J.. (1962). Loop-free structure of sequential machines. Information and Control. 5(1). 25–43. 48 indexed citations
18.
Stearns, Richard E. & J. Hartmanis. (1961). On the State Assignment Problem for Sequential Machines II. IEEE Transactions on Electronic Computers. EC-10(4). 593–603. 51 indexed citations
19.
Hartmanis, J.. (1960). Symbolic analysis of a decomposition of information processing machines. Information and Control. 3(2). 154–178. 46 indexed citations
20.
Hartmanis, J.. (1959). Linear Multivalued Sequential Coding Networks. IRE Transactions on Circuit Theory. 6(1). 69–74. 11 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