<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<META NAME="Generator" CONTENT="MS Exchange Server version 5.5.2653.12">
<TITLE>RE: [OT] Two more algorithms books</TITLE>
</HEAD>
<BODY>
<P><FONT SIZE=2>Oops, the <insert expletive> list reply just got me (and I know better).</FONT>
</P>
<P><FONT SIZE=2>-david</FONT>
<BR><FONT SIZE=2>-----Original Message-----</FONT>
<BR><FONT SIZE=2>From: Pennell, David [<A HREF="mailto:DPennell@quallaby.com">mailto:DPennell@quallaby.com</A>]</FONT>
<BR><FONT SIZE=2>Sent: Wednesday, September 19, 2001 7:38 PM</FONT>
<BR><FONT SIZE=2>To: 'squeak-dev@lists.squeakfoundation.org'</FONT>
<BR><FONT SIZE=2>Subject: RE: [OT] Two more algorithms books</FONT>
</P>
<BR>
<P><FONT SIZE=2>Are you back from your vacation? </FONT>
<BR><FONT SIZE=2>I've made a bunch of fixes/improvements to GLORP. Jon recently </FONT>
<BR><FONT SIZE=2>started to work on it too... I think he has a couple of questions. </FONT>
<BR><FONT SIZE=2>-david </FONT>
<BR><FONT SIZE=2>> -----Original Message----- </FONT>
<BR><FONT SIZE=2>> From: Alan Knight [<A HREF="mailto:knight@acm.org">mailto:knight@acm.org</A>] </FONT>
<BR><FONT SIZE=2>> Sent: Wednesday, September 19, 2001 4:32 PM </FONT>
<BR><FONT SIZE=2>> To: squeak-dev@lists.squeakfoundation.org </FONT>
<BR><FONT SIZE=2>> Subject: Re: [OT] Two more algorithms books </FONT>
<BR><FONT SIZE=2>> </FONT>
<BR><FONT SIZE=2>> </FONT>
<BR><FONT SIZE=2>> I missed the original set of books, but a recent favourite of </FONT>
<BR><FONT SIZE=2>> mine, while </FONT>
<BR><FONT SIZE=2>> somewhat specialized, is the Gusfield book from Cambridge </FONT>
<BR><FONT SIZE=2>> called something </FONT>
<BR><FONT SIZE=2>> like "Algorithms on Strings, Trees and Sequences". While it's </FONT>
<BR><FONT SIZE=2>> a narrow </FONT>
<BR><FONT SIZE=2>> focus, its explanations of general algorithms are extremely </FONT>
<BR><FONT SIZE=2>> good, and it </FONT>
<BR><FONT SIZE=2>> covers quite an interesting sub-field. </FONT>
<BR><FONT SIZE=2>> </FONT>
<BR><FONT SIZE=2>> At 07:29 PM 9/16/2001 -0400, David N. Smith (IBM) wrote: </FONT>
<BR><FONT SIZE=2>> >All: </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> >Slightly off subject, but if you collect algorithm books, </FONT>
<BR><FONT SIZE=2>> here are two </FONT>
<BR><FONT SIZE=2>> >more worth taking a look at. Such books don't happen often, </FONT>
<BR><FONT SIZE=2>> but we seem to </FONT>
<BR><FONT SIZE=2>> >be in a small flurry right now. (See my earlier post about calendar </FONT>
<BR><FONT SIZE=2>> >algorithms.) </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> >This one is the second edition of a book published 11 years </FONT>
<BR><FONT SIZE=2>> ago that got </FONT>
<BR><FONT SIZE=2>> >rave reviews. It is huge, and "Introduction" does not mean </FONT>
<BR><FONT SIZE=2>> your 10 year </FONT>
<BR><FONT SIZE=2>> >old (or a typical freshman) will find it easy. I show an </FONT>
<BR><FONT SIZE=2>> augmented listing </FONT>
<BR><FONT SIZE=2>> >of Amazon's info here; The paper version is only $20 less and will </FONT>
<BR><FONT SIZE=2>> >probably be much more fragile. </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> >Introduction to Algorithms </FONT>
<BR><FONT SIZE=2>> >by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, cl Stein </FONT>
<BR><FONT SIZE=2>> >List Price: $69.95 </FONT>
<BR><FONT SIZE=2>> >Our Price: $69.95 </FONT>
<BR><FONT SIZE=2>> >Hardcover 2nd edition (September 2001) </FONT>
<BR><FONT SIZE=2>> >MIT Press; ISBN: 0262032937 ; Dimensions (in inches): 2.12 x </FONT>
<BR><FONT SIZE=2>> 9.33 x 8.33 </FONT>
<BR><FONT SIZE=2>> >ISBN 0-262-03293-7, 1184 pp. </FONT>
<BR><FONT SIZE=2>> >(Also available in paper.) </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> >Sedgewick is known for algorithm books FOR freshmen or </FONT>
<BR><FONT SIZE=2>> sophomores. He's </FONT>
<BR><FONT SIZE=2>> >massively expanded the coverage of his earlier books. I have </FONT>
<BR><FONT SIZE=2>> not seen </FONT>
<BR><FONT SIZE=2>> >Parts 1-4 (in one volume), but this one caught my eye; I </FONT>
<BR><FONT SIZE=2>> just got it and </FONT>
<BR><FONT SIZE=2>> >it is rich with info & code, and dense with information. His target </FONT>
<BR><FONT SIZE=2>> >audience seems to have changed. </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> >Algorithms in C Part 5: Graph Algorithms </FONT>
<BR><FONT SIZE=2>> >by Robert Sedgewick </FONT>
<BR><FONT SIZE=2>> >List Price: $34.99 </FONT>
<BR><FONT SIZE=2>> >Our Price: $34.99 </FONT>
<BR><FONT SIZE=2>> >Availability: Usually ships within 24 hours. </FONT>
<BR><FONT SIZE=2>> >Paperback - 512 pages 3nd edition (August 17, 2001) </FONT>
<BR><FONT SIZE=2>> >Addison-Wesley Pub Co; ISBN: 0201316633 ; Dimensions (in </FONT>
<BR><FONT SIZE=2>> inches): 0.78 x </FONT>
<BR><FONT SIZE=2>> >9.18 x 7.72 </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> > </FONT>
<BR><FONT SIZE=2>> >Dave </FONT>
<BR><FONT SIZE=2>> >-- </FONT>
<BR><FONT SIZE=2>> >_______________________________ </FONT>
<BR><FONT SIZE=2>> >David N. Smith </FONT>
<BR><FONT SIZE=2>> >IBM T J Watson Research Center </FONT>
<BR><FONT SIZE=2>> >Hawthorne, NY </FONT>
<BR><FONT SIZE=2>> >dnsmith@watson.ibm.com </FONT>
<BR><FONT SIZE=2>> </FONT>
<BR><FONT SIZE=2>> -- </FONT>
<BR><FONT SIZE=2>> Alan Knight [|], Cincom Smalltalk Development </FONT>
<BR><FONT SIZE=2>> knight@acm.org </FONT>
<BR><FONT SIZE=2>> aknight@cincom.com </FONT>
<BR><FONT SIZE=2>> <A HREF="http://www.cincom.com/scripts/smalltalk.exe/downloads/index.asp" TARGET="_blank">http://www.cincom.com/scripts/smalltalk.exe/downloads/index.asp</A> </FONT>
<BR><FONT SIZE=2>> </FONT>
<BR><FONT SIZE=2>> </FONT>
<BR><FONT SIZE=2>> </FONT>
<BR><FONT SIZE=2>> </FONT>
</P>
</BODY>
</HTML>