Photo 1/11
Galerie
Photo 1/11
Vous en avez un à vendre ?
La conception et l'analyse d'algorithmes (monographies en informatique) HC très bon état
7,40 USD
Environ6,34 EUR
État :
Très bon état
Livre qui ne semble pas neuf, ayant déjà été lu, mais qui est toujours en excellent état. La couverture ne présente aucun dommage apparent. Pour les couvertures rigides, la jaquette (si applicable) est incluse. Aucune page n'est manquante, endommagée, pliée ni déchirée. Aucun texte n'est souligné ni surligné. Aucune note ne figure dans les marges. La couverture intérieure peut présenter des marques d'identification mineures. Marques d'usure et déchirures mineures. Consulter l'annonce du vendeur pour avoir plus de détails et voir la description des défauts.
- Achat immédiatLa conception et l'analyse d'algorithmes (monographies en informatique) HC très bon état
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Livraison :
5,97 USD (environ 5,12 EUR) USPS Media MailTM.
Lieu où se trouve l'objet : Los Angeles, California, États-Unis
Délai de livraison :
Estimé entre le lun. 11 août et le mer. 13 août à 94104
Retours :
Retour sous 30 jours. L'acheteur paie les frais de retour. Si vous utilisez un bordereau d'affranchissement eBay, son coût sera déduit du montant de votre remboursement.
Paiements :
Achetez en toute confiance
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :297134785756
Dernière mise à jour le 08 août 2025 03:08:03 CEST. Afficher toutes les modificationsAfficher toutes les modifications
Caractéristiques de l'objet
- État
- Brand
- Unbranded
- Book Title
- The Design and Analysis of Algorithms (Monographs in Computer Sc
- MPN
- Does not apply
- ISBN
- 9780387976877
À propos de ce produit
Product Identifiers
Publisher
Springer New York
ISBN-10
0387976876
ISBN-13
9780387976877
eBay Product ID (ePID)
117555
Product Key Features
Number of Pages
X, 322 Pages
Language
English
Publication Name
Design and Analysis of Algorithms
Publication Year
1991
Subject
Programming / Algorithms
Type
Textbook
Subject Area
Computers
Series
Monographs in Computer Science Ser.
Format
Hardcover
Dimensions
Item Height
0.3 in
Item Weight
50.8 Oz
Item Length
9.2 in
Item Width
6.1 in
Additional Product Features
Intended Audience
Scholarly & Professional
TitleLeading
The
Number of Volumes
1 vol.
Illustrated
Yes
Table Of Content
I Lectures.- 1 Algorithms and Their Complexity.- 2 Topological Sort and MST.- 3 Matroids and Independence.- 4 Depth-First and Breadth-First Search.- 5 Shortest Paths and Transitive Closure.- 6 Kleene Algebra.- 7 More on Kleene Algebra.- 8 Binomial Heaps.- 9 Fibonacci Heaps.- 10 Union-Find.- 11 Analysis of Union-Find.- 12 Splay Trees.- 13 Random Search Trees.- 14 Planar and Plane Graphs.- 15 The Planar Separator Theorem.- 16 Max Flow.- 17 More on Max Flow.- 18 Still More on Max Flow.- 19 Matching.- 20 More on Matching.- 21 Reductions and NP-Completeness.- 22 More on Reductions and NP-Completeness.- 23 More NP-Complete Problems.- 24 Still More NP-Complete Problems.- 25 Cook's Theorem.- 26 Counting Problems and #P.- 27 Counting Bipartite Matchings.- 28 Parallel Algorithms and NC.- 29 Hypercubes and the Gray Representation.- 30 Integer Arithmetic in NC.- 31 Csanky's Algorithm.- 32 Chistov's Algorithm.- 33 Matrix Rank.- 34 Linear Equations and Polynomial GCDs.- 35 The Fast Fourier Transform (FFT).- 36 Luby's Algorithm.- 37 Analysis of Luby's Algorithm.- 38 Miller's Primality Test.- 39 Analysis of Miller's Primality Test.- 40 Probabilistic Tests with Polynomials.- II Homework Exercises.- Homework 1.- Homework 2.- Homework 3.- Homework 4.- Homework 5.- Homework 6.- Homework 7.- Homework 8.- Homework 9.- Homework 10.- Miscellaneous Exercises.- III Homework Solutions.- Homework 1 Solutions.- Homework 2 Solutions.- Homework 3 Solutions.- Homework 4 Solutions.- Homework 5 Solutions.- Homework 6 Solutions.- Homework 7 Solutions.- Homework 8 Solutions.- Homework 9 Solutions.- Homework 10 Solutions.- Solutions to Miscellaneous Exercises.
Synopsis
These are my lecture notes from CS681: Design and Analysis of Algo- rithms, a one-semester graduate course I taught at Cornell for three consec- utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts - A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. - M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. - R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references., These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts * A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. * M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. * R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references., The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth's works on algorithms on his or her shelf. Dexter Kozen, a researcher and professor at Cornell University, has written a text for graduate study of algorithms.
LC Classification Number
QA76.9.A43
Description de l'objet fournie par le vendeur
Informations sur le vendeur professionnel
À propos de ce vendeur
booksmostly
99,7% d'évaluations positives•23 000 objets vendus
Inscrit comme vendeur professionnel
Catégories populaires de cette Boutique
Évaluations du vendeur (11.334)
- m***3 (371)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéSolid packaging and well shipped! Just as described. Good value. Thank you!!
- n***r- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéThank you
- 9***s (627)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéCool
Catégories populaires de cette Boutique
Évaluations du vendeur (11.334)
- m***3 (371)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéSolid packaging and well shipped! Just as described. Good value. Thank you!!
- n***r- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéThank you
- 9***s (627)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéCool