External Links

    Journal: Inf. Process. Lett.

    Volume 52, Issue 6

    285 -- 287Jan A. Bergstra, Gheorghe Stefanescu. Bisimulation is Two-Way Simulation
    289 -- 294Arturo Carpi. On Repeated Factors in C^/infty-Words
    295 -- 301Subir Bhattacharya, Amitava Bagchi. A General Framework for Minimax Search in Game Trees
    303 -- 307Philip N. Klein. A Data Structure for Bicategories, with Application to Speeding up an Approximation Algorithm
    309 -- 315Y. Daniel Liang. Dominations in Trapezoid Graphs
    317 -- 322Jing-Ho Yan, Gerard J. Chang. The Path-Partition Problem in Block Graphs
    323 -- 324H. Petersen. On the Determinacy Problem for Two-Way Pushdown Automata
    325 -- 327Luke O Connor. An Upper Bound on the Number of Functions Satisfying the Strict Avalanche Criterion
    329 -- 331Ravi B. Boppana. The Decision-Tree Complexity of Element Distinctness
    333 -- 337Wan Fokkink. A Complete Equational Axiomatization for Prefix Iteration
    339 -- 0Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini. Corrigendum: An Optimal Lower Bound for Nonregular Languages
    341 -- 0Erl-Huei Lu, Yi-Chang Cheng, Hsiao-Peng Wuu. Corrigendum: A Complete Decoding Algorithm for Double-Error-Correcting Primitive Binary BCH Codes of Odd m

    Volume 52, Issue 5

    229 -- 233H. Petersen. Refined Simulation of Multihead Automata
    235 -- 237Ronald V. Book. On Collapsing the Polynomial-Time Hierarchy
    239 -- 241Samir Khuller, Uzi Vishkin. On the Parallel Complexity of Digraph Reachability
    243 -- 247James F. Korsh. Loopless Generation of k-Ary Tree Sequences
    249 -- 252Eric T. Bax. Algorithms to Count Paths and Cycles
    253 -- 257Mark Allen Weiss. Linear-Time Construction of Treaps and Cartesian Trees
    259 -- 263Jin-Tai Yan, Pei-Yung Hsiao. A Fuzzy Clustering Algorithm for Graph Bisection
    265 -- 271Zhi-Zhong Chen. A Parallel Algorithm for Finding a Triconnected Component Separator with an Application
    273 -- 276Zbigniew Duszak, Waldemar W. Koczkodaj. Generalization of a New Definition of Consistency for Pairwise Comparisons
    277 -- 284Fabrizio Luccio, Alberto Pedrotti. A Parallel List Update Problem

    Volume 52, Issue 4

    175 -- 180Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe. Upward Separation for FewP and Related Classes
    181 -- 182Ernie Cohen. The Convergence Span of Greedy Load Balancing
    183 -- 189Chuzo Iwamoto, Godfried T. Toussaint. Finding Hamiltonian Circuits in Arrangements of Jordan Curves is NP-Complete
    191 -- 199Su-Hyun Lee, Do-Hyung Kim, Kwang-Moo Choe. Path for AND-Parallel Execution of Logic Programs
    201 -- 206Hung-Min Sun, Shiuh-Pyng Shieh. On Dynamic Threshold Schemes
    207 -- 213Esko Nuutila. An Efficient Transitive Closure Algorithm for Cyclic Digraphs
    215 -- 221Mark de Berg, Marc J. van Kreveld. Rectilinear Decompositions with Low Stabbing Number
    223 -- 228Pierre Kelsen. An Optimal Parallel Algorithm for Maximal Matching

    Volume 52, Issue 3

    115 -- 121Alberto Pedrotti. Analysis of a List-Update Strategy
    123 -- 129Y. Daniel Liang. On the Feedback Vertex Set Problem in Permutation Graphs
    131 -- 136Kirk Pruhs. Average-Case Scalable On-Line Algorithms for Fault Replacement
    137 -- 145Irène Durand, Bruno Salinier. Constructor Equivalent Term Rewriting Systems are Strongly Sequential: A Direct Proof
    147 -- 154Paul F. Dietz, Rajeev Raman. A Constant Update Time Finger Search Tree
    155 -- 159Luc Devroye, Paul Kruszewski. A Note on the Horton-Strahler Number for Random Trees
    161 -- 165Frank Wagner. Approximate Map Labeling is in Omega (n log n)
    167 -- 173Michele Flammini. On the Learnability of Monotone k /mu-DNF Formulae Under Product Distributions

    Volume 52, Issue 2

    57 -- 60Helmut Seidl. Haskell Overloading is DEXPTIME-Complete
    61 -- 68Mikael Rittri. Semi-Unification of Two Terms in Abelian Groups
    69 -- 75Bern-Cherng Liaw, Richard C. T. Lee. An Optimal Algorithm to Solve the Minimum Weakly Cooperative Guards Problem for 1-Spiral Polygons
    77 -- 85Chen-Hsing Peng, Jia-Shung Wang, Richard C. T. Lee. Recognizing Shortest-Path Trees in Linear Time
    87 -- 90Refael Hassin, Shlomo Lahav. Maximizing the Number of Unused Colors in the Vertex Coloring Problem
    91 -- 98Takehiro Tokuda, Yoshimichi Watanabe. An Attribute Evaluation of Context-Free Languages
    99 -- 103Mohamed G. Gouda. Stabilizing Observers
    105 -- 108Jean Mayo, Phil Kearns. Distributed Termination Detection with Roughly Synchronized Clocks
    109 -- 114Thomas Roos, Peter Widmayer. k-Violation Linear Programming

    Volume 52, Issue 1

    1 -- 6Nakagawa Akinari, Hiroshi Hagiwara. On the Real-Number Representation with Variable-Length Exponent Field
    7 -- 15Charles U. Martel. Maximum Finding on a Multiple Access Broadcast Network
    15 -- 22Torben Æ. Mogensen. WORM-2DPDAs: An Extension to 2DPDAs that can be Simulated in Linear Time
    23 -- 29Md. Mozammel Huq Azad Khan. An Algorithm for Hazard-Free Minimization of Incompletely Specified Switching Function
    31 -- 34Lawrence L. Larmore, Wojciech Rytter. An Optimal Sublinear Time Parallel Algorithm for Some Dynamic Programming Problems
    35 -- 38Shao Dong Chen, Hong Shen, Rodney W. Topor. An Efficient Permutation-Based Parallel Range-Join Algorithm on N-Dimensional Torus Computers
    39 -- 43Jon M. Kleinberg. A Lower Bound for Two-Server Balancing Algorithms
    45 -- 49Giulia Galbiati, Francesco Maffioli, Angelo Morzenti. A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem
    51 -- 56Aohan Mei, Yoshihide Igarashi. An Efficient Strategy for Robot Navigation in Unknown Environment
    runs on