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=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computing sums of order-
k
Fibonacci numbers in
\log
time
M.C. Er
Information Processing Letters
17
(1), 1983, July, pp. 1-5
Trapdoor knapsacks without superincreasing structure
M. Willett
Information Processing Letters
17
(1), 1983, July, pp. 7-11
An algorithm to construct a compact b-tree in case of ordered keys
F. Cesarini
,
G. Soda
Information Processing Letters
17
(1), 1983, July, pp. 13-16
Shape distribution of height-balanced trees
R.C. Richards
Information Processing Letters
17
(1), 1983, July, pp. 17-20
Simulation, reduction and preservation of correctness properties of parallel systems
H.R. Tirri
Information Processing Letters
17
(1), 1983, July, pp. 21-27
Denotational semantics of communicating processes based on a language for applicative multiprogramming
M. Broy
Information Processing Letters
17
(1), 1983, July, pp. 29-35
An improved algorithm for hierarchical clustering using strong components
R.E. Tarjan
Information Processing Letters
17
(1), 1983, July, pp. 37-41
A distributed solution of the distributed termination problem
S.P. Rana
Information Processing Letters
17
(1), 1983, July, pp. 43-46
Is an exit statement sufficient? (structural programming)
M.H. Williams
Information Processing Letters
17
(1), 1983, July, pp. 47-51
Perfect stables in graphs
C. Croitoru
,
E. Suditu
Information Processing Letters
17
(1), 1983, July, pp. 53-56
Contiguous segmentation with limited compacting
J.R. Nawrocki
Information Processing Letters
17
(2), 1983, August, pp. 57-62
Optimality of intuitive checkpointing policies
M.J. Magazine
Information Processing Letters
17
(2), 1983, August, pp. 63-66
Optimum ordered bi-weighted binary trees
M. Shing
Information Processing Letters
17
(2), 1983, August, pp. 67-70
A note on the power of integer division
J. Vyskoc̆
Information Processing Letters
17
(2), 1983, August, pp. 71-72
A faster algorithm for finding edge-disjoint branchings
P. Tong
,
E.L. Lawler
Information Processing Letters
17
(2), 1983, August, pp. 73-76
Embedding cryptographic trapdoors in arbitrary knapsack systems
A. Shamir
Information Processing Letters
17
(2), 1983, August, pp. 77-79
Log-logarithmic worst-case range queries are possible in space
\Theta(n)
D.E. Willard
Information Processing Letters
17
(2), 1983, August, pp. 81-84
Stability of desynchronized 0l systems
Y. Kobuchi
Information Processing Letters
17
(2), 1983, August, pp. 85-90
An algorithm for horizontal decompositions (relational database model)
P. de Bra
,
J. Paredaens
Information Processing Letters
17
(2), 1983, August, pp. 91-95
Finding Hamiltonian circuits in proper interval graphs
A.A. Bertossi
Information Processing Letters
17
(2), 1983, August, pp. 97-101
Physical parallel devices are not much faster than sequential ones
A. Schorr
Information Processing Letters
17
(2), 1983, August, pp. 103-106
Precise typing and filters
J.J. Martin
Information Processing Letters
17
(3), 1983, October, pp. 109-112
Space as time (two-dimensional logic)
L. Fariñas
Information Processing Letters
17
(3), 1983, October, pp. 113-115
A note on the complexity of a partition algorithm
V. Lifschitz
,
L. Pesotchinsky
Information Processing Letters
17
(3), 1983, October, pp. 117-120
On the subword complexity of m-free DOL languages
A. Ehrenfeucht
,
G. Rozenberg
Information Processing Letters
17
(3), 1983, October, pp. 121-124
Seiten 1
2
3
>