Juris Hartmanis (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Juris Hartmanis" in English language version.

refsWebsite

Global rank English rank

21doi.org

2^nd place

7acm.org

1,185^th place

840^th place

5cornell.edu

332^nd place

246^th place

4semanticscholar.org

11^th place

8^th place

4ams.org

451^st place

277^th place

3handle.net

102^nd place

76^th place

2ieee.org

652^nd place

515^th place

2jstor.org

26^th place

20^th place

2worldcat.org

5^th place

2nasonline.org

3,325^th place

2,396^th place

2web.archive.org

1^st place

2lza.lv

low place

1mathgenealogy.org

4,501^st place

3,002^nd place

1springer.com

274^th place

309^th place

1worldliteraturetoday.org

low place

1caltech.edu

887^th place

714^th place

1umsystem.edu

low place

9,017^th place

1purdue.edu

850^th place

625^th place

1stanford.edu

179^th place

183^rd place

1cmu.edu

1,564^th place

1,028^th place

1nsf.gov

3,828^th place

2,823^rd place

1sina.com.cn

144^th place

497^th place

1aaas.org

9,065^th place

7,557^th place

1nae.edu

low place

7,932^nd place

1amacad.org

3,464^th place

2,377^th place

1humboldt-foundation.de

low place

1cra.org

low place

aaas.org

"Fellows". American Association for the Advancement of Science. 1981. Retrieved July 30, 2022.

acm.org

awards.acm.org

"ACM Fellows". ACM. 1994. Retrieved July 30, 2022.
"Juris Hartmanis: ACM Fellow". 1994. Retrieved July 9, 2022.
"ACM Distinguished Service Award". ACM. 2013. Retrieved July 30, 2022.
"Juris Hartmanis: Distinguished Service Award". 2013. Retrieved July 30, 2022.

amturing.acm.org

Hartmanis, Juris (May 17, 2018). "Juris Hartmanis, 1993 ACM Turing Award Recipient" (video). Interviewed by David Gries. Ithaca, New York: ACM.
"Turing Award". ACM. 1993. Retrieved July 30, 2022.

cacm.acm.org

Shustek, Len (2015). "An interview with Juris Hartmanis". CACM. 58 (4): 33–37. doi:10.1145/2736346. S2CID 35051248.

amacad.org

"Members". American Academy of Arts and Sciences. 1992. Retrieved July 30, 2022.

ams.org

caltech.edu

resolver.caltech.edu

Hartmanis, Juris (1955). Some embedding theorems for lattices (PhD thesis). Cal Tech. doi:10.7907/40KS-0T27.

cmu.edu

cs.cmu.edu

Purdue University created the first CS Department in 1962 "History of the Department". Cornell started its CS Department in 1965, "CS Dept. timeline". as did Stanford, "CS Dept. timeline"., Carnegie Mellon, "CS Dept. history". and a few others.

cornell.edu

ecommons.cornell.edu

Berman, L.; — (1977). "On isomorphisms and density of NP and other complete sets" (PDF). SIAM Journal on Computing. 6 (2): 305–322. doi:10.1137/0206023. hdl:1813/7101. MR 0455536.
Hartmanis, Juris (1989). "Gödel, von Neumann, and the P =? NP problem". Bulletin of the European Association for Theoretical Computer Science. 38: 101–107.
Hartmanis, Juris (March 31, 2010). "A Conversation with Juris Hartmanis" (video). Interviewed by David Gries. Ithaca, New York: Internet-First University Press.

cs.cornell.edu

Purdue University created the first CS Department in 1962 "History of the Department". Cornell started its CS Department in 1965, "CS Dept. timeline". as did Stanford, "CS Dept. timeline"., Carnegie Mellon, "CS Dept. history". and a few others.

news.cornell.edu

Waldron, Patricia (August 4, 2022). "Juris Hartmanis, first CS department chair, dies at 94". Cornell Chronicle. Retrieved August 5, 2022.

cra.org

"Distinguished Service Award". Computing Research Association. CRA. January 16, 2015. Retrieved July 30, 2022.

doi.org

Selman, Alan L., ed. (1990). Complexity Theory Retrospective : In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988. New York, NY: Springer New York. doi:10.1007/978-1-4612-4478-3. ISBN 978-1-4612-4478-3. S2CID 31789744. Retrieved August 4, 2022.
Hartmanis, Juris (July 26, 2009). "Dr. Juris Hartmanis Interview" (text). Interviewed by William Aspray. Ithaca, New York: ACM Oral History interviews. doi:10.1145/1141880.1775727.
Hartmanis, Juris (1955). Some embedding theorems for lattices (PhD thesis). Cal Tech. doi:10.7907/40KS-0T27.
—; Stearns, R.E. (November 11, 1964). Computational complexity of recursive sequences. 5th Ann. Symp. on Switching Circuit Theory and Logical Design. Princeton, New Jersey: IEEE. pp. 82–90. doi:10.1109/SWCT.1964.6.
—; Lewis, P.M.; Stearns, R.E. (May 24, 1963). Wayne A. Kalenich (ed.). Classifications of computations by time and memory requirements. Proc. IFIP Congress 65. New York City: Spartan Books, Inc., Washington, D.C. pp. 31–35. doi:10.2307/2272795. JSTOR 2272795.
—; Lewis, P.M.; Stearns, R.E. (October 6, 1965). Hierarchies of memory limited computations. FOCS 65: Proc. Sixth Ann. Symp Switching Circuit Theory and Logical Design. New York: IEEE. pp. 179–190. doi:10.1109/FOCS.1965.11.
—; Stearns, R. E. (1965). "On the computational complexity of algorithms". Transactions of the American Mathematical Society. 117: 285–306. doi:10.2307/1994208. JSTOR 1994208. MR 0170805.
— (1981), "Observations about the development of theoretical computer science", IEEE Annals of the History of Computing, 3 (1): 42–51, doi:10.1109/MAHC.1981.10005, hdl:1813/6244, ISSN 1058-6180
Hartmanis, Juris; Lin, Herbert, eds. (1992). Computing the Future: A broader agenda for computer science and engineering. Washington, DC: National Academies Press. p. 288. doi:10.17226/1982. ISBN 978-0-309-04740-1.
Garfinkel, Simson; Spafford, Eugene H. (October 2022). "In memoriam: Juris Hartmanis 1928–2022". CACM. 65 (10): 14–15. doi:10.1145/3559705.
See page 103 of his lecture: Karp, Richard M. (February 1986). "Combinatorics, complexity, and randomness". Communications of the ACM. 29 (2): 98–109. doi:10.1145/5657.5658. ISSN 0001-0782.
Lewis, P.M.; Stearns, R.E.; — (October 6, 1965). Memory bounds for recognition of context-free and context-sensitive languages. FOCS 65: Proc. Sixth Ann. Symp Switching Circuit Theory and Logical Design. Ann Arbor, Michigan: IEEE. pp. 191–202. doi:10.1109/FOCS.1965.14.
Berman, L.; — (1977). "On isomorphisms and density of NP and other complete sets" (PDF). SIAM Journal on Computing. 6 (2): 305–322. doi:10.1137/0206023. hdl:1813/7101. MR 0455536.
Mahaney, Stephen R. (October 1982). "Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis". Journal of Computer and System Sciences. 25 (2): 130–143. doi:10.1016/0022-0000(82)90002-2. hdl:1813/6257.
Cai, Jin-Yi; Sivakumar, D. (April 1999), "Sparse hard sets for P: resolution of a conjecture of Hartmanis", Journal of Computer and System Sciences, 58 (2): 280–296, doi:10.1006/jcss.1998.1615
Cai, Jin-Yi; Gundermann, Thomas; —; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd (December 1988), "The boolean hierarchy I: Structural properties", SIAM Journal on Computing, 17 (6): 1232–1252, doi:10.1137/0217078
Cai, Jin-Yi; Gundermann, Thomas; —; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd (February 1989), "The boolean hierarchy II: Applications", SIAM Journal on Computing, 18 (1): 95–111, doi:10.1137/0218007
Selman, Alan L., ed. (1990). Complexity Theory Retrospective. Springer New York, NY. doi:10.1007/978-1-4612-4478-3. ISBN 978-1-4612-8793-3. S2CID 31789744.
Stearns, R. E. (1990). "Juris Hartmanis: The beginnings of computational complexity". In Selman, Alan L. (ed.). Complexity Theory Retrospective. Springer New York, NY. doi:10.1007/978-1-4612-4478-3. ISBN 978-1-4612-8793-3. S2CID 31789744.
—; Lin, Herbert, eds. (1992). Computing the Future: A broader agenda for computer science and engineering. Washington, DC: The National Academies Press. p. 288. doi:10.17226/1982. ISBN 978-0-309-04740-1.
Shustek, Len (2015). "An interview with Juris Hartmanis". CACM. 58 (4): 33–37. doi:10.1145/2736346. S2CID 35051248.

handle.net

hdl.handle.net

— (1981), "Observations about the development of theoretical computer science", IEEE Annals of the History of Computing, 3 (1): 42–51, doi:10.1109/MAHC.1981.10005, hdl:1813/6244, ISSN 1058-6180
Berman, L.; — (1977). "On isomorphisms and density of NP and other complete sets" (PDF). SIAM Journal on Computing. 6 (2): 305–322. doi:10.1137/0206023. hdl:1813/7101. MR 0455536.
Mahaney, Stephen R. (October 1982). "Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis". Journal of Computer and System Sciences. 25 (2): 130–143. doi:10.1016/0022-0000(82)90002-2. hdl:1813/6257.

humboldt-foundation.de

"Alexander von Humboldt Foundation, Juris Hartmanis". Alexander von Humboldt Foundation. 1993.

ieee.org

ieeexplore.ieee.org

—; Stearns, R.E. (November 11, 1964). Computational complexity of recursive sequences. 5th Ann. Symp. on Switching Circuit Theory and Logical Design. Princeton, New Jersey: IEEE. pp. 82–90. doi:10.1109/SWCT.1964.6.
Lewis, P.M.; Stearns, R.E.; — (October 6, 1965). Memory bounds for recognition of context-free and context-sensitive languages. FOCS 65: Proc. Sixth Ann. Symp Switching Circuit Theory and Logical Design. Ann Arbor, Michigan: IEEE. pp. 191–202. doi:10.1109/FOCS.1965.14.

jstor.org

—; Lewis, P.M.; Stearns, R.E. (May 24, 1963). Wayne A. Kalenich (ed.). Classifications of computations by time and memory requirements. Proc. IFIP Congress 65. New York City: Spartan Books, Inc., Washington, D.C. pp. 31–35. doi:10.2307/2272795. JSTOR 2272795.
—; Stearns, R. E. (1965). "On the computational complexity of algorithms". Transactions of the American Mathematical Society. 117: 285–306. doi:10.2307/1994208. JSTOR 1994208. MR 0170805.

lza.lv

"Foreign members". Latvian Academy of Sciences. 1990. Retrieved July 30, 2022.
"Lielā medaļa" [Grand Medal]. www.lza.lv (in Latvian). Latvian Academy of Sciences. Archived from the original on January 6, 2022. Retrieved August 4, 2022. 2001 ... Juris Hartmanis, par izcilu ieguldījumu datorzinātņu attīstībā. [2001 ... Juris Hartmanis, for his outstanding contribution to the development of computer science.]

mathgenealogy.org

"Juris Hartmanis". mathgenealogy.org. Mathematics Genealogy Project. Retrieved August 4, 2022.

nae.edu

"NAE Website – Dr. Juris Hartmanis". National Academy of Engineering.

nasonline.org

National Academy of Sciences Members and Foreign Associates Elected Archived May 27, 2013, at the Wayback Machine, National Academy of Sciences, April 30, 2013.
"Member Emeritus". National Academy of Sciences (NAS). Retrieved July 31, 2022.

nsf.gov

"Juris Hartmanis to Lead NSF's Directorate for CISE". NSF. September 5, 1996. Retrieved August 2, 2022.

purdue.edu

cs.purdue.edu

Purdue University created the first CS Department in 1962 "History of the Department". Cornell started its CS Department in 1965, "CS Dept. timeline". as did Stanford, "CS Dept. timeline"., Carnegie Mellon, "CS Dept. history". and a few others.

semanticscholar.org

api.semanticscholar.org

Selman, Alan L., ed. (1990). Complexity Theory Retrospective : In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988. New York, NY: Springer New York. doi:10.1007/978-1-4612-4478-3. ISBN 978-1-4612-4478-3. S2CID 31789744. Retrieved August 4, 2022.
Selman, Alan L., ed. (1990). Complexity Theory Retrospective. Springer New York, NY. doi:10.1007/978-1-4612-4478-3. ISBN 978-1-4612-8793-3. S2CID 31789744.
Stearns, R. E. (1990). "Juris Hartmanis: The beginnings of computational complexity". In Selman, Alan L. (ed.). Complexity Theory Retrospective. Springer New York, NY. doi:10.1007/978-1-4612-4478-3. ISBN 978-1-4612-8793-3. S2CID 31789744.
Shustek, Len (2015). "An interview with Juris Hartmanis". CACM. 58 (4): 33–37. doi:10.1145/2736346. S2CID 35051248.

sina.com.cn

finance.sina.com.cn

新智元 [Xin Zhi Yuan] (July 31, 2022). "图灵奖得主，"计算复杂性"理论奠基人Juris Hartmanis逝世，享年94岁" [Turing Award winner and founder of "computational complexity" theory, Juris Hartmanis, dies at 94]. 新浪 finance.sina.com.cn (in Simplified Chinese). Retrieved August 4, 2022.

springer.com

link.springer.com

Selman, Alan L., ed. (1990). Complexity Theory Retrospective : In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988. New York, NY: Springer New York. doi:10.1007/978-1-4612-4478-3. ISBN 978-1-4612-4478-3. S2CID 31789744. Retrieved August 4, 2022.

stanford.edu

cs.stanford.edu

Purdue University created the first CS Department in 1962 "History of the Department". Cornell started its CS Department in 1965, "CS Dept. timeline". as did Stanford, "CS Dept. timeline"., Carnegie Mellon, "CS Dept. history". and a few others.

umsystem.edu

"University of Missouri Honorary Degrees". University of Missouri.

web.archive.org

National Academy of Sciences Members and Foreign Associates Elected Archived May 27, 2013, at the Wayback Machine, National Academy of Sciences, April 30, 2013.
"Lielā medaļa" [Grand Medal]. www.lza.lv (in Latvian). Latvian Academy of Sciences. Archived from the original on January 6, 2022. Retrieved August 4, 2022. 2001 ... Juris Hartmanis, par izcilu ieguldījumu datorzinātņu attīstībā. [2001 ... Juris Hartmanis, for his outstanding contribution to the development of computer science.]

worldcat.org

— (1981), "Observations about the development of theoretical computer science", IEEE Annals of the History of Computing, 3 (1): 42–51, doi:10.1109/MAHC.1981.10005, hdl:1813/6244, ISSN 1058-6180
See page 103 of his lecture: Karp, Richard M. (February 1986). "Combinatorics, complexity, and randomness". Communications of the ACM. 29 (2): 98–109. doi:10.1145/5657.5658. ISSN 0001-0782.

worldliteraturetoday.org

"A Tribute to Astrid Ivask: A Literary Light". World Literature Today. April 2, 2015. Retrieved August 4, 2022.

Juris Hartmanis (English Wikipedia)

aaas.org

acm.org

awards.acm.org

amturing.acm.org

cacm.acm.org

amacad.org

ams.org

mathscinet.ams.org

ams.org

bookstore.ams.org

caltech.edu

resolver.caltech.edu

cmu.edu

cs.cmu.edu

cornell.edu

ecommons.cornell.edu

cs.cornell.edu

news.cornell.edu

cra.org

doi.org

handle.net

hdl.handle.net

humboldt-foundation.de

ieee.org

ieeexplore.ieee.org

jstor.org

lza.lv

mathgenealogy.org

nae.edu

nasonline.org

nsf.gov

purdue.edu

cs.purdue.edu

semanticscholar.org

api.semanticscholar.org

sina.com.cn

finance.sina.com.cn

springer.com

link.springer.com

stanford.edu

cs.stanford.edu

umsystem.edu

web.archive.org

worldcat.org

worldliteraturetoday.org