We can't find the internet
Attempting to reconnect
Something went wrong
Hang in there while we get back on track
£54.23
About as cheap as it gets — within 5% of the all-time low it hit 3 months ago.
£54 today · all-time low £53 (Jul 2026) · usually £55
Birkhauser Mathematics for the Analysis of Algorithms - Birkhauser Classics
We'll watch every seller, every day. One email when your price arrives.
Price History & Forecast
Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.
Last 79 days · 79 data points (no recent data)
NEW HERE?
Amazon shows you one price. We show you all of them.
Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.
WHAT'S ON THIS PAGE
when this has been cheap or pricey
where the price is heading next
all-time high & low, recent range
name your number, we'll email you
Price Distribution
Price distribution over 79 days • 3 price levels
Price Analysis
Most common price: £55 (32 days, 40.5%)
Price range: £53 - £55
Price levels: 3 different prices over 79 days
Description
Key Features
Covers recurrence relations, operator methods, and asymptotic analysis for algorithm performance evaluation.
Drawn from Stanford University's advanced computer science course, ensuring academic rigour and practical relevance.
Approximately half the book contains original examination problems and solutions for practical skill development.
Terse yet detailed writing style balances quick reference capability with depth for readers new to the subject.
Emphasises difficult algorithmic notions and precise analysis techniques beyond basic combinatorial methods.
Product Specifications
- Brand
- Birkhauser
- Format
- paperback
- ASIN
- 0817647287
- Domain
- Amazon UK
- Release Date
- 05 October 2007
- Listed Since
- 20 September 2007
Barcode
No barcode data available
Similar Products You Might Like
Mathematics for the Analysis of Algorithms: v. 1 (Progress in Theoretical Computer Science)
Birkhauser
Algorithms and Complexity (Volume A) (Handbook of Theoretical Computer Science, Volume A)
Elsevier
Analysis of Algorithms: An Active Learning Approach
Jones & Bartlett Learning
The Power of Algorithms: Inspiration and Examples in Everyday Life
Springer
Algorithms from THE BOOK
Prentice Hall Introduction to the Design and Analysis of Algorithms
Prentice Hall
Practical Analysis of Algorithms (Undergraduate Topics in Computer Science)
Springer
Analysis of Algorithms: Computational Methods and Mathematical Tools
Oxford University Press
Pearson Design and Analysis of Computer Algorithms Book
PEARSON EDUCATION
Cambridge University Press - How to Think about Algorithms
Cambridge University Press
Algorithm Design: A Methodological Approach - 150 problems and detailed solutions
CRC Press
Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities (Trends in Mathematics)
Birkhauser
Algorithms Unplugged
Springer
Algorithms and Data Structures in C++: 5 (Computer Science & Engineering)
CRC Press
Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)
Springer
Algorithms Unplugged
Springer
Algorithms: Design Techniques And Analysis (Revised Edition): 14 (LECTURE NOTES SERIES ON COMPUTING)
World Scientific Publishing Company
Online Algorithms: The State of the Art: 1442 (Lecture Notes in Computer Science, 1442)
Springer
Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition)
PEARSON EDUCATION
Algorithms and Theory of Computation Handbook, Volume 1: General Concepts and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)
CRC Press
Parameterized Algorithms
Springer
Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions: 127 (Grundlehren der mathematischen Wissenschaften, 127)
Springer
Algorithmische Graphentheorie
De Gruyter Oldenbourg
Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)
CRC Press