Information Processing Letters, Volume 76

Volume 76, Numbers 1-2, 20 November 2000

• Riccardo Focardi, Flaminia L. Luccio, David Peleg:
  Feedback vertex set in hypercubes. 1-5
  Electronic Edition (link) BibTeX
• Sergei Bespamyatnikh, Michael Segal:
  Enumerating longest increasing subsequences and patience sorting. 7-11
  Electronic Edition (link) BibTeX
• Ryuhei Uehara, Zhi-Zhong Chen:
  Parallel approximation algorithms for maximum weighted matching in general graphs. 13-17
  Electronic Edition (link) BibTeX
• Tomasz Borzyszkowski:
  Generalized interpolation in CASL. 19-24
  Electronic Edition (link) BibTeX
• Lanfranco Lopriore:
  Protection in a single-address-space environment. 25-32
  Electronic Edition (link) BibTeX
• Matthias Schonlau, Martin Theus:
  Detecting masquerades in intrusion detection based on unpopular commands. 33-38
  Electronic Edition (link) BibTeX
• Joan Serra-Sagristà:
  Enumeration of lattice points in l₁ norm. 39-44
  Electronic Edition (link) BibTeX
• Jue Xue, Ju Liu:
  A network-flow-based lower bound for the minimum weighted integer coloring problem. 45-50
  Electronic Edition (link) BibTeX
• Joep Aerts, Jan H. M. Korst, Sebastian Egner:
  Random duplicate storage strategies for load balancing in multimedia servers. 51-59
  Electronic Edition (link) BibTeX
• Jin-yi Cai, Ajay Nerurkar:
  A note on the non-NP-hardness of approximate lattice problems under general Cook reductions. 61-66
  Electronic Edition (link) BibTeX
• L. Javier García-Villalba, Amparo Fúster-Sabater:
  On the linear complexity of the sequences generated by nonlinear filterings. 67-73
  Electronic Edition (link) BibTeX
• Chu Min Li:
  Equivalency reasoning to solve a class of hard SAT problems. 75-81
  Electronic Edition (link) BibTeX
• Francesc Comellas, Javier Ozón, Joseph G. Peters:
  Deterministic small-world communication networks. 83-90
  Electronic Edition (link) BibTeX
• Stefan Dobrev, Heiko Schröder, Ondrej Sýkora, Imrich Vrto:
  Evolutionary graph colouring. 91-94
  Electronic Edition (link) BibTeX

Volume 76, Number 3, 15 December 2000

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

Volume 76, Number 4-6, 31 December 2000

• Leah Epstein:
  A note on on-line scheduling with precedence constraints on identical machines. 149-153
  Electronic Edition (link) BibTeX
• Wolfgang W. Bein, Rudolf Fleischer, Lawrence L. Larmore:
  Limited bookmark randomized online algorithms for the paging problem. 155-162
  Electronic Edition (link) BibTeX
• Xuehou Tan:
  On optimal bridges between two convex regions. 163-168
  Electronic Edition (link) BibTeX
• Limin Xiang, Kazuo Ushijima, Changjie Tang:
  Efficient loopless generation of Gray codes for k-ary trees. 169-174
  Electronic Edition (link) BibTeX
• Erez Hartuv, Ron Shamir:
  A clustering algorithm based on graph connectivity. 175-181
  Electronic Edition (link) BibTeX