The Design And Analysis Of Algorithms (Monographs In Computer Science),New

The Design And Analysis Of Algorithms (Monographs In Computer Science),New

In Stock
SKU: DADAX0387976876
Brand: Springer
Condition: New
Regular price$59.46
Quantity
Add to wishlist
Add to compare

Sold by Ergodebooks, an authorized reseller.

Returns accepted within 30 days | support@ergodebooks.com

Verified
Shipping Information
  • Free Standard Shipping — United States only
  • Processing Time: 1–3 business days
  • Estimated Delivery: 3–5 business days after dispatch
  • Double-boxed, fully insured & discreetly packaged
  • Tracking number sent via email once dispatched
  • Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund

Returns accepted within 30 days of delivery.

Damaged or Defective Item

Free return shipping + replacement or full refund

Wrong Item Received

Free return shipping + replacement or full refund

Change of Mind

Return shipping at customer's expense · 25% restocking fee applies

All returns require a Return Authorization (RA) number before sending.

To initiate a return, contact us:

support@ergodebooks.com +1 (281) 738-1050
View Full Return & Refund Policy
Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

These Are My Lecture Notes From Cs681: Design And Analysis Of Algo Rithms, A Onesemester 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. Addisonwesley, 1975. M. R. Garey And D. S. Johnson, Computers And Intractibility: A Guide To The Theory Of Npcompleteness. 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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed