Selected Papers on Design of Algorithms (for Algorithmix)

✍ Scribed by Knuth D.E.

• Publisher: CSLI Publications
• Year: 2010
• Tongue: English
• Leaves: 469
• Series: Center for the Study of Language and Information - CSLI Lecture Notes 191
• Category: Library

✦ Synopsis

1. Algorithms. 2. Computer Algorithms. 3. Computer programming

✦ Table of Contents

Knuth, Donald Ervin, Selected papers on design of algorithms 2010 ......Page 3
Copyright ......Page 4
Preface ......Page 8
Acknowledgments ......Page 13
Contents ......Page 6
Chapter 1 Robert W Floyd, in Memoriam 1 ......Page 16
Chapter 2 The Bose-Nelson Sorting Problem 19 ......Page 34
Chapter 3 A One-Way, Stackless Quicksort Algorithm 31 ......Page 46
Chapter 4 Optimum Binary Search Trees 35 ......Page 50
Chapter 5 Dynamic Huffman Coding 51 ......Page 66
Chapter 6 Inhomogeneous Sorting 71 ......Page 86
Chapter 7 Lexicographic Permutations with Restrictions 79 ......Page 94
Chapter 8 Nested Satisfiability 91 ......Page 106
Chapter 9 Fast Pattern Matching in Strings 99 ......Page 114
Chapter 10 Addition Machines 137 ......Page 152
Chapter 11 A Simple Program Whose Proof Isn’t 155 ......Page 170
Chapter 12 Verification of Link-Level Protocols 167 ......Page 182
Chapter 13 A Problem in Concurrent Programming Control 175 ......Page 190
Chapter 14 Optimal Prepaging and Font Caching 181 ......Page 196
Chapter 15 A Generalization of Dijkstra’s Algorithm 209 ......Page 224
Chapter 16 Two-Way Rounding 219 ......Page 234
Chapter 17 Matroid Partitioning 235 ......Page 250
Chapter 18 Irredundant Intervals 245 ......Page 260
Chapter 19 Simple Word Problems in Universal Algebras 275 ......Page 290
Chapter 20 Efficient Representation of Perm Groups 315 ......Page 330
Chapter 21 An Algorithm for Brownian Zeros 329 ......Page 344
Chapter 22 Semi-Optimal Bases for Linear Dependencies 337 ......Page 352
Chapter 23 Evading the Drift in Floating-Point Addition 341 ......Page 356
Chapter 24 Deciphering a Linear Congruential Encryption 349 ......Page 364
Chapter 25 Computation of Tangent, Euler, and Bernoulli Numbers 359 ......Page 374
Chapter 26 Euler’s Constant to 1271 Places 373 ......Page 388
Chapter 27 Evaluation of Polynomials by Computer 383 ......Page 398
Chapter 28 Minimizing Drum Latency Time 397 ......Page 412
Index 437 ......Page 452
cover......Page 1

✦ Subjects

Библиотека;Компьютерная литература;Алгоритмы и структуры данных;