Stable Marriage and Its Relation to Other Combinatorial Problems

Author:   Donald E. Knuth
Publisher:   American Mathematical Society
Edition:   annotated edition
ISBN:  

9780821806036


Pages:   74
Publication Date:   30 October 1996
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $58.08 Quantity:  
Add to Cart

Share |

Stable Marriage and Its Relation to Other Combinatorial Problems


Add your own review!

Overview

The initial French version of this text was a series of expository lectures that were given at the University of Montreal in November 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 was this year's recipient of the prestigious Kyoto Award in the Advanced Technology category for his tremendous contributions to the development of 20th century computer sciences through both research and education. The Kyoto Award is Japan's highest private award for lifetime achievement.

Full Product Details

Author:   Donald E. Knuth
Publisher:   American Mathematical Society
Imprint:   American Mathematical Society
Edition:   annotated edition
Dimensions:   Width: 18.40cm , Height: 0.60cm , Length: 26.00cm
Weight:   0.175kg
ISBN:  

9780821806036


ISBN 10:   0821806033
Pages:   74
Publication Date:   30 October 1996
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Reviews

This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design. Mathematical Reviews Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort. Computing Reviews


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

wl

Shopping Cart
Your cart is empty
Shopping cart
Mailing List