Information Processing Letters, Volume 24

Volume 24, Number 1, January 1987

Athanasios Alexandrakis, Symeon Bozapalidis:
Weighted Grammars and Kleene's Theorem. 1-4
Stuart A. Kurtz, Michael J. O'Donnell, James S. Royer:
How to Prove Representation-Independent Independence Results. 5-10
W. H. J. Feijen, A. J. M. van Gasteren, David Gries:
In-situ Inversion of a Cyclic Permutation. 11-14
Taenam Kim, Kyung-Yong Chwa:
An O(n log n log log n) Parallel Maximum Matching Algorithm for Bipartite Graphs. 15-17
Peter H. Hochschild:
Multiple Cuts, Input Repetition, and VLSI Complexity. 19-24
Raphael A. Finkel, Hari Madduri:
An Efficient Deadlock Avoidance Algorithm. 25-30
Masataka Sassa, Harushi Ishizuka, Ikuo Nakata:
ECLR-Attributed Grammars: A Practical Class of LR-Attributed Grammars. 31-41
Arthur J. Bernstein:
Predicate Transfer and Timeout in Message Passing Systems. 43-52
Richard S. Bird, John Hughes:
The alpha-beta Algorithm: An Exercise in Program Transformation. 53-57
Toshitsugu Yuba, Mamoru Hoshi:
Binary Search Networks: A New Method for Key Searching. 59-65
Vikraman Arvind, Somenath Biswas:
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. 67-69

Maciej Slusarek:
An Off-Line Storage Allocation Algorithm. 71-75
E. Allen Emerson:
Uniform Inevitability is Tree Automaton Ineffable. 77-79
Anne Grazon:
An Infinite Word Language Which is Not co-CFL. 81-85
Ouri Wolfson:
Concurrent Execution of Transaction Copies. 87-93
Dan Field:
A Note on a New Data Structure for in-the-Past Queries. 95-96
Claudio Rey, Rabab K. Ward:
On Determining the On-Line Minimax Linear Fit to a Discrete Point Set in the Plane. 97-101
Bogdan Korel:
The Program Dependence Graph in Static Program Testing. 103-108
Georg Gottlob:
Subsumption and Implication. 109-111
Masataka Sassa, Ikuo Nakata:
A Simple Realization of LR-Parsers for Regular Right Part Grammars. 113-120
Richard J. Anderson, Ernst W. Mayr:
Parallelism and the Maximal Path Problem. 121-126
C. A. R. Hoare, Jifeng He:
The Weakest Prespecification. 127-132
Mihalis Yannakakis, Fanica Gavril:
The Maximum k-Colorable Subgraph Problem for Chordal Graphs. 133-137

Marek Kubale:
The Complexity of Scheduling Independent Two-Processor Tasks on Dedicated Processors. 141-147
Mark W. Krentel:
A Note on the Transaction Backout Problem. 149-152
Richard P. Anstee:
A Polynomial Algorithm for b-Matchings: An Alternative Approach. 153-157
M. Roussille, P. Dufour:
Generation of Convex Polygons with Individual Angular Constraints. 159-164
William F. McColl, Mike Paterson:
The Planar Realization of Boolean Functions. 165-170
Dung T. Huynh:
On Solving Hard Problems by Polynomial-Size Circuits. 171-176
Dick Grune:
How to Compare the Incomparable. 177-181
Michel Castan, M.-H. Durand, Michel Lemaître:
A Set of Combinators for Abstraction in Linear Space. 183-188
D. C. Van Leijenhorst, Theo P. van der Weide:
On a Recursion Connected with Tree Balancing Algorithms. 189-192
Varol Akman:
An Algorithm for Determining an Opaque Minimal Forest of a Convex Polygon. 193-198
Michel Raynal:
A Distributed Algorithm to Prevent Mutual Drift Between n Logical Clocks. 199-202
Leonard Pitt:
A Note on Extending Knuth's Tree Estimator to Directed Acyclic Graphs. 203-206
David J. Evans, W. S. Yousif:
Explicit Solution of Block Tridiagonal Systems of Linear Equations. 207-209

Jan L. A. van de Snepscheut:
"Algorithms for On-the-Fly Garbage Collection" Revisited. 211-216
Shaunak Pawagi, P. S. Gopalakrishnan, I. V. Ramakrishnan:
Computing Dominators in Parallel. 217-221
D. C. Van Leijenhorst:
A Note on the Formula Size of the "mod k" Functions. 223-224
M. Zubair, B. B. Madan:
Time Efficient Systolic Architecture for Matrix * Vector Multiplication. 225-231
Dario Bini, Victor Y. Pan:
A Logarithmic Boolean Time Algorithm for Parallel Polynomial Division. 233-237
Anders Edenbrandt:
Chordal Graph Recognition is in NC. 239-241
Prakash V. Ramanan:
Obtaining Lower Bounds Using Artificial Components. 243-246
Svante Carlsson:
A Variant of Heapsort with Almost Optimal Number of Comparisons. 247-250
Martin Charles Golumbic:
A General Method for Avoiding Cycling in a Network. 251-253
Silvio Romero de Lemos Meira:
Strict Combinators. 255-258
Jacek Blazewicz, Gerd Finke:
Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. 259-263
R. Nigel Horspool, Michael R. Levy:
Correctness of an Extended Operator-Precedence Parsing Algorithm. 265-273
Jonathan Ruby:
A Liveness Property of a Parallel Algorithm. 275-277
Jayme Luiz Szwarcfiter:
A Note on the Computation of the k-Closure of a Graph. 279-280

Klaus Madlener, Friedrich Otto:
Using String-Rewriting for Solving the Word Problem for Finitely Presented Groups. 281-284
Takao Asano, Tetsuo Asano, Hiroshi Imai:
Shortest Path Between Two Simple Polygons. 285-288
M. D. Atkinson, H. W. Chang:
Computing the Number of Mergings with Constraints. 289-292
Cyrus Hazari, Hussein Zedan:
A Distributed Algorithm for Distributed Termination. 293-297
Gregers Koch:
Automating the Semantic Component. 299-305
@Article{Hirschberg: 1987: IUA,
Daniel S. Hirschberg, Dennis J. Volper:
Improved Update/Query Algorithms for the Interval Valuation Problem. 307-310
Ernest J. H. Chang, Gaston H. Gonnet, Doron Rotem:
On the Costs of Self-Stabilization. 311-316
Mark Valentine, Robert H. Davis:
The Automated Solution of Logic Puzzles. 317-324
Marek Chrobak, Wojciech Rytter:
Remarks on String-Matching and One-Way Multihead Automata. 325-329
Robert D. Tennent:
A Note on Undefined Expression Values in Programming Logics. 331-333
Peter Widmayer, Derick Wood:
Time- and Space-Optimal Contour Computation for a Set of Rectangles. 335-338
Michael B. Dillencourt:
Traveling Salesman Cycles are not Always Subgraphs of Delaunay Triangulations or of Minimum Weight Triangulations. 339-342
Richard Kennaway, M. Ronan Sleep:
Variable Abstraction in O(n log n) Space. 343-349

Heinrich Müller:
Sorting Numbers Using Limited Systolic Coprocessors. 351-354
Georg Gottlob:
On the Size of Nonredundant FD-Covers. 355-360
Andrzej Szepietowski:
There are no Fully Space Constructible Functions Between log log n and log n. 361-362
Ian Parberry:
An Improved Simulation of Space and Reversal Bounded Deterministic Turing Machines by Width and Depth Bounded Uniform Circuits. 363-367
Hanan Samet, Clifford A. Shaffer, Robert E. Webber:
Digitizing the Plane with Cells of Nonuniform Size. 369-375
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth:
Occam's Razor. 377-380
M. Bajantri, David B. Skillicorn:
A Fast Multiprocessor Message Passing Implementation. 381-389
Christopher W. Fraser, David R. Hanson:
Optimization of Argument Evaluation Order. 391-395
Raymond A. Marie, Kishor S. Trivedi:
A Note on the Effect of Preemptive Policies on the Stability of a Priority Queue. 397-401
William E. Wright:
A Note on External Sorting Using Almost Single Input Buffering. 403-405
M. K. Sridhar:
A New Algorithm for Parallel Solution of Linear Equations. 407-412
Herbert Edelsbrunner, Mark H. Overmars:
Zooming by Repeated Range Detection. 413-417

Last update Tue Feb 14 04:19:33 2012 CET by the DBLP Team —

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