Description

Book Synopsis
Uses the 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.

Trade 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

Table of Contents
Introduction, definitions, and examples Existence of a stable matching: the fundamental algorithm Principle of deferred decisions: coupon collecting Theoretical developments: application to the shortest path Searching a table by hashing; mean behavior of thefundamental algorithm Implementing the fundamental algorithm Research problems Annotated bibliography Appendix A. Later developments Appendix B. Solutions to exercises Index.

Stable Marriage and Its Relation to Other

    Product form

    £24.65

    Includes FREE delivery

    RRP £25.95 – you save £1.30 (5%)

    Order before 4pm tomorrow for delivery by Mon 10 Aug 2026.

    A Paperback by Donald E. Knuth

    2 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Stable Marriage and Its Relation to Other by Donald E. Knuth

      Publisher: MP-AMM American Mathematical
      Publication Date: Publication Date: 10/30/1996 12:00:00 AM
      ISBN13: 9780821806036, 978-0821806036
      ISBN10: 0821806033
      Also in:
      Mathematics Discrete mathematics

      Description

      Book Synopsis
      Uses the 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.

      Trade 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

      Table of Contents
      Introduction, definitions, and examples Existence of a stable matching: the fundamental algorithm Principle of deferred decisions: coupon collecting Theoretical developments: application to the shortest path Searching a table by hashing; mean behavior of thefundamental algorithm Implementing the fundamental algorithm Research problems Annotated bibliography Appendix A. Later developments Appendix B. Solutions to exercises Index.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account