
	Where results make sense

Topic: Thomas H Cormen

In the News (Thu 16 Feb 12)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Ron Rivest - Wikipedia, the free encyclopedia
		He is a co-author of Introduction to Algorithms (also known as 'CLRS'), a standard textbook on algorithms, with Thomas H. Cormen, Charles E. Leiserson and Clifford Stein.
		Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L. Introduction to Algorithms, first edition, MIT Press and McGraw-Hill.
		Cormen, Thomas H. Leiserson, Charles E. Rivest, Ronald L. Stein, Clifford (2001).
	en.wikipedia.org /wiki/Ron_Rivest (421 words)

	Dartmouth News - Computer Science project creates connection - 10/28/02
		One example is the work of Thomas H. Cormen, associate professor in computer science, and Christiana "Cricket" Toomey '04, a Dartmouth sophomore and an engineering major.
		Cormen is the coauthor of Introduction to Algorithms, the top college textbook on algorithms used by students across the country.
		Cormen says that with many students, mentorship extends after the immediate project, and often beyond graduation.
	www.dartmouth.edu /~news/releases/2002/oct/102802.html (309 words)

	Amazon.co.uk: Introduction to Algorithms: Books: Thomas H. Cormen,Stein Clifford,Charles E. Leiserson,Robert L. Rivest (Site not responding. Last check: 2007-10-30)
		I've had Cormen (one of the authors) as a professor in class, and my algorithms class uses this book, so admittedly my view might be a bit biased.
		Cormen always explains to his intro CS students why the study of algorithms is important, even as computers get faster and faster: some problems, poorly implemented, just will not run as well on a machine of today compared to a much older machine running a better algorithm.
		Cormen, he wouldn't be able to write the book off with the title of "pompous" or "eggheaded" either...
	www.amazon.co.uk /exec/obidos/ASIN/0262531968 (1490 words)

	DBLP: Thomas H. Cormen
		Thomas H. Cormen, James C. Clippinger: Performing BMMC Permutations Efficiently on Distributed-Memory Multiprocessors with MPI.
		Thomas H. Cormen, Kristin Bruhl: Don't Be Too Clever: Routing BMMC Permutations on the MasPar MP-2.
		Thomas H. Cormen, Jake Wegmann, David M. Nicol: Multiprocessor Out-of-core FFTs with Distributed Memory and Parallel Disks (extended abstract).
	informatik.uni-trier.de /~ley/db/indices/a-tree/c/Cormen:Thomas_H=.html (384 words)

	Computational and Applied Sciences Colloquium Series (Site not responding. Last check: 2007-10-30)
		Dr. Cormen will discuss how to perform out-of-core FFTs with parallel disks on both uniprocessors and multiprocessors, and in one dimension and multiple dimensions.
		Thomas H. Cormen is an Associate Professor in the Dartmouth College Department of Computer Science, where he has worked since 1992.
		Professor Cormen is coauthor of the textbook, Introduction to Algorithms, which he wrote with Charles E. Leiserson and Ronald L. Rivest.
	www.albany.edu /feature2000/special/colloquium_series.html (259 words)

	CSAIL Biography
		He is currently developing the Cilk multithreaded language, which has been used to program several parallel chess-playing programs that have won numerous prizes in international competition.
		His textbook, Introduction to Algorithms, coauthored with Ronald L. Rivest and Thomas H. Cormen was named "Best 1990 Professional and Scholarly Book in Computer Science and Data Processing" by the Association of American Publishers.
		Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, MIT Press and McGraw-Hill, 1990.
	www.csail.mit.edu /biographies/PI/bioprint.php?PeopleID=29 (389 words)

	CIDEC Library: Cormen * Introduction to Algorithms (Site not responding. Last check: 2007-10-30)
		Thomas H. Charles E. Ronald L. Series: The MIT Electrical Engineering and Computer Science Series
		Major chapters cover mathematical foundations, sorting and order statistics, data structures, advanced design and analysis techniques, advanced data structures, and graph algorithms.
		As a reference, it is well presented in a 7-page table of contents, beautifully indexed in a 32-page index which includes notational symbols, and well presented in that the separate chapters deliver their contents independently."--G. Michael Van Ty Smith, RMS Associates NASA STI Facility, in Sci-Tech News*
	www.cs.ioc.ee /yik/lib/4/Cormen1.html (170 words)

	CormenEtAl - PineWiki
		Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms: Second Edition, MIT Press, 2001.
		Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, MIT Press, 1990.
		Not currently used in CS365, although it has been in the past.
	pine.cs.yale.edu /pinewiki/CormenEtAl (66 words)

	Amazon.com: Reviews for Introduction to Algorithms, Second Edition: Books: Thomas H. Cormen,Charles E. Leiserson,Ronald ... (Site not responding. Last check: 2007-10-30)
		The exercises and problems seem to exist mainly as a source of test questions for professors (my opinion).
		Cormen has published the following on his website regarding solutions to the exercises: "please do not ask me for solutions; I will not respond.
		In short there is tremendous demand for an algorithms book that has both questions and answers.
	amazon.com /gp/product/customer-reviews/0262032937 (1711 words)

	Big O notation - Wikipedia, the free encyclopedia
		The Art of Computer Programming, Volume 1: Fundamental Algorithms, Third Edition.
		Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
		This page was last modified 13:06, 3 September 2006.
	en.wikipedia.org /wiki/Big_O_notation (1704 words)

	0262031418 - Introduction to Algorithms by Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest (Site not responding. Last check: 2007-10-30)
		0262031418 - Introduction to Algorithms by Thomas H. Cormen; Charles E. Leiserson; Ronald L. Rivest
		Some shelfwear, minor creasing a small tape mend, but otherwise a clean copy.
		Cormen, Thomas H., And Leiserson, Charles Eric, And Rivest, Ronald L
	www.biblio.com /isbnsearch.php?isbn=0262031418 (357 words)

	Thomas H. Cormen Books - Signed, used, new, out-of-print
		Customers in the US and Canada must order the Cloth edition of this title.
		Introduction to Algorithms is a comprehensive and fully understandable introduction to the study of algorithms that makes it suitable for use as a text, handbook or general reference.
		Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical...
	www.alibris.com /search/books/author/Thomas_H._Cormen (254 words)

	thomas h cormen - ResearchIndex document query (Site not responding. Last check: 2007-10-30)
		20 Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest,
		Out-of-Core FFTs with Parallel Disks - Thomas Cormen (1997)
		LR90] Thomas H. Cormen, Charles S. Leiserson, and Ronald L. Rivest.
	citeseer.ist.psu.edu /cis?q=Thomas+H.+Cormen (356 words)

	H&R BLOCK TAX CUT (Site not responding. Last check: 2007-10-30)
		The University of Tennessee, Frank H. McClung Museum, a University of Tennessee
		The ordinary isotope of hydrogen, H, is known as Protium, the other two isotopes
		William H. Calvin: Brains, climate, and human evolution
	h.taxs.ws (233 words)

	Références (Site not responding. Last check: 2007-10-30)
		Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Algorithms, MIT Press, 1990.
		Gaston H. Gonnet, Riccardo Baeza-Yates, Handbook of Algorithms and Data Structures, In Pascal and C, Addison Wesley, 1991.
		John H. Hennessy, David A. Patterson, Computer Architecture, A Quantitative Approach, Morgan Kaufmann Publishers, Inc., 1990.
	www.enseignement.polytechnique.fr /informatique/IF/poly/main013.html (842 words)

	Amazon.com: Reviews for Introduction to Algorithms, Second Edition: Books: Thomas H. Cormen,Charles E. Leiserson,Ronald ... (Site not responding. Last check: 2007-10-30)
		Amazon.com: Reviews for Introduction to Algorithms, Second Edition: Books: Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein
		Review of Introduction to Algorithms by Cormen and Others, February 5, 2006
		If Cormen and company can't meet this need, then perhaps there are some other knowledgeable people out there who can write one.
	www.amazon.com /Introduction-Algorithms/dp/customer-reviews/0262032937 (1711 words)

	DartCVL: The Dartmouth C Vector Library (ResearchIndex) (Site not responding. Last check: 2007-10-30)
		Give feedback on RSS feeds for document recommendations in CiteSeer.
		Thomas H. Cormen, Sumit Chawla, Preston Crow, Melissa Hirschl, Roberto Hoyle, Keith D. Kotay, Rolf H. Nelson, Nils Nieuwejaar, Scott M. Silver, Michael B. Taylor, Rajiv Wickremesinghe
		Because the MasPar MP-1 and MP-2 are functionally equivalent, both DartCVL and UnCvl will run on either.
	citeseer.ist.psu.edu /cormen95dartcvl.html (315 words)

	Amazon.com: Introduction to Algorithms, Second Edition: Books: Thomas H. Cormen,Charles E. Leiserson,Ronald L. ... (Site not responding. Last check: 2007-10-30)
		Amazon.com: Introduction to Algorithms, Second Edition: Books: Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein
		Join Amazon Prime and ship Two-Day for free and Overnight for $3.99.
		I am one of the authors of this book.
	www.amazon.com /exec/obidos/tg/detail/-/0262032937?v=glance (2221 words)

	Performing out-of-core FFTs on parallel disk systems by Thomas H. Cormen
		Performing out-of-core FFTs on parallel disk systems by Thomas H. Cormen
		The Fast Fourier Transform (FFT) plays a key role in many areas of computational science and engineering.
		It uses the BMMC permutation algorithm of Cormen, Sundquist, and Wisniewski as a key subroutine to perform the initial bit-reversal permutation and to permute data between stages of ``mini-FFTs'' that each fit in memory.
	www.ima.umn.edu /hpc/wkshp_abstracts/cormen1.html (362 words)

	Thomas,HR Books - Signed, used, new, out-of-print
		A text-book of histology arranged upon an embryological basis
		by Philipp Stöhr, Frederic Thomas Lewis, John Lewis Bremer
		Stöhr's histology : arranged upon an embroyological basis
	www.alibris.com /search/books/author/Thomas,HR (87 words)

	CheapUniBooks - browse books by title - "I" - UK student book price comparison
		Images from Otherland [Paperback] by William H. Brown III
		Interpretation of Bloodstain Evidence at Crime Scenes (Practical Aspects of Criminal and Forensic Investigation) [Hardcover] by Stuart H. James
		Introduction to Algorithms [Hardcover] by Thomas H. Cormen
	www.cheapunibooks.co.uk /browse.cgi/alphabetical/I (4582 words)

	Amazon.ca: Introduction to Algorithms, Second Edition: Books: Thomas H. Cormen,Charles E. Leiserson,Ronald L. ... (Site not responding. Last check: 2007-10-30)
		Amazon.ca: Introduction to Algorithms, Second Edition: Books: Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein
		Poorly written with lack of ways to test yourself, April 20 2004
		While many have noted how Thomas Corwen and his co-authors have added a scholarly touch to this subject with plenty of proofs it does not make for a good text.
	amazon.ca /Introduction-Algorithms-Second-Thomas-Cormen/dp/0262032937 (2022 words)

	Cormen/Leiserson/Rivest/Stein: Introduction to Algorithms (Site not responding. Last check: 2007-10-30)
		This is the authors' homepage for the textbook, Introduction to Algorithms (Second Edition) by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Cliff Stein, published by MIT Press and McGraw-Hill.
		Here is the MIT Press homepage for CLRS.
		Here is a recent version of the known
	theory.lcs.mit.edu /~clr (73 words)

	Introduction to Algorithms, by Cormen, 2nd Edition Cormen, Thomas H./ Leiserson, Charles E./ Rivest, Ronald L./ Stein, ...
		Introduction to Algorithms, by Cormen, 2nd Edition Cormen, Thomas H./ Leiserson, Charles E./ Rivest, Ronald L./ Stein, Clifford- Textbook - Bookbyte.com
		BRAND NEW 2ND INTERNATIONAL SOFTCOVER EDITION BOOK ONLY.
		2.01 D 8.22 W 9.30 H 4.70 Weight
	www.bookbyte.com /product.aspx?isbn=0262032937 (318 words)

	GRAND-CHALLENGE.NET: TACKLING THE HARDEST PROBLEMS ........
		According to the most recent data available, the top 36 computer science departments in the United States saw enrollments drop nearly 20 percent between 2000 and 2004."...
		Introduction to Algorithms, Second Edition by Thomas H. Cormen
		Posted by E Moritz @ 08:49 PM CST [Link]
	www.grand-challenge.net (3008 words)

Try your search on: Qwika (all wikis)