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
[1]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal checkpointing and local recording for domino-free rollback recovery
K. Venkatesh
,
T. Radhakrishnan
,
H.F. Li
Information Processing Letters
25
(5), 1987, July, pp. 295-303
A storage allocation method with invalidating dangling references
J.R. Nawrocki
,
J. Martinek
Information Processing Letters
25
(5), 1987, July, pp. 305-310
Super-exponentials nonprimitive recursive, but rudimentary
C. Calude
Information Processing Letters
25
(5), 1987, July, pp. 311-315
An application of the planar separator theorem to counting problems
S.S. Ravi
,
H.B. Hunt III
Information Processing Letters
25
(5), 1987, July, pp. 317-321
A note on Graham's convex hull algorithm
D. Gries
,
I. Stojmenovic̑
Information Processing Letters
25
(5), 1987, July, pp. 323-327
A new distributed breadth-first-search algorithm
Yunzhou Zhu
,
To-Yat Cheung
Information Processing Letters
25
(5), 1987, July, pp. 329-333
Fitted diagonals for reducing I/O bandwidth in systolic systems
R. Surós
,
E. Montagne
Information Processing Letters
25
(5), 1987, July, pp. 335-341
An efficient solution to the mutual exclusion problem using weak semaphores
S.A. Friedberg
,
G.L. Peterson
Information Processing Letters
25
(5), 1987, July, pp. 343-347
Packing items from a triangular distribution
Kadri Krause
,
Lawrence L. Larmore
,
Dennis James Volper
Information Processing Letters
25
(6), 1987, July, pp. 351-361
Nesting of shuffle closure is important
J. Jȩdrzejowicz
Information Processing Letters
25
(6), 1987, July, pp. 363-367
On the rotation distance in the lattice of binary trees
J. Pallo
Information Processing Letters
25
(6), 1987, July, pp. 369-373
Some average measures in m-ary search trees
R.A. Baeza-Yates
Information Processing Letters
25
(6), 1987, July, pp. 375-381
Generalized lower bounds derived from HÅstad's main lemma (small depth circuits)
S. Moran
Information Processing Letters
25
(6), 1987, July, pp. 383-388
On the worst-case ratio of a compound multiprocessor scheduling algorithm
M. Kunde
,
H. Steppat
Information Processing Letters
25
(6), 1987, July, pp. 389-396
The area-time complexity of the VLSI counter
I. Vrt̑o
Information Processing Letters
25
(6), 1987, July, pp. 397-400
Determining connected components in linear time by a linear number of processors
F. Peper
Information Processing Letters
25
(6), 1987, July, pp. 401-406
The complexity of strict serializability revisited
U. Kelter
Information Processing Letters
25
(6), 1987, July, pp. 407-411
A note on symmetrical cellular spaces
Y. Kobuchi
Information Processing Letters
25
(6), 1987, July, pp. 413-415
Seiten
<
1
2
3