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.
Complexity of sorting by distributive partitioning
B.L. Jackowski
,
R. Kubiak
,
S. Sokolowski
Information Processing Letters
9
(2), 1979, August, pp. 100
On the implementation of constants
I.E. Gunn
,
R. Morrison
Information Processing Letters
9
(1), 1979, July, pp. 1-4
Characterizing the regular prefix codes and right power-bounded languages
P.A.S. Veloso
Information Processing Letters
9
(1), 1979, July, pp. 5-7
A note concerning top down program development and restricted exit control structures
J.C. Cherniavsky
,
J. Keohane
,
P.B. Henderson
Information Processing Letters
9
(1), 1979, July, pp. 8-12
United and discriminated record types in strongly typed languages
D.M. Berry
,
R.L. Schwartz
Information Processing Letters
9
(1), 1979, July, pp. 13-18
A note on median selection and spider production
P.J. Eberlein
Information Processing Letters
9
(1), 1979, July, pp. 19-22
On polygon similarity
A. Bykat
Information Processing Letters
9
(1), 1979, July, pp. 23-25
A fast garbage compaction algorithm
H.B.M. Jonkers
Information Processing Letters
9
(1), 1979, July, pp. 26-30
Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
G.K. Manacher
,
A.L. Zobrist
Information Processing Letters
9
(1), 1979, July, pp. 31-34
Implicit computation of synchronization primitives
R.A. DeMillo
,
R.E. Miller
Information Processing Letters
9
(1), 1979, July, pp. 35-38
A new data structure for the union-find problem
M.J. Lao
Information Processing Letters
9
(1), 1979, July, pp. 39-45
Lower bounds of the complexity of linear algebras
D. Bini
,
M. Capovani
Information Processing Letters
9
(1), 1979, July, pp. 46-47
A note on a conjecture of Kam and Ullman concerning statistical databases
A.C. Yao
Information Processing Letters
9
(1), 1979, July, pp. 48-50
From left-regular to Greibach normal form grammars
A. Nijholt
Information Processing Letters
9
(1), 1979, July, pp. 51-55
Some observations on random 2-3 trees
M.R. Brown
Information Processing Letters
9
(2), 1979, August, pp. 57-59
The unsolvability of some Petri net language problems
Jan Grabowski
Information Processing Letters
9
(2), 1979, August, pp. 60-63
Document retrieval using associative processors
F.N. Teskey
Information Processing Letters
9
(2), 1979, August, pp. 64-67
Graph 2-isomorphism is
NP
-complete
F.F. Yao
Information Processing Letters
9
(2), 1979, August, pp. 68-72
A note on the complexity of approximative evaluation of polynomials
A. Nozaki
Information Processing Letters
9
(2), 1979, August, pp. 73-75
Aliasing among pointers in Euclid
R.L. Schwartz
Information Processing Letters
9
(2), 1979, August, pp. 76-79
`Possible' membership of a multivalued dependency in a relational database
W.S. Luk
Information Processing Letters
9
(2), 1979, August, pp. 80-83
An observation on scattered grammars
A. Ehrenfeucht
,
G. Rozenberg
Information Processing Letters
9
(2), 1979, August, pp. 84-85
Finding a homomorphism between two words is
NP
-complete
A. Ehrenfeucht
,
G. Rozenberg
Information Processing Letters
9
(2), 1979, August, pp. 86-88
On the normalization of relational databases
B. Srinivasan
,
V. Rajaraman
Information Processing Letters
9
(2), 1979, August, pp. 89-92
On identification of CR property in file organisation
A. Sengupta
,
S. Bandyopadhyay
,
P.K. Srimani
Information Processing Letters
9
(2), 1979, August, pp. 93-96
Seiten 1
2
3
>