External Links

    Journal: Inf. Process. Lett.

    Volume 36, Issue 6

    277 -- 280Subir Kumar Ghosh, Anil Maheshwari. An Optimal Algorithm for Computing a Minimum Nested Nonconvex Polygon
    281 -- 283Ferenc Kocsis, Johann F. Böhme. Rotation-Based Computations for Ray-Tracing Second-Order Surfaces and Curves
    285 -- 291Antonio Brogi, Evelina Lamma, Paola Mello. Hypothetical Reasoning in Logic Programming: A Semantic Approach
    293 -- 296Zoltán Fülöp, Sándor Vágvölgyi. The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations
    297 -- 299Rob R. Hoogerwoord. A Calculational Derivation of the Casop Algorithm
    301 -- 310Gabriel Matsliach. Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves
    311 -- 315Kai Salomaa, Sheng Yu. The Immortality Problem for LAG Systems
    317 -- 322Giuseppe Di Battista, Wei-Ping Liu, Ivan Rival. Bipartite Graphs, Upward Drawings, and Planarity
    323 -- 327Sung Kwon Kim. Parallel Algorithms for the Segment Dragging Problem

    Volume 36, Issue 5

    221 -- 224Hyoung Joong Kim, Jang Gyu Lee. Partial Sum Problem Mapping Into a Hypercube
    225 -- 230Jin Ho Hur, Kilnam Chon. Self and Selftype
    231 -- 236Peter Damaschke, Haiko Müller, Dieter Kratsch. Domination in Convex and Chordal Bipartite Graphs
    237 -- 240Ursula Martin. A Note on Division Orderings on Strings
    241 -- 245Jang-Ping Sheu, Zen-Fu Chiang. Efficient Allocation of Chain-Like Task on Chain-Like Network Computers
    247 -- 250Carsten Damm. Problems Complete for /oplus L
    251 -- 258Siu-Wing Cheng, Ravi Janardan. Efficient Dynamic Algorithms for Some Geometric Intersection Problems
    259 -- 266Marc Gyssens, Jan Paredaens, Dirk Van Gucht. On a Hierarchy of Classes for Nested Databases
    267 -- 272O. M. Makarov. On the Synthesis of Fast Algorithms for Signal Processing
    273 -- 275Pratul Dublish. Some Comments on the Subtree Isomorphism Problem for Ordered Trees

    Volume 36, Issue 4

    171 -- 175Valmir C. Barbosa. Blocking Versus Nonblocking Interprocess Communication: A Note on the Effect on Concurrency
    177 -- 182Hans Kleine Büning. Existence of Simple Propositional Formulas
    183 -- 189Xiaolei Qian. An Axiom System for Database Transactions
    191 -- 192Gerhard J. Woeginger. A Simple Solution to the Two Paths Problem in Planar Graphs
    193 -- 0Edsger W. Dijkstra. Making a Fair Roulette From a Possibly Biased Coin
    195 -- 201S. Ramesh. On the Completeness of Modular Proof Systems
    203 -- 206Erkki Mäkinen. The Grammatical Inference Problem for the Szilard Languages of Linear Grammars
    207 -- 213Bernd-Jürgen Falkowski. Perceptrons Revisited
    215 -- 218Miroslaw Kutylowski. Remarks on Sorting and One-Way Multihead Finite Automata
    219 -- 220Jozef Vyskoc. Making Bubblesort Recursive

    Volume 36, Issue 3

    111 -- 116De-Lei Lee. Efficient Address Generation in a Parallel Processor
    117 -- 121Jingde Cheng. An Algebraic Semantics of Notional Entailment Logic Cn
    123 -- 127Aphrodite Tsalgatidou. Modelling and Animating Information Systems Dynamics
    129 -- 133Shuo-Yen Robert Li. On Full Utilization of Multi-Channel Capacity with Priority Protocol
    135 -- 140Laura A. Sanchis. On the Complexity of Test Case Generation for NP-Hard Problems
    141 -- 145John G. Kollias, Yannis Manolopoulos, Christos H. Papadimitriou. The Optimum Execution Order of Queries in Linear Storage
    147 -- 151Lawrence L. Larmore. An Optimal Algorithm with Unknown Time Complexity for Convex Matrix Searching
    153 -- 157Rong Lin, Stephan Olariu. A Fast Parallel, Algorithm to Recognize, Partitionable Graphs
    159 -- 165A. Paulik. Worst-Case Analysis of a Generalized Heapsort Algorithm
    167 -- 170Kim-Heng Teo, Tai-Ching Tuan. Performance Analysis of Greedy Heuristic to Find a Minimum Total-Jogs Layout for River Routing

    Volume 36, Issue 2

    57 -- 63Torben Hagerup, Hong Shen. Improved Nonconservative Sequential and Parallel Integer Sorting
    65 -- 67Miklós Biró. Object-Oriented Interaction in Resource Constrained Scheduling
    69 -- 72Anna Slobodová. One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages
    73 -- 77Stephen A. Vavasis. Quadratic Programming is in NP
    79 -- 83Jin-yi Cai. Lower Bounds for Constant-Depth Circuits in the Presence of Help Bits
    85 -- 90Jae-Moon Lee, Jong Soo Park, Myunghwan Kim. An Upper Bound on Buffer Size for Join Operation Using Nonclusterd Indexes
    91 -- 94Richard J. Lipton, Arvin Park. The Processor Identity Problem
    95 -- 102Chandan Haldar, Lalit M. Patnaik. Oracle Complexities for Computational Geometry of Semi-Algebraic Sets and Voronoi Diagrams
    103 -- 109Graham M. Megson, F. M. F. Gaston. Improved Matrix Triangularisation Using a Double Pipeline Systolic Array

    Volume 36, Issue 1

    1 -- 5Zhen Liu. A Note on Graham s Bound
    7 -- 11Wen-Huei Chen, Ching-Sung Lu, Elben R. Brozovsky, Jin-Tuu Wang. An Optimization Technique for Protocol Conformance Testing Using Multiple Uio Sequences
    13 -- 17Joanna Jedrzejowicz. Infinite Hierarchy of Shuffle Expressions Over a Finite Alphabet
    19 -- 23Haklin Kim. Finding a Maximum Independent Set in a Permutation Graph
    25 -- 30Frank Dederichs, Rainer Weber. Safety and Liveness From a Methodological Point of View
    31 -- 36Biing-Feng Wang, Gen-Huey Chen. Two-Dimensional Processor Array with a Reconfigurable Bus System is at Least as Powerful as CRCW Model
    37 -- 38Stanley Burris, John Lawrence. Unification in Commutative Rings is Not Finitary
    39 -- 44Malcolm C. Fields, Greg N. Frederickson. A Faster Algorithm for the Maximum Weighted Tardiness Problem
    45 -- 49Oded Goldreich, Erez Petrank. The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols
    51 -- 52Ke Qiu, Henk Meijer. A Note on Diameter of Acyclic Directed Hypercubes
    53 -- 56Hans L. Bodlaender, Gerard Tel. Bit-Optimal Election in Synchronous Rings
    runs on