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=2
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Representation of binary trees on associative memories
Naftaly Minsky
Information Processing Letters
2
, 1973, pp. 1-5
Experiments in multi-lingual information retrieval
G. Salton
Information Processing Letters
2
, 1973, pp. 6-11
An improved algorithm for traversing binary trees without auxiliary stack
J.M. Robson
Information Processing Letters
2
, 1973, pp. 12-14
A note on the relative performance of two disk scanning policies
E.G., Jr. Coffman
,
C.J.M. Turnbull
Information Processing Letters
2
, 1973, pp. 15-17
On the identification of the convex hull of a finite set of points in the plane
R.A. Jarvis
Information Processing Letters
2
, 1973, pp. 18-21
A note on the number of states of the De Remer's recognizer
Jaroslav Král
,
Jiȓí Demner
Information Processing Letters
2
, 1973, pp. 22-23
Numerical differentiation of experimental data
Gábor Várhegyi
Information Processing Letters
2
, 1973, pp. 24-25
A transformation of marked graph
W. Henhapl
Information Processing Letters
2
, 1973, pp. 26-29
A note on leftmost restricted random context grammars
A.B. Cremers
,
H.A. Maurer
,
O. Mayer
Information Processing Letters
2
, 1973, pp. 31-33
An algorithm for obtaining the chromatic number and an optimal coloring of a graph
S.I. Roschke
,
A.L. Furtado
Information Processing Letters
2
, 1973, pp. 34-38
On computing the time complexity of transitive closure algorithms
Joël Coffy
Information Processing Letters
2
, 1973, pp. 39-42
Parallel/sequential array automata
Azriel Rosenfeld
,
David L. Milgram
Information Processing Letters
2
, 1973, pp. 43-46
Scanning list structures without stacks or tag bits
Gary Lindstrom
Information Processing Letters
2
, 1973, pp. 47-51
Another representation of binary tree traversal
E.N. Adams III
Information Processing Letters
2
(2), 1973, pp. 52-54
A generalization of the method of finite differences
D. Holnapy
,
M. Szöts
,
A. Botár
Information Processing Letters
2
, 1973, pp. 55-59
On universal computer-constructors
Gabor T. Herman
Information Processing Letters
2
, 1973, pp. 61-64
A modified branch-and-bound strategy
D.T. Tang
,
C.K. Wong
Information Processing Letters
2
, 1973, pp. 65-69
A limit theorem for sets of subwords in deterministic TOL languages
A. Ehrenfeucht
,
G. Rozenberg
Information Processing Letters
2
, 1973, pp. 70-73
Examples of formal grammars with weights
Masaharu Mizumoto
,
Junichi Toyoda
,
Kohkichi Tanaka
Information Processing Letters
2
, 1973, pp. 74-78
Applying the minimax rule of graphs which are not trees
T.B. Boffey
Information Processing Letters
2
, 1973, pp. 79-81
A general conservation law for queueing disciplines
C.A.R. Hoare
Information Processing Letters
2
, 1973, pp. 82-85
On one class of iterative methods for obtaining the generalized solution of non-consistent systems of linear algebraic equations
I.N. Molchanov
,
M.F. Iakovlev
Information Processing Letters
2
, 1973, pp. 86-90
A note on implementing parallel assignment instructions
Ravi Sethi
Information Processing Letters
2
, 1973, pp. 91-95
A dynamic storage allocation problem
Stein Krogdahl
Information Processing Letters
2
, 1973, pp. 96-99
Syntax-directed unit conversion
Jacques Cohen
Information Processing Letters
2
, 1973, pp. 100-102
Seiten 1
2
>