Are you looking for solutions to exercises and problems in
Introduction to Algorithms?
If you are, then see the frequently asked
question and answer below.
If you request solutions from me, I will not respond.
I receive many requests from students who want to work with me as
interns or as graduate students. I am not taking on any interns or
new graduate students at this time.
Graduate Students
Current graduate student:
Former graduate students:
- Alex Colvin, Ph.D. 1999
- Elena Riccio Davidson, Ph.D. 2006
- Geeta Chaudhry Petrovic, Ph.D. 2004 [Photo of Geeta and me at 2004 Dartmouth graduation]
- Len Wisniewski, Ph.D. 1996
- Melissa Hirschl Chawla, M.S. 1997
- Michael Ringenburg, M.S. 2001
- Georgi Vassilev, M.S. 1994
Introduction to Algorithms
Yes, I am coauthor of Introduction to Algorithms, along with Charles Leiserson, Ron Rivest, and Cliff Stein. Here are
answers to a few frequently asked questions about Introduction to
Algorithms:
- I see that there are two versions of the second edition,
one published by The MIT Press and one published by McGraw-Hill.
How do the two versions differ?
- Other than minor differences in the covers, the book content
in the two versions is identical. McGraw-Hill also includes a CD
(see the next question).
- Are the algorithms in the book implemented in a real programming
language, rather than just pseudocode?
- McGraw-Hill now includes with the book a CD containing Java
implementations of all the algorithms in Parts I-VI. The CD also
has Javadoc-generated web pages that document all the classes.
- Where can I find a list of errata?
- We maintain an errata page that allows
you to list errors by date, by page, by severity, or by discoverer.
There is even an incremental update feature, allowing you to list
only the errors posted since the last date that you asked about.
- How do I report errors?
- First, please visit the errata page
to verify that the error has not been reported already. Once
you have determined that you have found an unreported error,
send email to algorithm-bugs@mitpress.mit.edu. We will respond as quickly as possible, often within a day.
- Do you correct errors?
- Yes. Each time a new printing is produced, it contains corrections
to all errors that have been reported by that time. The errata page indicates in which printing
each error was corrected.
- What is the difference between an edition and a printing?
- Each edition is a major revision of the book. The first edition
of Introduction to Algorithms was published in 1990, and
the second edition did not appear until 2001. A printing for a
given edition occurs when the publisher needs to manufacture more
copies. As the answer to the previous question indicates, we
have been correcting errors in each printing of the second
edition. We perturb the pagination as little as possible when
correcting errors for a new printing.
- Can I get solutions to exercises and
problems?
- If you are an instructor who has adopted the book for course use,
yes. Otherwise, no, and please do not ask me for solutions; I
will not respond.
Instructors who have adopted the book for course use can get
the Instructor's Manual, which has lecture notes and solutions
to some (but not all) of the exercises and problems. You'll
need to contact either The MIT Press (if you are outside the U.S.
and Canada) or McGraw-Hill (if you are within the U.S. or Canada)
for passwords to access the manual site and the files. You cannot
get the passwords from me or from any of my coauthors.
- How can I typeset pseudocode to make it look like the pseudocode
in the book?
- In June 2003, I made available the
clrscode package
for LaTeX2e. You can download the package and its documentation
(in either PostScript or PDF) by clicking here. The package is also on the
CTAN website.
- Where are the web sites for the book?
- The MIT Press site is http://mitpress.mit.edu/algorithms.
The McGraw-Hill site is http://catalogs.mhhe.com/mhhe/viewProductDetails.do?isbn=0072970545,
and you can find the McGraw-Hill Online Learning Center for the
book at http://www.introductiontoalgorithms.com
(also http://www.introtoalgorithms.com).
Miscellaneous Personal Stuff
My brother-in-law, Tony Pecora, is the first patient in the US to
undergo the Edmonton Protocol for treatment of juvenile diabetes.
Check out his website at http://www.isletsupporter.com.
My wife, Nicole, and I took a Barbecue tour of
the South in August 1998.
I was the Ice Man for the Maryland
State Barbecue Championship in 2003, 2004, and 2005. Here's a photo from the 2005 contest of me with a
quad-runner full of 40-pound bags of ice. The photo was taken by the
Dizzy Pigs, the 2005 and
2006 Grand Champions. Even with the megaphone, I was pretty hoarse by
the end of the second day. The Dizzy Pigs, and all the other
contestants, can explain why.
In September 1997, Nicole and I finished hiking all 48 of the
4000-foot peaks in the White
Mountains of New Hampshire.
Contact Information
I am on sabbatical July 1, 2008 through June 30, 2009. The best way
to contact me is by email at thc@cs.dartmouth.edu. If you
must find me some other way:
U.S. Mail:
Department of Computer Science
Dartmouth College
6211 Sudikoff Laboratory
Hanover, NH 03755-3510
Office:
204 Sudikoff Laboratory
Phone:
Voice: 603-646-2417
Fax: 603-646-1672
|
Back to Dartmouth Computer Science Home Page
