1 option
Stable marriage and its relation to other combinatorial problems : an introduction to the mathematical analysis of algorithms / Donald E. Knuth.
- Format:
- Book
- Author/Creator:
- Knuth, Donald Ervin, 1938- author.
- Series:
- CRM proceedings & lecture notes ; Volume 10.
- CRM Proceedings & Lecture Notes ; Volume 10
- Standardized Title:
- Mariages stables et leurs relations avec d'autres problèmes combinatoires. English
- Language:
- English
- Subjects (All):
- Combinatorial analysis--Data processing.
- Combinatorial analysis.
- Marriage theorem--Data processing.
- Marriage theorem.
- Physical Description:
- 1 online resource (90 pages) : illustrations.
- Place of Publication:
- Providence, Rhode Island : American Mathematical Society, 1997.
- Summary:
- 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.
- Notes:
- Includes bibliographical references and index.
- Description based on print version record.
- ISBN:
- 1-4704-3924-7
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.