Algorithm design: Foundations, analysis, and Internet examples

MaRDI QIDQ2757736zbMATH OpenFDO

Authors Roberto Tamassia, Michael T. Goodrich

Publication date 29 November 2001

zbMATH Keywords

graph algorithmsinternet algorithms

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) General topics in the theory of algorithms (68W01)

Review text

The book is intended as a textbook for a senior algorithm course or a first-year graduate course. It covers the usual material in such algorithm courses with additional motivation from Internet and Java implementation examples. NEWLINENEWLINENEWLINEThe authors divided the book into four parts: Fundamental Tools, Graph Algorithms, Internet Algorithms and Additional Topics (this part covers three chapters: Computational Geometry, NP-Completeness and Algorithmic Frameworks). It totals 14 chapters and lists 213 items in the bibliography. NEWLINENEWLINENEWLINEThe material is nicely presented with features like visual justification of proofs and the exercises are classified into classes: Reinforcement, Criativity and Projects. Additionally, the book is designed in such a way that the algorithms solve real-world problems, being suitable also for professionals outside academics.

Recommendations

• Design and analysis of algorithms. A contemporary perspective
• Techniques for designing and analyzing algorithms
• Algorithms. Design techniques and analysis
• Algorithms. Design techniques and analysis
• Introduction to algorithms

Cited in

(30)

• Fault tolerant sorting -- theoretical and empirical analyses of the randomized quickmergesort algorithm
• Guide to competitive programming. Learning and improving algorithms through contests
• A compact data structure for representing a dynamic multiset
• Using the complete sequences for sorting natural numbers
• An intersection model for multitolerance graphs: efficient algorithms and hierarchy
• On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection
• Introduction to algorithms
• Algorithm design and applications
• Algorithms. Design and analysis
• A guide to algorithm design. Paradigms, methods, and complexity analysis
• Foundations of algorithms: using C++ pseudocode
• Round-trip Voronoi diagrams and doubling density in geographic networks
• Dominated parasitic flow loops in networks
• Example of combined algorithm development and architecture design
• A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
• Design and analysis of algorithms. A contemporary perspective
• Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
• The art of algorithm design
• The asymptotic behavior of precise lower estimate of reconstruction of a linear order on a finite set
• Real-world algorithms. A beginner's guide
• A Path to Hadamard Matrices
• Privacy-preserving group data access via stateless oblivious RAM simulation
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• Encyclopedia of Algorithms
• Design and analysis of approximation algorithms
• An analysis of Las Vegas algorithms for linear search
• Two new methods for constructing double-ended priority queues from priority queues
• Two-tier relaxed heaps
• Should one always use repeated squaring for modular exponentiation?
• A complementary view on the growth of directory trees

This page was built for publication: Algorithm design: Foundations, analysis, and Internet examples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757736)