33:
832:, Hartmanis talks in detail of this period of his life, in which his father was given an estate, Lestene; the Russians occupied Latvia, took his father away, and confiscated Lestene; the Germans took over once more and restored part of Lestene to his family; and the family left Latvia for Germany before the Russians invaded Latvia again.
402:
Hartmanis continued to make significant contributions to the field of computational complexity for decades. With
Leonard Berman, he proved that all natural NP-complete languages are polynomial-time isomorphic and conjectured that this holds for all NP-complete sets. Although the conjecture itself
410:
Hartmanis's 1981 article gives a personal account of developments in this area and in automata theory and discusses the underlying beliefs and philosophy that guided his research. The book written in honor of his 60th birthday, in particular, the chapter by
Stearns, is a valuable resource on
390:
With P.M. Lewis II, Hartmanis and
Stearns also defined complexity classes based on space usage. They proveded the first space hierarchy theorem. In the same year they also proved that every context-free language has deterministic space complexity
2925:
403:
remains open, it has led to a large body of research on the structure of NP-complete sets, culminating in
Mahaney's theorem on the nonexistence of sparse NP-complete sets. He and his coauthors also defined the
2930:
294:
in 1958. While at
General Electric, he developed many principles of computational complexity theory. In 1965, he became a professor at Cornell University. He was one of the founders and the first chair of its
2915:
310:, which made recommendations based on its priorities to sustain the core effort in CS&E, to broaden the field, and to improve undergrad education in CS&E. He was assistant director of the
1134:
These early papers developed many principles of computational complexity theory. Hartmanis's 1981 survey paper provides extensive information on the work in computational complexity theory.
303:
2975:
1702:
Cai, Jin-Yi; Gundermann, Thomas; —; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd (December 1988), "The boolean hierarchy I: Structural properties",
2920:
1882:
958:
456:
2945:
1948:
1732:
Cai, Jin-Yi; Gundermann, Thomas; —; Hemachandra, Lane A.; Sewelson, Vivian; Wagner, Klaus; Wechsung, Gerd (February 1989), "The boolean hierarchy II: Applications",
2910:
1039:
1002:
2353:
442:. Gödel, in this letter, was the first to question whether a problem equivalent to an NP-complete problem could be solved in quadratic or linear time, presaging the
2950:
2153:
513:
347:
379:, a way of classifying computational problems according to the time required to solve them. They went on to prove a number of fundamental results such as the
1261:
782:
Hartmanis, Juris (July 26, 2009). "Dr. Juris
Hartmanis Interview" (text). Interviewed by William Aspray. Ithaca, New York: ACM Oral History interviews.
2900:
2895:
251:, the wife and children of Mārtiņš Hartmanis left Latvia in 1944 as refugees, fearing for their safety if the Soviet Union took over Latvia again.
1652:
1091:
302:
Hartmanis contributed to national efforts to advance computer science and engineering (CS&E) in many ways. Most significantly, he chaired the
267:
85:
422:
brought fresh insight into the early history of computational complexity before his landmark paper with
Stearns, touching on interactions among
2980:
2955:
2965:
2905:
2229:
2192:
2161:
1926:
1828:
1780:
1202:
723:
477:
2970:
2800:
2346:
1804:
1519:
1030:
994:
950:
562:
387:
remarks that "t is the 1965 paper by Juris
Hartmanis and Richard Stearns that marks the beginning of the modern era of complexity theory."
364:
291:
282:. The University of Missouri–Kansas City honored him with an Honorary Doctor of Humane Letters in May 1999. After teaching mathematics at
2940:
2050:
1972:
1446:
815:
525:
493:
326:
244:
765:
indicates a masculine grammatical form in the
Latvian language. In a similar manner, for example, the philosopher Kant is known as Kant
626:
Juris
Hartmanis has been interviewed four times. Videos are available for two of them. The most far-reaching one is by William Aspray.
2960:
2420:
875:
275:
90:
1314:
1953:
508:
342:
842:
2691:
1601:
2935:
2543:
2339:
463:
372:
318:
217:
2132:
2024:
1379:
502:
1528:. FOCS 65: Proc. Sixth Ann. Symp Switching Circuit Theory and Logical Design. Ann Arbor, Michigan: IEEE. pp. 191–202.
2985:
2628:
2326:
2265:
2184:
680:
532:
330:
707:
Complexity Theory Retrospective : In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988
2213:
2098:
1269:
539:
334:
266:, where in 1951 he received a master's degree in applied mathematics at the University of Kansas City (now known as the
1322:
1289:
1222:
519:
470:
338:
321:
for fundamental contributions to computational complexity theory and to research and education in computing. He was a
311:
1613:
Mahaney, Stephen R. (October 1982). "Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis".
607:
Memory bounds for recognition of context-free and context-sensitive languages 1965 (with P.M. Lewis and R.E. Stearns)
2270:
1734:
1704:
1478:
1410:
1258:
644:
371:. The citation reads, "In recognition of their seminal paper which established the foundations for the field of
1186:
927:. 5th Ann. Symp. on Switching Circuit Theory and Logical Design. Princeton, New Jersey: IEEE. pp. 82–90.
1355:[Turing Award winner and founder of "computational complexity" theory, Juris Hartmanis, dies at 94].
1650:
Cai, Jin-Yi; Sivakumar, D. (April 1999), "Sparse hard sets for P: resolution of a conjecture of Hartmanis",
1352:
2572:
380:
234:
598:"Classifications of computations by time and memory requirements" 1965 (with P.M. Lewis and R.E. Stearns)
287:
259:
205:
144:
80:
229:
2890:
2885:
1690:
396:
271:
753:
In the Baltic languages, own-names are not lexical constants, but have different grammatical forms.
2774:
2317:
443:
439:
239:, a general in the Latvian Army, and Irma Marija Hartmane. He was the younger brother of the poet
2729:
2594:
2476:
2426:
2414:
2287:
2120:
1834:
1786:
1058:
970:
729:
283:
279:
209:
201:
159:
139:
1551:
414:
In the late 1980s, Hartmanis's exposition on a newly discovered letter dated 20 March 1956 from
2308:
1442:
2622:
2600:
2225:
2188:
2157:
2128:
2094:
1824:
1776:
1497:
1198:
1118:
869:
719:
404:
2796:
2784:
2758:
2713:
2709:
2454:
2448:
2279:
2217:
2016:
1816:
1768:
1743:
1713:
1661:
1630:
1622:
1574:
1566:
1529:
1487:
1419:
1190:
1108:
1100:
1048:
1006:
962:
928:
879:
807:
783:
711:
419:
376:
296:
154:
134:
121:
1588:
1070:
705:
2857:
2810:
2790:
2675:
2661:
2549:
2527:
2470:
2432:
2391:
1679:
1584:
1469:
1326:
1265:
1066:
384:
314:
Directorate of Computer and Information Science and Engineering (CISE) from 1996 to 1998.
216:"in recognition of their seminal paper which established the foundations for the field of
2072:
1994:
258:, where Juris Hartmanis received the equivalent of a master's degree in physics from the
1218:
1001:. FOCS 65: Proc. Sixth Ann. Symp Switching Circuit Theory and Logical Design. New York:
2845:
2780:
2768:
2746:
2723:
2717:
2657:
2584:
2515:
2385:
435:
1089:— (1981), "Observations about the development of theoretical computer science",
900:
32:
2879:
2863:
2851:
2820:
2806:
2762:
2703:
2555:
2537:
2533:
2521:
2499:
2397:
2312:
1626:
431:
427:
415:
263:
179:
169:
2291:
1838:
1790:
1159:
733:
601:"Hierarchies of memory limited computations" 1965 (with P.M. Lewis and R.E. Stearns)
2824:
2578:
2511:
2505:
2444:
2438:
2362:
1285:
483:
368:
299:
department (which was one of the first computer science departments in the world).
248:
240:
213:
174:
103:
1152:
961:
Congress 65. New York City: Spartan Books, Inc., Washington, D.C. pp. 31–35.
2246:
610:"On isomorphisms and density of NP and other complete sets" 1977 (with L. Berman)
2752:
2634:
2616:
2610:
2464:
2379:
2250:
1856:
1808:
1760:
811:
701:
651:
639:
633:
423:
2331:
2046:
1904:
1523:
922:
2841:
2814:
2697:
2671:
2667:
2651:
2493:
2458:
1820:
1772:
1246:
715:
184:
1525:
Memory bounds for recognition of context-free and context-sensitive languages
1501:
1122:
630:
William Aspray interviews Hartmanis for the ACM Oral History interviews, 2009
247:, Mārtiņš Hartmanis was arrested by the Soviets and died in prison. Later in
2687:
2604:
2322:
1104:
788:
672:
2210:
Computing the Future: A broader agenda for computer science and engineering
1666:
1183:
Computing the Future: A broader agenda for computer science and engineering
581:
Computing the Future: A broader agenda for computer science and engineering
1807:(1990). "Juris Hartmanis: The beginnings of computational complexity". In
595:"Computational complexity of recursive sequences" 1964 (with R.E. Stearns)
308:
Computing the Future – A Broad Agenda for Computer Science and Engineering
2681:
2365:
1533:
1339:
2001 ... Juris Hartmanis, par izcilu ieguldījumu datorzinātņu attīstībā.
1010:
613:"Observations about the development of theoretical computer science" 1981
1878:
932:
604:"On the computational complexity of algorithms" 1965 (with R.E. Stearns)
1166:
1062:
974:
255:
2178:
1492:
1473:
883:
1861:
Bulletin of the European Association for Theoretical Computer Science
1635:
1579:
1145:
1113:
322:
2283:
1747:
1718:
1570:
1424:
1405:
1053:
1034:
966:
1922:
1259:
National Academy of Sciences Members and Foreign Associates Elected
2221:
1194:
1968:
53:
2335:
955:
Classifications of computations by time and memory requirements
636:
interviews Hartmanis for the Cornell ecommons collection, 2010
228:
Hartmanis was born in Latvia on July 5, 1928. He was a son of
1513:
1511:
2926:
Members of the United States National Academy of Engineering
1552:"On isomorphisms and density of NP and other complete sets"
200:(July 5, 1928 – July 29, 2022) was a Latvian-born American
1143:
Purdue University created the first CS Department in 1962
457:
American Association for the Advancement of Science (AAAS)
2931:
Members of the United States National Academy of Sciences
2150:
Feasible Computations and Provable Complexity Properties
1380:"Juris Hartmanis, first CS department chair, dies at 94"
654:
interviews Hartmanis as ACM Turing Award recipient, 2018
569:
Feasible Computations and Provable Complexity Properties
2916:
1994 fellows of the Association for Computing Machinery
1404:
Garfinkel, Simson; Spafford, Eugene H. (October 2022).
2127:. Englewood Cliffs, N.J.: Prentice-Hall. p. 211.
2154:
Society for Industrial and Applied Mathematics (SIAM)
988:
986:
984:
916:
914:
367:
received the highest prize in computer science, the
2253:. Ithaca, New York: Internet-First University Press.
1949:"Alexander von Humboldt Foundation, Juris Hartmanis"
1247:
List of Fellows of the American Mathematical Society
1219:"Juris Hartmanis to Lead NSF's Directorate for CISE"
375:." Their paper defined the foundational notion of a
359:
Computational complexity: foundational contributions
317:
In 1989, Hartmanis was elected as a member into the
2834:
2739:
2644:
2565:
2486:
2407:
2372:
1883:
American Association for the Advancement of Science
1084:
1082:
1080:
801:
799:
777:
775:
352:in 2001 for his contributions to computer science.
165:
153:
127:
117:
99:
73:
61:
39:
23:
1545:
1543:
895:
893:
808:"Juris Hartmanis, 1993 ACM Turing Award Recipient"
616:"Gödel, von Neumann, and the P =? NP problem" 1989
2125:Algebraic Structure Theory of Sequential Machines
1850:
1848:
1437:
1435:
1040:Transactions of the American Mathematical Society
559:Algebraic Structure Theory of Sequential Machines
395:, which contained the essential idea that led to
1309:
1307:
761:is the stem of the own-name, whereas the suffix
1035:"On the computational complexity of algorithms"
924:Computational complexity of recursive sequences
2073:"Juris Hartmanis: Distinguished Service Award"
1406:"In memoriam: Juris Hartmanis 1928–2022"
1024:
1022:
1020:
2347:
1857:"Gödel, von Neumann, and the P =? NP problem"
1181:Hartmanis, Juris; Lin, Herbert, eds. (1992).
944:
942:
843:"A Tribute to Astrid Ivask: A Literary Light"
8:
2921:Fellows of the American Mathematical Society
921:—; Stearns, R.E. (November 11, 1964).
306:study that resulted in the 1992 publication
1474:"Combinatorics, complexity, and randomness"
1353:"图灵奖得主，"计算复杂性"理论奠基人Juris Hartmanis逝世，享年94岁"
1150:Cornell started its CS Department in 1965,
2354:
2340:
2332:
999:Hierarchies of memory limited computations
828:In two of the interviews cited in section
757:must be understood as Hartman-is, whereby
20:
2976:University of Missouri–Kansas City alumni
2946:California Institute of Technology alumni
1717:
1665:
1634:
1578:
1491:
1423:
1112:
1052:
953:(May 24, 1963). Wayne A. Kalenich (ed.).
901:"University of Missouri Honorary Degrees"
787:
2911:American theoretical computer scientists
2309:Hartmanis biography at A.M. TURING AWARD
489:Humboldt Foundation Research Award, 1993
1653:Journal of Computer and System Sciences
1615:Journal of Computer and System Sciences
1242:
1240:
1092:IEEE Annals of the History of Computing
664:
499:Honorary Doctor of Humane Letters, 1999
16:American computer scientist (1928–2022)
2951:Latvian emigrants to the United States
1280:
1278:
642:interviews Hartmanis in an article in
337:. He was also a foreign member of the
2247:"A Conversation with Juris Hartmanis"
1927:American Academy of Arts and Sciences
478:American Academy of Arts and Sciences
7:
2208:—; Lin, Herbert, eds. (1992).
1378:Waldron, Patricia (August 4, 2022).
871:Some embedding theorems for lattices
503:Computing Research Association (CRA)
292:General Electric Research Laboratory
2266:"An interview with Juris Hartmanis"
2245:Hartmanis, Juris (March 31, 2010).
1905:"NAE Website – Dr. Juris Hartmanis"
710:. New York, NY: Springer New York.
383:. In his own Turing Award lecture,
327:Association for Computing Machinery
2099:National Academy of Sciences (NAS)
268:University of Missouri–Kansas City
14:
2047:"ACM Distinguished Service Award"
1954:Alexander von Humboldt Foundation
806:Hartmanis, Juris (May 17, 2018).
528:Distinguished Service Award, 2013
505:Distinguished Service Award, 2000
355:Hartmanis died on July 29, 2022.
312:National Science Foundation (NSF)
2901:20th-century American scientists
31:
2896:20th-century American engineers
2180:Computational Complexity Theory
1909:National Academy of Engineering
1813:Complexity Theory Retrospective
1765:Complexity Theory Retrospective
829:
575:Computational Complexity Theory
464:National Academy of Engineering
373:computational complexity theory
319:National Academy of Engineering
218:computational complexity theory
2318:Hartmanis biography at Cornell
2021:Computing Research Association
1:
2981:Ohio State University faculty
2956:Latvian World War II refugees
2327:Mathematics Genealogy Project
2017:"Distinguished Service Award"
1995:"Juris Hartmanis: ACM Fellow"
1522:; — (October 6, 1965).
1467:See page 103 of his lecture:
1249:, retrieved January 19, 2013.
681:Mathematics Genealogy Project
583:(ed.) 1992 (with Herbert Lin)
533:American Mathematical Society
331:American Mathematical Society
2966:University of Marburg alumni
2906:American computer scientists
2313:Short Annotated Bibliography
2214:The National Academies Press
1627:10.1016/0022-0000(82)90002-2
1550:Berman, L.; — (1977).
1270:National Academy of Sciences
540:National Academy of Sciences
335:National Academy of Sciences
2971:University of Kansas alumni
1602:Berman–Hartmanis conjecture
1323:Latvian Academy of Sciences
1290:Latvian Academy of Sciences
1146:"History of the Department"
769:in the Lithuanian language.
520:Latvian Academy of Sciences
471:Latvian Academy of Sciences
341:, which bestowed him their
339:Latvian Academy of Sciences
3002:
2941:Cornell University faculty
411:computational complexity.
2961:Santa Fe Institute people
1855:Hartmanis, Juris (1989).
1821:10.1007/978-1-4612-4478-3
1815:. Springer New York, NY.
1773:10.1007/978-1-4612-4478-3
1767:. Springer New York, NY.
1735:SIAM Journal on Computing
1705:SIAM Journal on Computing
1559:SIAM Journal on Computing
1479:Communications of the ACM
868:Hartmanis, Juris (1955).
716:10.1007/978-1-4612-4478-3
645:Communications of the ACM
304:National Research Council
278:under the supervision of
243:. After the Soviet Union
191:
110:
86:University of Kansas City
30:
2249:(video). Interviewed by
1187:National Academies Press
810:(video). Interviewed by
212:, received the 1993 ACM
1359:(in Simplified Chinese)
1317:[Grand Medal].
1105:10.1109/MAHC.1981.10005
789:10.1145/1141880.1775727
363:In 1993, Hartmanis and
333:, also a member of the
290:, Hartmanis joined the
262:. He then moved to the
245:occupied Latvia in 1940
2936:Turing Award laureates
2386:Maurice Vincent Wilkes
1667:10.1006/jcss.1998.1615
1357:新浪 finance.sina.com.cn
1351:新智元 (July 31, 2022).
993:—; Lewis, P.M.;
949:—; Lewis, P.M.;
905:University of Missouri
847:World Literature Today
381:Time hierarchy theorem
206:computational theorist
2264:Shustek, Len (2015).
2177:—, ed. (1989).
1264:May 27, 2013, at the
547:Selected publications
399:on space complexity.
288:Ohio State University
260:University of Marburg
145:Ohio State University
81:University of Marburg
2986:Scientists from Riga
2152:. Philadelphia, PA:
1534:10.1109/FOCS.1965.14
1011:10.1109/FOCS.1965.11
1005:. pp. 179–190.
814:. Ithaca, New York:
274:in mathematics from
254:They first moved to
2775:Michael Stonebraker
2573:Fernando J. Corbató
2121:Richard E., Stearns
1225:. September 5, 1996
1164:, Carnegie Mellon,
1160:"CS Dept. timeline"
1153:"CS Dept. timeline"
997:(October 6, 1965).
933:10.1109/SWCT.1964.6
2730:Charles P. Thacker
2595:Richard E. Stearns
2477:Kenneth E. Iverson
2427:Edsger W. Dijkstra
2415:James H. Wilkinson
2363:A. M. Turing Award
2212:. Washington, DC:
2027:. January 16, 2015
1329:on January 6, 2022
1185:. Washington, DC:
1167:"CS Dept. history"
531:Inaugural Fellow,
469:Member (foreign):
284:Cornell University
280:Robert P. Dilworth
210:Richard E. Stearns
202:computer scientist
160:Robert P. Dilworth
140:Cornell University
2873:
2872:
2747:Leslie G. Valiant
2623:Douglas Engelbart
2601:Edward Feigenbaum
2231:978-0-309-04740-1
2194:978-0-8218-0131-4
2163:978-0-898710-27-4
2095:"Member Emeritus"
1830:978-1-4612-8793-3
1782:978-1-4612-8793-3
1691:Mahaney's theorem
1493:10.1145/5657.5658
1472:(February 1986).
1384:Cornell Chronicle
1286:"Foreign members"
1272:, April 30, 2013.
1204:978-0-309-04740-1
1171:and a few others.
1157:as did Stanford,
884:10.7907/40KS-0T27
725:978-1-4612-4478-3
677:mathgenealogy.org
673:"Juris Hartmanis"
589:Selected articles
405:Boolean hierarchy
397:Savitch's theorem
230:Mārtiņš Hartmanis
195:
194:
166:Doctoral students
112:Scientific career
2993:
2797:John L. Hennessy
2785:Whitfield Diffie
2759:Shafi Goldwasser
2714:E. Allen Emerson
2710:Edmund M. Clarke
2455:Michael O. Rabin
2449:Herbert A. Simon
2356:
2349:
2342:
2333:
2296:
2295:
2261:
2255:
2254:
2242:
2236:
2235:
2205:
2199:
2198:
2174:
2168:
2167:
2148:— (1978).
2145:
2139:
2138:
2116:
2110:
2109:
2107:
2105:
2091:
2085:
2084:
2082:
2080:
2069:
2063:
2062:
2060:
2058:
2043:
2037:
2036:
2034:
2032:
2013:
2007:
2006:
2004:
2002:
1991:
1985:
1984:
1982:
1980:
1965:
1959:
1958:
1945:
1939:
1938:
1936:
1934:
1919:
1913:
1912:
1901:
1895:
1894:
1892:
1890:
1875:
1869:
1868:
1852:
1843:
1842:
1801:
1795:
1794:
1757:
1751:
1750:
1729:
1723:
1722:
1721:
1712:(6): 1232–1252,
1699:
1693:
1688:
1682:
1677:
1671:
1670:
1669:
1647:
1641:
1640:
1638:
1610:
1604:
1599:
1593:
1592:
1582:
1556:
1547:
1538:
1537:
1515:
1506:
1505:
1495:
1470:Karp, Richard M.
1465:
1459:
1458:
1456:
1454:
1439:
1430:
1429:
1427:
1401:
1395:
1394:
1392:
1390:
1375:
1369:
1368:
1366:
1364:
1348:
1342:
1341:
1336:
1334:
1325:. Archived from
1311:
1302:
1301:
1299:
1297:
1282:
1273:
1256:
1250:
1244:
1235:
1234:
1232:
1230:
1215:
1209:
1208:
1178:
1172:
1170:
1163:
1156:
1149:
1141:
1135:
1132:
1126:
1125:
1116:
1086:
1075:
1074:
1056:
1026:
1015:
1014:
990:
979:
978:
946:
937:
936:
918:
909:
908:
897:
888:
887:
865:
859:
858:
856:
854:
839:
833:
826:
820:
819:
803:
794:
793:
791:
779:
770:
751:
745:
744:
742:
740:
698:
692:
691:
689:
687:
669:
517:
492:Charter Fellow,
484:ACM Turing Award
444:P = NP? question
394:
377:Complexity class
351:
297:computer science
270:) and in 1955 a
238:
155:Doctoral advisor
135:General Electric
122:Computer science
68:
49:
47:
35:
21:
3001:
3000:
2996:
2995:
2994:
2992:
2991:
2990:
2876:
2875:
2874:
2869:
2858:Robert Metcalfe
2830:
2811:Geoffrey Hinton
2801:David Patterson
2791:Tim Berners-Lee
2735:
2676:Leonard Adleman
2662:Kristen Nygaard
2640:
2591:Juris Hartmanis
2561:
2550:Ivan Sutherland
2482:
2471:Robert W. Floyd
2433:Charles Bachman
2403:
2392:Richard Hamming
2368:
2360:
2323:Juris Hartmanis
2305:
2300:
2299:
2284:10.1145/2736346
2263:
2262:
2258:
2244:
2243:
2239:
2232:
2216:. p. 288.
2207:
2206:
2202:
2195:
2187:. p. 128.
2176:
2175:
2171:
2164:
2147:
2146:
2142:
2135:
2118:
2117:
2113:
2103:
2101:
2093:
2092:
2088:
2078:
2076:
2071:
2070:
2066:
2056:
2054:
2045:
2044:
2040:
2030:
2028:
2015:
2014:
2010:
2000:
1998:
1993:
1992:
1988:
1978:
1976:
1967:
1966:
1962:
1947:
1946:
1942:
1932:
1930:
1921:
1920:
1916:
1903:
1902:
1898:
1888:
1886:
1877:
1876:
1872:
1854:
1853:
1846:
1831:
1809:Selman, Alan L.
1803:
1802:
1798:
1783:
1761:Selman, Alan L.
1759:
1758:
1754:
1748:10.1137/0218007
1731:
1730:
1726:
1719:10.1137/0217078
1701:
1700:
1696:
1689:
1685:
1680:Sparse language
1678:
1674:
1649:
1648:
1644:
1612:
1611:
1607:
1600:
1596:
1571:10.1137/0206023
1554:
1549:
1548:
1541:
1517:
1516:
1509:
1468:
1466:
1462:
1452:
1450:
1441:
1440:
1433:
1425:10.1145/3559705
1403:
1402:
1398:
1388:
1386:
1377:
1376:
1372:
1362:
1360:
1350:
1349:
1345:
1332:
1330:
1313:
1312:
1305:
1295:
1293:
1284:
1283:
1276:
1266:Wayback Machine
1257:
1253:
1245:
1238:
1228:
1226:
1217:
1216:
1212:
1205:
1189:. p. 288.
1180:
1179:
1175:
1165:
1158:
1151:
1144:
1142:
1138:
1133:
1129:
1088:
1087:
1078:
1054:10.2307/1994208
1028:
1027:
1018:
992:
991:
982:
967:10.2307/2272795
948:
947:
940:
920:
919:
912:
899:
898:
891:
867:
866:
862:
852:
850:
849:. April 2, 2015
841:
840:
836:
827:
823:
805:
804:
797:
781:
780:
773:
752:
748:
738:
736:
726:
702:Selman, Alan L.
700:
699:
695:
685:
683:
671:
670:
666:
661:
624:
619:
586:
549:
511:
452:
392:
385:Richard M. Karp
361:
345:
232:
226:
224:Life and career
198:Juris Hartmanis
183:
178:
173:
149:
95:
74:Alma mater
66:
57:
51:
45:
43:
26:
25:Juris Hartmanis
17:
12:
11:
5:
2999:
2997:
2989:
2988:
2983:
2978:
2973:
2968:
2963:
2958:
2953:
2948:
2943:
2938:
2933:
2928:
2923:
2918:
2913:
2908:
2903:
2898:
2893:
2888:
2878:
2877:
2871:
2870:
2868:
2867:
2861:
2855:
2849:
2846:Jeffrey Ullman
2838:
2836:
2832:
2831:
2829:
2828:
2818:
2804:
2794:
2788:
2781:Martin Hellman
2778:
2772:
2769:Leslie Lamport
2766:
2756:
2750:
2743:
2741:
2737:
2736:
2734:
2733:
2727:
2724:Barbara Liskov
2721:
2718:Joseph Sifakis
2707:
2701:
2695:
2685:
2679:
2665:
2658:Ole-Johan Dahl
2655:
2648:
2646:
2642:
2641:
2639:
2638:
2632:
2626:
2620:
2614:
2608:
2598:
2588:
2585:Butler Lampson
2582:
2576:
2569:
2567:
2563:
2562:
2560:
2559:
2553:
2547:
2541:
2531:
2525:
2519:
2516:Dennis Ritchie
2509:
2503:
2497:
2490:
2488:
2484:
2483:
2481:
2480:
2474:
2468:
2462:
2452:
2442:
2436:
2430:
2424:
2418:
2411:
2409:
2405:
2404:
2402:
2401:
2395:
2389:
2383:
2376:
2374:
2370:
2369:
2361:
2359:
2358:
2351:
2344:
2336:
2330:
2329:
2320:
2315:
2304:
2303:External links
2301:
2298:
2297:
2256:
2237:
2230:
2200:
2193:
2169:
2162:
2156:. p. 62.
2140:
2133:
2111:
2086:
2064:
2038:
2008:
1986:
1960:
1940:
1914:
1896:
1870:
1844:
1829:
1805:Stearns, R. E.
1796:
1781:
1763:, ed. (1990).
1752:
1724:
1694:
1683:
1672:
1660:(2): 280–296,
1642:
1621:(2): 130–143.
1605:
1594:
1565:(2): 305–322.
1539:
1507:
1460:
1443:"Turing Award"
1431:
1396:
1370:
1343:
1321:(in Latvian).
1315:"Lielā medaļa"
1303:
1274:
1251:
1236:
1210:
1203:
1173:
1136:
1127:
1076:
1031:Stearns, R. E.
1016:
980:
938:
910:
889:
874:(PhD thesis).
860:
834:
821:
795:
771:
746:
724:
704:, ed. (1990).
693:
663:
662:
660:
657:
656:
655:
649:
637:
631:
623:
620:
618:
617:
614:
611:
608:
605:
602:
599:
596:
592:
591:
590:
585:
584:
578:
572:
566:
555:
554:
553:
548:
545:
544:
543:
536:
529:
523:
506:
500:
497:
490:
487:
481:
474:
467:
460:
451:
448:
360:
357:
225:
222:
193:
192:
189:
188:
167:
163:
162:
157:
151:
150:
148:
147:
142:
137:
131:
129:
125:
124:
119:
115:
114:
108:
107:
101:
97:
96:
94:
93:
88:
83:
77:
75:
71:
70:
69:(aged 94)
63:
59:
58:
52:
41:
37:
36:
28:
27:
24:
15:
13:
10:
9:
6:
4:
3:
2:
2998:
2987:
2984:
2982:
2979:
2977:
2974:
2972:
2969:
2967:
2964:
2962:
2959:
2957:
2954:
2952:
2949:
2947:
2944:
2942:
2939:
2937:
2934:
2932:
2929:
2927:
2924:
2922:
2919:
2917:
2914:
2912:
2909:
2907:
2904:
2902:
2899:
2897:
2894:
2892:
2889:
2887:
2884:
2883:
2881:
2865:
2864:Avi Wigderson
2862:
2859:
2856:
2853:
2852:Jack Dongarra
2850:
2847:
2843:
2840:
2839:
2837:
2833:
2826:
2822:
2819:
2816:
2812:
2808:
2807:Yoshua Bengio
2805:
2802:
2798:
2795:
2792:
2789:
2786:
2782:
2779:
2776:
2773:
2770:
2767:
2764:
2763:Silvio Micali
2760:
2757:
2754:
2751:
2748:
2745:
2744:
2742:
2738:
2731:
2728:
2725:
2722:
2719:
2715:
2711:
2708:
2705:
2704:Frances Allen
2702:
2699:
2696:
2693:
2689:
2686:
2683:
2680:
2677:
2673:
2669:
2666:
2663:
2659:
2656:
2653:
2650:
2649:
2647:
2643:
2636:
2633:
2630:
2627:
2624:
2621:
2618:
2615:
2612:
2609:
2606:
2602:
2599:
2596:
2592:
2589:
2586:
2583:
2580:
2577:
2574:
2571:
2570:
2568:
2564:
2557:
2556:William Kahan
2554:
2551:
2548:
2545:
2542:
2539:
2538:Robert Tarjan
2535:
2534:John Hopcroft
2532:
2529:
2526:
2523:
2522:Niklaus Wirth
2520:
2517:
2513:
2510:
2507:
2504:
2501:
2500:Edgar F. Codd
2498:
2495:
2492:
2491:
2489:
2485:
2478:
2475:
2472:
2469:
2466:
2463:
2460:
2456:
2453:
2450:
2446:
2443:
2440:
2437:
2434:
2431:
2428:
2425:
2422:
2421:John McCarthy
2419:
2416:
2413:
2412:
2410:
2406:
2399:
2398:Marvin Minsky
2396:
2393:
2390:
2387:
2384:
2381:
2378:
2377:
2375:
2371:
2367:
2364:
2357:
2352:
2350:
2345:
2343:
2338:
2337:
2334:
2328:
2324:
2321:
2319:
2316:
2314:
2310:
2307:
2306:
2302:
2293:
2289:
2285:
2281:
2277:
2273:
2272:
2267:
2260:
2257:
2252:
2248:
2241:
2238:
2233:
2227:
2223:
2222:10.17226/1982
2219:
2215:
2211:
2204:
2201:
2196:
2190:
2186:
2182:
2181:
2173:
2170:
2165:
2159:
2155:
2151:
2144:
2141:
2136:
2130:
2126:
2122:
2115:
2112:
2100:
2096:
2090:
2087:
2074:
2068:
2065:
2052:
2048:
2042:
2039:
2026:
2022:
2018:
2012:
2009:
1996:
1990:
1987:
1974:
1970:
1969:"ACM Fellows"
1964:
1961:
1956:
1955:
1950:
1944:
1941:
1928:
1924:
1918:
1915:
1910:
1906:
1900:
1897:
1884:
1880:
1874:
1871:
1866:
1862:
1858:
1851:
1849:
1845:
1840:
1836:
1832:
1826:
1822:
1818:
1814:
1810:
1806:
1800:
1797:
1792:
1788:
1784:
1778:
1774:
1770:
1766:
1762:
1756:
1753:
1749:
1745:
1742:(1): 95–111,
1741:
1737:
1736:
1728:
1725:
1720:
1715:
1711:
1707:
1706:
1698:
1695:
1692:
1687:
1684:
1681:
1676:
1673:
1668:
1663:
1659:
1655:
1654:
1646:
1643:
1637:
1632:
1628:
1624:
1620:
1616:
1609:
1606:
1603:
1598:
1595:
1590:
1586:
1581:
1576:
1572:
1568:
1564:
1560:
1553:
1546:
1544:
1540:
1535:
1531:
1527:
1526:
1521:
1520:Stearns, R.E.
1518:Lewis, P.M.;
1514:
1512:
1508:
1503:
1499:
1494:
1489:
1486:(2): 98–109.
1485:
1481:
1480:
1475:
1471:
1464:
1461:
1448:
1444:
1438:
1436:
1432:
1426:
1421:
1418:(10): 14–15.
1417:
1413:
1412:
1407:
1400:
1397:
1385:
1381:
1374:
1371:
1358:
1354:
1347:
1344:
1340:
1328:
1324:
1320:
1316:
1310:
1308:
1304:
1291:
1287:
1281:
1279:
1275:
1271:
1267:
1263:
1260:
1255:
1252:
1248:
1243:
1241:
1237:
1224:
1220:
1214:
1211:
1206:
1200:
1196:
1195:10.17226/1982
1192:
1188:
1184:
1177:
1174:
1168:
1161:
1154:
1147:
1140:
1137:
1131:
1128:
1124:
1120:
1115:
1110:
1106:
1102:
1098:
1094:
1093:
1085:
1083:
1081:
1077:
1072:
1068:
1064:
1060:
1055:
1050:
1046:
1042:
1041:
1036:
1032:
1025:
1023:
1021:
1017:
1012:
1008:
1004:
1000:
996:
995:Stearns, R.E.
989:
987:
985:
981:
976:
972:
968:
964:
960:
956:
952:
951:Stearns, R.E.
945:
943:
939:
934:
930:
926:
925:
917:
915:
911:
906:
902:
896:
894:
890:
885:
881:
877:
873:
872:
864:
861:
848:
844:
838:
835:
831:
825:
822:
817:
813:
809:
802:
800:
796:
790:
785:
778:
776:
772:
768:
764:
760:
756:
750:
747:
735:
731:
727:
721:
717:
713:
709:
708:
703:
697:
694:
682:
678:
674:
668:
665:
658:
653:
650:
647:
646:
641:
638:
635:
632:
629:
628:
627:
621:
615:
612:
609:
606:
603:
600:
597:
594:
593:
588:
587:
582:
579:
576:
573:
570:
567:
564:
560:
557:
556:
551:
550:
546:
541:
537:
534:
530:
527:
524:
521:
515:
510:
507:
504:
501:
498:
495:
491:
488:
485:
482:
479:
475:
472:
468:
465:
461:
458:
454:
453:
449:
447:
445:
441:
437:
433:
429:
425:
421:
417:
412:
408:
406:
400:
398:
388:
386:
382:
378:
374:
370:
366:
358:
356:
353:
349:
344:
340:
336:
332:
328:
324:
320:
315:
313:
309:
305:
300:
298:
293:
289:
285:
281:
277:
273:
269:
265:
264:United States
261:
257:
252:
250:
246:
242:
236:
231:
223:
221:
219:
215:
211:
207:
203:
199:
190:
186:
181:
180:Neil Immerman
176:
171:
170:Allan Borodin
168:
164:
161:
158:
156:
152:
146:
143:
141:
138:
136:
133:
132:
130:
126:
123:
120:
116:
113:
109:
105:
102:
98:
92:
89:
87:
84:
82:
79:
78:
76:
72:
65:July 29, 2022
64:
60:
55:
42:
38:
34:
29:
22:
19:
2825:Pat Hanrahan
2590:
2579:Robin Milner
2528:Richard Karp
2512:Ken Thompson
2506:Stephen Cook
2445:Allen Newell
2439:Donald Knuth
2278:(4): 33–37.
2275:
2269:
2259:
2240:
2209:
2203:
2179:
2172:
2149:
2143:
2124:
2114:
2102:. Retrieved
2089:
2077:. Retrieved
2067:
2055:. Retrieved
2041:
2029:. Retrieved
2020:
2011:
1999:. Retrieved
1989:
1977:. Retrieved
1963:
1952:
1943:
1931:. Retrieved
1917:
1908:
1899:
1887:. Retrieved
1873:
1864:
1860:
1812:
1799:
1764:
1755:
1739:
1733:
1727:
1709:
1703:
1697:
1686:
1675:
1657:
1651:
1645:
1618:
1614:
1608:
1597:
1562:
1558:
1524:
1483:
1477:
1463:
1451:. Retrieved
1415:
1409:
1399:
1387:. Retrieved
1383:
1373:
1361:. Retrieved
1356:
1346:
1338:
1331:. Retrieved
1327:the original
1318:
1294:. Retrieved
1254:
1227:. Retrieved
1213:
1182:
1176:
1139:
1130:
1099:(1): 42–51,
1096:
1090:
1044:
1038:
998:
954:
923:
904:
870:
863:
851:. Retrieved
846:
837:
824:
766:
762:
758:
754:
749:
737:. Retrieved
706:
696:
684:. Retrieved
676:
667:
643:
625:
580:
574:
568:
563:R.E. Stearns
558:
413:
409:
401:
389:
369:Turing Award
365:R.E. Stearns
362:
354:
316:
307:
301:
253:
249:World War II
241:Astrid Ivask
227:
214:Turing Award
197:
196:
175:Dexter Kozen
128:Institutions
111:
104:Turing Award
67:(2022-07-29)
50:July 5, 1928
18:
2891:2022 deaths
2886:1928 births
2753:Judea Pearl
2635:Fred Brooks
2617:Amir Pnueli
2611:Manuel Blum
2465:John Backus
2380:Alan Perlis
2251:David Gries
1047:: 285–306.
830:#Interviews
812:David Gries
652:David Gries
640:Len Shustek
634:David Gries
561:1966 (with
512: [
509:Grand Medal
420:von Neumann
346: [
343:Grand Medal
329:and of the
233: [
2880:Categories
2842:Alfred Aho
2821:Ed Catmull
2815:Yann LeCun
2698:Peter Naur
2672:Adi Shamir
2668:Ron Rivest
2652:Andrew Yao
2544:John Cocke
2494:Tony Hoare
2459:Dana Scott
2134:0130222771
1867:: 101–107.
1319:www.lza.lv
659:References
622:Interviews
577:(ed.) 1989
208:who, with
185:Jin-Yi Cai
46:1928-07-05
2688:Vint Cerf
2605:Raj Reddy
2366:laureates
2119:—;
1923:"Members"
1879:"Fellows"
1636:1813/6257
1580:1813/7101
1502:0001-0782
1389:August 5,
1363:August 4,
1333:August 4,
1229:August 2,
1123:1058-6180
1114:1813/6244
1029:—;
853:August 4,
755:Hartmanis
739:August 4,
686:August 4,
2692:Bob Kahn
2682:Alan Kay
2629:Jim Gray
2292:35051248
2123:(1966).
2104:July 31,
2079:July 30,
2057:July 30,
2031:July 30,
1979:July 30,
1933:July 30,
1889:July 30,
1839:31789744
1791:31789744
1453:July 30,
1296:July 30,
1262:Archived
1033:(1965).
957:. Proc.
876:Cal Tech
734:31789744
538:Member,
476:Member,
462:Member,
455:Fellow,
56:, Latvia
2325:at the
2001:July 9,
1957:. 1993.
1811:(ed.).
1589:0455536
1071:0170805
1063:1994208
975:2272795
759:Hartman
518:of the
393:(log n)
325:of the
276:Caltech
256:Germany
91:Caltech
2866:(2023)
2860:(2022)
2854:(2021)
2848:(2020)
2827:(2019)
2817:(2018)
2803:(2017)
2793:(2016)
2787:(2015)
2777:(2014)
2771:(2013)
2765:(2012)
2755:(2011)
2749:(2010)
2732:(2009)
2726:(2008)
2720:(2007)
2706:(2006)
2700:(2005)
2694:(2004)
2684:(2003)
2678:(2002)
2664:(2001)
2654:(2000)
2637:(1999)
2631:(1998)
2625:(1997)
2619:(1996)
2613:(1995)
2607:(1994)
2597:(1993)
2587:(1992)
2581:(1991)
2575:(1990)
2558:(1989)
2552:(1988)
2546:(1987)
2540:(1986)
2530:(1985)
2524:(1984)
2518:(1983)
2508:(1982)
2502:(1981)
2496:(1980)
2479:(1979)
2473:(1978)
2467:(1977)
2461:(1976)
2451:(1975)
2441:(1974)
2435:(1973)
2429:(1972)
2423:(1971)
2417:(1970)
2400:(1969)
2394:(1968)
2388:(1967)
2382:(1966)
2290:
2228:
2191:
2160:
2131:
2075:. 2013
2053:. 2013
1997:. 1994
1975:. 1994
1929:. 1992
1885:. 1981
1837:
1827:
1789:
1779:
1587:
1500:
1449:. 1993
1292:. 1990
1201:
1121:
1069:
1061:
973:
732:
722:
648:, 2015
542:, 2013
535:, 2013
522:, 2001
496:, 1994
480:, 1992
473:, 1990
466:, 1989
459:, 1981
450:Awards
440:Kleene
438:, and
432:Church
424:Turing
323:Fellow
187:(1986)
182:(1980)
177:(1977)
172:(1969)
118:Fields
106:(1993)
100:Awards
2835:2020s
2740:2010s
2645:2000s
2566:1990s
2487:1980s
2408:1970s
2373:1960s
2288:S2CID
1835:S2CID
1787:S2CID
1555:(PDF)
1059:JSTOR
971:JSTOR
730:S2CID
552:Books
516:]
428:Gödel
416:Gödel
350:]
272:Ph.D.
237:]
2271:CACM
2226:ISBN
2189:ISBN
2158:ISBN
2129:ISBN
2106:2022
2081:2022
2059:2022
2033:2022
2003:2022
1981:2022
1935:2022
1891:2022
1825:ISBN
1777:ISBN
1498:ISSN
1455:2022
1411:CACM
1391:2022
1365:2022
1335:2022
1298:2022
1231:2022
1199:ISBN
1119:ISSN
1003:IEEE
959:IFIP
855:2022
741:2022
720:ISBN
688:2022
571:1978
486:1993
436:Post
286:and
204:and
62:Died
54:Riga
40:Born
2280:doi
2218:doi
2185:AMS
2051:ACM
2025:CRA
1973:ACM
1817:doi
1769:doi
1744:doi
1714:doi
1662:doi
1631:hdl
1623:doi
1575:hdl
1567:doi
1530:doi
1488:doi
1447:ACM
1420:doi
1223:NSF
1191:doi
1109:hdl
1101:doi
1049:doi
1045:117
1007:doi
963:doi
929:doi
880:doi
816:ACM
784:doi
763:-is
712:doi
526:ACM
494:ACM
430:,
418:to
220:".
2882::
2844:;
2823:;
2813:;
2809:;
2799:;
2783:;
2761:;
2716:;
2712:;
2690:;
2674:;
2670:;
2660:;
2603:;
2593:;
2536:;
2514:;
2457:;
2447:;
2311:,
2286:.
2276:58
2274:.
2268:.
2224:.
2183:.
2097:.
2049:.
2023:.
2019:.
1971:.
1951:.
1925:.
1907:.
1881:.
1865:38
1863:.
1859:.
1847:^
1833:.
1823:.
1785:.
1775:.
1740:18
1738:,
1710:17
1708:,
1658:58
1656:,
1629:.
1619:25
1617:.
1585:MR
1583:.
1573:.
1561:.
1557:.
1542:^
1510:^
1496:.
1484:29
1482:.
1476:.
1445:.
1434:^
1416:65
1414:.
1408:.
1382:.
1337:.
1306:^
1288:.
1277:^
1268:,
1239:^
1221:.
1197:.
1117:,
1107:,
1095:,
1079:^
1067:MR
1065:.
1057:.
1043:.
1037:.
1019:^
983:^
969:.
941:^
913:^
903:.
892:^
878:.
845:.
798:^
774:^
767:as
728:.
718:.
679:.
675:.
514:lv
446:.
434:,
426:,
407:.
348:lv
235:lv
2355:e
2348:t
2341:v
2294:.
2282::
2234:.
2220::
2197:.
2166:.
2137:.
2108:.
2083:.
2061:.
2035:.
2005:.
1983:.
1937:.
1911:.
1893:.
1841:.
1819::
1793:.
1771::
1746::
1716::
1664::
1639:.
1633::
1625::
1591:.
1577::
1569::
1563:6
1536:.
1532::
1504:.
1490::
1457:.
1428:.
1422::
1393:.
1367:.
1300:.
1233:.
1207:.
1193::
1169:.
1162:.
1155:.
1148:.
1111::
1103::
1097:3
1073:.
1051::
1013:.
1009::
977:.
965::
935:.
931::
907:.
886:.
882::
857:.
818:.
792:.
786::
743:.
714::
690:.
565:)
48:)
44:(
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
