External Links

    Journal: Inf. Process. Lett.

    Volume 100, Issue 6

    213 -- 219Akiyoshi Shioura, Takeshi Tokuyama. Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm
    220 -- 225Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser. Farthest line segment Voronoi diagrams
    226 -- 232Kimmo Fredriksson, Szymon Grabowski. A general compression algorithm that supports fast searching
    233 -- 237Hong Liu, Kenneth W. Regan. Improved construction for universality of determinant and permanent
    238 -- 245Alon Efrat, Sariel Har-Peled. Guarding galleries and terrains

    Volume 100, Issue 5

    173 -- 182Enrique Alba, Gabriel Luque, Lourdes Araujo. Natural language tagging with genetic algorithms
    183 -- 187Xuehou Tan. A 2-approximation algorithm for the zookeeper s problem
    188 -- 193Calin D. Morosan. On the number of broadcast schemes in networks
    194 -- 198Jianbo Qian, Cao An Wang. How much precision is needed to compare two sums of square roots of integers?
    199 -- 205Taisuke Izumi, Toshimitsu Masuzawa. A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems
    206 -- 212Joost Engelfriet, Sebastian Maneth. The equivalence problem for deterministic MSO tree transducers is decidable

    Volume 100, Issue 4

    131 -- 136Jean-Luc Baril, Jean Marcel Pallo. Efficient lower and upper bounds of the diagonal-flip distance between triangulations
    137 -- 144Z. S. Peng, H. F. Ting. An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees
    145 -- 150Andrew Teoh Beng Jin, Tee Connie, David Ngo Chek Ling. Remarks on BioHash and its mathematical foundation
    151 -- 153Yunfeng Tao. Infinity problems and countability problems for omega-automata
    154 -- 161Chor Ping Low. An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs
    162 -- 166Reuven Cohen, Liran Katzir, Danny Raz. An efficient approximation for the Generalized Assignment Problem
    167 -- 171Gang Wu, Jia-Huai You, Guohui Lin. A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors

    Volume 100, Issue 3

    91 -- 96Kimmo Fredriksson, Maxim Mozgovoy. Efficient parameterized string matching
    97 -- 104Alexandre Pinlou, Eric Sopena. Oriented vertex and arc colorings of outerplanar graphs
    105 -- 109Tatsuya Akutsu. A relation between edit distance for ordered trees and edit distance for Euler strings
    110 -- 115Xianchao Zhang, Weifa Liang, He Jiang. Flow equivalent trees in undirected node-edge-capacitated planar graphs
    116 -- 119Andre Gronemeier. A note on the decoding complexity of error-correcting codes
    120 -- 123Asish Mukhopadhyay, Samidh Chatterjee, Benjamin J. Lafreniere. On the All-Farthest-Segments problem for a planar set of points
    124 -- 129Artiom Alhazov. P systems without multiplicities of symbol-objects

    Volume 100, Issue 2

    41 -- 46Guy Wolfovitz. The complexity of depth-3 circuits computing symmetric Boolean functions
    47 -- 51Iztok Banic, Janez Zerovnik. Fault-diameter of Cartesian graph bundles
    52 -- 59Yosuke Kikuchi, Toru Araki. Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
    60 -- 63Ernesto Jiménez, Sergio Arévalo, Antonio Fernández. Implementing unreliable failure detectors with unknown membership
    64 -- 68Peter Damaschke. A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
    69 -- 71Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel. Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices
    72 -- 75Martin Lange, Rafal Somla. Propositional dynamic logic of context-free programs and fixpoint logic with chop
    76 -- 82Pum-Mo Ryu, Key-Sun Choi. Determining the specificity of terms using inside-outside information: a necessary condition of term hierarchy mining
    83 -- 89. New simple constructions of distance-increasing mappings from binary vectors to permutations

    Volume 100, Issue 1

    1 -- 7Yunlei Zhao. A note on the Dwork-Naor timed deniable authentication
    8 -- 13Ioannis Koutis. Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope
    14 -- 20Sebastian Deorowicz. Speeding up transposition-invariant string matching
    21 -- 22Dongvu Tonien. On a traitor tracing scheme from ACISP 2003
    23 -- 28Arvind Narayanan, K. Srinathan, C. Pandu Rangan. Perfectly Reliable Message Transmission
    29 -- 35Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès. Fair cost-sharing methods for the minimum spanning tree game
    36 -- 39Ted Krovetz, Phillip Rogaway. Variationally universal hashing
    runs on