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=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comments on convex hull of a finite set of points in two dimensions
A. Fournier
Information Processing Letters
8
(4), 1979, April, pp. 173
Efficient search for rationals
C.H. Papadimitriou
Information Processing Letters
8
(1), 1979, January, pp. 1-4
Some decidability results about regular and pushdown translations
K. Culik II
Information Processing Letters
8
(1), 1979, January, pp. 5-8
Paired sequential lists in a memory interval
A.S. Fraenkel
Information Processing Letters
8
(1), 1979, January, pp. 9-10
Testing for existence of a covering Boyce-Codd normal form
S.L. Osborn
Information Processing Letters
8
(1), 1979, January, pp. 11-14
A note on cyclic closure operations
K. Inoue
,
I. Takanami
Information Processing Letters
8
(1), 1979, January, pp. 15-16
A note on a construction of Margulis
D. Angluin
Information Processing Letters
8
, 1979, January, pp. 17-19
A note on Rabin's nearest-neighbor algorithm
S. Fortune
,
J. Hopcroft
Information Processing Letters
8
(1), 1979, January, pp. 20-23
Edge-disjoint branching in directed multigraphs
Y. Shiloach
Information Processing Letters
8
(1), 1979, January, pp. 24-27
Factoring numbers in
O(\log n)
arithmetic steps
A. Shamir
Information Processing Letters
8
(1), 1979, January, pp. 28-31
A note on vector grammars
M. Jantzen
Information Processing Letters
8
(1), 1979, January, pp. 32-33
A note on bottom-up pyramid acceptors
K. Inoue
,
I. Takanami
Information Processing Letters
8
(1), 1979, January, pp. 34-37
Generalized
^{1.5}
sequential machine maps
A. Buda
Information Processing Letters
8
(1), 1979, January, pp. 38-40
Reference counting can manage the circular environments of mutual recursion
D.P. Friedman
,
D.S. Wise
Information Processing Letters
8
(1), 1979, January, pp. 41-45
Using duality to compute the pair of matrix products
QY
and
Y^TQ
over a commutative ring
O.M. Makarov
Information Processing Letters
8
(1), 1979, January, pp. 46-49
Three efficient algorithms for counting problems
A. Bertoni
,
G. Mauri
,
M. Torelli
Information Processing Letters
8
(1), 1979, January, pp. 50-53
Batch scheduling from short lists
G. Lyon
Information Processing Letters
8
(2), 1979, February, pp. 57-59
Deadline scheduling of tasks with ready times and resource constraints
J. BĘazewicz
Information Processing Letters
8
(2), 1979, February, pp. 60-63
Even initial feedback vertex set problem is
NP
-complete
D.A. Simovici
,
G. Grigoras
Information Processing Letters
8
(2), 1979, February, pp. 64-66
Two implementations of the conditional critical region using a split binary semaphore
J.L.W. Kessels
,
A.J. Martin
Information Processing Letters
8
(2), 1979, February, pp. 67-71
Binary merging by partitioning
M. van der Nat
Information Processing Letters
8
(2), 1979, February, pp. 72-75
A starvation-free solution to the mutual exclusion problem
Joseph M. Morris
Information Processing Letters
8
(2), 1979, February, pp. 76-80
Space-time trade off in implementing certain set operations
J. Misra
Information Processing Letters
8
(2), 1979, February, pp. 81-85
Miller's primality test
H.W., Jr. Lenstra
Information Processing Letters
8
(2), 1979, February, pp. 86-88
Rational search
S.P. Reiss
Information Processing Letters
8
(2), 1979, February, pp. 89-90
Seiten 1
2
3
>