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=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Partial values in a tabular database model
J. Grant
Information Processing Letters
9
(2), 1979, August, pp. 97-99
A note on the proof of a concurrent program
E. Best
Information Processing Letters
9
(3), 1979, October, pp. 103-104
Comments on the all nearest-neighbor problem for convex polygons
A. Fournier
,
K. Denum
Information Processing Letters
9
(3), 1979, October, pp. 105-107
The complexity of symmetrizing matrices
C.J. Colbourn
Information Processing Letters
9
(3), 1979, October, pp. 108-109
Linear algorithms for edge-coloring trees and unicyclic graphs
S. Mitchell
,
S. Hedetniemi
Information Processing Letters
9
(3), 1979, October, pp. 110-112
On module assignment in two-processor distributed systems
R.K. Arora
,
S.P. Rana
Information Processing Letters
9
(3), 1979, October, pp. 113-117
A randomized algorithm for checking equivalence of circular lists
A. Itai
Information Processing Letters
9
(3), 1979, October, pp. 118-121
A transportable code generator system
M.H. Williams
,
A.R. Bulmer
Information Processing Letters
9
(3), 1979, October, pp. 122-125
DB: a LISP-type data base system
M. Ferrari
,
G. Guida
Information Processing Letters
9
(3), 1979, October, pp. 126-134
A note on the pumping lemma for regular languages
A. Yehudai
Information Processing Letters
9
(3), 1979, October, pp. 135-136
Reduction of page swaps on the two dimensional transforms in a paging environment
K. Itano
Information Processing Letters
9
(3), 1979, October, pp. 137-140
Comments on convex hull of a finite set of points in two dimensions
F. Dévai
,
T. Szendrényi
Information Processing Letters
9
(3), 1979, October, pp. 141-142
Stack implementation of shallow binding in languages with mixed scoping
G. Prini
Information Processing Letters
9
(3), 1979, October, pp. 143-154
The formal termination problem for programs with finite ALGOL 68-modes
Hans Langmaack
,
Wolfram Lippe
,
Franz Wagner
Information Processing Letters
9
(3), 1979, October, pp. 155-159
Padded lists: Set operations in expected
\Theta(\log\log N)
time
W.R. Franklin
Information Processing Letters
9
(4), 1979, November, pp. 161-166
Bounds on list scheduling of UET tasks with restricted resource constraints
J.Y.-T. Leung
Information Processing Letters
9
(4), 1979, November, pp. 167-170
An algorithm for the most economic link addition in a tree communications network
E.J. Cockayne
,
F. Ruskey
,
A.G. Thomason
Information Processing Letters
9
(4), 1979, November, pp. 171-175
A mechanical proof of the termination of Takeuchi's function
J.S. Moore
Information Processing Letters
9
(4), 1979, November, pp. 176-181
On the solution of polynomial equations using continued fractions
A.G. Akritas
Information Processing Letters
9
(4), 1979, November, pp. 182-184
Deadlock absence proofs for networks of communicating processes
K.M. Chandy
,
J. Misra
Information Processing Letters
9
(4), 1979, November, pp. 185-189
Location of multiple points in a planar subdivision
D.T. Lee
,
C.C. Yang
Information Processing Letters
9
(4), 1979, November, pp. 190-193
Systems of distinct representatives for k families of sets
J.L. Szwarcfiter
Information Processing Letters
9
(5), 1979, December, pp. 195-196
Traversing binary trees simply and cheaply
J.M. Morris
Information Processing Letters
9
(5), 1979, December, pp. 197-200
A linear algorithm for finding the convex hull of a simple polygon
D. McCallum
,
D. Avis
Information Processing Letters
9
(5), 1979, December, pp. 201-206
Cyclomatic numbers do not measure complexity of unstructured programs
G. Oulsnam
Information Processing Letters
9
(5), 1979, December, pp. 207-211
Seiten
<
1
2
3
>