
	Where results make sense

Topic: Juris Hartmanis

Related Topics

Richard Stearns

Computer scientist

William Kahan

University at Albany

Turing Award

Kristen Nygaard

Ivan Sutherland

Edsger Dijkstra

Cornell University

Laila Freivalds

Helmuts Balderis

Latvia

Polskie Stronnictwo Ludowe

Hermanis Matisons

Lisa Halaby

In the News (Sat 6 Sep 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	CRA Distinguished Service Award
		Juris Hartmanis, Walter R. Read Professor of Engineering at Cornell University, has been selected to receive CRA's Distinguished Service Award for 2000.
		Hartmanis is an eminent computer scientist and a co-recipient of 1993 ACM Turing Award.
		Juris Hartmanis recently completed a two-year term as the Assistant Director of the National Science Foundation (NSF) for Computer and Information Science and Engineering (CISE).
	www.cra.org /Activities/awards/service/winner.00.html (239 words)

	juris.html (Site not responding. Last check: 2007-11-07)
		The Walter R. Read Professor of Engineering at Cornell University, Hartmanis is widely known as the founding father of computational complexity, a field that seeks to classify the computational difficulty of problems and measure the computing resources needed to solve them.
		Hartmanis' speech "Observations about the Nature of Computer Science" will be a philosophical look at the impact computers have had, and will to continue to have, on society.
		Hartmanis recently completed a two-year term as assistant director of the National Science Foundation Directorate of Computer and Information Science and Engineering, which has responsibility for NSF's efforts with the Internet, computers and computational research.
	www.nmsu.edu /~ucomm/Releases/1999/Oct99/juris.html (297 words)

	Juris Hartmanis (Site not responding. Last check: 2007-11-07)
		Juris Hartmanis was born in Riga, Latvia, on July 5, 1928.
		Together with R. Stearns, Hartmanis began the modern study of computational complexity with a fundamental 1965 paper, which formally defined time complexity on Turing machines and showed the existence of a hierarchy of time complexity classes.
		In 1993, Hartmanis was the winner (with R. Stearns) of the ACM Turing award, computer science's highest award.
	www.student.cs.uwaterloo.ca /~cs462/Hall/hartmanis.html (203 words)

	Learn more about Juris Hartmanis in the online encyclopedia. (Site not responding. Last check: 2007-11-07)
		Juris Hartmanis is a prominent computer scientist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".
		In 1965, he became a professor at Cornell University, where he helped created its computer science department and was its first chairman.
		Hartmanis, J., and Stearns, R. On the computational complexity of algorithms.
	www.onlineencyclopedia.org /j/ju/juris_hartmanis.html (231 words)

	Hartmanis retirement (Site not responding. Last check: 2007-11-07)
		Juris Hartmanis, the Walter R. Read Professor in Engineering and first chair of the Department of Computer Science, will retire at the close of the current academic year after more than three decades at Cornell.
		Hartmanis first came to Cornell in the late 1950s after receiving his Ph.D. from the California Institute of Technology in 1955.
		Hartmanis is also a recipient of the Computing Research Association Distinguished Service Award for 2000.
	www.news.cornell.edu /Chronicle/01/5.10.01/Hartmanis.html (498 words)

	Invitation to discuss the article "On Computational Complexity and
		The overall topic of his article, "On Computational Complexity and the Nature of Computer Science," lends itself to both technical discussion of questions in theoretical computer science and broader discussion of policy issues relating to "Computing the Future".
		I hope you will be able to participate so that we can start a meaningful discussion on the research directions and goals of computer science in the pages of Computing Surveys.
		Juris has agreed to comment on accepted discussion items.
	www.seas.upenn.edu /~sweirich/types/archive/1994/msg00137.html (658 words)

	Faculty Research Interests : Juris_Hartmanis (Site not responding. Last check: 2007-11-07)
		We also study the trade-offs between different computational resources in problem solving, with particular attention to sequential-time, parallel-time, nondeterministic-time, memory requirements, randomness as a computational resource, and interactive computing.
		Cai, J., T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K.
		Hartmanis, J., R. Chang, D. Ranjan and P. Rohatgi.
	www.cs.cornell.edu /Info/Faculty/Juris_Hartmanis.html (286 words)

	Access Briefs - NSF's Hartmanis to Speak at U of I
		Juris Hartmanis, Assistant Director of the National Science Foundation Directorate of Computer, Information Science and Engineering (CISE) will speak on March 11 at 8 PM at the University of Illinois computer science department in Urbana, Ill.
		Hartmanis will asses the state of computer science, outline the key computer science programs at the NSF, and discuss the role of the CISE in the NSF-wide Knowledge and Distributed Intelligence (
		In addition to his NSF position, Hartmanis is the Walter R. Read professor of engineering at Cornell University.
	www.ncsa.uiuc.edu /News/Access/Briefs/98Briefs/980310.Hartmanis.html (181 words)

	DBLP: Juris Hartmanis
		Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung: The Boolean Hierarchy I: Structural Properties.
		Juris Hartmanis, Theodore P. Baker: Relative Succinctness of Representations of Languages and Separation of Complexity Classes.
		Richard Edwin Stearns, Juris Hartmanis: On the application of pair algebra to automata theory FOCS 1964: 192-196
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/h/Hartmanis:Juris.html (1373 words)

	Juris Hartmanis - Education - Information - Educational Resources - Encyclopedia - Music
		Juris Hartmanis (born July 7, 1928 in Riga, Latvia) is a prominent computer scientist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".
		In 1965, he became a professor at Cornell University, where he helped to create its computer science department and was its first chairman.
		Hartmanis, J., and Stearns, R. On the computational complexity of algorithms.
	www.music.us /education/J/Juris-Hartmanis.htm (370 words)

	ComputerBase - Lexikon: Juris Hartmanis
		In der Folge arbeitete er für das General Electric Research Laboratory, wo er Prinzipien der Informatik erforschte und lehrte.
		Hartmanis, R. Stearns: On the computational complexity of algorithms.
		Informatiker, der gemeinsam mit Richard Stearns 1993 den Turing Award für seine Forschungsleistungen auf dem Gebiet der Komplexitätstheorie erhielt
	www.computerbase.de /lexikon/Juris_Hartmanis (187 words)

	Amazon.com: "Juris Hartmanis": Key Phrase page (Site not responding. Last check: 2007-11-07)
		Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of his Sixtieth Birthday, July 5, 1988 by Alan L. Selman (Editor)
		Juris Hartmanis was a leading pioneer in this disci- pline.
		Complexity in the Construction of Test Cases For NP-hard Problems 427 [2] Jin-Yi Cai, Thomas Gundermann, Juris Hartmanis, Lane Hemachandra, Vivian Sewelson, Klaus Wagner, and Gerd Wechsung.
	www.amazon.com /phrase/Juris-Hartmanis (300 words)

	Richard Edwin Stearns
		To Juris Hartmanis and Richard E. Stearns, in recognition of their seminal joint research which established the foundations for the field of computational complexity theory.
		Hartmanis, J. and Stearns, R.E., Algebraic Structure Theory of Sequential Machines, Prentice-Hall, 1966.
		Hartmanis, J. and Stearns, R.E., On the Computational Complexity of Algorithms, Trans.
	www.cs.albany.edu /FacultyStaff/profiles/res.html (395 words)

	[No title] (Site not responding. Last check: 2007-11-07)
		The following message is jointly from Bob Boyer (boyer@cs.utexas.edu) Juris Hartmanis (jh@cs.cornell.edu) John McCarthy (jmc@cs.stanford.edu) Bill Wulf (wulf@capa.cs.virginia.edu) Dear signers and other interested people: More than 900 of you signed a petition calling for the withdrawal of the NRC Report "Computing the Future".
		First, the Chairman of the committee that developed "Computing the Future", Dr. Juris Hartmanis and Dr. McCarthy will develop a statement on the nature of computer science, its subdisciplines, and specific opportunities for basic research.
		The CSTB has transmitted a recommendation to the NRC that all of its reports should be made available in some electronic form, but it remains to be seen what action will be taken on this matter.
	www-formal.stanford.edu /jmc/petition/final-reply (782 words)

	Presidential Search
		Among those involved in the interview process is Juris Hartmanis, the W.R. Read Professor Emeritus in Engineering and Computer Science.
		Hartmanis, also senior associate dean for computing and information science at Cornell, is one of five faculty members serving on the PSC.
		As for his colleagues serving on the PSC, Hartmanis was upbeat.
	www.news.cornell.edu /stories/Nov05/search.11.10.fac.html (304 words)

	Juris Hartmanis
		JURIS HARTMANIS (PhD '55 Cal Tech) served on the faculty at Cornell University and Ohio State University after receiving his PhD degree in mathematics, and then spent seven years as a research scientist at the General Electric Research Laboratory in Schenectady, New York.
		Professor Hartmanis chaired the influential National Research Council 1992 study Computing the Future: A Broader Agenda for Computer Science and Engineering.
		Among other current activities, he is a member of the Science Board and the Science Steering Committee of the Santa Fe Institute.
	www.cornell.edu /presidentsearch/members/hartmanis.cfm (206 words)

	CISE Newsletter - NSF 97-19 (Site not responding. Last check: 2007-11-07)
		Juris Hartmanis, an expert in the theory of computation and computational complexity, has been appointed Assistant Director of the National Science Foundation Directorate of Computer and Information Science and Engineering (CISE).
		Hartmanis will lead the directorate which has responsibility for NSF's efforts with networking infrastructure and research, supercomputer centers, robotics and intelligent systems, information processing systems, and computer and computational science research.
		Since 1965, Hartmanis has been with Cornell University, where he helped create the computer science department and served as its first chair.
	www-static.cc.gatech.edu /staff/f/freeman/cise-news.html (2051 words)

	BEATCS Computational Complexity Column
		by Juris Hartmanis, Richard Chang, S. Chari, D. Ranjan, and P. Rohatgi, in Current Trends in Theoretical Computer Science, G. Rozenberg and A. Salomaa, ed., World Scientific Series in Computer Science, Vol.
		by Juris Hartmanis, Richard Chang, D. Ranjan, and P. Rohatgi, in Current Trends in Theoretical Computer Science, G. Rozenberg and A. Salomaa, ed., World Scientific Series in Computer Science, Vol.
		by Juris Hartmanis, Richard Chang, J. Kadin and S. Mitchell, in Current Trends in Theoretical Computer Science, G. Rozenberg and A. Salomaa, ed., World Scientific Series in Computer Science, Vol.
	theorie.informatik.uni-ulm.de /Personen/toran/beatcs (873 words)

	[No title]
		Leo Harrington Gerald Sacks MIT 1973 Michael Harrison Harvey Garner Michigan 1963 Juris Hartmanis R.P. Dilworth Caltech 1955 A.
		Kowaltowski J.H. Morris Berkeley 1973 Dexter Kozen Juris Hartmanis Cornell 1977 Dean Krafft Bob Constable Cornell 1981 Dina Kravets Alok Aggarwal MIT 1992 Dina Kravets Tom Leighton MIT 1992 Hugo Krawczyk Oded Goldreich Technion 1990 Mark Krentel Vijay Vazirani Cornell 1986 Hans-Joerg Kreowski Hartmut Ehrig TU Berlin 1977 B.
		Vivian Sewelson Juris Hartmanis Cornell 1983 Jeffrey Shaffer Matthew Hecht Maryland 1978 Amitabh Shah Keith Marzullo Cornell 1990 Jeffrey Shallit Manuel Blum Berkeley 1983 Adi Shamir Zohar Manna Weizmann 1977 Eli Shamir Shmuel Agmon Hebrew ?
	sigact.acm.org /genealogy/database (4647 words)

	No Title
		Hartmanis, R. Chang, D. Ranjan and P. Rohatgi.
		Hartmanis, R. Chang, S. Chari, D. Ranjan and P. Rohatgi.
		Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan and P.
	www.cs.nmsu.edu /~dranjan/full-cv/full-cv.html (1844 words)

	The Mathematics Genealogy Project - Juris Hartmanis (Site not responding. Last check: 2007-11-07)
		Click here to see the students listed in chronological order.
		According to our current on-line database, Juris Hartmanis has 12 students and 143 descendants.
		If you have additional information or corrections regarding this mathematician, please use the update form.
	genealogy.math.ndsu.nodak.edu /html/id.phtml?id=10404 (78 words)

	david peleg - ResearchIndex document query
		On the Hardness of Approximating MAX k-CUT and its Dual - Kann, Khanna, Lagergren..
		Gil Neiger Tetsuo Asano Vassos Hadzilacos David Peleg Laszl# Babai Juris Hartmanis Andrew Pitts Eric
		Gil Neiger Tetsuo Asano Vassos Hadzilacos David Peleg Laszlo Babai Juris Hartmanis Andrew Pitts Eric
	citeseer.ist.psu.edu /cis?q=David+Peleg (486 words)

	AddALL.com - Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, ...
		AddALL.com - Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988
		Complexity Theory Retrospective: In Honor of Juris Hartmanis on the Occasion of His Sixtieth Birthday, July 5, 1988
		If you cannot find this book in our new and in print search, be sure to try our used and out of print search too!
	www.addall.com /detail/0387973508.html (86 words)

	E.W. Dijkstra Archive: Computing the future? (EWD1137)
		I read almost all of "Computing the future: a broader agenda for computer science and engineering", edited by Juris Hartmanis and Herbert Lin, for the National Research Council.
		The book is printed with soy ink on acid-free recycled stock (and that is perhaps the best we can say about it).
		Fortunately, the Appendix "Contributors to Computing the Future" mentions only one faculty member of UT Austin.
	www.cs.utexas.edu /~EWD/transcriptions/EWD11xx/EWD1137.html (802 words)

Try your search on: Qwika (all wikis)