Information Processing Letters, Volume 23

Volume 23, Number 1, July 1986

Wojciech Rytter: The Space Complexity of the Unique Decipherability Problem. 1-3 BibTeX
Ferng-Ching Lin, Wei Kuan Shih: Long Edges in the Layouts of Shuffle-Exchange and Cube-Connected Cycles Graphs. 5-9 BibTeX
Gottfried Tinhofer, H. Schreck: The Bounded Subset Sum Problem is Almost Everywhere Randomly Decidable in O(n). 11-17 BibTeX
Hartmut Schmeck: On the Maximum Edge Length in VLSI Layouts of Complete Binary Trees. 19-23 BibTeX
José L. Balcázar: On (Greek D)D_P²-Immunity. 25-28 BibTeX Karel Culik II, Juhani Karhumäki: A Note on the Equivalence Problem of Rational Formal Power Series. 29-31
K. Kakuta, Hirofumi Nakamura, S. Iida: A Parallel Reference Counting Algorithm. 33-37 BibTeX
Bernd-Jürgen Falkowski, Lothar Schmitz: A Note on the Queens' Problem. 39-46 BibTeX
O. M. Vikas, S. K. Basandra: Data Algebra and Its Application in Database Design. 47-54 BibTeX

Ivan Lavallée, Gérard Roucairol: A Fully Distributed (Minimal) Spanning Tree Algorithm. 55-62 BibTeX
Alberto Apostolico: Improving the Worst-Case Performance of the Hunt-Szymanski Strategy for the Longest Common Subsequence of Two Strings. 63-69 BibTeX
Hans Rohnert: Shortest Paths in the Plane with Convex Polygonal Obstacles. 71-76 BibTeX
Rob R. Hoogerwoord: An Implementation of Mutual Inclusion. 77-80 BibTeX
Wojciech Rytter: An Application of Mehlhorn's Algorithm for Bracket Languages to log(n) Space Recognition of Input-Driven Languages. 81-84 BibTeX
Janusz W. Laski: An Algorithm for the Derivation of Codefinitions in Computer Programs. 85-90 BibTeX
J. K. Annot, M. D. Janssens, A. J. van de Goor: Comments on Morris's Starvation-Free Solution to the Mutual Exclusion Problem. 91-97 BibTeX
Simeon C. Ntafos: On Gallery Watchmen in Grids. 99-102 BibTeX
John V. Franco: On the Probabilistic Performance of Algorithms for the Satisfiability Problem. 103-106 BibTeX
Bruno Codenotti, Grazia Lotti: Area-Time Tradeoffs for Bilinear Forms Computations in VLSI. 107-109 BibTeX

Bruno Codenotti, Grazia Lotti: A VLSI Fast Solver for Tridiagonal Linear Systems. 111-114 BibTeX
O. M. Makarov: A Noncommutative Algorithm for Multiplying 5*5 Matrices Using 102 Multiplications. 115-117 BibTeX
Ten-Hwang Lai, Alan P. Sprague: A Note on Anomalies in Parallel Branch-and-Bound Algorithms with One-to-One Bounding Functions. 119-122 BibTeX
J. Cooper, Selim G. Akl: Efficient Selection on a Binary Tree. 123-126 BibTeX
Patricio V. Poblete: Approximating Functions by Their Poisson Transform. 127-130 BibTeX
Alan A. Bertossi: Total Domination in Interval Graphs. 131-134 BibTeX
Wojciech Szpankowski: On an Asymptotic Analysis of a Tree-Type Algorithm for Broadcast Communications. 135-142 BibTeX
Klaus W. Wagner: On the Intersection of the Class of Linear Context-Free Languages and the Class of Single-Reset Languages. 143-146 BibTeX
Grigori Mints, Enn Tyugu: Semantics of a Declarative Language. 147-151 BibTeX
Kazem Taghva: Some Characterizations of Finitely Specifiable Implicational Dependency Families. 153-158 BibTeX
Jan Tijmen Udding: Absence of Individual Starvation Using Weak Semaphores. 159-162 BibTeX

Patrick Dehornoy: Turing Complexity of the Ordinals. 167-170 BibTeX
Michel Latteux, Erick Timmerman: Finitely Generated (Omega)o-Languages. 171-175 BibTeX
Bowen Alpern, Alan J. Demers, Fred B. Schneider: Safety Without Stuttering. 177-180 BibTeX
David R. O'Hallaron, P. E. Reynolds: A Generalized Deadlock Predicate. 181-188 BibTeX
Lenore Blum: Towards an Asymptotic Analysis of Karmarkar's Algorithm. 189-194 BibTeX
Alan A. Bertossi, Maurizio A. Bonuccelli: Hamiltonian Circuits in Interval Graph Generalizations. 195-200 BibTeX
Susumu Yamasaki, Shuji Doshita: Resolution Deduction to Detect Satisfiability For Another Class Including Non-Horn Sentences In Propositional Logic. 201-207 BibTeX
D. Gordon: Eliminating the Flag in Threaded Binary Search Trees. 209-214 BibTeX
O. J. Murphy, Stanley M. Selkow: The Efficiency of Using k-d Trees for Finding Nearest Neighbors in Discrete Space. 215-218 BibTeX

R. Sommerhalder, S. C. van Westrhenen: A Parallel O(log n) Algorithm for the Drawing of Algebraic Curves in an n*n Square. 221-226 BibTeX
Klaus Ambos-Spies: A Note on the Complete Problems for Complexity Classes. 227-230 BibTeX
Jan L. A. van de Snepscheut, Jan Tijmen Udding: An Alternative Implementation of Communication Primitives. 231-238 BibTeX
David J. Evans, Nadia Y. Yousif: Merging by the Parallel Jump Searching Algorithm. 239-246 BibTeX
G. Chen, M. Howard Williams: The Value of an Array Facility in Prolog. 247-251 BibTeX
Manfred Broy: Denotational Semantics of Communicating Sequential Programs. 253-259 BibTeX
J. Stojanovski: A Note on Implementing Prolog in Lisp. 261-264 BibTeX
C. C. Handley: An in Situ Distributive Sort. 265-270 BibTeX
Erkki Mäkinen: A Note on Pure Grammars. 271-274 BibTeX

Ernst L. Leiss: The Inaccessible Set: A Classification by Query Type of Security Risks in Statistical Database. 275-279 BibTeX
M. Benois, Jacques Sakarovitch: On the Complexity of Some Extended Word Problems Defined by Cancellation Rules. 281-287 BibTeX
Herbert Edelsbrunner, Emo Welzl: Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. 289-293 BibTeX
Alain J. Martin: A New Generalization of Dekker's Algorithm for Mutual Exclusion. 295-297 BibTeX
Leszek Holenderski: The Correctness of Nondeterministic Programs Revisited. 299-303 BibTeX
Lloyd Allison, Trevor I. Dix: A Bit-String Longest-Common-Subsequence Algorithm. 305-310 BibTeX
Kwang-Moo Choe, C. H. Chang: Efficient Computation of the Locally Least-Cost Insertion String for the LR Error Repair. 311-316 BibTeX
Frank Harary, Peter J. Slater: A Linear Algorithm for the Cutting Center of a Tree. 317-319 BibTeX
Richard B. Kieburtz: When Chasing Your Tail Saves Time. 321-324 BibTeX
Ikuo Nakata, Masataka Sassa: L-Attributed LL(1)-Grammars are LR-Attributed. 325-328 BibTeX