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=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Comments on: G. Manacher, An application of pattern matching to a problem in geometrical complexity
S.G. Akl
Information Processing Letters
7
(2), 1978, February, pp. 86
A correction to a unilaterally connected components algorihtm
G.A. Cheston
Information Processing Letters
7
(2), 1978, February, pp. 125
The maximum depth of monotone formulae
W.F. McColl
Information Processing Letters
7
(2), 1978, February, pp. 65
Sorting by distributive partitioning
W. Dobosiewicz
Information Processing Letters
7
(1), 1978, January, pp. 1-6
Commutation relations of slices characterize some synchronization primitives
D. Dolev
,
E. Shamir
Information Processing Letters
7
(1), 1978, January, pp. 7-9
The min-max spanning tree problem and some extensions
P.M. Camerini
Information Processing Letters
7
(1), 1978, January, pp. 10-14
Cycle detection in critical path networks
A. Karayiannis
,
G. Loizou
Information Processing Letters
7
(1), 1978, January, pp. 15-19
Analysis of queuing networks in which processes exhibit locality-transition behaviour
S. Tsur
Information Processing Letters
7
(1), 1978, January, pp. 20-23
A class of grammar generating non-counting languages
S. Crespi Reghizzi
,
D. Mandrioli
Information Processing Letters
7
(1), 1978, January, pp. 24-26
Genetic order and compactifying garbage collectors
M. Terashima
,
E. Goto
Information Processing Letters
7
(1), 1978, January, pp. 27-32
The decidability of
\nu
-local catenativity and of other properties of DOL systems
K. Culik II
Information Processing Letters
7
(1), 1978, January, pp. 33-35
Lindenmayer grammars and symbolic testing
W.E. Howden
Information Processing Letters
7
(1), 1978, January, pp. 36-39
An information-theoretic lower bound for the longest common subsequence problem
D.S. Hirschberg
Information Processing Letters
7
(1), 1978, January, pp. 40-41
A probabilistic minimum spanning tree algorithm
F.J. Rohlf
Information Processing Letters
7
(1), 1978, January, pp. 44-48
A note on two-dimensional finite automata
K. Inoue
,
I. Takanami
,
A. Nakamura
Information Processing Letters
7
(1), 1978, January, pp. 49-52
A reevaluation of an efficient algorithm for determining the convex hull of a finite planar set
K.R. Anderson
Information Processing Letters
7
(1), 1978, January, pp. 53-55
A more efficient convex hull algorithm
J. Koplowitz
,
D. Jouppi
Information Processing Letters
7
(1), 1978, January, pp. 56-57
Substad: for fast substitution in LISP, with an application on unification
D. de Champeaux
Information Processing Letters
7
(1), 1978, January, pp. 58-62
A linear storage space algorithm for a reference structure index
Y. Kambayashi
,
T. Hayashi
,
Y. Tanaka
,
S. Yajima
Information Processing Letters
7
(2), 1978, February, pp. 66-71
An error-correcting coding scheme for alphanumeric data
A.S. Sethi
,
V. Rajaraman
,
P.S. Kenjale
Information Processing Letters
7
(2), 1978, February, pp. 72-77
Arcade-a system for research and education in computer architecture
A. Brandwajn
,
Ph. Kruchten
,
J.A. Heranandez
Information Processing Letters
7
(2), 1978, February, pp. 78-85
Divide and conquer for linear expected time
J.L. Bentley
,
M.I. Shamos
Information Processing Letters
7
(2), 1978, February, pp. 87-91
Insertion merge sorting
E. Peltola
,
H. Erkiö
Information Processing Letters
7
(2), 1978, February, pp. 92-99
On the generative capacity of simple matrix grammars of finite index
G. Păun
Information Processing Letters
7
(2), 1978, February, pp. 100-102
A canonical form algorithm for proving equivalence of conditional forms
H. Samet
Information Processing Letters
7
(2), 1978, February, pp. 103-106
Seiten 1
2
3
>