Information Processing Letters, Volume 91

Volume 91, Number 1, 16 July 2004

Petteri Kaski:
Packing Steiner trees with identical terminal sets. 1-5
Electronic Edition (link) BibTeX
Angelika Hellwig, Dieter Rautenbach, Lutz Volkmann:
Note on the connectivity of line graphs. 7-10
Electronic Edition (link) BibTeX
Chong-Dae Park, Kyung-Yong Chwa:
Hamiltonian properties on the class of hypercube-like networks. 11-17
Electronic Edition (link) BibTeX
Alexander Gaysinsky, Alon Itai, Hadas Shachnai:
Strongly competitive algorithms for caching with pipelined prefetching. 19-27
Electronic Edition (link) BibTeX
Willi Geiselmann, Rainer Steinwandt:
Power attacks on a side-channel resistant elliptic curve implementation. 29-32
Electronic Edition (link) BibTeX
Raphael Chung-Wei Phan:
Impossible differential cryptanalysis of 7-round Advanced Encryption Standard (AES). 33-38
Electronic Edition (link) BibTeX
Douglas R. Stinson:
Attack on a concast signature scheme. 39-41
Electronic Edition (link) BibTeX
Mark Ettinger, Peter Høyer, Emanuel Knill:
The quantum query complexity of the hidden subgroup problem is polynomial. 43-48
Electronic Edition (link) BibTeX
Ying Li, Yibin Hou:
Search audio data with the wavelet pyramidal algorithm. 49-55
Electronic Edition (link) BibTeX

Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. 57-67
Electronic Edition (link) BibTeX
Jongik Kim, Sang Ho Lee, Hyoung-Joo Kim:
Efficient structural joins with clustered extents. 69-75
Electronic Edition (link) BibTeX
Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi:
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. 77-83
Electronic Edition (link) BibTeX
Masataka Takamura, Tom Altman, Yoshihide Igarashi:
Speedup of Vidyasankar's algorithm for the group. 85-91
Electronic Edition (link) BibTeX
Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Bussche:
On the expressive power of semijoin queries. 93-98
Electronic Edition (link) BibTeX
Jop F. Sibeyn:
External matrix multiplication and all-pairs shortest path. 99-106
Electronic Edition (link) BibTeX

Krishna Kumaraswamy, Vasileios Megalooikonomou, Christos Faloutsos:
Fractal dimension and vector quantization. 107-113
Electronic Edition (link) BibTeX
Sung-Ryul Kim, Inbok Lee, Kunsoo Park:
A fast algorithm for the generalized k-keyword proximity problem given keyword offsets. 115-120
Electronic Edition (link) BibTeX
Giacomo Lenzi, Erich Monteleone:
On Fixpoint Arithmetic and Infinite Time Turing Machines. 121-128
Electronic Edition (link) BibTeX
Wing-Kai Hon, Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Siu-Ming Yiu:
Non-shared edges and nearest neighbor interchanges revisited. 129-134
Electronic Edition (link) BibTeX
Seung-Joon Oh, Jae-Yearn Kim:
A hierarchical clustering algorithm for categorical sequence data. 135-140
Electronic Edition (link) BibTeX
Jakob Grue Simonsen:
On confluence and residuals in Cauchy convergent transfinite rewriting. 141-146
Electronic Edition (link) BibTeX
Y. H. Tsin:
On finding an ear decomposition of an undirected graph distributively. 147-153
Electronic Edition (link) BibTeX

Jan Poland:
A coding theorem for Enumerable Output Machines. 157-161
Electronic Edition (link) BibTeX
Pradipta Prometheus Mitra, Muhammad Arshad Ul Abedin, Md. Abul Kashem:
Algorithms for solving the symmetry number problem on trees. 163-169
Electronic Edition (link) BibTeX
Ramtin Khosravi, Mohammad Ghodsi:
Shortest paths in simple polygons with polygon-meet constraints. 171-176
Electronic Edition (link) BibTeX
Jan Remy:
Resource constrained scheduling on multiple machines. 177-182
Electronic Edition (link) BibTeX
Raja Jothi, Balaji Raghavachari:
Survivable network design: the capacitated minimum spanning network problem. 183-190
Electronic Edition (link) BibTeX
Fangguo Zhang, Xiaofeng Chen:
Attack on an ID-based authenticated group key agreement scheme from PKC 2004. 191-193
Electronic Edition (link) BibTeX
Partha Dutta, Rachid Guerraoui, Bastian Pochon:
Fast non-blocking atomic commit: an inherent trade-off. 195-200
Electronic Edition (link) BibTeX

Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti:
The power of first-order quantification over states in branching and linear time temporal logics. 201-210
Electronic Edition (link) BibTeX
Jun Ye, Xiande Liu, Lu Han:
Evolutionary game algorithm for continuous parameter optimization. 211-219
Electronic Edition (link) BibTeX
Hiroshi Nagamochi, Nobuyasu Yamada:
Counting edge crossings in a 2-layered drawing. 221-225
Electronic Edition (link) BibTeX
Yong H. Shin, Hyokyung Bahn:
A scalable Web cache sharing scheme. 227-232
Electronic Edition (link) BibTeX
Markus Müller-Olm, Helmut Seidl:
Computing polynomial program invariants. 233-244
Electronic Edition (link) BibTeX
Yijie Han:
Improved algorithm for all pairs shortest paths. 245-250
Electronic Edition (link) BibTeX

Ralf Hartmut Güting, Zhiming Ding:
A simple but effective improvement to the plumb-line algorithm. 251-257
Electronic Edition (link) BibTeX
Rainer E. Burkard, Vladimir G. Deineko:
On the Euclidean TSP with a permuted Van der Veen matrix. 259-262
Electronic Edition (link) BibTeX
Bruno Durand, Nikolai K. Vereshchagin:
Kolmogorov-Loveland stochasticity for finite strings. 263-269
Electronic Edition (link) BibTeX
Seth Pettie, Peter Sanders:
A simpler linear time 2/3-epsilon approximation for maximum weight matching. 271-276
Electronic Edition (link) BibTeX
Miklós Bartha, Miklós Krész:
Tutte type theorems for graphs having a perfect internal matching. 277-284
Electronic Edition (link) BibTeX
Steffen Lange, Sandra Zilles:
Formal language identification: query learning vs. Gold-style learning. 285-292
Electronic Edition (link) BibTeX
Chang-Hsiung Tsai, Jimmy J. M. Tan, Lih-Hsing Hsu:
The super-connected property of recursive circulant graphs. 293-298
Electronic Edition (link) BibTeX
Ilyong Chung:
Erratum to: "The design of conference key distribution system employing a symmetric balanced incomplete block design": [Inform. Process. Lett. 81 (2002) 313-318]. 299-300
Electronic Edition (link) BibTeX