External Links

    Journal: Inf. Process. Lett.

    Volume 33, Issue 6

    275 -- 281Alan A. Bertossi, Sabrina Moretti. Parallel Algorithms on Circular-Arc Graphs
    283 -- 287Michael B. Dillencourt. Realizability of Delaunay Triangulations
    289 -- 295Neil J. Gunther, John G. Shaw. Path Integral Evaluation of Aloha Network Transients
    297 -- 300Tom Altman, Bogdan S. Chlebus. Sorting Roughly Sorted Sequences in Parallel
    301 -- 303Stephan Olariu. A Generalization of Chvátal s Star-Cutset Lemma
    305 -- 308Torben Hagerup, Christine Rüb. A Guided Tour of Chernoff Bounds
    309 -- 311Zvi Galil, Kunsoo Park. A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming
    313 -- 317Philip Hingston, Ross Wilkinson. A Distributed Join Algorithm
    319 -- 321. On a Triangle Counting Problem
    323 -- 330Edgar Knapp. A Predicate Transformer for Progress

    Volume 33, Issue 5

    221 -- 226Pierluigi Crescenzi, Riccardo Silvestri. Relative Complexity of Evaluating the Optimum Cost and Constructing the Optimum for Maximization Problems
    227 -- 231Hitoshi Suzuki, Naomi Takahashi, Takao Nishizeki. A Linear Algorithm for Bipartition of Biconnected Graphs
    233 -- 238Yijie Han, Yoshihide Igarashi. Time Lower Bounds for Sorting on Multi-Dimensional Mesh-Connected Processor Arrays
    239 -- 242Jürgen Kämper. A Result Relating Disjunctive Self-Reducibility to P-Immunity
    243 -- 248C. S. Kannan, Henry Y. H. Chuang. Fast Hough Transform on a Mesh Connected Processor Array
    249 -- 254Laurence Boxer, Russ Miller. Common Intersections of Polygons
    255 -- 260Divyakant Agrawal, Amr El Abbadi. Exploiting Logical Structures in Replicated Databases
    261 -- 267Victor Shoup. On the Deterministic Complexity of Factoring Polynomials over Finite Fields
    269 -- 273Richard J. Anderson, Gary L. Miller. A Simple Randomized Parallel Algorithm for List-Ranking

    Volume 33, Issue 4

    105 -- 206Jayaramaiah Boreddy, R. N. Mukherjee. An Algorithm to Find Polygon Similarity
    169 -- 174John Hershberger. Finding the Upper Envelope of n Line Segments in O(n log n) Time
    175 -- 179D. T. Lee, Franco P. Preparata. Parallel Batched Planar Point Location on the CCC
    181 -- 185Torben Hagerup, Christine Rüb. Optimal Merging and Sorting on the Erew Pram
    187 -- 191Christos Levcopoulos, Ola Petersson. A Note on Adaptive Parallel Sorting
    193 -- 197Egon Wanke, Manfred Wiegers. Undecidability of the Bandwidth Problem on Linear Graph Languages
    199 -- 204José D. P. Rolim. On the Polynomial IO-Complexity
    207 -- 212Richard Zippel. An Explicit Separation of Relativised Random Polynomial Time and Relativised Deterministic Polynomial Time
    213 -- 219Janez Zerovnik. A Randomised Heuristical Algorithm for Estimating the Chromatic Number of a Graph

    Volume 33, Issue 3

    113 -- 120Roberto Grossi, Fabrizio Luccio. Simple and Efficient String Matching with k Mismatches
    121 -- 124Takayoshi Shoudai. The Lexicographically First Topological Order Problem is NLOG-Complete
    125 -- 130Lanfranco Lopriore. Software-Controlled Cache Coherence Protocol for Multicache Systems
    131 -- 133E. Robert McCurley. Auxiliary Variables in Partial Correctness Programming Logics
    135 -- 139Selim G. Akl, David Gries, Ivan Stojmenovic. An Optimal Parallel Algorithm for Generating Combinations
    141 -- 143Ronald V. Book, Shouwen Tang. A Note on Sparse Sets and the Polynomial-Time Hierarchy
    145 -- 146Ravi B. Boppana. The Average-Case Parallel Complexity of Sorting
    147 -- 156A. Srinivasa Rao, C. Pandu Rangan. Optimal Parallel Algorithms on Circular-Arc Graphs
    157 -- 162Bruce Parker, Ian Parberry. Constructing Sorting Networks from k-Sorters
    163 -- 168Rudolf Berghammer, Gunther Schmidt, Hans Zierer. Symmetric Quotients and Domain Constructions

    Volume 33, Issue 2

    59 -- 62David Avis, J. M. Robert, Rephael Wenger. Lower Bounds for Line Stabbing
    63 -- 65Christian Buchta. On the Average Number of Maxima in a Set of Vectors
    67 -- 72Kuo-Liang Chung, Wen-Chin Chen, Ferng-Ching Lin. Fast Computation of Periodic Continued Fractions
    73 -- 78Andrzej Szepietowski. Some Remarks on the Alternating Hierarchy and Closure Under Complement for Sublogarithmic Space
    79 -- 81Winfried Thome, Reinhard Wilhelm. Simulating Circular Attribute Grammars Through Attribute Reevaluation
    83 -- 89Martin Dietzfelbinger. The Speed of Copying on One-Tape Off-Line Turing Machines
    91 -- 96Alejandro A. Schäffer. Optimal Node Ranking of Trees in Linear Time
    97 -- 107Stefano Ceri, Georg Gottlob, Letizia Tanca, Gio Wiederhold. Magic Semi-Joins
    109 -- 112Andrzej Szepietowski. Some Notes on Strong and Weak log log n Space Complexity

    Volume 33, Issue 1

    3 -- 5Zoltán Fülöp, Sándor Vágvölgyi. Top-Down Tree Transducers with Deterministic Top-Down Look-Ahead
    7 -- 10S. J. Wan, S. K. Michael Wong. An Adaptive Algorithm for Finding a Covering Hypersphere
    11 -- 14De-Lei Lee. On Access and Alignment of Data in a Parallel Processor
    15 -- 19Mila E. Majster-Cederbaum. The Contraction Property is Sufficient to Guarantee the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces
    21 -- 24Jayadev Misra. A Simple Proof of a Simple Consensus Algorithm
    25 -- 28Gadi Taubenfeld. Leader Election in the Presence of n-1 Initial Failures
    29 -- 33A. Srinivasa Rao, C. Pandu Rangan. Linear Algorithm for Domatic Number Problem on Interval Graphs
    35 -- 44Bhaskar DasGupta, C. E. Veni Madhavan. An Approximate Algorithm for the Minimal Vertex Nested Polygon Problem
    45 -- 52Kam-Fai Wong. Comments on A Comparison of Concatenated and Superimposed Code Word Surrogate Files for Very Large Data/Knowledge Bases
    53 -- 58Michel Raynal. Prime Numbers as a Tool to Design Distributed Algorithms
    runs on