Information Processing Letters, Volume 92

Volume 92, Number 1, 16 October 2004

• Masafumi Yamashita, Ichiro Suzuki, Tiko Kameda:
  Searching a polygonal region by a group of stationary k-searchers. 1-8
  
• Gabriel Valiente:
  Trading uninitialized space for time. 9-13
  
• Chung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
  The super laceability of the hypercubes. 15-21
  
• Ding Liu:
  A strong lower bound for approximate nearest neighbor searching. 23-29
  
• Xiaofan Yang, David J. Evans, Hong-Jian Lai, Graham M. Megson:
  Generalized honeycomb torus is Hamiltonian. 31-37
  
• Bruce E. Litow, Narsingh Deo:
  Graph compression and the zeros of polynomials. 39-44
  
• Byron L. D. Bezerra, Francisco de A. T. de Carvalho:
  A symbolic approach for content-based information filtering. 45-52
  
• Sharon A. Curtis:
  Darts and hoopla board design. 53-56
  

Volume 92, Number 2, 31 October 2004

• Atsuko Yamaguchi, Kiyoko F. Aoki, Hiroshi Mamitsuka:
  Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees. 57-63
  
• Andrzej Szepietowski, Monika Targan:
  A note on the oriented chromatic number of grids. 65-70
  
• Pascal Ochem:
  Oriented colorings of triangle-free planar graphs. 71-76
  
• S. Fossé, Gwénaël Richomme:
  Some characterizations of Parikh matrix equivalent binary words. 77-82
  
• Hagen Völzer:
  A constructive proof for FLP. 83-87
  
• Giorgio Ausiello, Marc Demange, Luigi Laura, Vangelis Th. Paschos:
  Algorithms for the On-Line Quota Traveling Salesman Problem. 89-94
  
• Maciej Kurowski:
  A 1.235 lower bound on the number of points needed to draw all n-vertex planar graphs. 95-98
  
• Heum-Geun Kang, Jun-Ki Min, Seok-Ju Chun, Chin-Wan Chung:
  A compression method for prefix-sum cubes. 99-105
  

Volume 92, Number 3, 15 November 2004

• Garth Isaak, Darren A. Narayan:
  A classification of tournaments having an acyclic tournament as a minimum feedback arc set. 107-111
  
• Benjamin Doerr:
  Global roundings of sequences. 113-116
  
• Ilia Krasikov, S. D. Noble:
  Finding next-to-shortest paths in a graph. 117-119
  
• Alok Aggarwal, Youngcheul Wee:
  On the symmetric angle-restricted nearest neighbor problem. 121-126
  
• Jin-yi Cai, Robert A. Threlfall:
  A note on quadratic residuosity and UP. 127-131
  
• Jeong Min Shim, Seok Il Song, Jae Soo Yoo, Young Soo Min:
  An efficient cache conscious multi-dimensional index structure. 133-142
  
• Igor Shparlinski:
  On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA. 143-147
  
• Ismail Hakki Toroslu, Ahmet Cosar:
  Dynamic programming solution for multiple query optimization problem. 149-155
  
• George Davie:
  Characterising the Martin-Löf random sequences using computably enumerable sets of measure one. 157-160
  

Volume 92, Number 4, 30 November 2004

• San Skulrattanakulchai:
  Acyclic colorings of subcubic graphs. 161-167
  
• Jens Lechtenbörger:
  Computing unique canonical covers for simple FDs via transitive reduction. 169-174
  
• Irit Katriel:
  On the algebraic complexity of set equality and inclusion. 175-178
  
• Abul Kashem, M. Ziaur Rahman:
  An optimal parallel algorithm for c-vertex-ranking of trees. 179-184
  
• Aaron Windsor:
  A simple proof that finding a maximal independent set in a graph is in NC. 185-187
  
• Soumen Maity, Amiya Nayak, Bimal K. Roy:
  Characterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links. 189-197
  
• Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
  Cryptographic key assignment schemes for any access control policy. 199-205
  
• Lars Engebretsen:
  Simplified tight analysis of Johnson's algorithm. 207-210
  

Volume 92, Number 5, 16 December 2004

• Tatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic:
  Minimal forbidden subwords. 211-218
  
• Donglei Du:
  Optimal preemptive semi-online scheduling on two uniform processors. 219-223
  
• Eberhard Bertsch, Mark-Jan Nederhof:
  Fast parallel recognition of LR language suffixes. 225-229
  
• Ku-Young Chang, Howon Kim, Ju-Sung Kang, Hyun-Sook Cho:
  An extension of TYT algorithm for GF((2n)m) using precomputation. 231-234
  
• Jack H. Lutz:
  Computability versus exact computability of martingales. 235-237
  
• K. S. Cheung:
  New characterization for live and reversible augmented marked graphs. 239-243
  
• Amit Weisman, L. Paul Chew, Klara Kedem:
  Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations. 245-251
  
• Owen Kaser:
  Compressing arrays by ordering attribute values. 253-256
  
• Eyas El-Qawasmeh:
  Word prediction using a clustered optimal binary search tree. 257-265
  

Volume 92, Number 6, 31 December 2004

• Cezar Câmpeanu, Sheng Yu:
  Pattern expressions and pattern automata. 267-274
  
• Daniel J. Dougherty, Stanley M. Selkow:
  The complexity of the certification of properties of Stable Marriage. 275-277
  
• Isabel Nunes:
  Method redefinition--ensuring alternative behaviors. 279-285
  
• John Hershberger:
  Kinetic collision detection with fast flight plan changes. 287-291
  
• Ayelet Butman, Revital Eres, Gad M. Landau:
  Scaled and permuted string matching. 293-297
  
• Yu-Wei Chen:
  An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services. 299-302
  
• Bang Ye Wu, Zheng-Nan Huang, Fu-Jie Zhan:
  Exact algorithms for the minimum latency problem. 303-309
  
• Kuen-Fang Jea, Ming-Yuan Chang, Ke-Chung Lin:
  An efficient and flexible algorithm for online mining of large itemsets. 311-316