Date: Sat, 25 May 2002 14:09:28 -0500 (CDT) From: Mike Silbersack <silby@silby.com> To: Alan Cox <alc@cs.rice.edu> Cc: Robert Watson <rwatson@FreeBSD.org>, <cvs-committers@FreeBSD.org>, <cvs-all@FreeBSD.org> Subject: Re: cvs commit: src/sys/vm vm_map.c vm_map.h Message-ID: <20020525140714.O3212-100000@patrocles.silby.com> In-Reply-To: <20020525043853.GG22588@cs.rice.edu>
next in thread | previous in thread | raw e-mail | index | archive | help
On Fri, 24 May 2002, Alan Cox wrote: > On Fri, May 24, 2002 at 09:22:49PM -0400, Robert Watson wrote: > > > > I believe they were invented by Danny Sleator at CMU a fair while ago as > > part of his work on amortized analysis. Other related and interesting > > structures are skip lists, and so on. Any decent algorithms text should > > discuss these in detail, and the pertinent details of amortized analysis. > > > > Should, but don't. Most notably the very popular "Introduction to > Algorithms" by Cormen, Leiserson, and Rivest doesn't. Knuth's books > are too old. Sedgewick describes them but doesn't do the analysis. > The best reference that I can suggest is any one of several related > books by Weiss, in particular, his latest data structures in Java > book. It describes both the algorithm and the analysis. > > Alan I picked up Intro to Algorithms last summer because I thought it would teach me about many neat algorithms. I was disappointed to find out that the authors tend to focus more on proofs of a small number. I haven't read any of the Knuth books, I'll probably get around to that one of these days. Thanks for the pointer to the Weiss books, I'll see if I can find some of those as well. Mike "Silby" Silbersack To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe cvs-all" in the body of the message
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20020525140714.O3212-100000>