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 YEAR=1980
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Threshold behaviors of a random constraint satisfaction problem with exact phase transitions
Chunyan Zhao
,
Zhiming Zheng
Information Processing Letters
111
(20), 2011, pp. 985-988
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
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
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
On two theorems of Lenstra
Seppo Pajunen
Information Processing Letters
11
, 1980, pp. 224-228
A note on an improved bisection algorithm
T. Bui
Information Processing Letters
10
, 1980, pp. 35-36
A 2.5 times optimal algorithm for packing in two dimensions
Daniel D.K.D.B. Sleator
Information Processing Letters
10
, 1980, pp. 37-40
A note on universal classes of hash functions
Dilip V. Sarwate
Information Processing Letters
10
, 1980, pp. 41-45
A note on Delaunay and optimal triangulations
David G. Kirkpatrick
Information Processing Letters
10
, 1980, pp. 127-128
On the
\Omega(n\log n)
lower bound for convex hull and maximal vector determination
Peter van Emde Boas
Information Processing Letters
10
, 1980, pp. 132-136