Journals in DBLP

Inf. Process. Lett.
2000, volume: 76, number: 3

1. Igor Shparlinski
   Linear complexity of the Naor-Reingold pseudo-random function. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:95-99 [Journal]
   
2. Akira Higuchi, Naofumi Takagi
   A fast addition algorithm for elliptic curve arithmetic in GF(2ⁿ) using projective coordinates. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:101-103 [Journal]
   
3. Keon-Jik Lee, Kee-Young Yoo
   Linear systolic multiplier/squarer for fast exponentiation. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:105-111 [Journal]
   
4. Kuo-Liang Chung, Wen-Ming Yan
   On the number of spanning trees of a multi-complete/star related graph. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:113-119 [Journal]
   
5. Ho-Hyun Park, Chin-Wan Chung
   Complexity of estimating multi-way join result sizes for area skewed spatial data. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:121-129 [Journal]
   
6. Leslie Lamport, Sharon E. Perl, William E. Weihl
   When does a correct mutual exclusion algorithm guarantee mutual exclusion? [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:131-134 [Journal]
   
7. Hyun-Sung Kim, Sung-Woo Lee, Kee-Young Yoo
   Partitioned systolic architecture for modular multiplication in GF(2^m). [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:135-139 [Journal]
   
8. Florian Roussel, Irena Rusu
   Recognizing i-triangulated graphs in O(mn) time. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2000, v:76, n:3, pp:141-147 [Journal]