External Links

    Journal: Inf. Process. Lett.

    Volume 51, Issue 6

    275 -- 282Ying The Tsai, Chuan Yi Tang, Yunn Yen Chen. Average Performance of a Greedy Algorithm for the On-Line Minimum Matching Problem on Euclidean Space
    283 -- 288Steven S. Seiden, Daniel S. Hirschberg. Finding Succinct Ordered Minimal Perfect Hash Functions
    289 -- 294Barun Chandra. Constructing Sparse Spanners for Most Graphs in Higher Dimensions
    295 -- 302Micha Hofri. On Timeout for Global Deadlock Detection in Decentralized Database Systems
    303 -- 310Olav Lysne. Extending Bachmair s Method for Proof by Consistency to the Final Algebra
    311 -- 314Alejandro López-Ortiz. New Lower Bounds for Element Distinctness on a On-Tape Turing Machine
    315 -- 319Nikolai N. Kuzjurin. Multi-Processor Scheduling and Expanders
    321 -- 323Vincenzo Acciaro. On the Complexity of Computing Gröbner Bases in Characteristic 2

    Volume 51, Issue 5

    219 -- 222Bo Chen, André van Vliet, Gerhard J. Woeginger. A Lower Bound for Randomized On-Line Scheduling Algorithms
    223 -- 226Eliezer A. Albacea. Parallel Algorithm for Finding a Core of a Tree Network
    227 -- 231Tamal K. Dey, Nimish R. Shah. Many-Face Complexity in Incremental Convex Arrangements
    233 -- 235Jung-Sing Jwo, Tai-Ching Tuan. On Transmitting Delay in a Distance-Transitive Strongly Antipodal Graph
    237 -- 243Xiaojun Shen, Qing Hu, Weifa Liang. Realization of an Arbitrary Permutation on a Hypercube
    245 -- 250Philip M. Long. Halfspace Learning, Linear Programming, and Nonmalicious Distributions
    251 -- 255Lloyd Allison. Using Hirschberg s Algorithm to Generate Random Alignments of Strings
    257 -- 264Yoav Raz. Serializability by Commitment Ordering
    265 -- 269Jordan Gergov. Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines
    271 -- 274Dan Gusfield. Faster Implementation of a Shortest Superstring Approximation

    Volume 51, Issue 4

    163 -- 169Ching Yu Hung, Behrooz Parhami. Fast RNS Division Algorithms for Fixed Divisors with Application to RSA Encrytion
    171 -- 174André Raspaud, Eric Sopena. Good and Semi-Strong Colorings of Oriented Planar Graphs
    175 -- 179Dominique Barth, André Raspaud. Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph
    181 -- 188K. Sridharan, Harry E. Stephanou, K. C. Craig, S. Sathiya Keerthi. Distance Measures on Intersecting Objects and Their Applications
    189 -- 193Paul Fischer, Klaus-Uwe Höffgen. Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon
    195 -- 199Peng Chen, Shigeru Masuyama. On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph
    201 -- 206Robert Harper. A Simplified Account of Polymorphic References
    207 -- 211David Eppstein. Arboricity and Bipartite Subgraph Listing Algorithms
    213 -- 218Xiao-Dong Hu, P. D. Chen, Frank K. Hwang. A New Competitive Algorithm for the Counterfeit Coin Problem

    Volume 51, Issue 3

    111 -- 116Mark Jerrum. Counting Trees in a Graph is #P-Complete
    117 -- 120Erl-Huei Lu, Yi-Chang Chen, Hsiao-Peng Wuu. A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m
    121 -- 124K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston. A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph
    125 -- 127Bapiraju Vinnakota, V. V. Bapeswara Rao. Enumeration of Binary Trees
    129 -- 132Wen-Chin Chen, Wen-Chun Ni. Internal Path Length of the Binary Representation of Heap-Ordered Trees
    133 -- 140Refael Hassin, Shlomi Rubinstein. Approximations for the Maximum Acyclic Subgraph Problem
    141 -- 148Vladimir G. Deineko, René van Dal, Günter Rote. The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case
    149 -- 153Jayme Luiz Szwarcfiter, Guy Chaty. Enumerating the Kernels of a Directed Graph with no Odd Circuits
    155 -- 161Ganesan Ramalingam, Thomas W. Reps. On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem

    Volume 51, Issue 2

    57 -- 60Norbert Blum, Henning Rochow. A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals
    61 -- 66David A. Basin. A Term Equality Problem Equivalent to Graph Isomorphism
    67 -- 71Michael Frazier, C. David Page Jr.. Prefix Grammars: An Alternative Characterization of the Regular Languages
    73 -- 77Simon R. Blackburn. Increasing the Rate of Output of m-Sequences
    85 -- 92Eun-Jung Lee, Kwang-Moo Choe. Grammar Coverings of a Deterministic Parser with Action Conflicts
    93 -- 99Abhijit Sengupta, Suresh Viswanathan. On Fault-Tolerant Fixed Routing in Hypercubes
    101 -- 105Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn. A Lower Bound for Area-Universal Graphs
    107 -- 110Peter Kirrinnis. An Optimal Bound for Path Weights in Huffman Trees

    Volume 51, Issue 1

    1 -- 6Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc. Optimal Coteries and Voting Schemes
    7 -- 10Meena Mahajan, Thomas Thierauf, N. V. Vinodchandran. A Note on SpanP Functions
    11 -- 16Zhaofang Wen. New Algorithms for the LCA Problem and the Binary Tree Reconstruction Problem
    17 -- 23Shuji Jimbo, Akira Maruoka. On the Relationship Between varepsilon-Biased Random Variables and varepsilon-Dependent Random Variables
    25 -- 29Ling Chen, Henry Y. H. Chuang. A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image
    31 -- 34Joseph Gil, Yossi Matias. Designing Algorithms by Expectations
    35 -- 41Yoshihide Igarashi, Shingo Osawa, Walter Unger. Automorphisms of Broadcasting Schemes with Respect to Start Rounds
    43 -- 52Antonia Sinachopoulos. Logics and Decidability for Labelled Pre- and Partially Ordered Kripke Structures
    53 -- 56Dan Halperin, Micha Sharir. On Disjoint Concave Chains in Arrangements of (Pseudo) Lines
    runs on