Juris Hartmanis
- Computational Theory and Mathematics top 0.2%
- semigroups and automata theory 21
- Computability, Logic, AI Algorithms 21
- Advanced Algebra and Logic 7
- Cellular Automata and Applications 3
- Software top 2%
- Hardware and Architecture top 2%
- Artificial Intelligence top 1%
- Algorithms and Data Compression 8
- Machine Learning and Algorithms 4
- Logic, programming, and type systems 3
-
- DNA and Biological Computing 5
Juris Hartmanis
42 papers receiving 1.8k citations
Peers
Comparison fields: 5 of 78
- Computational Theory and Mathematics 1.6k
- Software 243
- Hardware and Architecture 244
- Artificial Intelligence 1.0k
- Computer Networks and Communications 254
Countries citing papers authored by Juris Hartmanis
This map shows the geographic impact of Juris 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 Juris Hartmanis with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Juris Hartmanis more than expected).
Fields of papers citing papers by Juris Hartmanis
This network shows the impact of papers produced by Juris 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 Juris Hartmanis. The network helps show where Juris Hartmanis may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Juris Hartmanis, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Business Object Design and Implementation II: Oopsla'96, Oopsla'97 and Oopsla'98 Workshop Proceedings | 1998 | 1 |
| 2 | Computer Science Today: Recent Trends and Developments | 1995 | 72 |
| 3 | 1994 | 1 | |
| 4 | Computer-Aided Cooperative Product Development: Mit-JSME Workshop, Mit, Cambridge, U. S. A. November 20-21, 1989 Proceedings | 1991 | 3 |
| 5 | Deductive and Object-Oriented Databases: Second International Conference, DOOD '91 Munich, Germany, December 16-18, 1991 Proceedings | 1991 | 2 |
| 6 | 1991 | 22 | |
| 7 | 1990 | 10 | |
| 8 | The Structural Complexity Column. | 1989 | 2 |
| 9 | 1988 | 57 | |
| 10 | Solvable problems with conflicting relativizations. | 1985 | 14 |
| 11 | 1979 | 3 | |
| 12 | 1978 | 2 | |
| 13 | Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version) | 1977 | 1 |
| 14 | 1977 | 274 | |
| 15 | 1976 | 15 | |
| 16 | 1976 | 42 | |
| 17 | 1970 | 29 | |
| 18 | 1968 | 40 | |
| 19 | 1965 | 488 | |
| 20 | 1962 | 10 |
About Juris Hartmanis
Juris Hartmanis is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence, having authored 43 papers that have together received 2.1k indexed citations. Recurring topics across this work include semigroups and automata theory (21 papers), Computability, Logic, AI Algorithms (21 papers), Algorithms and Data Compression (8 papers), Advanced Algebra and Logic (7 papers), DNA and Biological Computing (5 papers), Machine Learning and Algorithms (4 papers), Logic, programming, and type systems (3 papers) and Cellular Automata and Applications (3 papers). The work is most often cited by research in Computational Theory and Mathematics (1.6k citations), Software (243 citations) and Hardware and Architecture (244 citations). Juris Hartmanis has collaborated with scholars based in United States, Switzerland and Netherlands. Frequent co-authors include Richard E. Stearns, L. Berman, Jan Van Leeuwen, Pierre Wolper, Gerhard Goos, Patrice Godefroid, John E. Hopcroft, Philip Lewis, Lane A. Hemachandra and Jin‐Yi Cai. Their work appears in journals such as Communications of the ACM, Information Sciences and Journal of the ACM.
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.