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=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some properties of commutation in free partially commutative monoids
C. Duboc
Information Processing Letters
20
(1), 1985, January, pp. 1-4
Cancellation rules and extended word problems
R.V. Book
,
F. Otto
Information Processing Letters
20
(1), 1985, January, pp. 5-11
Selection in x+y and matrices with sorted rows and columns
A. Mirzaian
,
E. Arjomandi
Information Processing Letters
20
(1), 1985, January, pp. 13-17
A note on undercover relation
E. Mäkinen
Information Processing Letters
20
(1), 1985, January, pp. 19-21
A special purpose MIMD parallel processor
G.P. McKeown
Information Processing Letters
20
(1), 1985, January, pp. 23-27
An algorithm for local compaction of horizontal microprograms
S.U. Roa
,
A.K. Majumdar
Information Processing Letters
20
(1), 1985, January, pp. 29-33
PDL with data constants
S. Passy
,
T. Tinchev
Information Processing Letters
20
(1), 1985, January, pp. 35-41
A linear applicative solution for the set union problem
S.L. Meira
Information Processing Letters
20
(1), 1985, January, pp. 43-45
Direct determination of a 'seed' binary matrix
A.C. Bounas
Information Processing Letters
20
(1), 1985, January, pp. 47-50
On equivalence of relational and network database models
S. Jajodia
Information Processing Letters
20
(1), 1985, January, pp. 51-54
The VLSI optimality of the AKS sorting network
G. Bilardi
,
F.P. Preparata
Information Processing Letters
20
(2), 1985, February, pp. 55-59
The undecidability of self-embedding for term rewriting systems
D.A. Plaisted
Information Processing Letters
20
(2), 1985, February, pp. 61-64
Evaluating expressions with a queue
J.L.A. van de Snepscheut
Information Processing Letters
20
(2), 1985, February, pp. 65-66
A comment on the 'basic security theorem' of Bell and LaPadula
J. McLean
Information Processing Letters
20
(2), 1985, February, pp. 67-70
Translation of Turner combinators in
O(n\log n)
space
K. Noshita
Information Processing Letters
20
(2), 1985, February, pp. 71-74
An optimal algorithm for the maximum alignment of terminals
P. Widmayer
,
C.K. Wong
Information Processing Letters
20
(2), 1985, February, pp. 75-82
On the correspondence between two classes of reduction systems
S.R. Thatte
Information Processing Letters
20
(2), 1985, February, pp. 83-85
More on looping vs. repeating in dynamic logic
D. Harel
,
D. Peleg
Information Processing Letters
20
(2), 1985, February, pp. 87-90
On separation of the emptiness and equivalence problems for program schemes
A.J. Auzins
,
E.B. Kinber
Information Processing Letters
20
(2), 1985, February, pp. 91-93
Codeterministic automata on infinite words
D. Beauquier
,
D. Perrin
Information Processing Letters
20
(2), 1985, February, pp. 95-98
Upper bounds on the size of LR(k) parsers
E. Ukkonen
Information Processing Letters
20
(2), 1985, February, pp. 99-103
An infinite square-free co-CFL
M.G. Main
Information Processing Letters
20
(2), 1985, February, pp. 105-107
How to detect tampering of data
S.C. Kak
Information Processing Letters
20
(2), 1985, February, pp. 109-110
Details of distortions in the computed Fourier transforms of signals. - Part I: Short periodic signals
E.C. Njau
Information Processing Letters
20
(3), 1985, April, pp. 111-113
Real addition and the polynomial hierarchy
E.D. Sontag
Information Processing Letters
20
(3), 1985, April, pp. 115-120
Seiten 1
2
3
>