
	Where results make sense

Topic: John Hopcroft

Related Topics

Niklaus Wirth

Classic definition of republic

Marvin Minsky

Andy Devine

Allan Jones

Vaughn Monroe

Niels Bohr

October 14

October 8

Harry Houdini

October 7

Arabic script

October 9

Tony Wilson

Alfred Drake

In the News (Mon 4 Jun 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Department of Computer Science - Hopcroft Lecture
		John Hopcroft, of Cornell University, received the Turing Award -- the most prestigious award in Computer Science -- jointly with Robert Tarjan in 1986.
		The citation states that the award was given "for fundamental achievements in the design and analysis of algorithms and data structures." John Hopcroft is also well known for his books on algorithms and formal languages coauthored with Alfred Aho and Jeffrey Ullman.
		Hopcroft's current research is in the emerging discipline of information capture and access.
	www.cs.concordia.ca /hopcroft.html (150 words)

	Hopcroft symposium
		John Hopcroft is stepping down June 30 after eight years as dean of the College of Engineering.
		Of the 40 new faculty hired during the Hopcroft administration, 25 percent are women and 12 percent are underrepresented minorities.
		During his tribute to Hopcroft, Lee, whose company was formed last year from a merger of GTE and Bell Atlantic, noted that Hopcroft spends 20 percent of his time on fund-raising.
	www.news.cornell.edu /Chronicle/01/6.7.01/Hopcroft.html (624 words)

	John Hopcroft - Wikipedia, the free encyclopedia
		He received his bachelor's degree from Seattle University in 1961 and his master's degree and Ph.D. from Stanford University in 1962 and 1964, respectively.
		In addition to his research work, he is well known for his books on algorithms and formal languages coauthored with Jeffrey Ullman and Alfred Aho, regarded as classic texts in the field.
		John Hopcroft is the grandson of Jacob Nist, founder of the Seattle Box Company.
	en.wikipedia.org /wiki/John_Hopcroft (235 words)

	John E. Hopcroft
		John E. Hopcroft is the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University.
		An undergraduate alumnus of Seattle University, Hopcroft was honored with a Doctor of Humanities Degree, Honoris Causa, in 1990.
		Hopcroft's research centers on theoretical aspects of computing, especially analysis of algorithms, automata theory, and graph algorithms.
	www.cs.cornell.edu /jeh (504 words)

	DBLP: John E. Hopcroft
		John E. Hopcroft, Deborah Joseph, Sue Whitesides: On the Movement of Robot Arms in 2-Dimensional Bounded Regions.
		John E. Hopcroft, Robert Endre Tarjan: A V log V Algorithm for Isomorphism of Triconnected Planar Graphs.
		John E. Hopcroft, Robert Endre Tarjan: A V² Algorithm for Determining Isomorphism of Planar Graphs.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/h/Hopcroft:John_E=.html (1041 words)

	CRA Distinguished Service Award 2007
		John E. Hopcroft, the IBM Professor of Engineering and Applied Mathematics in Computer Science at Cornell University, was recognized for his remarkable record of service to the computing research community.
		At NSF, Hopcroft was active on various NSF advisory boards, including the National Science Board, where he chaired the Committee on Program and Plans that oversaw all major science funding, including computer science programs and the supercomputing centers.
		Hopcroft helped the Vietnam Educational Foundation build computer science education in Vietnam, and currently is working with the Millennium Foundation, with support from the World Bank, to help build science infrastructure in Chile.
	www.cra.org /Activities/awards/service/2007.html (512 words)

	John Hopcroft -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-11-01)
		John E. Hopcroft (born October 7, 1939) is a renowned theoretical (A scientist who specializes in the theory of computation and the design of computers) computer scientist.
		The citation states that he received the award "for fundamental achievements in the design and analysis of algorithms and data structures."
		John Hopcroft is the grandson of (Click link for more info and facts about Jacob Nist) Jacob Nist, founder of the (Click link for more info and facts about Seattle Box Company) Seattle Box Company.
	www.absoluteastronomy.com /encyclopedia/j/jo/john_hopcroft.htm (235 words)

	DBLP: John E. Hopcroft
		John E. Hopcroft, Deborah Joseph, Sue Whitesides: On the Movement of Robot Arms in 2-Dimensional Bounded Regions.
		John E. Hopcroft, Robert Endre Tarjan: A V log V Algorithm for Isomorphism of Triconnected Planar Graphs.
		John E. Hopcroft, Robert Endre Tarjan: A V² Algorithm for Determining Isomorphism of Planar Graphs.
	www.acm.org /sigmod/dblp/db/indices/a-tree/h/Hopcroft:John_E=.html (1080 words)

	BBC NEWS \| UK \| England \| Beds/Bucks/Herts \| Mother killed 'possessed' parents
		Hopcroft, of Crown Leys, Aylesbury, denied two counts of murder but admitted two lesser charges of manslaughter on the grounds of diminished responsibility.
		Hopcroft bowed her head as part of a transcript of her mother's 999 call was read to the court.
		In an interview with a police doctor after her arrest, Hopcroft described how she thought her parents were no longer themselves and she had to kill them.
	news.bbc.co.uk /2/hi/uk_news/england/beds/bucks/herts/2969788.stm (437 words)

	Citations: Introduction to Automata Theory - Hopcroft, Ullman (ResearchIndex) (Site not responding. Last check: 2007-11-01)
		Hopcroft, J. and J. Ullman: 1979, Introduction to Automata Theory, Languages, and Computation.
		Hopcroft, R. Motwani, and J. Ullman, Introduction to Automata Theory, Languages and Computation, 2nd ed.
		Hopcroft, J. & Ullman, J. Introduction to automata theory, languages, and compilation.
	citeseer.ist.psu.edu /context/2824/0 (664 words)

	DBLP: John E. Hopcroft
		John E. Hopcroft, Richard M. Karp: A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs.
		John E. Hopcroft, Jeffrey D. Ullman: Sets Accepted by One-Way Stack Automata Are Context Sensitive.
		John E. Hopcroft, Jeffrey D. Ullman: An Approach to a Unified Theory of Automata.
	www.vldb.org /dblp/db/indices/a-tree/h/Hopcroft:John_E=.html (931 words)

	CS 1401, Exam #2 (Site not responding. Last check: 2007-11-01)
		Today, October 7, is the 65th birthday of John E. Hopcroft, a renowned theoretical computer scientist.
		After designing a congratulatory press release about John Hopcroft, you realized that he likes to use his middle initial E. Write a code that, given a string release in which the name "John Hopcroft" appears exactly once, replaces his name in this release with "John E. Hopcroft".
		Hopcroft is known as one of the authors of a classical textbook on data structures and algorithms.
	www.cs.utep.edu /vladik/cs1401.04/test2.html (546 words)

	John_e_hopcroft (Site not responding. Last check: 2007-11-01)
		John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
		The examples, at times were just too complicated, and could have been done better with easy to understand examples...
		Yet another CS classic : This is yet another classic from the Aho Gang.It sets up a very formal framework for discussing alorithms, beginning at the beginning...
	books.mysic.ca /Author/John_E_Hopcroft (472 words)

	Introduction to Automata Theory, Languages, and Computation (2nd Edition) by John E. Hopcroft 0201441241 - Direct ... (Site not responding. Last check: 2007-11-01)
		Hopcroft's book is a very good introduction to the theory of computing, from finite automata to undecidability.
		He introduces the text with a crash course in proofs, which is useful for a text of this nature.
		The material can at times seem a bit outdated since the computing world has changed by several orders of magnitude since their original work, but it still provides a solid foundation in the philosophy and mathematics of computing.
	www.directtextbook.com /reviews/0201441241 (925 words)

	Alfred Aho Information
		He is also a co-author (along with Ullman and John Hopcroft) of a number of widely used textbooks on several areas of computer science, including algorithms and data structures, and the foundations of computer science.
		Aho has received many prestigious honors, including the IEEE's John von Neumann Medal and membership in both the American Academy of Arts and Sciences and the National Academy of Engineering.
		He holds honorary doctorates from the University of Waterloo and the University of Helsinki in Finland, and is a Fellow of the American Association for the Advancement of Science, ACM, Bell Labs, and IEEE.
	www.bookrags.com /wiki/Alfred_Aho (317 words)

	nsffy99
		The two witnesses were Neal Lane, director of the NSF, and Dr. John Hopcroft, a member of the National Science Board, which is the governing body of NSF.
		Hopcroft and Lane both provided brief testimonies explaining the major NSF themes for FY99: Knowledge and Distributed Intelligence; Life and Earth's Environment; and Educating for the Future.
		Hopcroft added that setting priorities within disciplines is easily done by peer-review, but it is more difficult to set priorities between fields of study.
	www.agiweb.org /gap/hearings/nsffy99.html (437 words)

	[No title] (Site not responding. Last check: 2007-11-01)
		Hopcroft to give Chancellor's Distinguished Lecture on March 23
		John Hopcroft, dean of engineering at Cornell University, will speak at 3:30 p.m.
		He is one of the best known people in the world," said S.S. Iyengar, LSU professor of computer science.
	appl003.lsu.edu /UNV002.NSF/(NoteID)/A690FD611ED9506D86256A080071DFD9?OpenDocument (121 words)

	Nat' Academies Press, Computing, Communication, and the Information Age (1994)
		OCR for page R1 by John E. Hopcroft Joseph C. Ford Professor of Computer Science Cornell University NATIONAL ACADEMY PRESS Washington, D.C. OCR for page R2 The National Research Council serves as an independent advisor to the federal government on scientific and technical questions of national importance.
		Professor Hopcroft's lecture began, as do all ISLS lectures, in the auditorium of the National Academy of Sciences building in Washington, D.C. The lecture was presented on October 23, 1992, to approximately 100 members of the Washington information sciences community and was then presented outside the country in two tours.
		On November 5-6 Professor Hopcroft delivered the ISLS lecture and a technical lecture (“Toward a Science Base for Electronic Prototyping”) at the Hong Kong University of Science and Technology and visited the United Nations University International Institute for Software Technology in Macau.
	www.nap.edu /books/NX005759/html/R1.html (1372 words)

	John Hopcroft - Encyclopedia, History, Geography and Biography
		John Hopcroft - Encyclopedia, History, Geography and Biography
		This page was last modified 21:56, 6 Apr 2005.
		This encyclopedia, history, geography and biography article about John Hopcroft contains research on
	www.arikah.com /encyclopedia/John_Hopcroft (255 words)

	Professor John Hopcroft's visit to Asia. Basic information (Site not responding. Last check: 2007-11-01)
		This year, the Lecturer is Professor John Hopcroft, the Joseph C. Ford Professor of Computer Science at Cornell University.
		John E. Hopcroft is the Joseph C. Ford Professor of Computer Science and
		Professor Hopcroft is widely recognized for his pioneering work in the
	www.atip.org /public/atip.reports.92/hopcroft.abs.html (844 words)

	[No title]
		Aho, Alfred V., John E. Hopcroft, and Jeffrey D. Ullman, Data Structures and Algorithms, Addison Wesley, Reading, Ma, 1982.
		Boguraev, Branimir K., Edward J. Briscoe, John Carroll, David Carter, and Claire Grover, 'The derivation of grammatically indexed lexicon from the Longman Dictionary of Contemporary English,' ACL Proceedings, 25th Annual Meeting, pp.
		Hopcroft, John and Jeffrey Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, Reading, Massachusetts, 1979.
	www.cs.bham.ac.uk /research/poplog/contrib/nlp_book/pop11/bibliog.txt (5624 words)

	Greg's Home Page at SDSC
		Alfred Aho, John Hopcroft and Jeffrey Ullman, Addison-Wesley, 1st edition, 1983.
		John Levine, Tony Mason and Doug Brown, O'Reilly & Associates, 2nd edition, 1992.
		Howard Anton and Chris Rorres, John Wiley and Sons, 6th edition, 1991.
	www.sdsc.edu /~johnson/home_books.html (458 words)

	Learn more about John Hopcroft in the online encyclopedia. (Site not responding. Last check: 2007-11-01)
		Learn more about John Hopcroft in the online encyclopedia.
		Enter a phrase or search word in the box below.
		Hint: Play with putting spaces before and after your words to see the different results you get.
	www.onlineencyclopedia.org /j/jo/john_hopcroft.html (237 words)

	[No title]
		Alfred A. Aho, John E. Hopcroft and Jeffrey D. Ullman.
		John A. Allen, Pat Langley and Stan Matwin.
		John Wiley and Sons, New York, NY, 1966.
	www.csee.usf.edu /~bhatpuli/Research/thesis.html (3199 words)

	New lower bounds for Hopcroft's problem
		We obtain slightly higher bounds for the counting version of Hopcroft's problem in four or more dimensions.
		As a related result, using a straightforward adversary argument, we derive a quadratic lower bound on the complexity of Hopcroft's problem in a surprisingly powerful decision tree model of computation.
		Update (26 Sep 2000): Braß and Knauer, using recent work of Bárány, Harcos, Pach, and Tardos, recently discovered a set of n points and m hyperplanes, where at most d hyperplanes pass through any point, with a large number of point-hyperplane incidences.
	compgeom.cs.uiuc.edu /~jeffe/pubs/hopcroft.html (361 words)

	NSB-97-***
		Jaskolski, Lubchenco, and Hopcroft expressed concern about the audience and objectives to be addressed by the statement, and urged that the statement be kept simple for a broad audience.
		Hopcroft further urged that, if the purpose is to tell the audience how to improve the system, that the paper focus on a small number of recommendations, which can be firmly endorsed by the Board, with good evidence that they would work.
		Hopcroft, Chairman, Committee on Programs and Plans (CPP), reported that in addition to the three items acted on during the Board’s Closed Session, the Committee discussed how major research projects would be brought to CPP in the future.
	ustimss.msu.edu /opensess.htm (9368 words)

	Introduction to Automata Theory, Languages, and Computation (2nd Edition) by John E. Hopcroft Rajeev Motwani Jeffrey D. ... (Site not responding. Last check: 2007-11-01)
		Introduction to Automata Theory, Languages, and Computation (2nd Edition) by John E. Hopcroft Rajeev Motwani Jeffrey D. Ullman
		by: Written by: John E. Hopcroft Rajeev Motwani Jeffrey D. Ullman
		This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity.
	www.internetcross.com /item/0201441241 (701 words)

	G51MAL 2005: Main Page
		Either way, do not expect these notes to be a complete or even self-contained record of all that was said and discussed during the lectures.
		The book Introduction to Automata Theory, Languages, and Computation, 2nd edition [HMU01] by John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman is the main reference for the course.
		The 1979 first edition of Introduction to Automata Theory, Languages, and Computation [HU79] by John E. Hopcroft and Jeffrey D. Ullman is very thorough and a classic in the field.
	www.cs.nott.ac.uk /~nhn/G51MAL (667 words)

	New Lower Bounds for Hopcroft's Problem (Extended Abstract) (ResearchIndex) (Site not responding. Last check: 2007-11-01)
		This document uses CoBlitz to cache paper downloads.
		We define a general class of partitioning algorithms, and show that in the worst...
		0.1: On the Embedding Phase of the Hopcroft and Tarjan Planarity..
	citeseer.ist.psu.edu /120675.html (493 words)

	Computer Science Colloquium - September 9
		This talk will sketch the underlying theory that supports new activities in access to information such as locating and clustering data, spectral analysis and collaborative filtering.
		John E. Hopcroft is a renowned theoretical computer scientist.
		He received the Turing award, the most prestigious award in the field, jointly with Robert Tarjan in 1986.
	web.gc.cuny.edu /ComputerScience/cs_cllqm/talks/2004_09_23.html (213 words)

	Natural Communities in Large Linked Networks - Hopcroft, Khan, Kulis, Selman (ResearchIndex) (Site not responding. Last check: 2007-11-01)
		John Hopcroft, Omar Khan, Brian Kulis, and Bart Selman Department of Computer...
		Hopcroft, O. Khan, B. Kulis, and B. Selman.
		@misc{ hopcroft03natural, author = "J. Hopcroft and O. Khan and B. Kulis and B. Selman", title = "Natural communities in large linked networks", text = "J. Hopcroft, O. Khan, B. Kulis, and B. Selman.
	citeseer.lcs.mit.edu /hopcroft03natural.html (464 words)

Try your search on: Qwika (all wikis)