External Links

    Journal: Inf. Process. Lett.

    Volume 93, Issue 6

    263 -- 268Frank Nielsen, Richard Nock. A fast deterministic smallest enclosing disk approximation algorithm
    269 -- 274Ryoichi Kato, Osamu Watanabe. Substring search and repeat search using factor oracles
    275 -- 279. Finding a longest nonnegative path in a constant degree tree
    281 -- 288K. Rustan M. Leino. Efficient weakest preconditions
    289 -- 293Sibylle B. Fröschle. The decidability border of hereditary history preserving bisimilarity
    295 -- 299Ruy Fabila Monroy, Jorge Urrutia. Graham triangulations and triangulations with a center are hamiltonean
    301 -- 306Mikio Kano, Criel Merino, Jorge Urrutia. On plane spanning trees and cycles of multicolored point sets with few intersections
    307 -- 313Thierry Garcia, David Semé. A Coarse-Grained Multicomputer algorithm for the detection of repetitions

    Volume 93, Issue 5

    207 -- 215Sandeep S. Kulkarni, Chase Bolen, John Oleszkiewicz, Andrew Robinson. Alternators in read/write atomicity
    217 -- 223Mohammad Reza Mousavi, Michel A. Reniers, Jan Friso Groote. A syntactic commutativity format for SOS
    225 -- 230Franck Leprévost, Jean Monnerat, Sébastien Varrette, Serge Vaudenay. Generating anomalous elliptic curves
    231 -- 237Hiroshi Nagamochi. On computing minimum (::::s, t::::)-cuts in digraphs
    239 -- 244Frédéric Chataigner. Approximating the Maximum Agreement Forest on ::::k:::: trees
    245 -- 248Min Xu, Jun Ming Xu, Xin-Min Hou. Fault diameter of Cartesian product graphs
    249 -- 253I-Hsuan Yang, Chien-Pin Huang, Kun-Mao Chao. A fast algorithm for computing a longest common increasing subsequence
    255 -- 261X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, L. M. Wang. An improved GA and a novel PSO-GA-based hybrid algorithm

    Volume 93, Issue 4

    155 -- 162Mirtha-Lina Fernández. On proving C::E::-termination of rewriting by size-change termination
    163 -- 168Alexander Thomasian. Reconstruct versus read-modify writes in RAID
    169 -- 171Andrzej Lingas, Martin Wahlen. A note on maximum independent set and related problems on box graphs
    173 -- 175Minghui Jiang. UPS-::::k::::: a set partitioning problem with applications in UPS pickup-delivery system
    177 -- 183Jun-Ho Her, R. S. Ramakrishna. External-memory depth-first search algorithm for solid grid graphs
    185 -- 190Nathan Segerlind. Exponential separation between Res(::::k::::) and Res(::::k::::+1) for ::::k:::: leq varepsilonlog::::n::::
    191 -- 198Mingyan Li, Radha Poovendran, David A. McGrew. Minimizing center key storage in hybrid one-way function based group key management with communication constraints
    199 -- 206Stelvio Cimato, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci. Ideal contrast visual cryptography schemes with reversing

    Volume 93, Issue 3

    103 -- 107Akio Fujiyoshi. Linearity and nondeletion on monadic context-free tree grammars
    109 -- 115Andrzej Pelc, David Peleg. Broadcasting with locally bounded Byzantine faults
    117 -- 123Mirtha-Lina Fernández. Relaxing monotonicity for innermost termination
    123 -- 131L. Sunil Chandran, Fabrizio Grandoni. Refined memorization for vertex cover
    133 -- 138Jianxi Fan, Xiaola Lin, Xiaohua Jia. Node-pancyclicity and edge-pancyclicity of crossed cubes
    139 -- 141Jouni K. Seppänen. Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
    143 -- 147Sudip Seal, Srikanth Komarina, Srinivas Aluru. An optimal hierarchical clustering algorithm for gene expression data
    149 -- 153Ludwig Staiger. Constructive dimension equals Kolmogorov complexity

    Volume 93, Issue 2

    53 -- 56Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter. The Helly property on subfamilies of limited size
    57 -- 61Afzel Noore, P. L. Cross. Modeling the reliability of large dynamic distributed non-homogeneous networks
    63 -- 67Haejae Jung. The d-deap ast: a fast and simple cache-aligned d-ary deap
    69 -- 74Steffen Heber, Carla D. Savage. Common intervals of trees
    75 -- 81Celina M. Herrera de Figueiredo, Vinícius G. P. de Sá. Note on the Homogeneous Set Sandwich Problem
    83 -- 89Gill Barequet, Gershon Elber. Optimal bounding cones of vectors in three dimensions
    91 -- 97Angeline Wong, Leejay Wu, Phillip B. Gibbons, Christos Faloutsos. Fast estimation of fractal dimension and correlation integral on stream data
    99 -- 102Jun-Jie Pan, Gerard J. Chang. Isometric-path numbers of block graphs

    Volume 93, Issue 1

    1 -- 5Tee Connie, Andrew Teoh Beng Jin, Michael Goh Kah Ong, David Ngo Chek Ling. PalmHashing: a novel approach for cancelable biometrics
    7 -- 12Daiji Fukagawa, Tatsuya Akutsu. Performance analysis of a greedy algorithm for inferring Boolean functions
    13 -- 17Haim Kaplan, Nira Shafrir. The greedy algorithm for shortest superstrings
    19 -- 24Fengfeng Zhou, Yinlong Xu, Guoliang Chen. No-wait scheduling in single-hop multi-channel LANs
    25 -- 28Michaël Quisquater, Bart Preneel, Joos Vandewalle. Spectral characterization of cryptographic Boolean functions satisfying the (extended) propagation criterion of degree ::::l:::: and order ::::k::::
    29 -- 36Jun Zheng, Shahram Latifi, Emma Regentova, Kai Luo, Xiaolong Wu. Diagnosability of star graphs under the comparison diagnosis model
    37 -- 42Sheng Zhou, Christopher B. Jones. HCPO: an efficient insertion order for incremental Delaunay triangulation
    43 -- 46Daewan Han, Moonsik Lee. An algebraic attack on the improved summation generator with 2-bit memory
    47 -- 52Raúl Durán Díaz, Jaime Muñoz Masqué. Optimal strong primes
    runs on