Information Processing Letters, Volume 34

Volume 34, Number 1, 22 February 1990

Masahito Kurihara, Ikuo Kaji:
Modular Term Rewriting Systems and the Termination. 1-4
Mohan Ahuja:
Flush Primitives for Asynchronous Distributed Systems. 5-12
Shai Simonson:
Routing with Critical Paths. 13-19
Arne Andersson, Svante Carlsson:
Construction of a Tree From its Traversals in Optimal Time and Space. 21-25
Jeremy Jacob:
Separability and the Detection of Hidden Channels. 27-29
Alejandro D. Martínez, Rosita Wachenchauzer, Rafael Dueire Lins:
Cycle Reference Counting with Local Mark-Scan. 31-35
O. J. Murphy, Stanley M. Selkow:
Finding Nearest Neighbors with Voronoi Tessellations. 37-41
Carla Neaderhouser Purdy, George B. Purdy:
The Area-Time Complexity of the Greatest Common Divisor Problem: A Lower Bound. 43-46
Joseph Y.-T. Leung, Gilbert H. Young:
Preemptive Scheduling to Minimize Mean Weighted Flow Time. 47-50
Ronald Morrison, Malcolm P. Atkinson, Alfred L. Brown, Alan Dearle:
On the Classification of Binding Mechanisms. 51-55
Nissim Francez:
Corrigenda: Cooperating Proofs for Distributed Programs with Multiparty Interactions. 57, (see: IPL 32(5): 235-242 (22 September 1989))

Simeon C. Ntafos:
The Robber Route Problem. 59-63
Pradip Dey, Barrett R. Bryant, Tadao Takaoka:
Lexical Ambiguity in Tree Adjoining Grammars. 65-69
Young C. Wee, Seth Chaiken, Dan E. Willard:
On the Angle Restricted Nearest Neighbor Problem. 71-76
Sandeep Sen:
Finding an Approximate Median with High Probability in Constant Parallel Time. 77-80
Stephen A. Cook, Toniann Pitassi:
A Feasibly Constructive Lower Bound for Resolution Proofs. 81-85
Jean-Paul Laumond:
Connectivity of Plane Triangulations. 87-96
Stephan Olariu:
On the Closure of Triangle-Free Graphs Under Substitution. 97-101
Michel Cosnard, Jean Duprat, Afonso Ferreira:
The Complexity of Searching in X+Y and Other Multisets. 103-109

C. A. R. Hoare:
Fixed Points of Increasing Functions. 111-112
Jean Marcel Pallo:
A Distance Metric on Binary Trees Using Lattice-Theoretic Measures. 113-116
Alberto Bertoni, Massimiliano Goldwurm, Paolo Massazza:
Counting Problems and Algebraic Formal Power Series in Noncommuting Variables. 117-121
Lein Harn, Thomas Kiesler:
An Efficient Probabilistic Encryption Scheme. 123-129
Moon Hwa Park, Myunghwan Kim:
A Distributed Synchronization Scheme for Fair Multi-Process Handshakes. 131-138
Henk Goeman:
Towards a Theory of (Self) Applicative Communicating Processes: A Short Note. 139-142
Christoph Meinel:
Logic VS. Complexity Theoretic Properties of the Graph Accessibility Problem for Directed Graphs of Bounded Degree. 143-146
Shang-Hua Teng:
Space Efficient Processor Identity Protocol. 147-154
John C. Tipper:
A Straightforward Iterative Algorithm for the Planar Voronoi Diagram. 155-160
Jürgen Plehn:
Preemptive Scheduling of Independent Jobs with Releas Times and Deadlines on a Hypercube. 161-166

Udi Manber:
Recognizing Breadth-First Search Trees in Linear Time. 167-171
Laxmikant V. Kalé:
An Almost Perfect Heuristic for the N Nonattacking Queens Problem. 173-178
Earlin Lutz:
Some Proofs of Data Refinement. 179-185
Biing-Feng Wang, Gen-Huey Chen, Ferng-Chiang Lin:
Constant Time Sorting on a Processor Array with a Reconfigurable Bus System. 187-192
James H. Bradford:
Sequence Matching with Binary Codes. 193-196
Anindo Bagchi, S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Parallel Algorithms for Gossiping by Mail. 197-202
Samir Khuller:
Coloring Algorithms for K_5-Minor Free Graphs. 203-208
James W. Cooper, Leslie J. Kitchen:
Casop: A Fast Algorithm for Computing the n-Ary Composition of a Binary Associative Operator. 209-213
G. Ramalingam, C. Pandu Rangan:
New Sequential and Parallel Algorithms for Interval Graph Recognition. 215-219

Paul E. S. Dunne:
Comment on Kochol's Paper ``Efficient Monotone Circuits for Threshold Functions''. 221-222
Stefan Rönn, Heikki Saikkonen:
Distributed Termination Detection with Counters. 223-227
Zsolt Tuza:
Periodic String Division Generated by Deterministic L Systems. 229-234
Sung Kwon Kim:
A Parallel Algorithm for Finding a Maximum Clique of a Set of Circular Arcs of a Circle. 235-241
Owen Murphy:
A Unifying Framework for Trie Design Heuristics. 243-249
William Pugh:
Slow Optimally Balanced Search Strategies VS. Cached Fast Uniformly Balanced Search Strategies. 251-254
Andreas S. Pombortsis:
Sharing Special Purpose Resources in a Multiprocessor Environment. 255-260
R. T. Kuo, S. S. Tseng:
The Necessary and Sufficient Condition for the Worst-Case Male Optimal Stable Matching. 261-263
J. M. Robson:
Random Access Machines with Multi-Dimensional Memories. 265-266
Mark Allen Weiss, Robert Sedgewick:
More on Shellsort Increment Sequences. 267-270
Gaston H. Gonnet, Ricardo A. Baeza-Yates:
An Analysis of the Karp-Rabin String Matching Algorithm. 271-274
Ingo Althöfer:
Tight Lower Bounds on the Length of Word Chains. 275-276

Oded Goldreich:
A Note on Computational Indistinguishability. 277-281
N. Chandrasekharan:
Isomorphism Testing of k-Trees is in NC, for Fixed k. 283-287
Jan Chomicki, V. S. Subrahmanian:
Generalized Closed World Assumptions is Pi^0_2-Complete. 289-291
Lenwood S. Heath:
Covering a Set with Arithmetic Progressions is NP-Complete. 293-298
Mehdi R. Zargham, Kenneth J. Danhof:
Toward a Definition of Fault Analysis for Petri Nets Models. 299-305
Philip N. Klein, Clifford Stein:
A Parallel Algorithm for Eliminating Cycles in Undirected Graphs. 307-312
Gabriel Matsliach, Oded Shmueli:
Distributing A B+-Tree in a Loosely Coupled Environment. 313-321
Abhijit Sengupta, Subir Bandyopadhyay:
Deadlock-Free Routing in k-Ary Hypercube Network in Presence of Processor Failures. 323-328

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

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