The.Algorithm.Design.Manual.Springer-Verlag.1998
The.Algorithm.Design.Manual.Springer-Verlag.1998 The.Algorithm.Design.Manual.Springer-Verlag.1998
Handbook of Algorithms and Data Structures Handbook of Algorithms and Data Structures The Handbook of Data Structures and Algorithms , by Gonnet and Baeza-Yates, provides a comprehensive reference on fundamental data structures for searching and priority queues, and algorithms for sorting and text searching. The book covers these relatively small number of topics comprehensively, presenting most of the major and minor variations which appear in the literature. Perusing the book makes one aware of the tremendous range of data structures which have been developed, and the intense level of analysis many of them have been subjected to. For each data structure or algorithm, a brief description is provided along with its asymptotic complexity and an extensive set of references. More distinctively, an implementation in C and/or Pascal is usually provided, along with experimental results comparing the performance of these implementations on a variety of distributions. The authors have created a very slick WWW site for the book, http://www.dcc.uchile.cl/~rbaeza/handbook/hbook.html , containing all the source code as well as the index and table of contents. This entire site has been replicated in the local distribution site , although this copy still contains ftp links to Chile for the algorithm implementations. However, all of these files are also available locally . These files are all copyrighted © Addison-Wesley Publishing Co. Inc. Since many of the elementary data structures and sorting algorithms can be implemented concisely, most of the programs are very short. They are perhaps most useful as models, or as part of an experimental study to compare the performance on different data structures for a particular application. ● Link to Handbook of Algorithms and Data Structures ● Local copies of all the algorithm implementations ● Local copy of original site, but with FTP calls to Chile for certain algorithm implementations Problem Links ● Dictionaries (8) ● Priority Queues (7) ● Searching (7) ● Sorting (7) ● Arbitrary Precision Arithmetic (6) ● Median and Selection (6) ● Finite State Machine Minimization (5) ● String Matching (4) file:///E|/WEBSITE/IMPLEMEN/HANDBOOK/IMPLEMEN.HTM (1 of 2) [19/1/2003 1:37:37]
Handbook of Algorithms and Data Structures ● Kd-Trees (3) ● Approximate String Matching (2) ● Range Search (2) ● Suffix Trees and Arrays (2) About the Book Send us Mail Go to Main Page This page last modified on May 21, 1997. file:///E|/WEBSITE/IMPLEMEN/HANDBOOK/IMPLEMEN.HTM (2 of 2) [19/1/2003 1:37:37]
- Page 1221 and 1222: 1.3.8 Calendrical Calculations Go t
- Page 1223 and 1224: 1.3.9 Job Scheduling ● Feedback E
- Page 1225 and 1226: 1.4.2 Topological Sorting Related P
- Page 1227 and 1228: 1.4.8 Edge and Vertex Connectivity
- Page 1229 and 1230: 1.4.10 Drawing Graphs Nicely ● Pl
- Page 1231 and 1232: 1.4.11 Drawing Trees ● Planarity
- Page 1233 and 1234: 1.4.12 Planarity Detection and Embe
- Page 1235 and 1236: 1.5.2 Independent Set ● Vertex Co
- Page 1237 and 1238: 1.5.3 Vertex Cover ● Independent
- Page 1239 and 1240: 1.5.4 Traveling Salesman Problem
- Page 1241 and 1242: 1.5.6 Graph Partition ● Network F
- Page 1243 and 1244: 1.5.7 Vertex Coloring Related Probl
- Page 1245 and 1246: 1.5.11 Feedback Edge/Vertex Set Go
- Page 1247 and 1248: 1.6.1 Robust Geometric Primitives G
- Page 1249 and 1250: 1.6.6 Range Search ● Kd-Trees ●
- Page 1251 and 1252: 1.6.8 Intersection Detection ● Ro
- Page 1253 and 1254: 1.6.16 Minkowski Sum Go to the corr
- Page 1255 and 1256: 1.7.1 Set Cover ● Set Packing ●
- Page 1257 and 1258: 1.7.2 Set Packing Go to the corresp
- Page 1259 and 1260: 1.7.3 String Matching ● Approxima
- Page 1261 and 1262: 1.7.4 Approximate String Matching
- Page 1263 and 1264: 1.7.5 Text Compression Go to the co
- Page 1265 and 1266: 1.7.6 Cryptography ● Text Compres
- Page 1267 and 1268: 1.7.7 Finite State Machine Minimiza
- Page 1269 and 1270: 1.7.8 Longest Common Substring ●
- Page 1271: 1.7.9 Shortest Common Superstring G
- Page 1275 and 1276: Moret and Shapiro's Algorithms P to
- Page 1277 and 1278: Index B Up: Index - All Index: B ba
- Page 1279 and 1280: Index C Up: Index - All Index: C ch
- Page 1281 and 1282: Index E Up: Index - All Index: E ed
- Page 1283 and 1284: Index G Up: Index - All Index: G ga
- Page 1285 and 1286: Index I Up: Index - All Index: I in
- Page 1287 and 1288: Index L Up: Index - All Index: L li
- Page 1289 and 1290: Index N Up: Index - All Index: N ne
- Page 1291 and 1292: Index P Up: Index - All Index: P pa
- Page 1293 and 1294: Index R Up: Index - All Index: R RA
- Page 1295 and 1296: Index S successor supercomputer , s
- Page 1297 and 1298: Index U Up: Index - All Index: U un
- Page 1299 and 1300: Index W Up: Index - All Index: W wo
- Page 1301 and 1302: Index (complete) bin packing bipart
- Page 1303 and 1304: Index (complete) Fourier transform
- Page 1305 and 1306: Index (complete) parenthesization p
- Page 1307 and 1308: Index (complete) symmetry, exploiti
- Page 1309 and 1310: Ranger - Nearest Neighbor Search in
- Page 1311 and 1312: DIMACS Implementation Challenges Pe
- Page 1313 and 1314: Stony Brook Project Implementations
- Page 1315 and 1316: Clarkson's higher dimensional conve
- Page 1317 and 1318: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1319 and 1320: file:///E|/WEBSITE/BIBLIO/TESTDATA/
- Page 1321 and 1322: file:///E|/WEBSITE/BIBLIO/TESTDATA/
Handbook of <strong>Algorithm</strong>s and Data Structures<br />
● Kd-Trees (3)<br />
● Approximate String Matching (2)<br />
● Range Search (2)<br />
● Suffix Trees and Arrays (2)<br />
About the Book<br />
Send us Mail<br />
Go to Main Page<br />
This page last modified on May 21, 1997.<br />
file:///E|/WEBSITE/IMPLEMEN/HANDBOOK/IMPLEMEN.HTM (2 of 2) [19/1/2003 1:37:37]