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.
Product Identifiers
Publisher
American Mathematical Society
ISBN-13
9780821806036
eBay Product ID (ePID)
87761621
Product Key Features
Author
Donald E. Knuth
Publication Name
Stable Marriage and Its Relation to Other Combinatorial Problems
Format
Paperback
Language
English
Subject
Mathematics
Publication Year
1996
Type
Textbook
Number of Pages
74 Pages
Additional Product Features
Title_Author
Donald E. Knuth
Series Title
Crm Proceedings & Lecture Notes
Country/Region of Manufacture
United States
Meistverkauft in Studium & Erwachsenenbildung
Aktuelle Folie {CURRENT_SLIDE} von {TOTAL_SLIDES}- Meistverkauft in Studium & Erwachsenenbildung