Information Processing Letters, Volume 27

Volume 27, Number 1, February 1988

M. Balakrishnan, S. Sutarwala, Arun K. Majumdar, Dilip K. Banerji, James G. Linders:
A Semantic Approach for Modular Synthesis of VLSI Systems. 1-7
Ming Li:
A Separator Theorem for One-Dimensional Graphs Under Linear Mapping. 9-11
Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju:
Sorting with Efficient Use of Special-Purpose Sorters. 13-15
G. Ramalingam, C. Pandu Rangan:
Total Domination in Interval Graphs Revisited. 17-21
G. Lyon:
A Tagless Marking That is Linear Over Subtrees. 23-28
Mark B. Josephs:
The Data Refinement Calculator for Z Specifications. 29-33
Doug Lea:
Digital and Hilbert k-d Trees. 35-41
Alan Gibbons, Amos Israeli, Wojciech Rytter:
Parallel O(log n) Time Edge-Colouring of Trees and Halin Graphs. 43-51

Bogdan S. Chlebus:
A Parallel Bucket Sort. 57-61
Jacek Witaszek:
A Practical Method for Finding the Optimum Postponement Transformation for LR(k) Parsers. 63-67
Mukesh Singhal, Yelena Yesha:
A Polynomial Algorithm for Computation of the Probability of Conflicts in a Database Under Arbitrary Data Access Distribution. 69-74
Satoru Miyano:
A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem. 75-78
Chin-Chen Chang, C. H. Chang:
An Ordered Minimal Perfect Hashing Scheme with Single Parameter. 79-83
Robin Liu, Simeon C. Ntafos:
On Decomposing Polygons into Uniformly Monotone Parts. 85-89
Franz Baader:
A Note on Unification Type Zero. 91-93
Ravi S. Sandhu:
Cryptographic Implementation of a Tree Hierarchy for Access Control. 95-98
Nicholas J. Patterson, Kenneth J. Supowit:
Finding the Vertices Nearest to a Point in a Hypercube. 99-102
Alan M. Frieze:
On the Random Construction of Heaps. 103-109

Leszek Holenderski, Andrzej Szalas:
Propositional Description of Finite Cause-Effect Structures. 111-117
David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis:
On Generating All Maximal Independent Sets. 119-123
Kurt Mehlhorn:
A Faster Approximation Algorithm for the Steiner Problem in Graphs. 125-128
Sharat Chandran, Azriel Rosenfeld:
Order Statistics on a Hypercube. 129-132
Alan A. Bertossi:
Parallel Circle-Cover Algorithms. 133-139
Stephen A. Cook, Michael Luby:
A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula. 141-145
Joel Berman, Willem J. Blok:
Positive Boolean Dependencies. 147-150
Osamu Watanabe:
On Hardness of One-Way Functions. 151-157
Jacek Leszczylowski, Staffan Bonnier, Jan Maluszynski:
Logic Programming with External Procedures: Introducing S-Unification. 159-165

Yung H. Tsin:
On Handling Vertex Deletion in Updating Spanning Trees. 167-168
K. V. S. Ramarao, Robert Daley, Rami G. Melhem:
Message Complexity of the Set Intersection Problem. 169-174
Hans Rohnert:
Time and Space Efficient Algorithms for Shortest Paths Between Convex Polygons. 175-179
Richard Koo, Sam Toueg:
Effects of Message Loss on the Termination of Distributed Protocols. 181-188
Ulrich Faigle, Rainer Schrader:
On the Convergence of Stationary Distributions in Simulated Annealing Algorithms. 189-194
Abdol-Hossein Esfahanian, S. Louis Hakimi:
On Computing a Conditional Edge-Connectivity of a Graph. 195-199
Andrzej Szepietowski:
Remarks on Languages Acceptable in log n Space. 201-203
Dominique Roelants van Baronaigien, Frank Ruskey:
Generating t-ary Trees in A-Order. 205-213
Khaled M. Bugrara, Paul Walton Purdom Jr.:
An Exponential Lower Bound for the Pure Literal Rule. 215-219

Carla D. Savage:
Recognizing Majority on a One-Way Mesh. 221-225
Hermann Jung, Kurt Mehlhorn:
Parallel Algorithms for Computing Maximal Independent Sets in Trees and for Updating Minimum Spanning Trees. 227-236
Krishnaprasad Thirunarayan:
On the Computability of Circumscription. 237-243
Bob P. Weems:
A Study of Page Arrangements for Extendible Hashing. 245-248
Ashok Kumar, Vishv M. Malhotra:
A New Computation Rule for Prolog. 249-252
Kozo Itano, Yutaka Sato, Hidemi Hirai, Tomoyoshi Yamagata:
An Incremental Pattern Matching Algorithm for the Pipelined Lexical Scanner. 253-258
Harold N. Gabow, Robert Endre Tarjan:
A Linear-Time Algorithm for Finding a Minimum Spanning Pseudoforest. 259-263
Mirko Krvanek:
The Complexity of Ultrametric Partitions on Graphs. 265-270
G. Ramalingam, C. Pandu Rangan:
A Unified Approach to Domination Problems on Interval Graphs. 271-274

Jirí Matousek:
Line Arrangements and Range Search. 275-280
Aldo de Luca, Stefano Varricchio:
On the Factors of the Thue-Morse Word on Three Symbols. 281-285
Hans L. Bodlaender:
A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors. 287-290
Meichun Hsu, Stuart E. Madnick:
Shifting Timestamps for Concurrency Control in an Information Hierarchy. 291-297
Shay Kutten:
Optimal Fault-Tolerant Distributed Construction of a Spanning Forest. 299-307
Ewa Orlowska:
Proof System for Weakest Prespecification. 309-313
M. A. Sridhar:
On the Connectivity of the De Bruijn Graph. 315-318
Xiaoqiu Huang:
A Lower Bound for the Edit-Distance Problem Under an Arbitrary Cost Function. 319-321
David Fernández-Baca:
Nonserial Dynamic Programming Formulations of Satisfiability. 323-326

Last update Fri May 24 20:29:19 2013 CET by the DBLP Team —

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