Date: Fri, 24 May 2002 23:38:53 -0500 From: Alan Cox <alc@cs.rice.edu> To: Robert Watson <rwatson@FreeBSD.org> Cc: Mike Silbersack <silby@silby.com>, cvs-committers@FreeBSD.org, cvs-all@FreeBSD.org Subject: Re: cvs commit: src/sys/vm vm_map.c vm_map.h Message-ID: <20020525043853.GG22588@cs.rice.edu> In-Reply-To: <Pine.NEB.3.96L.1020524212137.70658G-100000@fledge.watson.org> References: <20020523221001.X18281-100000@patrocles.silby.com> <Pine.NEB.3.96L.1020524212137.70658G-100000@fledge.watson.org>
next in thread | previous in thread | raw e-mail | index | archive | help
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 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?20020525043853.GG22588>