Design and Analysis of Algorithms: A Contemporary Perspective

Sandeep Sen; Amit Kumar

doi:10.1017/9781108654937

Design and Analysis of Algorithms

A Contemporary Perspective

- Get access
  
  Buy a print copy
  
  Check if you have access via personal or institutional login
  
  Log in Register
Cited by 2
Cited by
- 2
Crossref Citations

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Gusenbauer, Michael 2022. Search where you will find most: Comparing the disciplinary coverage of 56 bibliographic databases. Scientometrics, Vol. 127, Issue. 5, p. 2683.

CrossRef

Google Scholar

Prabowo, Yos Sharma, Shrivatsal Bhattacharya, Subhashish Tripathi, Awneesh Kumar and Bhavaraju, Vijay 2023. ZVS Boundary Analysis and Design Guideline of MV Grid-Compliant Solid-State Transformer for DC Fast Charger Applications. IEEE Transactions on Transportation Electrification, Vol. 9, Issue. 4, p. 4964.

CrossRef

Google Scholar

Sandeep Sen, Indian Institute of Technology, Delhi, Amit Kumar, Indian Institute of Technology, Delhi

Publisher:: Cambridge University Press
Online publication date:: April 2019
Print publication year:: 2019
Online ISBN:: 9781108654937
DOI:: https://doi.org/10.1017/9781108654937

Subjects:: Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science

64.99 (USD)

Digital access for individuals
(PDF download and/or read online)
Add to cart

Added to cart

Digital access for individuals
(PDF download and/or read online)
View cart
Export citation
Buy a print copy

Information

Contents

Metrics

The text covers important algorithm design techniques, such as greedy algorithms, dynamic programming, and divide-and-conquer, and gives applications to contemporary problems. Techniques including Fast Fourier transform, KMP algorithm for string matching, CYK algorithm for context free parsing and gradient descent for convex function minimization are discussed in detail. The book's emphasis is on computational models and their effect on algorithm design. It gives insights into algorithm design techniques in parallel, streaming and memory hierarchy computational models. The book also emphasizes the role of randomization in algorithm design, and gives numerous applications ranging from data-structures such as skip-lists to dimensionality reduction methods.

- Aa Reduce text
- Aa Enlarge text

View selected items
Save to my bookmarks
Export citations
Download PDF (zip)
Save to Kindle
Save to Dropbox
Save to Google Drive
Save content to
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to .

To save content items to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Please be advised that item(s) you selected are not available.
You are about to save
Your Kindle email address

Please provide your Kindle email.

@free.kindle.com @kindle.com (service fees apply)

By using this service, you agree that you will only keep content for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services

Metrics

Altmetric attention score

Total number of HTML views: 0

Total number of PDF views: 0 *

Loading metrics...

Total views: 0 *

Loading metrics...

* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

Usage data cannot currently be displayed.

Design and Analysis of Algorithms

A Contemporary Perspective

This Book has been cited by the following publications. This list is generated based on data provided by Crossref.

Book description

Refine List

Actions for selected content:

Contents

Frontmatter
pp i-iv

Dedication
pp v-vi

Content
pp vii-xiv

List of Figures
pp xv-xviii

List of Tables
pp xix-xx

Preface
pp xxi-xxiv

Acknowledgments
pp xxv-xxvi

1 - Model and Analysis
pp 1-15

2 - Basics of Probability and Tail Inequalities
pp 16-33

3 - Warm-up Problems
pp 34-53

4 - Optimization I: Brute Force and Greedy Strategy
pp 54-91

5 - Optimization II: Dynamic Programming
pp 92-108

6 - Searching
pp 109-127

7 - Multidimensional Searching and Geometric Algorithms
pp 128-156

8 - String Matching and Finger Printing
pp 157-170

9 - Fast Fourier Transform and Applications
pp 171-183

10 - Graph Algorithms
pp 184-207

11 - Maximum Flow and Applications
pp 208-229

12 - NP Completeness and Approximation Algorithms
pp 230-257

13 - Dimensionality Reduction*
pp 258-276

14 - Parallel Algorithms
pp 277-307

15 - Memory Hierarchy and Caching
pp 308-322

16 - Streaming Data Model
pp 323-342

Appendix A - Recurrences and Generating Functions
pp 343-350

Bibliography
pp 351-362

Index
pp 363-367

Metrics

Altmetric attention score

Full text views

Book summary page views

Design and Analysis of Algorithms

A Contemporary Perspective

Book description

Refine List

Actions for selected content:

Save Search

Contents

Metrics

Altmetric attention score

Full text views

Book summary page views