World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
67
Citations
28149
World Ranking
2145
National Ranking
1077

Research.com Recognitions

  • 2013 - Member of the National Academy of Sciences
  • 2013 - Fellow of the American Mathematical Society
  • 2013 - ACM Distinguished Service Award For their long-standing work as series editors of the Springer Lecture Notes in Computer Science (LNCS) -- under their stewardship a most important venue for disseminating innovative research in the initial decades of the field of computer science.
  • 1994 - ACM Fellow In recognition of their seminal paper which established the foundations for the field of computational complexity theory.
  • 1993 - A. M. Turing Award With Richard E. Stearns, in recognition of their seminal paper which established the foundations for the field of computational complexity theory.
  • 1992 - Fellow of the American Academy of Arts and Sciences
  • 1989 - Member of the National Academy of Engineering For fundamental contributions to computational complexity theory and to research and education in computing.
  • 1981 - Fellow of the American Association for the Advancement of Science (AAAS)

Overview

Juris Hartmanis is affiliated with Cornell University in the United States. Their career has been primarily rooted in the field of computer science, with a focus on foundational aspects of computational complexity theory.

Hartmanis has received multiple awards recognizing contributions to computational complexity and related research areas. In 1993, they were honored with the A. M. Turing Award jointly with Richard E. Stearns for their seminal paper that established the foundations for computational complexity theory.

Additional honors include being named an ACM Fellow in 1994 specifically for their foundational paper. Hartmanis also received the ACM Distinguished Service Award in 2013 for their long-standing work as a series editor of the Springer Lecture Notes in Computer Science (LNCS), an important venue for disseminating computer science research in its early decades.

Memberships and fellowships further reflect recognition by the scientific community. Hartmanis became a member of the National Academy of Sciences and a Fellow of the American Mathematical Society in 2013.

Earlier distinctions include election as a Fellow of the American Academy of Arts and Sciences in 1992, and selection as a member of the National Academy of Engineering in 1989 for contributions to computational complexity theory as well as research and education in computing.

They were also made a Fellow of the American Association for the Advancement of Science (AAAS) in 1981.

Best Publications

  • The Semantic Web

    Unknown

  • Fast Software Encryption

    Gerhard Goos;Juris Hartmanis;Jan van Leeuwen;Bruce Schneier

  • Partial-Order Methods for the Verification of Concurrent Systems: An Approach to the State-Explosion Problem

    Patrice Godefroid;J. van Leeuwen;J. Hartmanis;G. Goos

  • On the computational complexity of algorithms

    J. Hartmanis;R. E. Stearns

  • The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983

    G. Goos;J. Hartmanis;D. Barstow;W. Brauer

  • Algebraic Structure Theory of Sequential Machines

    Juris Hartmanis;R. E. Stearns

  • On Isomorphisms and Density of $NP$ and Other Complete Sets

    Leonard Berman;Juris Hartmanis

  • Hierarchies of memory limited computations

    R. E. Stearns;J. Hartmanis;P. M. Lewis

  • Computational Science and Its Applications – ICCSA 2004

    Antonio Laganá;Marina L. Gavrilova;Vipin Kumar;Youngsong Mun

  • Temporal Databases: Research and Practice

    G. Goos;J. Hartmanis;Sury Sripada;J. Van Leeuwen

  • Memory bounds for recognition of context-free and context-sensitive languages

    P. M. Lewis;R. E. Stearns;J. Hartmanis

  • The Boolean hierarchy I: structural properties

    Jin-Yi Cai;Thomas Gundermann;Juris Hartmanis;Lane A. Hemachandra

  • Multiple Classifier Systems

    Unknown

  • Ambient Intelligence

    Unknown

  • Computer Science Today: Recent Trends and Developments

    Jan Van Leeuwen;J. Hartmanis;G. Goos

  • On the State Assignment Problem for Sequential Machines II

    R. E. Stearns;J. Hartmanis

  • Software Engineering for Self-Adaptive Systems II

    Unknown

  • Generalized Kolmogorov complexity and the structure of feasible computations

    Juris Hartmanis

  • Sparse sets in NP-P: EXPTIME versus NEXPTIME*

    Juris Hartmanis;Neil Immerman;Vivian Sewelson

  • Pose estimation errors, the ultimate diagnosis

    Carolina Redondo-Cabrera;Roberto Lopez-Sastre;Yu Xiang;Tinne Tuytelaars

  • An Overview of the Theory of Computational Complexity

    J. Hartmanis;J. E. Hopcroft

  • Computational Science and Its Applications — ICCSA 2003

    Vipin Kumar;Marina L. Gavrilova;Chih Jeng Kenneth Tan;Pierre L’Ecuyer

  • Multiple Classifier Systems

    Gerhard Goos;Juris Hartmanis;Jan van Leeuwen

  • On isomorphisms and density of NP and other complete sets

    J. Hartmanis;L. Berman

  • Distributed Artificial Intelligence

    G. Goos;J. Hartmanis;J. van Leeuwen

Frequent Co-Authors

Richard Edwin Stearns
Richard Edwin Stearns University at Albany, State University of New York
Neil Immerman
Neil Immerman University of Massachusetts Amherst
John E. Hopcroft
John E. Hopcroft Cornell University
Jin-Yi Cai
Jin-Yi Cai University of Wisconsin–Madison
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Manuel Blum
Manuel Blum Carnegie Mellon University
Andrew Chi-Chih Yao
Andrew Chi-Chih Yao Tsinghua University
Benny Chor
Benny Chor Tel Aviv University
Johan Håstad
Johan Håstad Royal Institute of Technology
John R. Rice
John R. Rice Purdue University West Lafayette

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to a wide range of online degree programs and career paths. Many learners choose flexible and affordable options designed for busy professionals and students seeking career growth. For those wanting to build business and technical leadership skills within a short timeframe, a 1 year executive mba online can be an excellent choice.

If you have an interest in data, archives, or information management, an online library science degree can complement your computer science background and lead to unique interdisciplinary careers.

Cost is often a key concern when considering graduate education. Many students compare programs to find the least expensive online masters that fit their goals, ensuring a wise investment in their future.

For those aspiring to top leadership roles within tech-driven organizations, pursuing an online doctorate in organizational leadership can provide a valuable edge while offering the flexibility of distance learning.

Best Scientists Citing Juris Hartmanis

Trending Scientists

Recently Published Articles