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=SIAM J. Comput. AND YEAR=1976
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Errata: On optimal processor scheduling for multiprogramming
L.J. Bass
SIAM Journal on Computing
5
, 1976, pp. 758
Sorting and searching in multisets
I. Munro
,
P.M. Spira
SIAM Journal on Computing
5
, 1976, pp. 1-8
Optimal alphabetic trees
A. Itai
SIAM Journal on Computing
5
, 1976, pp. 9-18
Partial-match retrieval algorithms
R.L. Rivest
SIAM Journal on Computing
5
, 1976, pp. 19-50
Machine selection of elements in crossword puzzles: An application of computational linguistics
L.J. Mazlack
SIAM Journal on Computing
5
, 1976, pp. 51-72
On algorithms for enumerating all circuits of a graph
P. Mateti
,
N. Deo
SIAM Journal on Computing
5
, 1976, pp. 90-99
On the evaluation of powers
A.C.-C. Yao
SIAM Journal on Computing
5
, 1976, pp. 100-103
b
-matchings in trees
S. Goodman
,
S. Hedetniemi
,
R.E. Tarjan
SIAM Journal on Computing
5
, 1976, pp. 104-108
On the number of additions to compute specific polynomials
A. Borodin
,
S. Cook
SIAM Journal on Computing
5
, 1976, pp. 146-157
A comparison of two algorithms for global data flow analysis
K. Kennedy
SIAM Journal on Computing
5
, 1976, pp. 158-180
Graph transformations for roundoff analysis
W. Miller
SIAM Journal on Computing
5
, 1976, pp. 204-216
On families of languages defined by time-bounded random access machines
I.H. Sudborough
,
A. Zalcberg
SIAM Journal on Computing
5
, 1976, pp. 217-230
Noncanonical extensions of bottom-up parsing techniques
T.G. Szymanski
,
J.H. Williams
SIAM Journal on Computing
5
, 1976, pp. 231-250
Termination properties of generalized Petri nets
Y.E. Lien
SIAM Journal on Computing
5
, 1976, pp. 251-265
Decomposition theorems for various kinds of languages parallel in nature
S. Skyum
SIAM Journal on Computing
5
, 1976, pp. 284-296
Ranking algorithms: The symmetries and colorations of the
n
-cube
J.P. Fillmore
,
S.G. Williamson
SIAM Journal on Computing
5
, 1976, pp. 297-304
Local adjunct languages and regular sets
L.S. Levy
SIAM Journal on Computing
5
, 1976, pp. 305-308
Synthesizing a response function with a feedback scheduling algorithm
A. Bernstein
SIAM Journal on Computing
5
, 1976, pp. 309-317
On preserving proximity in extendible arrays
D. Bollman
SIAM Journal on Computing
5
, 1976, pp. 318-323
Computational complexity over finite fields
V. Strassen
SIAM Journal on Computing
5
, 1976, pp. 324-335