External Links

    Journal: Inf. Process. Lett.

    Volume 96, Issue 6

    193 -- 196Ali Sezgin, Ganesh Gopalakrishnan. On the definition of sequential consistency
    197 -- 201Kuan-Yu Chen, Kun-Mao Chao. Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
    202 -- 206Stasys Jukna. On the P versus NP intersected with co-NP question in communication complexity
    207 -- 213Méziane Aïder, Mustapha Aouchiche. Distance monotonicity and a new characterization of Hamming graphs
    214 -- 219Eduardo Moreno. De Bruijn sequences and De Bruijn graphs for a general language
    220 -- 224Bostjan Slivnik, Bostjan Vilfan. Producing the left parse ::::during:::: bottom-up parsing
    225 -- 229Thuy Duong Vu. The compression structure of a process

    Volume 96, Issue 5

    155 -- 161Tadao Takaoka. An O(::::n:::::::3:::loglog::::n::::/log::::n::::) time algorithm for the all-pairs shortest path problem
    162 -- 166Walter A. Burkhard. Double hashing with passbits
    167 -- 174Xianbing Wang, Yong Meng Teo, Jiannong Cao. A bivalency proof of the lower bound for uniform consensus
    175 -- 177Igor Shparlinski, Arne Winterhof. On the linear complexity of bounded integer sequences over different moduli
    178 -- 184Gonzalo Navarro, Nieves R. Brisaboa. New bounds on ::::D::::-ary optimal codes
    185 -- 191Moritz G. Maaß, Johannes Nowak. A new method for approximate indexing and dictionary lookup with one error

    Volume 96, Issue 4

    123 -- 127Jun Ming Xu, Min Xu, Qiang Zhu. The super connectivity of shuffle-cubes
    128 -- 135Pangfeng Liu. Minimum degree triangulation for rectangular domains
    136 -- 140Min Xu, Jun Ming Xu. Edge-pancyclicity of Möbius cubes
    141 -- 145Agostino Capponi, Concetta Pilotto. Bounded families for the on-line ::::t::::-relaxed coloring
    146 -- 150Jun Ming Xu, Zheng-Zhong Du, Min Xu. Edge-fault-tolerant edge-bipancyclicity of hypercubes
    151 -- 153Greg Aloupis, Erin McLeish. A lower bound for computing Oja depth

    Volume 96, Issue 3

    81 -- 88Jérôme Monnot. The labeled perfect matching in bipartite graphs
    89 -- 92Rocco A. Servedio, Andrew Wan. Computing sparse permanents faster
    93 -- 95Nikhil Srivastava, Alan D. Taylor. Tight bounds on plurality
    96 -- 100Sahadeo Padhye. Partial known plaintext attack on Koyama scheme
    101 -- 105Jianhua Zhao, Xuandong Li, Guoliang Zheng. A quadratic-time DBM-based successor algorithm for checking timed automata
    106 -- 113Yuriy A. Reznik. On the average depth of asymmetric LC-tries
    114 -- 122Swastik Kopparty, Chinya V. Ravishankar. A framework for pursuit evasion games in R:::n:::

    Volume 96, Issue 2

    41 -- 48Huaming Zhang, Xin He. Visibility representation of plane graphs via canonical ordering tree:::, :::
    49 -- 53Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas. On the hamiltonicity of the cartesian product
    54 -- 58Ferucio Laurentiu Tiplea, Dan C. Marinescu. Structural soundness of workflow nets is decidable
    59 -- 66Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer. Bases for Boolean co-clones
    67 -- 70Dieter Rautenbach. Lower bounds on treespan
    71 -- 79Rosario Gennaro, Mario Di Raimondo. Secure multiplication of shared secrets in the exponent

    Volume 96, Issue 1

    1 -- 6Jywe-Fei Fang, Kuan-Chou Lai. Embedding the incomplete hypercube in books
    7 -- 17Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan. On the dynamic extent of delimited continuations
    18 -- 23Alberto Caprara, Ulrich Pferschy. Modified subset sum heuristics for bin packing
    24 -- 29Andrea Pietracaprina, Geppino Pucci. Optimal many-to-one routing on the mesh with constant queues
    30 -- 35Alain Finkel, Jérôme Leroux. The convex hull of a regular set of integer vectors is polyhedral and effectively computable
    36 -- 40K. Alagarsamy. A mutual exclusion algorithm with optimally bounded bypasses
    runs on