'This is a very stimulating book!' - N. G. de Bruijn. 'This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design' - ""Mathematical Reviews"". 'This book is an excellent (and enjoyable) means of sketching a large area of computer science for specialists in other fields: It requires little previous knowledge, but expects of the reader a degree of mathematical facility and a willingness to participate. It is really neither a survey nor an introduction; rather, it is a paradigm, a fairly complete treatment of a single example used as a synopsis of a larger subject' - ""SIGACT News"". 'Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort!' - ""Computing Reviews"". The above citations are taken from reviews of the initial French version of this text - a series of seven expository lectures that were given at the University of Montreal in November of 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 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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Silent Way Books, Glenside, PA, USA
Trade Paperback. Zustand: Near Very Good. Pages tight and unmarked; minor shelf wear to wraps. Bestandsnummer des Verkäufers 031171
Anzahl: 1 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 6019906
Anzahl: 3 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers FW-9780821806036
Anzahl: 3 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. 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. Series: CRM Proceedings & Lecture Notes. Num Pages: 74 pages, Illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 253 x 181 x 6. Weight in Grams: 172. . 1996. annotated edition. Paperback. . . . . Bestandsnummer des Verkäufers V9780821806036
Anzahl: 1 verfügbar
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New. Bestandsnummer des Verkäufers 6019906-n
Anzahl: 3 verfügbar
Anbieter: Rarewaves.com USA, London, LONDO, Vereinigtes Königreich
Paperback. Zustand: New. 'This is a very stimulating book!' - N. G. de Bruijn. 'This short book will provide extremely enjoyable reading to anyone with an interest in discrete mathematics and algorithm design' - ""Mathematical Reviews"". 'This book is an excellent (and enjoyable) means of sketching a large area of computer science for specialists in other fields: It requires little previous knowledge, but expects of the reader a degree of mathematical facility and a willingness to participate. It is really neither a survey nor an introduction; rather, it is a paradigm, a fairly complete treatment of a single example used as a synopsis of a larger subject' - ""SIGACT News"". 'Anyone would enjoy reading this book. If one had to learn French first, it would be worth the effort!' - ""Computing Reviews"". The above citations are taken from reviews of the initial French version of this text - a series of seven expository lectures that were given at the University of Montreal in November of 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 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. Bestandsnummer des Verkäufers LU-9780821806036
Anzahl: 2 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Paperback. Zustand: Brand New. annotated edition edition. 74 pages. 10.25x7.25x0.25 inches. In Stock. Bestandsnummer des Verkäufers __0821806033
Anzahl: 1 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. 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. Series: CRM Proceedings & Lecture Notes. Num Pages: 74 pages, Illustrations. BIC Classification: PBV. Category: (P) Professional & Vocational. Dimension: 253 x 181 x 6. Weight in Grams: 172. . 1996. annotated edition. Paperback. . . . . Books ship from the US and Ireland. Bestandsnummer des Verkäufers V9780821806036
Anzahl: 1 verfügbar
Anbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Zustand: new. Bestandsnummer des Verkäufers ef3524bfca054d3ae4b298408ef0ee8b
Anzahl: 3 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 74. Bestandsnummer des Verkäufers 263442804
Anzahl: 3 verfügbar