Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=29
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
Michel Minoux
Information Processing Letters
29
, 1988, pp. 1-12
A fully distributed termination detection scheme
Shing-Tsaan Huang
Information Processing Letters
29
, 1988, pp. 13-18
Proving open properties by induction
Jean-Claude Raoult
Information Processing Letters
29
, 1988, pp. 19-23
On the detection of a common intersection of
k
convex objects in the plane
Matthias Reichling
Information Processing Letters
29
, 1988, pp. 25-29
On process assignment in parallel computing
F. Warren Burton
,
G.P. McKeown
,
V.J. Rayward-Smith
Information Processing Letters
29
, 1988, pp. 31-34
On linear search heuristics
Erkki Mäkinen
Information Processing Letters
29
, 1988, pp. 35-36
A practical algorithm for Boolean matrix multiplication
Michael D. Atkinson
,
N. Santoro
Information Processing Letters
29
, 1988, pp. 37-38
An exercise in proving self-stabilization with a variant function
J.L.W. Kessels
Information Processing Letters
29
, 1988, pp. 39-42
Time-optimal short-circuit evaluation of Boolean expressions
Masataka Sassa
,
Ikuo Nakata
Information Processing Letters
29
, 1988, pp. 43-51
A linear algorithm to solve fixed-point equations on transition systems
André Arnold
,
Paul Crubille
Information Processing Letters
29
, 1988, pp. 57-66
An incompleteness result in process algebra
Andrzej Szalas
Information Processing Letters
29
, 1988, pp. 67-70
On efficient parallel computations of costs of paths on a grid graph
Wojciech Rytter
Information Processing Letters
29
, 1988, pp. 71-74
Embedding rectilinear graphs in linear time
Frank Hoffmann
,
Klaus Kriegel
Information Processing Letters
29
, 1988, pp. 75-79
A guided tour of the mathematics of Metasoft '88
Andrzej Blikle
Information Processing Letters
29
, 1988, pp. 81-86
On the degree of synchronization of
k
1TOL and
k
1ETOL systems
Dietmar Wätjen
,
Erwin Unruh
Information Processing Letters
29
, 1988, pp. 87-89
Test sets for languages of infinite words
Aldo de Luca
,
Mariacristina Pelagalli
,
Stefano Varricchio
Information Processing Letters
29
, 1988, pp. 91-95
Dynamic programming on two-dimensional systolic arrays
Basile Louka
,
Maurice Tchuente
Information Processing Letters
29
, 1988, pp. 97-104
A fast backtrack algorithm for graph isomorphism
Hari Ballabh Mittal
Information Processing Letters
29
, 1988, pp. 105-110
Some subclasses of context-free languages in
NC^1
Oscar H. Ibarra
,
Tao Jiang
,
Bala Ravikumar
Information Processing Letters
29
, 1988, pp. 111-117
A linear-processor algorithm for depth-first search in planar graphs
Gregory E. Shannon
Information Processing Letters
29
, 1988, pp. 119-123
Preperfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule
Paliath Narendran
,
Friedrich Otto
Information Processing Letters
29
, 1988, pp. 125-130
A new characterization of FD implication with an application to update anomalies
Gottfried Vossen
Information Processing Letters
29
, 1988, pp. 131-135
The complexity of finding uniform emulations on fixed graphs
Hans L. Bodlaender
Information Processing Letters
29
, 1988, pp. 137-141
Confluence of indirection reductions in graph rewrite systems
P.M. van den Broek
Information Processing Letters
29
, 1988, pp. 143-148
Ring based termination detection algorithm for distributed computations
S. Haldar
,
D.K. Subramanian
Information Processing Letters
29
, 1988, pp. 149-153
Seiten 1
2
3
>