Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 29
Volume 29, Number 1, September 1988
- Michel Minoux:
LTUR: A Simplified Linear-Time Unit Resolution Algorithm for Horn Formulae and Computer Implementation. 1-12 - Shing-Tsaan Huang:
A Fully Distributed Termination Detection Scheme. 13-18 - Jean-Claude Raoult:
Proving Open Properties by Induction. 19-23 - Matthias Reichling:
On the Detection of a Common Intersection of k Convex Objects in the Plane. 25-29 - F. Warren Burton, Geoff P. McKeown, Victor J. Rayward-Smith:
On Process Assignment in Parallel Computing. 31-34 - Erkki Mäkinen
:
On Linear Search Heuristics. 35-36 - M. D. Atkinson, Nicola Santoro:
A Practical Algorithm for Boolean Matrix Multiplication. 37-38 - Joep L. W. Kessels:
An Exercise in Proving Self-Stabilization with a Variant Function. 39-42 - Masataka Sassa, Ikuo Nakata:
Time-Optimal Short-Circuit Evaluation of Boolean Expressions. 43-51
Volume 29, Number 2, September 1988
- André Arnold, Paul Crubillé:
A Linear Algorithm to Solve Fixed-Point Equations on Transition Systems. 57-66 - Andrzej Szalas:
An Incompleteness Result in Process Algebra. 67-70 - Wojciech Rytter:
On Efficient Computations of Costs of Paths on a Grid Graph. 71-74 - F. Hoffman:
Embedding Rectilinear Graphs in Linear Time. 75-79 - Andrzej Blikle:
A Guided Tour of the Mathematics of MetaSoft'88. 81-86 - Dietmar Wätjen, Erwin Unruh:
On the Degree of Synchronization of kl TOL and k1 ETOL Systems. 87-89 - Aldo de Luca, M. Pelagalli, Stefano Varricchio:
Test Sets for Languages of Infinite Words. 91-95 - Basile Louka, Maurice Tchuenté:
Dynamic Programming on Two-Dimensional Systolic Arrays. 97-104 - H. B. Mittal:
A Fast Backtrack Algorithm for Graph Isomorphism. 105-110
Volume 29, Number 3, October 1988
- Oscar H. Ibarra, Tao Jiang, Bala Ravikumar:
Some Subclasses of Context-Free Languages In NC1. 111-117 - Gregory E. Shannon:
A Linear-Processor Algorithm for Depth-First Search in Planar Graphs. 119-123 - Paliath Narendran, Friedrich Otto:
Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule. 125-130 - Gottfried Vossen:
A New Characterization of FD Implication with an Application to Update Anomalies. 131-135 - Hans L. Bodlaender:
The Complexity of Finding Uniform Emulations on Fixed Graphs. 137-141 - P. M. van den Broek:
Confluence of Indirection Reductions in Graph Rewrite Systems. 143-148 - Sibsankar Haldar, D. K. Subramanian:
Ring Based Termination Detection Algorithm for Distributed Computations. 149-153 - Bogdan Korel, Janusz W. Laski:
Dynamic Program Slicing. 155-163
Volume 29, Number 4, November 1988
- Jerzy R. Nawrocki, A. Urbanski:
Fixed-Size Blocks Optimization. 165-169 - Symeon Bozapalidis, S. Ioulidis:
Varieties of Formal Series on Trees and Eilenberg's Theorem. 171-175 - Sang Cho, Dung T. Huynh:
On a Complexity Hierarchy Between L and NL. 177-182 - Aris M. Ouksel, Peter Scheuermann:
Implicit Data Structures for Linear Hashing Schemes. 183-189 - Chan-Ik Park, Kyu Ho Park, Myunghwan Kim:
Efficient Backward execution in and/or Process Model. 191-198 - Ernst L. Leiss:
On the Degree of Dominator Trees. 199-200 - F. E. J. Kruseman:
On a Recursive Ascent Parser. 201-206 - Fabio Alberto Schreiber, Giuseppe Rosolini:
An Algebraic Description of Some State-Dependent Failure Mechanisms. 207-211 - Sakti Pramanik, Myoung-Ho Kim:
HCB-Tree: A Height Compressed B-Tree for Parallel Processing. 213-220
Volume 29, Number 5, November 1988
- Giorgio Gallo, Maria Grazia Scutellà:
Polynomially Solvable Satisfiability Problems. 221-227 - H. J. Boom:
Lazy Variable-Renumbering Makes Substitution Cheap. 229-232 - Boris S. Veroy:
Optimal Search Algorithm for a Minimum of a Discrete Periodic Bimodal Function. 233-239 - Peter Schorn:
A Canonical Simplifier for Trigonometric Expressions in the Kinematic Equation. 241-246 - Füsun Özgüner, Cevdet Aykanat:
A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor. 247-254 - Marek Chrobak, Richard Harter:
A Note on Random Sampling. 255-256 - William McCune:
Un-Skolemizing Clause Sets. 257-263 - Micha Sharir:
The Shortest Watchtower and Related Problems for Polyhedral Terrains. 265-270 - Alessandro D'Atri, Marina Moscarini:
On Hypergraph Acyclicity and Graph Chordality. 271-274 - Pratul Dublish:
An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon. 275-276
Volume 29, Number 6, December 1988
- Mila E. Majster-Cederbaum:
On the Uniqueness of Fixed Points of Endofunctors in a Category of Complete Metric Spaces. 277-281 - Bernard M. Waxman, Makoto Imase:
Worst-Case Performance of Rayward-Smith's Steiner Tree Heuristic. 283-287 - Stephan Olariu:
On the Unimodality of Convex Polygons. 289-292 - Carroll Morgan:
Auxiliary Variables in Data Refinement. 293-296 - Irène Guessarian, Lutz Priese:
On the Minimal Number of * Operators to Model Regularity in Fair SCCS. 297-300 - David Alex Lamb:
Benign Side Effects. 301-305 - Natarajan Shankar, V. Ramachandran:
Efficient Parallel Circuits and Algorithms for Division. 307-313 - Tetsuo Moriya:
Closure Property of Principal Cones Under Substitution. 315-317 - Boris S. Veroy:
Average Complexity of Divide-and-Conquer Algorithms. 319-326 - Torben Hagerup:
On Saving Space in Parallel Computation (Note). 327-329
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-06 21:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
