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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comments on 'a distributed algorithm for distributed termination'
G. Tel
,
J. van Leeuwen
Information Processing Letters
25
(5), 1987, July, pp. 349
Some observations concerning alternating Turing machines using small space
J.H. Chang
,
O.H. Ibarra
,
B. Ravikumar
,
L. Berman
Information Processing Letters
25
(1), 1987, April, pp. 1-9
On-line construction of the convex hull of a simple polyline
A.A. Melkman
Information Processing Letters
25
(1), 1987, April, pp. 11-12
Separation with the Ruzzo, Simon, and Tompa relativization implies
\mbox{DSPACE}(\log n) \neq \mbox{NSPACE}(\log n)
B. Kirsig
,
K.J. Lange
Information Processing Letters
25
(1), 1987, April, pp. 13-15
Probable correctness theory
R.G. Hamlet
Information Processing Letters
25
(1), 1987, April, pp. 17-25
An
O(n^{1.5})
algorithm to decide boundedness for conflict-free vector replacement systems
Rodney R. Howell
,
Louis E. Rosier
,
Hsu-Chun Yen
Information Processing Letters
25
, 1987, April, pp. 27-33
Fixed hypercube embedding
G. Cybenko
,
D.W. Krumme
,
K.N. Venkataraman
Information Processing Letters
25
(1), 1987, April, pp. 35-39
Obstacle growing in a nonpolygonal world
J.P. Laumond
Information Processing Letters
25
(1), 1987, April, pp. 41-50
A fast parallel coloring of planar graphs with five colors
J. Naor
Information Processing Letters
25
(1), 1987, April, pp. 51-53
An
O(\log n)
time parallel algorithm for triangulating a set of points in the plane
Cao An Wang
,
Yung H. Tsin
Information Processing Letters
25
(1), 1987, April, pp. 55-60
Performance of distributive partitioned sort in a demand paging environment
G.A. Hyslop
,
E.A. Lamagna
Information Processing Letters
25
(1), 1987, April, pp. 61-64
A topological approach to dynamic graph connectivity
J.H. Reif
Information Processing Letters
25
(1), 1987, April, pp. 65-70
Prespecification in data refinement
C.A.R. Hoare
,
Jifeng He
,
J.W. Sanders
Information Processing Letters
25
(2), 1987, May, pp. 71-76
A linear expected-time algorithm for computing planar relative neighbourhood graphs
J. Katajainen
,
O. Nevalainen
,
J. Teuhola
Information Processing Letters
25
(2), 1987, May, pp. 77-86
Efficient algorithms for common transversals
M. Atallah
,
C. Bajaj
Information Processing Letters
25
(2), 1987, May, pp. 87-91
Predicative specifications for functional programs describing communicating networks
M. Broy
Information Processing Letters
25
(2), 1987, May, pp. 93-101
A time-optimal message-efficient distributed algorithm for depth-first-search
K.B. Lakshmanan
,
N. Meenakshi
,
K. Thulasiraman
Information Processing Letters
25
(2), 1987, May, pp. 103-109
Parallel algorithms for finding Hamilton cycles in random graphs
A.M. Frieze
Information Processing Letters
25
(2), 1987, May, pp. 111-117
An observation concerning constraint-based compaction
F.M. Maley
Information Processing Letters
25
(2), 1987, May, pp. 119-122
The complexity of preemptive scheduling given interprocessor communication delays
V.J. Rayward-Smith
Information Processing Letters
25
(2), 1987, May, pp. 123-125
Quantification in ALGOL-like languages
R.D. Tennent
Information Processing Letters
25
(2), 1987, May, pp. 133-137
Counterexamples to termination for the direct sum of term rewriting systems
Y. Toyama
Information Processing Letters
25
(3), 1987, May, pp. 141-143
On the proof of a distributed algorithm
J.P. Verjus
Information Processing Letters
25
(3), 1987, May, pp. 145-147
A non-Hamiltonian, nondegenerate Delaunay triangulation
M.B. Dillencourt
Information Processing Letters
25
(3), 1987, May, pp. 149-151
On distributed snapshots
T.H. Lai
,
T.H. Yang
Information Processing Letters
25
(3), 1987, May, pp. 153-158
Seiten 1
2
3
>