Information Processing Letters, Volume 83

Volume 83, Number 1, 16 July 2002

• Arnaud Lefebvre, Thierry Lecroq:
  Compror: On-line lossless data compression with a factor oracle. 1-6
  
• Harald Fecher, Mila E. Majster-Cederbaum, Jinzhao Wu:
  Bundle event structures: A revised cpo approach. 7-12
  
• Alan J. Hoffman, Kate Jenkins, Tim Roughgarden:
  On a game in directed graphs. 13-16
  
• Ingo Wegener:
  A simplified correctness proof for a well-known algorithm computing strongly connected components. 17-19
  
• Atsushi Sasaki:
  A time-optimal distributed sorting algorithm on a line network. 21-26
  
• Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenberger:
  Lower bounds on precedence-constrained scheduling for parallel processors. 27-32
  
• Amihood Amir, Moshe Lewenstein, Ely Porat:
  Approximate swapped matching. 33-39
  
• Maharaj Mukherjee, Kanad Chakraborty:
  A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. 41-48
  
• Haengrae Cho:
  Database recovery using incomplete page versions in a multisystem data sharing environment. 49-55
  

Volume 83, Number 2, 31 July 2002

• Fedor V. Fomin, Andrzej Lingas:
  Approximation algorithms for time-dependent orienteering. 57-62
  
• Bruno Carpentieri:
  Sending compressed messages to a learned receiver on a bidirectional line. 63-70
  
• Tatsuhiro Tsuchiya, Tohru Kikuno:
  Byzantine quorum systems with maximum availability. 71-77
  
• Byeong-Mo Chang:
  Managing the granularity of constraint-based analyses by rule transformation. 79-88
  
• Leszek Gasieniec, Andrzej Lingas:
  On adaptive deterministic gossiping in ad hoc radio networks. 89-93
  
• Wei-Hua He:
  Weaknesses in some multisignature schemes for specified group of verifiers. 95-99
  
• Roberto Barbuti, Cinzia Bernardeschi, Nicoletta De Francesco:
  Abstract interpretation of operational semantics for secure information flow. 101-108
  
• Igor Shparlinski:
  Security of most significant bits of g^x2. 109-113
  
• Dong-Ho Lee, Shin Heu, Hyoung-Joo Kim:
  An efficient algorithm for hyperspherical range query processing in high-dimensional data space. 115-123
  

Volume 83, Number 3, 16 August 2002

• Matthieu Latapy, Clémence Magnien:
  Coding distributive lattices with Edge Firing Games. 125-128
  
• Marek Piotrów:
  A note on constructing binary heaps with periodic networks. 129-134
  
• L. Paul Chew, Haggai David, Matthew J. Katz, Klara Kedem:
  Walking around fat obstacles. 135-140
  
• Francis Y. L. Chin, Fu Lee Wang:
  Efficient algorithm for transversal of disjoint convex polygons. 141-144
  
• Rafael Dueire Lins:
  An efficient algorithm for cyclic reference counting. 145-150
  
• Ricardo A. Baeza-Yates, Hector Soza-Pollman:
  Optimal bounded disorder. 151-157
  
• Alberto Apostolico, Stefano Lonardi:
  A speed-up for the commute between subword trees and DAWGs. 159-161
  
• Mohammad Taghi Hajiaghayi, Yashar Ganjali:
  A note on the Consecutive Ones Submatrix problem. 163-166
  
• Pierre-Yves Schobbens, Gunter Saake, Amílcar Sernadas, Cristina Sernadas:
  A two-level temporal logic for evolving specifications. 167-172
  
• Claudio Arbib, Alberto Caprara:
  On the stability number of the edge intersection of two graphs. 173-174
  
• Navneet Malpani, Jianer Chen:
  A note on practical construction of maximum bandwidth paths. 175-180
  

Volume 83, Number 4, 31 August 2002

• Boris Aronov:
  A lower bound on Voronoi diagram complexity. 183-185
  
• Fabian Schwarzer, Achim Schweikard:
  On the complexity of one-shot translational separability. 187-194
  
• Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
  Steiner trees in uniformly quasi-bipartite graphs. 195-200
  
• Jean-Luc Fouquet:
  No odd pairs in minimal imperfect NP₅ graphs. 201-204
  
• Eduardo Sany Laber, Leonardo Gomes Holanda:
  Improved bounds for asymmetric communication protocols. 205-209
  
• John D. Holt, Soon Myoung Chung:
  Mining association rules using inverted hashing and pruning. 211-220
  
• Paul C. Attie:
  Wait-free Byzantine consensus. 221-227
  
• Mikhail Y. Kovalyov, Marcus Pattloch, Günter Schmidt:
  A polynomial algorithm for lot-size scheduling of two type tasks. 229-235
  

Volume 83, Number 5, 15 September 2002

• Benny K. Nielsen, Pawel Winter, Martin Zachariasen:
  On the location of Steiner points in uniformly-oriented Steiner trees. 237-241
  
• Francesco Quaglia:
  A restriction of the elastic time algorithm. 243-249
  
• Ph. Schnoebelen:
  Verifying lossy channel systems has nonprimitive recursive complexity. 251-261
  
• Steven D. Galbraith, John Malone-Lee, Nigel P. Smart:
  Public key signatures in the multi-user setting. 263-266
  
• Amnon Ta-Shma:
  Storing information with extractors. 267-274
  
• Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos:
  New bounds on the size of the minimum feedback vertex set in meshes and butterflies. 275-280
  
• Subhamoy Maitra:
  Highly nonlinear balanced Boolean functions with good local and global avalanche characteristics. 281-286
  
• Funda Ergün, Rakesh K. Sinha, Lisa Zhang:
  An improved FPTAS for Restricted Shortest Path. 287-291
  
• Gerard J. Chang:
  Corrigendum to "The path-partition problem in block graphs". 293
  

Volume 83, Number 6, 2002

• Shahrokh Saeednia:
  An identity-based society oriented signature scheme with anonymous signers. 295-299
  
• Chang-Hsiung Tsai, Jimmy J. M. Tan, Tyne Liang, Lih-Hsing Hsu:
  Fault-tolerant hamiltonian laceability of hypercubes. 301-306
  
• Ora Arbell, Gad M. Landau, Joseph S. B. Mitchell:
  Edit distance of run-length encoded strings. 307-314
  
• Chor Ping Low:
  An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique. 315-321
  
• Zhiyi Tan, Yong He:
  Optimal online algorithm for scheduling on two identical machines with machine availability constraints. 323-329
  
• Loren Schwiebert:
  There is no optimal routing policy for the torus. 331-336
  
• Sheng-Tzong Cheng, Ing-Ray Chen:
  A self-adjusting quality of service control scheme. 337-344
  
• Carles Padró, Germán Sáez:
  Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. 345-351