Atjaunināt sīkdatņu piekrišanu

Selected Papers on Analysis of Algorithms [Mīkstie vāki]

3.94/5 (36 ratings by Goodreads)
(Stanford University, California)
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 49,51 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Citas grāmatas par šo tēmu:
The fourth volume of influential computer scientist Knuth's collected papers is devoted to a specialty he founded in the 1960s to deal with quantitative studies of computer techniques and predict the efficiency of computer programs. He has added updated material to most of the 34 papers. Distributed in the US by Cambridge U. Press. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Donald Knuth's influence in computer science ranges from the invention of methods for translating and defining programming languages to the creation of the TeX and METAFONT systems for desktop publishing. His award-winning textbooks have become classics; his scientific papers are widely referenced and stand as milestones of development over a wide range of topics. The present volume, which is the fourth in a series of his collected works, is devoted to an important subfield of Computer Science that Knuth founded in the 1960s and still considers his main life's work. This field, to which he gave the name Analysis of Algorithms, deals with quantitative studies of computer techniques, leading to methods for understanding and predicting the efficiency of computer programs. More than 30 of the papers that helped to shape this field are reprinted and updated in the present collection, together with historical material that has not previously been published.

This volume is devoted to Analysis of Algorithms, a field that Knuth founded and still considers his main life's work.

Analysis of Algorithms is the fourth in a series of collected works by world-renowned computer scientist Donald Knuth. This volume is devoted to an important subfield of Computer Science that Knuth founded in the 1960s and still considers his main life's work. This field, to which he gave the name Analysis of Algorithms, deals with quantitative studies of computer techniques, leading to methods for understanding and predicting the efficiency of computer programs. Analysis of Algorithms, which has grown to be a thriving international discipline, is the unifying theme underlying Knuth's well known book The Art of Computer Programming. More than 30 of the fundamental papers that helped to shape this field are reprinted and updated in the present collection, together with historical material that has not previously been published. Although many ideas come and go in the rapidly changing world of computer science, the basic concepts and techniques of algorithmic analysis will remain important as long as computers are used.


Analysis of Algorithms is the fourth in a series of collected works by world-renowned computer scientist Donald Knuth. This volume is devoted to an important subfield of Computer Science that Knuth founded in the 1960s and still considers his main life's work. This field, to which he gave the name Analysis of Algorithms, deals with quantitative studies of computer techniques, leading to methods for understanding and predicting the efficiency of computer programs. Analysis of Algorithms, which has grown to be a thriving international discipline, is the unifying theme underlying Knuth's well known book The Art of Computer Programming. More than 30 of the fundamental papers that helped to shape this field are reprinted and updated in the present collection, together with historical material that has not previously been published. Although many ideas come and go in the rapidly changing world of computer science, the basic concepts and techniques of algorithmic analysis will remain important as long as computers are used.

Mathematical Analysis of Algorithms
1(18)
The Dangers of Computer Science Theory
19(8)
The Analysis of Algorithms
27(8)
Big Omicron and Big Omega and Big Theta
35(8)
Optimal Measurement Points for Program Frequency Counts
43(12)
Estimating the Efficiency of Backtrack Programs
55(22)
Ordered Hash Tables
77(24)
Activity in an Interleaved Memory
101(4)
An Analysis of Alpha-Beta Pruning
105(44)
Notes on Generalized Dedekind Sums
149(32)
The Distribution of Continued Fraction Approximations
181(8)
Evaluation of Porter's Constant
189(6)
The Subtractive Algorithm for Greatest Common Divisors
195(10)
Length of Strings for a Merge Sort
205(10)
The Average Height of Planted Plane Trees
215(10)
The Toilet Paper Problem
225(10)
An Analysis of Optimum Caching
235(22)
A Trivial Algorithm Whose Analysis Isn't
257(26)
Deletions That Preserve Randomness
283(20)
Analysis of a Simple Factorization Algorithm
303(38)
The Expected Linearity of a Simple Equivalence Algorithm
341(50)
Textbook Examples of Recursion
391(24)
An Exact Analysis of Stable Allocation
415(14)
Stable Husbands
429(18)
Shellsort With Three Increments
447(20)
The Average Time for Carry Propagation
467(6)
Linear Probing and Graphs
473(12)
A Terminological Proposal
485(8)
Postscript About NP-Hard Problems
493(2)
An Experiment in Optimal Sorting
495(6)
Duality in Addition Chains
501(4)
Complexity Results for Bandwidth Minimization
505(30)
The Problem of Compatible Representatives
535(10)
The Complexity of Nonuniform Random Number Generation
545(60)
Index 605