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 YEAR=1976
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on linear precedence functions
R.K. Shyamasundar
Information Processing Letters
5
, 1976, pp. 81
A distributed index sequential access method
B.K. Gairola
,
V. Rajaraman
Information Processing Letters
5
, 1976, pp. 1-5
An application of pattern matching to a problem in geometrical complexity
Glenn Manacher
Information Processing Letters
5
, 1976, pp. 6-7
On finding all unilaterally connected components of a digraph
E. Arjomandi
Information Processing Letters
5
(1), 1976, pp. 8-10
Implementing dictionaries using binary trees of very small height
H.A. Maurer
,
Th. Ottmann
,
H.-W. Six
Information Processing Letters
5
, 1976, pp. 11-14
Constructing optimal binary decision trees is
NP
-complete
Laurent Hyafil
,
Ronald L. Rivest
Information Processing Letters
5
, 1976, pp. 15-17
On the parallel evaluation of division-free arithmetic expressions with fan-in of three
A.B. Barak
Information Processing Letters
5
(1), 1976, pp. 18-19
Relative complexity of checking and evaluating
Leslie G. Valiant
Information Processing Letters
5
, 1976, pp. 20-23
Recursiveness of monotonic array grammars and a hierarchy of array languages
Patrick Shen-Pei Wang
Information Processing Letters
5
, 1976, pp. 24-26
Improvements on fast methods for generating normal random variables
G. Marsaglia
,
K. Ananthanarayanan
,
N.J. Paul
Information Processing Letters
5
, 1976, pp. 27-30
A hashing method for fast set operations
Masataka Sassa
,
Eiichi Goto
Information Processing Letters
5
, 1976, pp. 31-34
Toward a system's environment for computer assisted programming
Carlos J. Lucena
,
Donald D. Cowan
Information Processing Letters
5
, 1976, pp. 35-40
Matrix multiplication by diagonals on a vector/parallel processor
N.K. Madsen
,
G.N. Rodrigue
,
J.I. Karush
Information Processing Letters
5
, 1976, pp. 41-45
Commutativity, non-commutativity, and bilinearity
Robert L. Probert
Information Processing Letters
5
, 1976, pp. 46-49
A cascade algorithm for the logical closure of a set of binary relations
Pierre Hansen
Information Processing Letters
5
, 1976, pp. 50-54
A linear algorithm for the Hamiltonian completion number of a tree
Sukhamay Kundu
Information Processing Letters
5
, 1976, pp. 55-57
n
-Reconstructability of context-free grammars
D. Mandrioli
Information Processing Letters
5
, 1976, pp. 58-62
Finding nearest neighbours
G. Yuval
Information Processing Letters
5
, 1976, pp. 63-65
A note on the complexity of the chromatic number problem
E.L. Lawler
Information Processing Letters
5
, 1976, pp. 66-67
Storage for consecutive retrieval
F. Luccio
,
F.P. Preparata
Information Processing Letters
5
, 1976, pp. 68-71
Full table search by polynomial functions
Nicola Santoro
Information Processing Letters
5
, 1976, pp. 72-74
A series expansion involving the harmonic numbers
Derek A. Zave
Information Processing Letters
5
, 1976, pp. 75-77
On a problem in storage optimization
E.L. Lozinskii
Information Processing Letters
5
, 1976, pp. 78-80
An almost optimal algorithm for unbounded searching
Jon Louis Bentley
,
Andrew Chi-chih Yao
Information Processing Letters
5
, 1976, pp. 82-87
On a semaphore anamoly
Kishor Shridharbhai Trivedi
Information Processing Letters
5
, 1976, pp. 88-89
Seiten 1
2
>