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=16
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A representation of disjoint sets with fast initialization
A. Perko
Information Processing Letters
16
(1), 1983, January, pp. 21
Infinite cube-connected cycles
F. Meyer auf der Heide
Information Processing Letters
16
(1), 1983, January, pp. 1-2
Preemptive scheduling of periodic jobs in uniform multiprocessor systems
A.A. Bertossi
,
M.A. Bonuccelli
Information Processing Letters
16
(1), 1983, January, pp. 3-6
On the subword complexity of locally catenative d0l languages
A. Ehrenfeucht
,
G. Rozenberg
Information Processing Letters
16
(1), 1983, January, pp. 7-9
Traveling salesman cycles are not always subgraphs of Voronoi duals
V. Kantabutra
Information Processing Letters
16
(1), 1983, January, pp. 11-12
Armstrong databases for functional and inclusion dependencies
R. Fagin
,
M.Y. Vardi
Information Processing Letters
16
(1), 1983, January, pp. 13-19
A modification of the greedy algorithm for vertex cover
Kenneth L. Clarkson
Information Processing Letters
16
, 1983, January, pp. 23-25
On a language without star
M. Latteux
Information Processing Letters
16
(1), 1983, January, pp. 27-30
About the rewriting systems produced by the Knuth-Bendix completion algorithm
Y. Métivier
Information Processing Letters
16
(1), 1983, January, pp. 31-34
Stabbing c-oriented polygons
R.H. Güting
Information Processing Letters
16
(1), 1983, January, pp. 35-40
Relating monotone formula size and monotone depth of Boolean functions
I. Wegener
Information Processing Letters
16
(1), 1983, January, pp. 41-42
Accuracy of approximating queueing network departure processes with independent renewal processes
L.N. Lester
Information Processing Letters
16
(1), 1983, January, pp. 43-48
On the enlargement of the class of regular languages by the shuffle closure
J. Jȩdrzejowicz
Information Processing Letters
16
(2), 1983, February, pp. 51-54
On sparse sets in
NP-P
J. Hartmanis
Information Processing Letters
16
(2), 1983, February, pp. 55-60
Stable marriages by coroutines
L. Allison
Information Processing Letters
16
(2), 1983, February, pp. 61-65
A generalization of two code ordering optimizations
C.W. Fraser
Information Processing Letters
16
(2), 1983, February, pp. 67-70
Optimal networks for distributing nonsequential programs
S. Eichholz
Information Processing Letters
16
(2), 1983, February, pp. 71-74
A decision procedure for optimal polyhedron partitioning
B. Chazelle
Information Processing Letters
16
(2), 1983, February, pp. 75-78
Key exchange using `keyless cryptography'
B. Alpern
,
F.B. Schneider
Information Processing Letters
16
(2), 1983, February, pp. 79-81
Should the two headed disk be greedy?-yes, it should
M. Hofri
Information Processing Letters
16
(2), 1983, February, pp. 83-85
Connectivity and edge-disjoint spanning trees
D. Gusfield
Information Processing Letters
16
(2), 1983, February, pp. 87-89
Iteration strikes back - at the cyclic towers of Hanoi
T.R. Walsh
Information Processing Letters
16
(2), 1983, February, pp. 91-93
On-line computation of transistive closures of graphs
T. Ibaraki
,
N. Katoh
Information Processing Letters
16
(2), 1983, February, pp. 95-97
Minimization of demand paging for the LRU stack model of program behavior
C.R. Wood
,
E.B. Fernandez
,
T. Lang
Information Processing Letters
16
(2), 1983, February, pp. 99-104
Programs as proofs: a synopsis
R.L. Constable
Information Processing Letters
16
(3), 1983, April, pp. 105-112
Seiten 1
2
3
>