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=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comments on a lower bound for convex hull determination
D. Avis
Information Processing Letters
11
(3), 1980, November, pp. 126
A note on the parallel complexity of computing the rank of order
n
matrices
O. Ibarra
,
S. Moran
,
L.E. Rosier
Information Processing Letters
11
, 1980, December, pp. 162
Termination detection for diffusing computations
Edsger W. Dijkstra
,
C.S. Scholten
Information Processing Letters
11
, 1980, pp. 1-4
An efficient variation of bubble sort
Wlodzimierz Dobosiewicz
Information Processing Letters
11
, 1980, pp. 5-6
Selection by distributive partitioning
D.C.S. Allison
,
M.T. Noga
Information Processing Letters
11
, 1980, pp. 7-8
Error correction by mutational grammars
Tomasz Krawczyk
Information Processing Letters
11
, 1980, pp. 9-15
On the complexity of testing a graph for
N
-cube
Kabekode V.S. Bhat
Information Processing Letters
11
, 1980, pp. 16-19
The decidability of persistence for vector addition systems
Jan Grabowski
Information Processing Letters
11
(1), 1980, August, pp. 20-23
A note on the pebble game
Michael C. Loui
Information Processing Letters
11
, 1980, August, pp. 24-26
On the internal S-stability of Rosenbrock methods
J.D. Day
Information Processing Letters
11
, 1980, pp. 27-30
Comments on: T.D. Bui, ``On an L-stable method for stiff differential equations''
J.D. Day
Information Processing Letters
11
, 1980, pp. 31-32
On a cycle finding algorithm
Georghios Loizou
Information Processing Letters
11
, 1980, pp. 33-36
An improved BL lower bound
Donna J. Brown
Information Processing Letters
11
, 1980, pp. 37-39
A note on colored Petri nets
James J. Peterson
Information Processing Letters
11
, 1980, pp. 40-43
Computing multivariate polynomials in parallel
L.G. Valiant
Information Processing Letters
11
(1), 1980, August, pp. 44-45
On the area of binary tree layouts
R.P. Brent
,
H.T. Kung
Information Processing Letters
11
, 1980, pp. 46-48
A fast parallel algorithm for the closest pair problem
Charles R. Dyer
Information Processing Letters
11
, 1980, pp. 49-52
A note on finding convex hulls via maximal vectors
Luc Devroye
Information Processing Letters
11
, 1980, August, pp. 53-56
A complement to Tarjan's result about the lower bound on the complexity of the set union problem
L. Banachowski
Information Processing Letters
11
, 1980, October, pp. 59-65
An
O(\log n)
algorithm for computing the
n
th element of the solution of a difference equation
F. Urbanek
Information Processing Letters
11
(2), 1980, October, pp. 66-67
Computing Fibonacci numbers (and similarly defined functions) in log time
D. Gries
,
G. Levin
Information Processing Letters
11
(2), 1980, October, pp. 68-69
A note on odd and even factors of undirected graphs
J. Ebert
Information Processing Letters
11
(2), 1980, October, pp. 70-72
An algorithm for testing lossless join property in relational databases
L. Liu
,
A. Demers
Information Processing Letters
11
(2), 1980, October, pp. 73-76
Area-time optimal VLSI networks for multiplying matrices
F.P. Preparata
,
J.E. Vuillemin
Information Processing Letters
11
(2), 1980, October, pp. 77-80
Minimum number of steps for permutation in a bubble memory
K.M. Chung
,
F. Luccio
,
C.K. Wong
Information Processing Letters
11
(2), 1980, October, pp. 81-83
Seiten 1
2
3
>