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=8
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Determining the chromatic number of a graph
C. McDiarmid
SIAM Journal on Computing
8
(1), 1979, February, pp. 1-14
A minimum linear arrangement algorithm for undirected trees
Y. Shiloach
SIAM Journal on Computing
8
(1), 1979, February, pp. 15-32
A partial analysis of random height-balanced trees
M.R. Brown
SIAM Journal on Computing
8
(1), 1979, February, pp. 33-41
Optimal 2,3-trees
R.E. Miller
,
N. Pippenger
,
A.L. Rosenberg
,
L. Snyder
SIAM Journal on Computing
8
(1), 1979, February, pp. 42-59
A round-off error model with applications to arithmetic expressions
V.B. Aggarwal
,
J.W. Burgmeier
SIAM Journal on Computing
8
(1), 1979, February, pp. 60-72
Generating trees and other combinatorial objects lexicographically
S. Zaks
,
D. Richards
SIAM Journal on Computing
8
(1), 1979, February, pp. 73-81
Heuristics that dynamically organize data structures
J.R. Bitner
SIAM Journal on Computing
8
(1), 1979, February, pp. 82-110
Total ordering problem
J. Opatrny
SIAM Journal on Computing
8
(1), 1979, February, pp. 111-114
Lower bounds on synchronous combinational complexity
L.H. Harper
,
J.E. Savage
SIAM Journal on Computing
8
(2), 1979, May, pp. 115-119
On the parallel evaluation of multivariate polynomials
L. Hyafil
SIAM Journal on Computing
8
(2), 1979, May, pp. 120-123
A new representation of the rational numbers for fast easy arithmetic
E.C.R. Hehner
,
R.N.S. Horspool
SIAM Journal on Computing
8
(2), 1979, May, pp. 124-134
Maximum flow in planar networks
A. Itai
,
Y. Shiloach
SIAM Journal on Computing
8
(2), 1979, May, pp. 135-150
Provably difficult combinatorial games
L.J. Stockmeyer
,
A.K. Chandra
SIAM Journal on Computing
8
(2), 1979, May, pp. 151-174
Dynamic binary search
K. Mehlhorn
SIAM Journal on Computing
8
(2), 1979, May, pp. 175-198
A counterexample to Reingold's pushdown permuter characterization theorem
C.R. Carlson
SIAM Journal on Computing
8
(2), 1979, May, pp. 199-201
Combinatorial analysis of an efficient algorithm for processor and storage allocation
E.G., Jr. Coffman
,
Y.-T. Leung
SIAM Journal on Computing
8
(2), 1979, May, pp. 202-217
Equivalences among relational expressions
A.V. Aho
,
Y. Sagiv
,
J.D. Ullman
SIAM Journal on Computing
8
(2), 1979, May, pp. 218-246
Decision problems for multivalued dependencies in relational databases
K. Hagihara
,
M. Ito
,
K. Taniguchi
,
T. Kasami
SIAM Journal on Computing
8
(2), 1979, May, pp. 247-264
Bottlenecks and edge connectivity in unsymmetrical networks
C.P. Schnorr
SIAM Journal on Computing
8
(2), 1979, May, pp. 265-274
Nearly on line scheduling of a uniform processor system with release times
S. Sahni
,
Y. Cho
SIAM Journal on Computing
8
(2), 1979, May, pp. 275-286
Automatic asymptotic and big-O calculations via computer algebra
D.R. Stoutemyer
SIAM Journal on Computing
8
(3), 1979, August, pp. 287-299
New algorithms for polynomial square-free decomposition over the integers
P.S. Wang
,
B.M. Trager
SIAM Journal on Computing
8
(3), 1979, August, pp. 300-305
Symbolic vector and dyadic analysis
M.C. Wirth
SIAM Journal on Computing
8
(3), 1979, August, pp. 306-319
A natural structure theorem for complex fields
H.I. Epstein
SIAM Journal on Computing
8
(3), 1979, August, pp. 320-325
New algorithms for polynomial multiplication
D.A. Klip
SIAM Journal on Computing
8
(3), 1979, August, pp. 326-343
Seiten 1
2
3
>