D. Knuth. Seminumerical Algorithms. Addison-Wesley, Reading, MA, 1997. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Fully Linear-Time Approximation Algorithm for Grammar-Based.. - Sakamoto (Correct)
....The grammar based compression is an optimization problem, given an input string, to nd a small context free grammar which generates the single string. This problem is known to be NP hard and not approximable within a constant factor [9] and due to a relation with an algebraic problem [6], it is unlikely to found an algorithm approximating this problem within O(log n= log log n) The framework of the grammar based compression can uniformly describe the dictionarybased coding schemes which are widely presented for real world text compression. For example, LZ78 [16] including LZW ....
D. Knuth. Seminumerical Algorithms. Addison-Wesley, 441-462, 1981.
Non-Abelian Cellular Automata - Moore (1995) (1 citation) (Correct)
....we can represent the CA rule as a polynomial [8] P (x) f 1 f 2 x f 3 x Delta Delta Delta f 2r 1 x 2r 1 after separating out the constant f 0 . We can think of P (x) as the tth row of a Green s function for the CA, and by using fast algorithms to raise P (x) to the tth power [9], we can predict the CA in O(t log t) in serial (on a random access machine) or O(log t) in parallel [1] We now show that a non autonomous version of (1) where the f i vary in space and time, is still predictable in O(log t) parallel time. Definition. NC k is the class of problems that ....
D.E. Knuth, Seminumerical Algorithms. Addison-Wesley, 1981.
Efficient Consistency for Erasure-Coded Data Via.. - Goodson, Wylie.. (2003) (5 citations) (Correct)
....size 2 so that each byte in the data item corresponds to a single y coordinate. This decision limits us to 256 unique x coordinates (i.e. N 256) Since the polynomial is interpolated at the x coordinate points many times, interpolation coefficients are precalculated using Newton s Formula [27]. Given these m (N m) constants, each of the N m code fragment interpolations require m multiplications and 2m additions. Multiplication in the Galois Field is implemented as a lookup table (i.e. a 2 2 B= 64 KB lookup table is used) Addition in the Galois Field is just bitwise XOR. ....
Donald Ervin Knuth. Seminumerical algorithms, volume 2. Addison-Wesley, 1981.
Analysis Of Rabin's Irreducibility Test For.. - Panario, Pittel.. (2000) (Correct)
....arithmetic see [2] 8.9) For a constant r3, a division with remainder can be computed with r3M(n) operations in Fq. Finally, we need the computation of h q rood f for polynomials h and f of degree at most n. This exponentiation can be done by means of the classical repeated squaring method (see [17], p. 461 462) In this case, the number of products needed is Cq = 1og 2 q v(q) 1, with v(q) the number of ones in the binary representation of q. Therefore, the cost of computing h q rood f by this method is rCqM(n) operations in Fq for both arithmetics. For an excellent reference book in the ....
D.E. KNUTH. The art of computer programming, vol. 2: seminumerical algo- rithms. Addison-Wesley, Reading MA, 3 edition, 1997.
Running Programs Backwards: the Logical Inversion of Imperative - Ross (2003) (11 citations) (Correct)
....capable of inverting some imperative algorithms, but are inadequate for most general cases. In fact, the abductive modeling of while loops is only an aid in inverting loops and is not strictly required. Other imperative algorithms, including Fibonacci numbers, bubble sort, and Knuth s Algorithm P [Knu81], have been successfully inverted with the use of more advanced logic programming control strategies. Abstract interpretation, dynamic control mechanisms such as coroutining and intelligent backtracking, and search heuristics are very useful in this regard. One promising avenue being investigated ....
Donald E. Knuth. Seminumerical Algorithms. Addison-Wesley, 2nd edition, 1981.
An Analysis of Random Number Generators for a Hardware.. - Martin (2002) (1 citation) (Correct)
....bit6 bit 8 . bit30 bit31 bit1 bit2 Direction of shift bit7 Figure 1: Logical Feedback Shift Register Random Number Generator The random number is read from the highest bits as required. The obvious weakness of this type of RNG is that sequential values fail the serial test described by Knuth [6]. At any time step t there is a 50 probability that the value at time t 1 can be predicted. If for an LFSR of length n at time t the value is v, then at time t 1 the value will be v 2 or v . This is shown in Figure 2 where pairs of values v t and v t 1 are plotted. It can ....
E. Knuth, Donald. Semi numerical algorithms, volume 2. Addison-Wesley Publishing Company, 1969.
A Hardware Implementation of a Genetic Programming System Using.. - Martin (2001) (Correct)
....from an external source, such as a time of day clock, or other source of noise. It also allows the RNG to be preset to a known seed for producing repeatable results. There is a suspicion that this RNG is not ideal because LFSRs are known to perform poorly in the serial test described by Knuth [10] and this is an area for further investigation. 5. Breeding Policy and Operators To conserve memory, a steady state breeding policy was used. Tournament selection is used with a tournament size of two. Larger tournament selection makes little sense with very small populations. The operators ....
E. Knuth, Donald. Semi Numerical Algorithms, volume 2. Addison-Wesley Publishing Company, 1969.
Security Constraints on the Oswald-Aigner Exponentiation Algorithm - Walter (2003) (5 citations) (Correct)
....is discarded without having been used. This should also be done for the Oswald Aigner algorithm. In addition, an extra double needs to be performed to convert each DAAD into DADAD, and the double s output is likewise ignored. Alternatives randomized algorithms exist. Standard m ary exponentiation [5] is not subject to this type of attack, but re use of operands might be detected [16] making that method unsuitable even with key blinding in place. The MIST algorithm [17 19] and an overlapping windows method [3] currently seem to be the most robust choices under these types of attack. 5 ....
D. E. Knuth, The Art of Computer Programming, vol. 2, "Seminumerical Algorithms", 2nd Edition, Addison-Wesley, 1981, 441-466.
Approximation Algorithms for Grammar-Based Data Compression - Lehman (2002) (1 citation) (Correct)
....a constant factor, approximating the smallest grammar for a string is at least as hard as approximating the shortest addition chain containing a speci ed set of numbers. 33 3.3 Background on Addition Chains Addition chains have been studied extensively for decades. There is a survey in Knuth [19] and a less comprehensive, but more recent survey due to Thurber [36] The classical addition chain problem is to nd the shortest addition chain containing a single, speci ed integer n. This is closely allied with the problem of nding the smallest grammar for the unary string x . All major ....
Donald E. Knuth. Seminumerical Algorithms. Addison-Wesley, 1981.
Compact Representation of Domain Parameters of Hyperelliptic.. - Zhang, Liu, Kim (2002) (1 citation) (Correct)
....fields (with q = 2 1 as a Mersenne number) and fields of characteristic 2, i.e. q = 2 . Large prime fields: There is a good reason to choose q as a Mersenne number. No integer division is required for modular reduction in modular multiplication modulo a Mersenne number q = 2 1, see [23] [9]. Suppose a, b, t, u F q , and c = ab = 2 t u, we have c = t u) mod q. There is no Mersenne number between 2 and 2 . Therefore, ECC cannot take advantage of the shortcut for modular multiplication modulo a Mersenne number, when 2 . However, things are di#erent for HCC ....
D.E. Knuth, and E. Donald E., Seminumerical Algorithms, Addison-Wesley, 1981.
On the Provable Security of an Efficient RSA-Based.. - Steinfeld, Pieprzyk.. (2006) (Correct)
No context found.
D. Knuth. Seminumerical Algorithms. Addison-Wesley, Reading, MA, 1997.
Counting Prime Numbers with Short Binary Signed.. - Jjangel Computacion Cs (2006) (Correct)
No context found.
D.E. Knuth, Seminumerical algorithms, Addison-Wesley, 1981.
Credential Management and Secure Single Login for SPKM - Hühnlein (1997) (Correct)
No context found.
D.E. Knuth: The Art of Computer Programming Vol. 2: Seminumerical algorithms, Addison-Wesley, Reading MA, 1981
CR-LIBM: The evaluation of the exponential - Daramy, Defour, de Dinechin.. (2003) (Correct)
No context found.
D. Knuth. The Art of Computer Programming, volume 2, "Seminumerical Algorithms". Addison Wesley, Reading, MA, third edition edition, 1998.
Construction of a Pseudo-Random Generator - From Any One-Way (Correct)
No context found.
Knuth, D., Semi-Numerical Algorithm, The Art of Computer Programming, AddisonWesley, Second Edition, Vol. 2, 1981.
The Discrete Runs Test and the Discrete - Maximum Of Test (Correct)
No context found.
Donald E. Knuth. The Art of Computer Programming, volume 2 (Semi-Numerical Algorithms). Addison-Wesley, Reading, Massachusets, 1981.
Probability Trees - Michael Mccool And (1997) (Correct)
No context found.
D. E. Knuth. Seminumerical Algorithms. AddisonWesley, 1969.
Unknown - (1996) (Correct)
No context found.
D.E. Knuth (1981), Seminumerical Algorithms (2nd ed.), Addison Wesley, Reading, MA.
Unknown - Filename Algebraic Tex (Correct)
No context found.
Knuth, D.: Seminumerical algorithms. 2nd ed. Reading, MA: Addison-Wesley 1981. Gelfand, A.E.: On the cyclic behavior of random transformations on a finite set. Tech. rept. 305, Dept. of Statistics, Stanford Univ. (August 1981).
Image Warping for 3-D Reconstruction - Robustness and Efficiency - Hornegger, Tomasi (Correct)
No context found.
Knuth DE: The Art of Computer Programming, Volume 2, Seminumerical Algorithms. Addison--Weseley, Reading, MA, Third Edition, 1997.
An Adaptive Recommendation System without Explicit Acquisition .. - Shahabi, Chen (2003) (Correct)
No context found.
D. Knuth, "Seminumerical algorithm," The Art of Computer Programming vol. 2, 1997.
Experiences with Oasis+: A Fault Tolerant Storage System - David Watson Yan (2001) (Correct)
No context found.
D. Knuth, Seminumerical Algorithms, The Art of
Quasi-Linear Cellular Automata - Cristopher Moore Santa (1997) (2 citations) (Correct)
No context found.
D.E. Knuth, Seminumerical Algorithms. Addison-Wesley, 1981.
An Analysis of Random Number Generators for a Hardware.. - Martin (2002) (1 citation) (Correct)
No context found.
E. Knuth, Donald. Semi numerical algorithms, volume 2. Addison-Wesley Publishing Company, 1969.
A Wideband Impulsive Noise Survey in the German Telephone.. - Henkel, Keßler (1994) (Correct)
No context found.
Knuth, D. E.: The art of computer programming, seminu- merical algorithms. Vol. 2. 2rid ed. Massachusetts: Reading, 1981.
First 50 documents Next 50
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