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 Volume=5
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
Scheduling graphs on two processors
Ravi Sethi
SIAM Journal on Computing
5
(1), 1976, March, pp. 73-82
New bounds on the complexity of the shortest path problem
Michael Fredman
SIAM Journal on Computing
5
(1), 1976, March, pp. 83-89
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
Bounds for selection
Laurent Hyafil
SIAM Journal on Computing
5
(1), 1976, March, pp. 109-114
On finding lowest common ancestors in trees
A.V. Aho
,
J.E. Hopcroft
,
J.D. Ullman
SIAM Journal on Computing
5
(1), 1976, March, pp. 115-132
A fast algorithm for finding an optimal ordering for vertex elimination on a graph
Tatsuo Ohtsuki
SIAM Journal on Computing
5
(1), 1976, March, pp. 133-145
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
Multidimensional searching problems
David Dobkin
,
Richard Lipton
SIAM Journal on Computing
5
(2), 1976, June, pp. 181-186
On the additive complexity of matrix multiplication
Robert L. Probert
SIAM Journal on Computing
5
(2), 1976, June, pp. 187-203
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
Algorithmic aspects of vertex elimination on graphs
Donald Rose
,
Robert E. Tarjan
,
George S. Lueker
SIAM Journal on Computing
5
(2), 1976, June, pp. 266-283
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
Seiten 1
2
3
>