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

Volume 83, Number 2, 31 July 2002

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

Volume 83, Number 3, 16 August 2002

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

Volume 83, Number 4, 31 August 2002

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

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

Volume 83, Number 6, 2002

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