
Journals in DBLP
 Igor Shparlinski
Linear complexity of the NaorReingold pseudorandom function. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:3, pp:9599 [Journal]
 Akira Higuchi, Naofumi Takagi
A fast addition algorithm for elliptic curve arithmetic in GF(2^{n}) using projective coordinates. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:3, pp:101103 [Journal]
 KeonJik Lee, KeeYoung Yoo
Linear systolic multiplier/squarer for fast exponentiation. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:3, pp:105111 [Journal]
 KuoLiang Chung, WenMing Yan
On the number of spanning trees of a multicomplete/star related graph. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:3, pp:113119 [Journal]
 HoHyun Park, ChinWan Chung
Complexity of estimating multiway join result sizes for area skewed spatial data. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:3, pp:121129 [Journal]
 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:131134 [Journal]
 HyunSung Kim, SungWoo Lee, KeeYoung 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:135139 [Journal]
 Florian Roussel, Irena Rusu
Recognizing itriangulated graphs in O(mn) time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:3, pp:141147 [Journal]
