Information Processing Letters, Volume 12

Volume 12, Number 1, 13 February 1981

S. Mauceri, Antonio Restivo:
A Family of Codes Commutatively Equivalent to Prefix Codes. 1-4
Krzysztof Dudzinski, Andrzej Dydek:
On a Stable Minimum Storage Merging Algorithm. 5-8
Eugene L. Lawler, Charles U. Martel:
Scheduling Periodically Occurring Tasks on Multiple Processors. 9-12
Christian Choffrut:
A Closure Property of Deterministic Context-Free Languages. 13-16
Nai-Kuan Tsao:
The Numerical Instability of Bini's Algorithm. 17-19
Harold N. Gabow:
A Linear-Time Recognition Algorithm for Interval Dags. 20-22
Dorothy E. Denning, Fred B. Schneider:
Master Keys for Group Sharing. 23-25
Eric C. R. Hehner:
Bunch Theory: A Simple Set Theory for Computer Science. 26-30
Sue Whitesides:
An Algorithm for Finding Clique Cut-Sets. 31-32
Pavol Hell, David G. Kirkpatrick:
On Generalized Matching Problems. 33-35
Maurice Bruynooghe:
Solving Combinatorial Search Problems by Intelligent Backtracking. 36-39
Errol L. Lloyd:
Coffman-Graham Scheduling of UET Task Systems with 0-1 Resources. 40-45
Stefano Ceri, Giuseppe Pelagatti:
An Upper Bound on the Number of Execution Nodes for a Distributed Join. 46-48
Mark H. Overmars, Jan van Leeuwen:
Some Principles for Dynamizing Decomposable Searching Problems. 49-53
Leslie G. Valiant: Addendum: Computing Multivariate Polynomials in Parallel. 54

Michael Hatzopoulos, John G. Kollias:
Optimal Policy for Database Backup and Recovery. 55-58
David M. Harland:
Concurrency in a Language Employing Messages. 59-62
Ingemar Ingemarsson, C. K. Wong:
A User Authentication Scheme for Shared Data Based on a Trap-Door One-Way Function. 63-67
Jean-Jacques Pansiot:
The Morse Sequence and Iterated Morphisms. 68-70
Allan Borodin, Leonidas J. Guibas, Nancy A. Lynch, Andrew Chi-Chih Yao:
Efficient Searching Using Partial Ordering. 71-75
Claus-Peter Schnorr:
How Many Polynomials can be Approximated Faster Than They can be Evaluated? 76-78
Joxan Jaffar:
Presburger Arithmetic With Array Segments. 79-82
David Steinberg, Michael Rodeh:
A Layout for the Shuffle-Exchange Network with Theta(N²/log N) Area. 83-88
Yossi Shiloach:
Another Look at the Degree Constrained Subgraph Problem. 89-92
Kurt Mehlhorn, Mark H. Overmars:
Optimal Dynamization of Decomposable Searching Problems. 93-98
Mark H. Overmars:
General Methods for `All Elements' and `All Pairs' Problems. 99-102
Silvio Micali:
Two-Way Deterministic Finite Automata are Exponentially More Succinct Than Sweeping Automata. 103-105
Martin Tompa:
An Extension of Savitch's Theorem to Small Space Bounds. 106-108

Bruno Courcelle:
The Simultaneous Accessibility of Two Configurations of Two Equivalent DPDA's. 111-114
Gary L. Peterson:
Myths About the Mutual Exclusion Problem. 115-116
Will E. Leland, Raphael A. Finkel, Li Qiao, Marvin H. Solomon, Leonard Uhr:
High Density Graphs for Processor Interconnection. 117-120
Ronald V. Book:
The Undecidability of a Word Problem: On a Conjecture of Strong, Maggiolo-Schettini and Rosen. 121-122
Gerhard Lischke:
Two Types of Properties for Complexity Measures. 123-126
Reinhard Wilhelm:
A Modified Tree-to-Tree Correction Problem. 127-132
Robert J. Fowler, Mike Paterson, Steven L. Tanimoto:
Optimal Packing and Covering in the Plane are NP-Complete. 133-137
Jerzy W. Jaromczyk:
Linear Decision Trees are too Weak for Convex Hull Problem. 138-141
Alberto Bertoni, Giancarlo Mauri:
On Efficient Computation of the Coefficients of Some Polynomials with Applications to Some Enumeration Problems. 142-145
W. Erni, R. Lapsien:
On the Time and Tape Complexity of Weak Unification. 146-150
Paolo Ancilotti, Maurelio Boari:
Information Streams Sharing a Finite Buffer: Protection Problems. 151-159

Franco P. Preparata, Kenneth J. Supowit:
Testing a Simple Polygon for Monotonicity. 161-164
Caroline M. Eastman:
Optimal Bucket Size for Nearest Neighbor Searching in k-d Trees. 165-167
Mark H. Overmars, Jan van Leeuwen:
Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems. 168-173
Christiane Frougny:
Simple Deterministic NTS Languages. 174-178
Henk Meijer:
A Note on `A Cryptosystem for Multiple Communication'. 179-181
Martin E. Hellman:
Another Cryptanalytic Attack on `A Cryptosystem for Multiple Communication'. 182-183
Thomas Ottmann, Arto Salomaa, Derick Wood:
Sub-Regular Grammar Forms. 184-187
Ichiro Semba:
Generation of all the Balanced Parenthesis Strings in Lexicographical Order. 188-192
Aldo de Luca:
A Combinatorial Property of the Fibonacci Words. 193-195
Eric C. R. Hehner, R. K. Shyamasundar:
An Implementation of P and V. 196-198
David Maier, Sharon C. Salveter:
Hysterical B-trees. 199-202
Christos H. Papadimitriou, Mihalis Yannakakis:
On Minimal Eulerian Graphs. 203-205
Masao Iri, Kazuo Murota, Shouichi Matsui:
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane. 206-209

Jon Mauney, Charles N. Fischer:
An Improvement to Immediate Error Detection in Strong LL(1) Parsers. 211-212
Lloyd K. Konneker, Yaakov L. Varol:
A Note on Heuristics for Dynamic Organization of Data Structures. 213-216
Marc Snir:
On the Complexity of Simplifying Quadratic Forms. 217-220
David M. Harland:
On Facilities for Interprocess Communication. 221-226
Oscar H. Ibarra, Shlomo Moran, Louis E. Rosier:
Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems. 227-232
Jean-Jacques Pansiot:
A Note on Post's Correspondence Problem. 233
Wojciech Rytter:
An Effective Simulation of Deterministic Pushdown Automata with Many Two-Way and One-Way Heads. 234-236
Bing-Chao Huang:
An Algorithm for Inverting a Permutation. 237-238
Józef Winkowski:
Protocols of Accessing Overlapping Sets of Resources. 239-243
Maxime Crochemore:
An Optimal Algorithm for Computing the Repetitions in a Word. 244-250
Moshe Y. Vardi:
The Decision Problem for Database Dependencies. 251-254
Jürgen Ebert:
A Sensitive Transitive Closure Algorithm. 255-258

Last update Sat May 25 20:34:42 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page