000			01165nmm a2200181Ia 4500
008			230306s9999||||xx |||||||||||||||||und||
020			_a9781470439248 (online)
100			_aKnuth, Donald Ervin,
245		0	_aStable marriage and its relation to other combinatorial problems : _ban introduction to the mathematical analysis of algorithms
260			_aProvidence, R.I. : _bAmerican Mathematical Society, _cc1997.
300			_a1 online resource (xiii, 74 p. : ill.)
490			_aCRM Proceedings and Lecture Notes, _vv. 10 _x2472-4890
504			_aIncludes bibliographical references (p. 67-68) and index.
505			_tLecture 1. Introduction, definitions, and examples ; Lecture 2. Existence of a stable matching: the fundamental algorithm ; Lecture 3. Principle of deferred decisions: coupon collecting ; Lecture 4. Theoretical developments: application to the shortest path ; Lecture 5. Searching a table by hashing ; mean behavior of the fundamental algorithm ; Lecture 6. Implementing the fundamental algorithm ; Lecture 7. Research problems
650			_aCombinatorial analysis
650			_aMarriage theorem
856			_uhttp://www.ams.org/crmp/010
999			_c28366 _d28366