An edition of Algorithm design (2001)

Algorithm design

foundations, analysis, and Internet examples

by and

  • 10 Want to read
Cover of: Algorithm design by Michael T. Goodrich, Roberto Tamassia, Michael T. Goodrich
Preview Only

My Reading Lists:

Create a new list
Notes
  • 10 Want to read
Notes

Check nearby libraries

Buy this book

Last edited by ImportBot
September 15, 2021 | History
Edit
An edition of Algorithm design (2001)

Algorithm design

foundations, analysis, and Internet examples

by and

  • 10 Want to read

This work doesn't have a description yet. Can you add one?

Publish Date
Publisher
Wiley-India
Language
English
Pages
708

Check nearby libraries

Buy this book

Previews available in: English

Subjects

Computer algorithms, Data structures (Computer science), Algorithms
Edition Availability
Cover of: Algorithm design
Algorithm design: foundations, analysis, and Internet examples
2011, Wiley-India
in English
Cover of: Algorithm design
Algorithm design: foundations, analysis, and Internet examples
2002, Wiley
in English
Cover of: Algorithm Design
Algorithm Design: Foundations, Analysis, and Internet Examples
September 15, 2001, Wiley
in English

Add another edition?

Book Details

Table of Contents

I. Fundamental Tools
Page 1
1. Algorithm Analysis
Page 3
1.1. Methodologies for Analyzing Algorithms
Page 5
1.2. Asymptotic Notation
Page 13
1.3. A Quick Mathematical Review
Page 21
1.4. Case Studies in Algorithm Analysis
Page 31
1.5. Amortization
Page 34
1.6. Experimentation
Page 42
1.7. Exercises
Page 47
2. Basic Data Structures
Page 55
2.1. Stacks and Queues
Page 57
2.2. Vectors, Lists, and Sequences
Page 65
2.3. Trees
Page 75
2.4. Priority Queues and Heaps
Page 94
2.5. Dictionaries and Hash Tables
Page 114
2.6. Java Example: Heap
Page 128
2.7. Exercises
Page 131
3. Search Trees and Skip Lists
Page 139
3.1. Ordered Dictionaries and Binary Search Trees
Page 141
3.2. AVL Trees
Page 152
3.3. Bounded-Depth Search Trees
Page 159
3.4. Splay Trees
Page 185
3.5. Skip Lists
Page 195
3.6. Java Example: AVL and Red-Black Trees
Page 202
3.7. Exercises
Page 212
4. Sorting, Sets, and Selection
Page 217
4.1. Merge-Sort
Page 219
4.2. The Set Abstract Data Type
Page 225
4.3. Quick-Sort
Page 235
4.4. A Lower Bound on Comparison-Based Sorting
Page 239
4.5. Bucket-Sort and Radix-Sort
Page 241
4.6. Comparison of Sorting Algorithms
Page 244
4.7. Selection
Page 245
4.8. Java Example: In-Place Quick-Sort
Page 248
4.9. Exercises
Page 251
5. Fundamental Techniques
Page 257
5.1. The Greedy Method
Page 259
5.2. Divide-and-Conquer
Page 263
5.3. Dynamic Programming
Page 274
5.4. Exercises
Page 282
II. Graph Algorithms
Page 285
6. Graphs
Page 287
6.1. The Graph Abstract Data Type
Page 289
6.2. Data Structures for Graphs
Page 296
6.3. Graph Traversal
Page 303
6.4. Directed Graphs
Page 316
6.5. Java Example: Depth-First Search
Page 329
6.6. Exercises
Page 335
7. Weighted Graphs
Page 339
7.1. Single-Source Shortest Paths
Page 341
7.2. All-Pairs Shortest Paths
Page 354
7.3. Minimum Spanning Trees
Page 360
7.4. Java Example: Dijkstra's Algorithm
Page 373
7.5. Exercises
Page 376
8. Network Flow and Matching
Page 381
8.1. Flows and Cuts
Page 383
8.2. Maximum Flow
Page 387
8.3. Maximum Bipartite Matching
Page 396
8.4. Minimum-Cost Flow
Page 398
8.5. Java Example: Minimum-Cost Flow
Page 405
8.6. Exercises
Page 412
III. Internet Algorithmics
Page 415
9. Text Processing
Page 417
9.1. Strings and Pattern Matching Algorithms
Page 419
9.2. Tries
Page 429
9.3. Text Compression
Page 440
9.4. Text Similarity Testing
Page 443
9.5. Exercises
Page 447
10. Number Theory and Cryptography
Page 451
10.1. Fundamental Algorithms Involving Numbers
Page 453
10.2. Cryptographic Computations
Page 471
10.3. Information Security Algorithms and Protocols
Page 481
10.4. The Fast Fourier Transform
Page 488
10.5. Java Example: FFT
Page 500
10.6. Exercises
Page 508
11. Network Algorithms
Page 511
11.1. Complexity Measures and Models
Page 513
11.2. Fundamental Distributed Algorithms
Page 517
11.3. Broadcast and Unicast Routing
Page 530
11.4. Multicast Routing
Page 535
11.5. Exercises
Page 541
IV. Additional Topics
Page 545
12. Computational Geometry
Page 547
12.1. Range Trees
Page 549
12.2. Priority Search Trees
Page 556
12.3. Quadtrees and k-D Trees
Page 561
12.4. The Plane Sweep Technique
Page 565
12.5. Convex Hulls
Page 572
12.6. Java Example: Convex Hull
Page 583
12.7. Exercises
Page 587
13. NP-Completeness
Page 591
13.1. P and NP
Page 593
13.2. NP-Completeness
Page 599
13.3. Important NP-Complete Problems
Page 603
13.4. Approximation Algorithms
Page 618
13.5. Backtracking and Branch-and-Bound
Page 627
13.6. Exercises
Page 638
14. Algorithmic Frameworks
Page 643
14.1. External-Memory Algorithms
Page 645
14.2. Parallel Algorithms
Page 657
14.3. Online Algorithms
Page 667
14.4. Exercises
Page 680
A. Useful Mathematical Facts
Page 685
Bibliography
Page 689
Index
Page 698

Edition Notes

Includes bibliographical references and index.

Published in
New Delhi

The Physical Object

Pagination
xii, 708 pages
Number of pages
708

Edition Identifiers

Open Library
OL35732213M
ISBN 10
8126509864
ISBN 13
9788126509867
OCLC/WorldCat
863579905

Work Identifiers

Work ID
OL5970259W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

Loading indicator
Loading carousel
Loading indicator
Loading carousel
Download catalog record: RDF / JSON