Join Amazon Prime and ship Two-Day for free and Overnight for $3.99. Already a member? Sign in.

 

or
Sign in to turn on 1-Click ordering.
 
   
More Buying Choices
13 used & new from $12.12

Have one to sell? Sell yours here
 
   
Tell a Friend
Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (Crm Proceedings & Lecture Notes, V. 10)
 
 
Are You an Author or Publisher?
Find out how to publish your own Kindle Books
 
  

Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (Crm Proceedings & Lecture Notes, V. 10) (Paperback)

by Donald E. Knuth (Author) "Let H and F be two finite sets of n elements..." (more)
Key Phrases: redundant proposals, stable matching, preference matrices (more...)
5.0 out of 5 stars  (1 customer review)

List Price: $21.00
Price: $21.00 & eligible for FREE Super Saver Shipping on orders over $25. Details
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.

Only 4 left in stock--order soon (more on the way).

Want it delivered Tuesday, July 29? Choose One-Day Shipping at checkout. See details

13 used & new available from $12.12

Better Together

Buy this book with Art of Computer Programming, The, Volumes 1-3 Boxed Set (2nd Edition) (The Art of Computer Programming Series) by Donald E. Knuth today!

Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms (Crm Proceedings & Lecture Notes, V. 10) Art of Computer Programming, The, Volumes 1-3 Boxed Set (2nd Edition) (The Art of Computer Programming Series)
Buy Together Today: $174.00

Customers Who Bought This Item Also Bought

Literate Programming (Center for the Study of Language and Information - Lecture Notes)

Literate Programming (Center for the Study of Language and Information - Lecture Notes) by Donald E. Knuth

4.0 out of 5 stars (5)  $21.90
Network Flows: Theory, Algorithms, and Applications

Network Flows: Theory, Algorithms, and Applications by Ravindra K. Ahuja

4.5 out of 5 stars (11)  $128.00
Mathematics for the Analysis of Algorithms (Modern Birkhäuser Classics)

Mathematics for the Analysis of Algorithms (Modern Birkhäuser Classics) by Daniel H. Greene

4.0 out of 5 stars (1)  $36.50
Approximation Algorithms for NP-Hard Problems

Approximation Algorithms for NP-Hard Problems by Dorit Hochbaum

5.0 out of 5 stars (1)  $76.95
Surreal Numbers

Surreal Numbers by Donald E. Knuth

3.4 out of 5 stars (5)  $17.99
Explore similar items : Books (8)

Editorial Reviews
Book Description
The book uses the appealing theory of stable marriage to introduce and illustrate a variety of important concepts and techniques of computer science and mathematics: data structures, control structures, combinatorics, probability, analysis, algebra, and especially the analysis of algorithms.

The presentation is elementary, and the topics are interesting to nonspecialists. The theory is quite beautiful and developing rapidly. Exercises with answers, an annotated bibliography, and research problems are included. The text would be appropriate as supplementary reading for undergraduate research seminars or courses in algorithmic analysis and for graduate courses in combinatorial algorithms, operations research, economics, or analysis of algorithms.

Donald E. Knuth is one of the most prominent figures of modern computer science. His works in The Art of Computer Programming are classic. He is also renowned for his development of TeX and METAFONT. In 1996, Knuth won the prestigious Kyoto Prize, considered to be the nearest equivalent to a Nobel Prize in computer science.

Language Notes
Text: English (translation)
Original Language: French


Product Details
  • Paperback: 74 pages
  • Publisher: American Mathematical Society (October 1996)
  • Language: English
  • ISBN-10: 0821806033
  • ISBN-13: 978-0821806036
  • Product Dimensions: 9.7 x 6.8 x 0.1 inches
  • Shipping Weight: 5.6 ounces (View shipping rates and policies)
  • Average Customer Review: 5.0 out of 5 stars  (1 customer review)
  • Amazon.com Sales Rank: #1,031,481 in Books (See Bestsellers in Books)
    (Publishers and authors: Improve Your Sales)