• Alle Preisangaben inkl. MwSt.
Nur noch 1 auf Lager (mehr ist unterwegs).
Verkauf und Versand durch Amazon.
Geschenkverpackung verfügbar.
Menge:1
An Introduction to the An... ist in Ihrem Einkaufwagen hinzugefügt worden
+ EUR 3,00 Versandkosten
Gebraucht: Gut | Details
Verkauft von Deal DE
Zustand: Gebraucht: Gut
Kommentar: Dieses Buch ist in gutem, sauberen Zustand. Seiten und Einband sind intakt.
Ihren Artikel jetzt
eintauschen und
EUR 1,30 Gutschein erhalten.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Anhören Wird wiedergegeben... Angehalten   Sie hören eine Probe der Audible-Audioausgabe.
Weitere Informationen
Alle 2 Bilder anzeigen

An Introduction to the Analysis of Algorithms (Psychopharmacology Monograph) (Englisch) Gebundene Ausgabe – Juni 1996

2 Kundenrezensionen

Alle Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Amazon-Preis Neu ab Gebraucht ab
Gebundene Ausgabe
"Bitte wiederholen"
EUR 57,13
EUR 54,79 EUR 17,89
6 neu ab EUR 54,79 7 gebraucht ab EUR 17,89

Dieses Buch gibt es in einer neuen Auflage:


Hinweise und Aktionen

  • Große Hörbuch-Sommeraktion: Entdecken Sie unsere bunte Auswahl an reduzierten Hörbüchern für den Sommer. Hier klicken.

Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.


Große Hörbuch-Sommeraktion
Entdecken Sie unsere vielseitige Auswahl an reduzierten Hörbüchern aus den Bereichen Romane, Krimis & Thriller, Sachbuch und Kinder- & Jugendhörbücher. Klicken Sie hier, um direkt zur Aktion zu gelangen.

Produktinformation

  • Gebundene Ausgabe: 512 Seiten
  • Verlag: Addison Wesley Pub Co Inc (Juni 1996)
  • Sprache: Englisch
  • ISBN-10: 020140009X
  • ISBN-13: 978-0201400090
  • Größe und/oder Gewicht: 14,7 x 2,8 x 22,6 cm
  • Durchschnittliche Kundenbewertung: 4.5 von 5 Sternen  Alle Rezensionen anzeigen (2 Kundenrezensionen)
  • Amazon Bestseller-Rang: Nr. 551.327 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
  • Komplettes Inhaltsverzeichnis ansehen

Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr

Produktbeschreibungen

Synopsis

This book is a thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. The first half of the book draws upon classical mathematical material from discrete mathematics, elementary real analysis, and combinatorics; the second half discusses properties of discrete structures and covers the analysis of a variety of classical sorting, searching, and string processing algorithms.

Buchrückseite

"People who analyze algorithms have double happiness. First of all they experience the sheer beauty of elegant mathematical patterns that surround elegant computational procedures. Then they receive a practical payoff when their theories make it possible to get other jobs done more quickly and more economically.... The appearance of this long-awaited book is therefore most welcome. Its authors are not only worldwide leaders of the field, they also are masters of exposition." --D. E. Knuth

This book provides a thorough introduction to the primary techniques used in the mathematical analysis of algorithms. The authors draw from classical mathematical material, including discrete mathematics, elementary real analysis, and combinatorics, as well as from classical computer science material, including algorithms and data structures. They focus on "average-case" or "probabilistic" analysis, although they also cover the basic mathematical tools required for "worst-case" or "complexity" analysis. Topics include recurrences, generating functions, asymptotics, trees, strings, maps, and an analysis of sorting, tree search, string search, and hashing algorithms.

Despite the large interest in the mathematical analysis of algorithms, basic information on methods and models in widespread use has not been directly accessible for work or study in the field. The authors here address this need, combining a body of material that gives the reader both an appreciation for the challenges of the field and the requisite background for keeping abreast of the new research being done to meet these challenges.

Highlights:
  • Thorough, self-contained coverage for students and professionals in computer science and mathematics
  • Focus on mathematical techniques of analysis
  • Basic preparation for the advanced results covered in Knuth's books and the research literature
  • Classical approaches and results in the analysis of algorithms


020140009XB04062001

Kundenrezensionen

4.5 von 5 Sternen
5 Sterne
1
4 Sterne
1
3 Sterne
0
2 Sterne
0
1 Sterne
0
Beide Kundenrezensionen anzeigen
Sagen Sie Ihre Meinung zu diesem Artikel

Die hilfreichsten Kundenrezensionen

1 von 1 Kunden fanden die folgende Rezension hilfreich Von Sen Peng Eu am 1. April 2000
Format: Gebundene Ausgabe
For a long time analytic combinatorics lacks a good and comprehensive textbook. Almost every learner in this field learns this subject via scattered papers and chapters in different books or journels. The apprearence of this book is so welcome by learners and researchers that it offers a excellent introduction of this powerful and relatively new field. Flajolet and Sedgewick are the famous masters of this field, and this book proves that again. The writing style is succinct, with instant exercise(s) after every important concept and result. The pace of this book is very natural and self-contained. The first half of this book deals with the basic tools used for analysis of algorithm, from the recurrence, generating function, to asymptotic approx. Then it discusses 2 most crucial subjects: trees and permutations. The last 2 chapter turns to strings and words. I found it very readble that there is a typical and core example in every chapter. BTW, since I still haven't finished studying this book, but I must say that Chapter 5 (Asymptotic) is among many textbooks the best introduction to this hard topic so far.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
Format: Gebundene Ausgabe
I don't know whether the style of this book is good or not but for me the chapter on generating functions was very readable. At the time of reading I already have read several books for the understanding of generating functions; including Graham, Knuth, and Patashnik's "Concrete Mathematics," which is definitely great but difficult to me. I've got a solid understanding of the subject through two books: Polya et al's "Notes on Introductory Combinatorics" and Sedgewick and Flajolet's.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen

Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)

Amazon.com: 6 Rezensionen
55 von 55 Kunden fanden die folgende Rezension hilfreich
Clear and concise 17. Januar 2001
Von Amazon Customer - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
This is an excellent book on the analysis of algorithms. More specifically, it is a book on the mathematics needed for the analysis of algorithms. Quite a few algorithms are presented and analyzed in great detail, but the emphasis is on the analysis techniques rather than on the algorithms.
This is in contrast with Cormen,Leiserson and Rivest, or Sedgewick's own "Algorithms" series which emphasize the algorithms rather than the analysis.
If you're looking for a catalog of algorithms along with explanations, you want a different book, but if you want to know how to analyze that bizarre code (which Fred in the next cubicle wrote) and prove that it works well (or doesn't) then this is an excellent choice.
The book is aimed at advanced undergrads/graduate students and assumes a certain amount of mathematical sophistication - i.e. calculus, discrete math, probability, etc.
On the spectrum from "Mathematical Techniques" through "Analysis of Algorithms" and ending up with "Catalog of Algorithms", I would start with Graham, Knuth and Patashnik "Concrete Mathematics", travel through this book, on to Knuth "The Art of Computer Programming", then to Cormen, Leiserson and Rivest, and finally end up with either Sedgewick's "Algorithms" or Skeina's "Algorithm Design Manual".
21 von 21 Kunden fanden die folgende Rezension hilfreich
Classic textbook in this field 1. April 2000
Von Sen Peng Eu - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe Verifizierter Kauf
For a long time analytic combinatorics lacks a good and comprehensive textbook. Almost every learner in this field learns this subject via scattered papers and chapters in different books or journels. The apprearence of this book is so welcome by learners and researchers that it offers a excellent introduction of this powerful and relatively new field. Flajolet and Sedgewick are the famous masters of this field, and this book proves that again. The writing style is succinct, with instant exercise(s) after every important concept and result. The pace of this book is very natural and self-contained. The first half of this book deals with the basic tools used for analysis of algorithm, from the recurrence, generating function, to asymptotic approx. Then it discusses 2 most crucial subjects: trees and permutations. The last 2 chapter turns to strings and words. I found it very readble that there is a typical and core example in every chapter. BTW, since I still haven't finished studying this book, but I must say that Chapter 5 (Asymptotic) is among many textbooks the best introduction to this hard topic so far.
5 von 5 Kunden fanden die folgende Rezension hilfreich
A very readable chapter on generating functions 4. Februar 1999
Von cj2005 - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
I don't know whether the style of this book is good or not but for me the chapter on generating functions was very readable. At the time of reading I already have read several books for the understanding of generating functions; including Graham, Knuth, and Patashnik's "Concrete Mathematics," which is definitely great but difficult to me. I've got a solid understanding of the subject through two books: Polya et al's "Notes on Introductory Combinatorics" and Sedgewick and Flajolet's.
3 von 5 Kunden fanden die folgende Rezension hilfreich
A must have. 22. Oktober 2001
Von Ein Kunde - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
I read a lot of books about complexity analysis. And this book is a state of art in the field. Easy to read, and well done.It cover the necessary staff that every new commer to the field should know, can be used as a refference,and it make a good teaching material for graduate student.
0 von 3 Kunden fanden die folgende Rezension hilfreich
Easy to Comprehend 30. Oktober 2011
Von Anon-Ops - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe Verifizierter Kauf
This book is great for the everyday college student, 2 to 3 education required to comprehend thoroughly.Impress your professor with the superfluous knowledge you will get from this well-written book.
Waren diese Rezensionen hilfreich? Wir wollen von Ihnen hören.