Donald E. Knuth: The Art of Computer Programming, Volume 1: Fundamental Algorithms, Addison-Wesley, 1973.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of computations, the incredible speed and exactness o#ered new possibilities in mathematics. At the same time, new research branches had to be explored numerical stability, generation of random numbers, or algorithms and their complexity, just to name a few. The famous books of Knuth [10] reflect most of these trends, and at the same time they show that it was then necessary to have computer and mathematics experts to do not only the programming, but also feed the input into the software and to interpret the output. The concept of a user interface was almost unknown, except for ....

Donald W. Knuth: The Art of Computer Programming, vol. 1--3, http: //www-cs-faculty.stanford.edu/~knuth/taocp.html, Addison-Wesley.

....disks inside a string. The basic idea is to use a numeric encoding of a permutation of f1; 2; kg that assigns each permutation a unique number between 1 and k . We then pick the permutation by its encoding. Numbering schemes for permutations are well known. We present one due to Knuth ([18]) in Figure 6.2. 131 6.3 Evaluation of Pseudo Random Number Based Schemes Experimental results suggests that the pseudo random number based addressing schemes work very well for one step translation. Using the scheme in two step translation, where we first permute the string addresses and then ....

Donald E. Knuth: The Art of Computer Programming, Volume 2 / Seminumerical Algorithms. Second Edition, Addison-Wesley Publishing Company, Reading Massachusetts, 1981

....ten pigeons) If ten marksmen shoot at ten pigeons simultaneously some pigeons will survive even if all the marksmen are sharpshooters. Show by simulation how many pigeons remain alive. 11. Chi square test) The most often used method of examining random distributions is the chi square ( 2 ) test [KNU69]. Assume we want to test a die simulated on our computer. Then we have to throw the die n times and record how often every single result was obtained; let us denote their number by Y s . Hereupon, the formula V = 1 n k X s=1 Y 2 s p s Gamma n is to be computed where k is the ....

Donald E. Knuth: The Art of Computer Programming. Vol. 2, Seminumerical Algorithms. Addison-Wesley Publishing Company, 1969. Section 4.5.4 of this book gives an extensive overview of methods to find prime factors of integers and to decide primality. References chapter Composed objects: Rows.

....an allocation request would fail. In a continuous system the administration of which parts of memory might be used is updated at each assignment, therefore immediatly detecting parts of memory no longer needed . For an overview of the types of automatic memory management or garbage collectors see [Knu69,App91,Wil92], further details on discontinuous garbage collectors can be found in [McC60,FY60,Che70,App89,App91,LH83] Both continuous and discontinuous memory management systems have their advantages and disadvantages. A continuous system uses the smallest possible amount of memory, but usually incurs a high ....

Donald E. Knuth: The Art of Computer Programming, Volume 1: Fundamental Algorithms, chapter 2.3.5, pages 406-422. Addison-Wesley, Reading, Massachusetts, 1969.

No context found.

Donald E. Knuth: The Art of Computer Programming, Volume 1: Fundamental Algorithms, Addison-Wesley, 1973.

No context found.

Donald E. Knuth: The Art of Computer Programming, Volume 3 / Sorting and Searching. Addison-Wesley Publishing Company, Reading Massachusetts, 1973

No context found.

Donald E. Knuth: The Art of Computer Programming, Volume 1 / Fundamental Algortihms. Second Edition, Addison-Wesley Publishing Company, Reading Massachusetts, 1973

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC