CS Structure

About CS Structure | Search | Help  

 

  • distributed system; shared memory; operating system; real-time system ( Subthemes )
  •          shared memory; distributed shared; file system; parallel program ( Subthemes )
  •                  neural network; recurrent neural; interconnection network; parallel algorithm ( Subthemes )
  •                          quasi-monte carlo; random number; number generator; lattice rule ( Subthemes )
  • THE ART OF COMPUTER PROGRAMMING - KNUTH  
    By
    Date 
    Refs | Theme tree | Cited by 1497 This paper is cited in the following contexts

    Citation List: key=1002586
     

    Citation List:

    Citation Tree

    1) MELLIN TRANSFORMS AND ASYMPTOTICS: HARMONIC SUMS  
    By And Philippe Dumas    Dedicated To Don Knuth    N. G. De Bruijn    Philippe Flajolet    Xavier Gourdon
    Date  April 1996
    Refs | Theme tree | Cited by 48 |  CiteSeer   (Hub and Authority Citation)

    2) ASYMPTOTIC BEHAVIOR OF THE LEMPEL-ZIV PARSING SCHEME AND DIGITAL SEARCH TREES  
    By Wojciech Szpankowski
    Date  January 1995
    Refs | Theme tree | Cited by 38 |  CiteSeer   (Authority Citation)

    3) GENERALIZED DIGITAL TREES AND THEIR DIFFERENCE-DIFFERENTIAL EQUATIONS  
    By Bruce Richmond
    Date  April 1996
    Refs | Theme tree | Cited by 20 |  CiteSeer   (Authority Citation)

    4) AUTOMATIC AVERAGE-CASE ANALYSIS OF ALGORITHMS  
    By Bruno Salvy    Domaine De Voluceau    E De Recherche    Et En Automatique    Paul Zimmermann
    Date  June 1993
    Refs | Theme tree | Cited by 33 |  CiteSeer   (Authority Citation)

    5) THE NUMBER FIELD SIEVE  
    By A. K. Lenstra    H. W. Lenstra    J. M. Pollard    M. S. Manasse
    Date  July 2001
    Refs | Theme tree | Cited by 33 |  CiteSeer   (Authority Citation)

    6) ON THE DISTRIBUTION FOR THE DURATION OF A RANDOMIZED LEADER ELECTION ALGORITHM  
    By Hosam M. Mahmoud    James Allen Fill    Wojciech Szpankowski
    Date  August 1996
    Refs | Theme tree | Cited by 13 |  CiteSeer  

    7) ON FAST MULTIPLICATION OF POLYNOMIALS OVER ARBITRARY ALGEBRAS  
    By David G. Cantor    Erich Kaltofen
    Date  January 1994
    Refs | Theme tree | Cited by 45 |  CiteSeer  

    8) COMPUTING FROBENIUS MAPS AND FACTORING POLYNOMIALS  
    By Joachim Von Zur Gathen    Victor Shoup
    Date  December 1996
    Refs | Theme tree | Cited by 38 |  CiteSeer  

    9) FAST IMPLEMENTATIONS OF RSA CRYPTOGRAPHY  
    By J. Vuillemin    M. Shand
    Date  August 1995
    Refs | Theme tree | Cited by 40 |  CiteSeer   (Authority Citation)

    10) LIST PROCESSING IN REAL TIME ON A SERIAL COMPUTER  
    By Henry G. Baker
    Date  December 1994
    Refs | Theme tree | Cited by 158 |  CiteSeer  

    11) A UNIVERSAL STATISTICAL TEST FOR RANDOM BIT GENERATORS  
    By Ueli M. Maurer
    Date  June 1995
    Refs | Theme tree | Cited by 25 |  CiteSeer   (Authority Citation)

    12) THE CHARACTERIZATION OF DATA-ACCUMULATING ALGORITHMS  
    By Selim G. Akl    Stefan D. Bruda
    Date  May 2001
    Refs | Theme tree | Cited by 11 |  CiteSeer  

    13) SPEEDING UP THE COMPUTATIONS ON AN ELLIPTIC CURVE USING ADDITION-SUBTRACTION CHAINS  
    By Jorge Olivos
    Date  March 1991
    Refs | Theme tree | Cited by 20 |  CiteSeer   (Authority Citation)

    14) AVERAGE PROFILE AND LIMITING DISTRIBUTION FOR A PHRASE SIZE IN THE LEMPEL-ZIV PARSING ALGORITHM  
    By Guy Louchard    Wojciech Szpankowski
    Date  October 1994
    Refs | Theme tree | Cited by 16 |  CiteSeer  

    15) A LIMIT THEOREM FOR "QUICKSORT"  
    By
    Date  May 1999
    Refs | Theme tree | Cited by 13 |  CiteSeer   (Authority Citation)

    16) A HYPERCUBIC SORTING NETWORK WITH NEARLY LOGARITHMIC DEPTH  
    By C. Greg Plaxton
    Date  January 1997
    Refs | Theme tree | Cited by 9 |  CiteSeer  

    17) INVERSIVE PSEUDORANDOM NUMBER GENERATORS: CONCEPTS, RESULTS AND LINKS  
    By Peter Hellekalek
    Date  March 1996
    Refs | Theme tree | Cited by 10 |  CiteSeer  

    18) GENERATING POWER OF LAZY SEMANTICS  
    By Jerzy Karczmarczuk
    Date  April 1997
    Refs | Theme tree | Cited by 10 |  CiteSeer   (Authority Citation)

    19) AUTOMATIC ACCURATE TIME-BOUND ANALYSIS FOR HIGH-LEVEL LANGUAGES  
    By And Gustavo Gomez    Yanhong A. Liu
    Date  January 1970
    Refs | Theme tree | Cited by 21 |  CiteSeer  

    20) MELLIN TRANSFORMS AND ASYMPTOTICS: FINITE DIFFERENCES AND RICE'S INTEGRALS  
    By And Robert Sedgewick    Philippe Flajolet
    Date  April 1996
    Refs | Theme tree | Cited by 15 |  CiteSeer   (Authority Citation)

    21) QUICKSORT ALGORITHM AGAIN REVISITED  
    By Charles Knessl    Wojciech Szpankowski
    Date  March 1997
    Refs | Theme tree | Cited by 9 |  CiteSeer   (Authority Citation)

    22) EFFICIENT MULTIPRECISION FLOATING POINT MULTIPLICATION WITH OPTIMAL DIRECTIONAL ROUNDING  
    By Jeremy R. Johnson    Werner Krandick
    Date  April 1997
    Refs | Theme tree | Cited by 9 |  CiteSeer   (Authority Citation)

    23) STORING TEXT RETRIEVAL SYSTEMS ON CD-ROM: COMPRESSION AND ENCRYPTION CONSIDERATIONS  
    By Abraham Bookstein    Scott Deerwester    Shmuel T. Klein
    Date  May 1998
    Refs | Theme tree | Cited by 18 |  CiteSeer   (Authority Citation)

    24) LH* RS : A HIGH-AVAILABILITY SCALABLE DISTRIBUTED DATA STRUCTURE USING REED SOLOMON CODES  
    By Thomas J. E. Schwarz    Witold Litwin
    Date  November 1999
    Refs | Theme tree | Cited by 9 |  CiteSeer  

    25) A LOWER BOUND FOR SORTING NETWORKS BASED ON THE SHUFFLE PERMUTATION  
    By C. Greg Plaxton    Torsten Suel
    Date  January 1997
    Refs | Theme tree | Cited by 7 |  CiteSeer   (Authority Citation)

  • Next 25 articles...