Stable Marriage and Its Relation to Other Combinatorial Problems
Format: Paperback
ISBN13: 9780821806036
Paperback|9780821806036
✨ Featured Offer
Brand New
$74.90
List Price: $27.00
🚚
See all 4 offers from $25.49 FREE standard delivery by: 01 Apr 2026
Overview
'This is a very stimulating book!' - N. G. de Bruijn. 'This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design' - ""Mathematical Reviews"". 'This book is an excellent (and enjoyable) means of sketching a large area of computer science for specialists in other fields: It requires little previous knowledge, but expects of the reader a degree of mathematical facility and a willingness to participate. It is really neither a survey nor an introduction; rather, it is a paradigm, a fairly complete treatment of a single example used as a synopsis of a larger subject' - ""SIGACT News"". 'Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort!' - ""Computing Reviews"". The above citations are taken from reviews of the initial French version of this text - a series of seven expository lectures that were given at the University of Montreal in November of 1975.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.
| ISBN-13 | 9780821806036 |
|---|---|
| ISBN-10 | 0821806033 |
| Weight | 0.40 Pounds |
| Dimensions | 7.25 x 0.25 x 10.25 In |
| List Price | $27.00 |
| Format | Paperback |
|---|---|
| Language | English |
| Pages | 74 pages |
| Publisher | Amer Mathematical Society |
| Published On | 1996-10-30 |
View All Offers
Sort by:
Price
Condition
Seller
Seller Comments
Price
Used, Very Good
Seller details
Book Alley
Pasadena, CA, USA
Gently used, no markings.
Free delivery by: 01 Apr 2026
Used, Good
Seller details
Bonita
Santa Clarita, CA, USA
Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Free delivery by: 01 Apr 2026
✨ Brand New
Seller details
Bonita
Santa Clarita, CA, USA
Free delivery by: 01 Apr 2026
Brand New
Seller details
GridFreed
North Las Vegas, NV, USA
Size: 9x6x0; New. In shrink wrap. Looks like an interesting title!
Free delivery by: 01 Apr 2026