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

Donald Ervin Knuth

Softcover

ISBN 10: 0821806033 ISBN 13: 9780821806036

Publisher: Amer Mathematical Society, 1996

Synopsis

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.

About this title

Language Notes

Text: English (translation)
Original Language: French

Review

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

Edition details

• Publisher: Amer Mathematical Society
• Publication date: 1996
• Language: English
• ISBN 10: 0821806033
• ISBN 13: 9780821806036
• Binding: Paperback
• Number of pages: 74