External Links

    Journal: Inf. Process. Lett.

    Volume 68, Issue 6

    271 -- 274Josep Rifà. A New Algebraic Algorithm to Decode the Ternary Golay Code
    275 -- 282Rakesh K. Sinha. Simulation of PRAMs with Scan Primitives by Unbounded Fan-In Circuits
    283 -- 289Jorge Calera-Rubio, Rafael C. Carrasco. Computing the Relative Entropy Between Regular Tree Languages
    291 -- 293Janelle J. Harms. A Simple Optimal Algorithm for Scheduling Variable-Sized Requests
    295 -- 298Wen-Ming Yan, Wendy J. Myrvold, Kuo-Liang Chung. A Formula for the Number of Spanning Trees of a Multi-Star Related Graph
    299 -- 302Andrzej Szepietowski. Weak and Strong One-Way Space Complexity Classes
    303 -- 305Pierre Fraigniaud. Hierarchical Broadcast Networks
    307 -- 312Ulrich Kühn. Local Calculation of Voronoi Diagrams
    313 -- 315Ton Kloks, Dieter Kratsch, Haiko Müller. Bandwidth of Chain Graphs
    317 -- 319Michael J. Collins, Bernard M. E. Moret. Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids

    Volume 68, Issue 5

    219 -- 225A. P. Ustimenko. Colored Cause-Effect Structures
    227 -- 233Yuliang Zheng, Hideki Imai. How to Construct Efficient Signcryption Schemes on Elliptic Curves
    235 -- 240KyungOh Lee, Heon Young Yeom. A Dynamic Scheduling Algorithm for Large Scale Multimedia Servers
    241 -- 248Venkatesan Guruswami, C. Pandu Rangan. A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds
    249 -- 253Peter Jonsson. Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems
    255 -- 259Bette Bultena, Frank Ruskey. An Eades-McKay Algorithm for Well-Formed Parentheses Strings
    261 -- 270Matteo Sereno. Binary Search with Errors and Variable Cost Queries

    Volume 68, Issue 4

    161 -- 165Nadia Creignou. Complexity Versus Stability for Classes of Propositional Formulas
    167 -- 171Roberto Posenato, Massimo Santini. A New Lower Bound on Approximability of the Ground State Problem for Tridimensional Ising Spin Glasses
    173 -- 177Wim H. Hesselink. Invariants for the Construction of a Handshake Register
    179 -- 183Ding-Ming Kwai, Behrooz Parhami. Pruned Three-Dimensional Toroidal Networks
    185 -- 188Pedro P. Sanchez, Refik Soyer. Information Concepts and Pairwise Comparison Matrices
    189 -- 196Yishay Mansour, Michal Parnas. Learning Conjunctions with Noise under Product Distributions
    197 -- 199Henri Gilbert, Dipankar Gupta, Andrew M. Odlyzko, Jean-Jacques Quisquater. Attacks on Shamir s RSA for Paranoids
    201 -- 206Ton Kloks, Haiko Müller, C. K. Wong. Vertex Ranking of Asteroidal Triple-Free Graphs
    207 -- 214Abhijit Sengupta. On Ring Embedding in Hypercubes with Faulty Nodes and Links
    215 -- 217Yi-Chang Cheng, Erl-Huei Lu, Shaw Woei Wu. A Modified Version of the Rao-Nam Algebraic-Code Encryption Scheme

    Volume 68, Issue 3

    107 -- 111Carles Padró. Robust Vector Space Secret Sharing Schemes
    113 -- 117Vincent Vajnovszki. On the Loopless Generation of Binary Tree Sequences
    119 -- 124Marcin Jurdzinski. Deciding the Winner in Parity Games is in UP /cap co-Up
    125 -- 132Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein. Efficient Special Cases of Pattern Matching with Swaps
    133 -- 139Francesco M. Malvestuto. A Complete Axiomatization of Full Acyclic Join Dependencies
    141 -- 146Chor Ping Low. A Polynomial Time Solvable Instance of the Feasible Minimum Cover Problem
    147 -- 151Witold Charatonik. An Undecidable Fragment of the Theory of Set Constraints
    153 -- 159Valery S. Gordon, Wieslaw Kubiak. Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs

    Volume 68, Issue 2

    55 -- 61Anne Bottreau, Yves Métivier. Some Remarks on the Kronecker Product of Graphs
    63 -- 69Joost P. Warners. A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form
    71 -- 81Desh Ranjan, Enrico Pontelli, Gopal Gupta. Efficient Algorithms for the Temporal Precedence Problem
    79 -- 85Joaquim Gabarró, Xavier Messeguer. Parallel Dictionaries with Local Rules on AVL and Brother Trees
    87 -- 91Colin J. Fidge. A Limitation of Vector Timestamps for Reconstructing Distributed Computations
    93 -- 95Srinivasan Venkatesh. Pseudo-Average Block Sensitivity Equals Average Sensitivity
    97 -- 105Kothuri Venkata Ravi Kanth, Ambuj K. Singh. Efficient Dynamic Range Searching Using Data Replication

    Volume 68, Issue 1

    1 -- 2Andrew Turpin, Alistair Moffat. Comment on Efficient Huffman Decoding and An Efficient Finite-State Machine Implementation of Huffman Decoders
    3 -- 9Alfredo García Olaverri, Pedro Jodrá, Javier Tejel. An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays
    11 -- 15Alberto Caprara, Romeo Rizzi. Improving a Family of Approximation Algorithms to Edge Color Multigraphs
    17 -- 23Rajeev Govindan, Michael A. Langston, Xudong Yan. Approximation the Pathwidth of Outerplanar Graphs
    25 -- 31Chan-Su Shin, Sung Yong Shin, Kyung-Yong Chwa. The Widest ::::k::::-Dense Corridor Problems
    33 -- 38Bernd Gärtner, Sven Schönherr. Exact Primitives for Smallest Enclosing Ellipses
    39 -- 45Chi-Hsiang Yeh, Behrooz Parhami. VLSI Layouts of Complete Graphs and Star Graphs
    47 -- 54Wojciech Fraczak, Marek B. Zaremba. A Non-SOS Operational Semantics for a Process Algebra
    runs on