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
[1]
Hilfe
Suche: Journal=SIAM J. Comput. AND Volume=9
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New fast algorithms for matrix operations
V.Ya. Pan
SIAM Journal on Computing
9
(2), 1980, May, pp. 321-342
On the polyhedral decision problem
A.C.-C. Yao
,
R.L. Rivest
SIAM Journal on Computing
9
(2), 1980, May, pp. 343-347
Path systems: Constructions, solutions and applications
E.M. Gurari
,
O.H. Ibarra
SIAM Journal on Computing
9
, 1980, pp. 348-374
Code motion
J.H. Reif
SIAM Journal on Computing
9
(2), 1980, May, pp. 375-395
On the computational complexity of program scheme equivalence
H.B. Hunt III
,
R.L. Constable
,
S. Sahni
SIAM Journal on Computing
9
(2), 1980, May, pp. 396-416
Saving space in fast string-matching
Z. Galil
,
J. Seiferas
SIAM Journal on Computing
9
(2), 1980, May, pp. 417-438
The mathematics of record handling
H. Ehrig
,
B.K. Rosen
SIAM Journal on Computing
9
(3), 1980, August, pp. 441-469
Conditions for optimality of the Huffman algorithm
D.S., Jr. Parker
SIAM Journal on Computing
9
(3), 1980, August, pp. 470-489
Storage modification machines
A. Schönhage
SIAM Journal on Computing
9
(3), 1980, August, pp. 490-508
A correct preprocessing algorithm for Boyer-Moore string-searching
W. Rytter
SIAM Journal on Computing
9
(3), 1980, August, pp. 509-512
The pebbling problem is complete in polynomial space
J.R. Gilbert
,
T. Lengauer
,
R.E. Tarjan
SIAM Journal on Computing
9
(3), 1980, August, pp. 513-524
Vector iteration in pointed iterative theories
S.L. Bloom
,
C.C. Elgot
,
J.B. Wright
SIAM Journal on Computing
9
(3), 1980, August, pp. 525-540
Bounds on the scheduling of typed task systems
J.M. Jaffe
SIAM Journal on Computing
9
(3), 1980, August, pp. 541-551
Random graphs and graph optimization problems
B.W. Weide
SIAM Journal on Computing
9
(3), 1980, August, pp. 552-557
Generating all maximal independent sets: NP-hardness and polynomial-time algorithms
E.L. Lawler
,
J.K. Lenstra
,
A.H.G. Rinnooy Kan
SIAM Journal on Computing
9
(3), 1980, August, pp. 558-565
Bounds on selection networks
A.C.-C. Yao
SIAM Journal on Computing
9
(3), 1980, August, pp. 566-582
An optimal algorithm for symbolic factorization of symmetric matrices
A. George
,
J.W.H. Liu
SIAM Journal on Computing
9
(3), 1980, August, pp. 583-593
Design and analysis of a data structure for representing sorted lists
M.R. Brown
,
R.E. Tarjan
SIAM Journal on Computing
9
(3), 1980, August, pp. 594-614
Applications of a planar separator theorem
R.J. Lipton
,
R.E. Tarjan
SIAM Journal on Computing
9
(3), 1980, August, pp. 615-627
Random graph isomorphism
L. Babai
,
P. Erdŏs
,
S.M. Selkow
SIAM Journal on Computing
9
(3), 1980, August, pp. 628-635
Space lower bounds for maze threadability on restricted machines
S.A. Cook
,
C.W. Rackoff
SIAM Journal on Computing
9
(3), 1980, August, pp. 636-652
Predictors of context-free grammars
K.-C. Tai
SIAM Journal on Computing
9
, 1980, pp. 653-664
Completeness with finite systems of intermediate assertions for recursive program schemes
K.R. Apt
,
L.G.L.T. Meertens
SIAM Journal on Computing
9
(4), 1980, November, pp. 665-671
A new proof of the linearity of the Boyer-Moore string searching algorithm
L.J. Guibas
,
A.M. Odlyzko
SIAM Journal on Computing
9
(4), 1980, November, pp. 672-682
Compatible orderings on the metric theory of trees
S.L. Bloom
,
R. Tindell
SIAM Journal on Computing
9
(4), 1980, November, pp. 683-691
Seiten
<
1
2
3
>