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=7
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Errata: On the number of multiplications required for matrix multiplication
R.W. Brockett
,
D. Dobkin
SIAM Journal on Computing
7
, 1978, pp. 238
Erratum to ''A fast Monte-Carlo test for primality''
R. Solovay
,
V. Strassen
SIAM Journal on Computing
7
(1), 1978, pp. 118
An application of bin-packing to multiprocessor scheduling
E.G. Coffman
,
M.R. Garey
,
D.S. Johnson
SIAM Journal on Computing
7
(1), 1978, February, pp. 1-17
Minimean merging and sorting: an algorithm
R. Michael Tanner
SIAM Journal on Computing
7
(1), 1978, February, pp. 18-38
Simple Gödel numberings, isomorphisms, and programming properties
M. Machtey
,
K. Winklmann
,
P. Young
SIAM Journal on Computing
7
(1), 1978, February, pp. 39-60
Polynomials with 0-1 coefficients that are hard to evaluate
R.J. Lipton
SIAM Journal on Computing
7
(1), 1978, February, pp. 61-69
Soundness and completeness of an axiom system for program verification
S.A. Cook
SIAM Journal on Computing
7
(1), 1978, February, pp. 70-90
An extension of computational duality to sequences of bilinear computations
R.L. Probert
SIAM Journal on Computing
7
(1), 1978, February, pp. 91-98
Computational parallels between the regular and context-free languages
H.B. Hunt III
,
D.J. Rosenkrantz
SIAM Journal on Computing
7
(1), 1978, February, pp. 99-114
The time measure of one-tape Turing machines does not have the parallel computation property
J. Biskup
SIAM Journal on Computing
7
(1), 1978, February, pp. 115-117
On structure preserving reductions
N. Lynch
,
R.J. Lipton
SIAM Journal on Computing
7
(2), 1978, May, pp. 119-126
An algorithm for transitive closure with linear expected time
C.P. Schnorr
SIAM Journal on Computing
7
(2), 1978, May, pp. 127-133
Observations on the complexity of generating quasi-Gray codes
M.L. Fredman
SIAM Journal on Computing
7
(2), 1978, May, pp. 134-146
Selecting the
K
th element in
X + Y
and
X_1 + X_2 +\cdots + X_m
D.B. Johnson
,
T. Mizoguchi
SIAM Journal on Computing
7
(2), 1978, May, pp. 147-153
An
O(N\cdot\log N)
algorithm for a class of matching problems
Nimrod Megiddo
,
Arie Tamir
SIAM Journal on Computing
7
(2), 1978, May, pp. 154-157
On good EOL forms
H.A. Maurer
,
A. Salomaa
,
D. Wood
SIAM Journal on Computing
7
, 1978, pp. 158-166
Linear languages and the intersection closures of classes of languages
R.V. Book
,
M. Nivat
SIAM Journal on Computing
7
(2), 1978, May, pp. 167-177
Approximation algorithms for some routing problems
G.N. Frederickson
,
M.S. Hecht
,
C.E. Kim
SIAM Journal on Computing
7
(2), 1978, May, pp. 178-193
Rudimentary predicates and relative computation
C. Wrathall
SIAM Journal on Computing
7
(2), 1978, May, pp. 194-209
Finite capacity queuing systems with applications in computer modeling
A.G. Konheim
,
M. Reiser
SIAM Journal on Computing
7
(2), 1978, May, pp. 210-229
Parallel computations in graph theory
E. Reghbati
,
D.G. Corneil
SIAM Journal on Computing
7
(2), 1978, May, pp. 230-237
Data movement in odd-even merging
Robert Sedgewick
SIAM Journal on Computing
7
(3), 1978, August, pp. 239-272
Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems
K.S. Booth
SIAM Journal on Computing
7
(3), 1978, August, pp. 273-279
Finding all spanning trees of directed and undirected graphs
H.N. Gabow
,
E.W. Myers
SIAM Journal on Computing
7
(3), 1978, August, pp. 280-287
Efficient calculations of expected miss ratios in the independent reference model
R. Fagin
,
T.G. Price
SIAM Journal on Computing
7
(3), 1978, August, pp. 288-297
Seiten 1
2
>