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=3
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The computing time of the Euclidean algorithm
George Collins
SIAM Journal on Computing
3
(1), 1974, March, pp. 1-10
Stack replacement algorithms for two-level directly addressable paged memories
R.R. Muntz
,
H. Opderbeck
SIAM Journal on Computing
3
, 1974, pp. 11-22
Picture skeletons based on eccentricities of points of minimum spanning trees
R.E. Osteen
,
P.P. Lin
SIAM Journal on Computing
3
, 1974, pp. 23-40
On backtracking: a combinatorial description of the algorithm
J.P. Fillmore
,
S.G. Williamson
SIAM Journal on Computing
3
(1), 1974, March, pp. 41-55
Computing the weak components of a directed graph
J.F. Pecault
SIAM Journal on Computing
3
, 1974, pp. 56-61
Finding dominators in directed graphs
Robert E. Tarjan
SIAM Journal on Computing
3
(1), 1974, March, pp. 62-89
Order graph grammars
C.R. Cook
SIAM Journal on Computing
3
, 1974, pp. 90-100
Optimal binary search trees with restricted maximal depth
M.R. Garey
SIAM Journal on Computing
3
, 1974, pp. 101-110
Jump PDA's and hierarchies of deterministic context-free languages
S.A. Greibach
SIAM Journal on Computing
3
, 1974, pp. 111-127
Polynomials with rational coefficients which are hard to compute
V. Strassen
SIAM Journal on Computing
3
, 1974, pp. 128-149
An algorithm for the computation of linear forms
J.E. Savage
SIAM Journal on Computing
3
, 1974, pp. 150-158
Analysis of a feedback scheduler
Y.S. Chua
,
A.J. Bernstein
SIAM Journal on Computing
3
, 1974, pp. 159-176
Isomorph rejection on power sets
D.M. Perlman
SIAM Journal on Computing
3
, 1974, pp. 177-183
A hierarchy theorem for polynomial-space recognition
O.H. Ibarra
SIAM Journal on Computing
3
, 1974, pp. 184-187
Optimum communication spanning trees
T.C. Hu
SIAM Journal on Computing
3
(3), 1974, September, pp. 188-195
Polynomial multiplication, powers and asymptotic analysis: Some comments
R.J. Fateman
SIAM Journal on Computing
3
, 1974, pp. 196-213
On Hamiltonian walks in graphs
S.E. Goodman
,
S.T. Hedetniemi
SIAM Journal on Computing
3
, 1974, pp. 214-221
A note on the Hecht-Ullman characterization of nonreducible flow graphs
J.M. Adams
,
J.M. Phelan
,
R.H. Stark
SIAM Journal on Computing
3
(3), 1974, September, pp. 222-223
On bounded right context languages and grammars
S.L. Graham
SIAM Journal on Computing
3
, 1974, pp. 224-254
The number of 1's in binary integers: bounds and extremal properties
M.D. McIlroy
SIAM Journal on Computing
3
(4), 1974, December, pp. 255-261
Computationally related problems
S. Sahni
SIAM Journal on Computing
3
, 1974, pp. 262-279
A note on perfect elimination digraphs
D.J. Kleitman
SIAM Journal on Computing
3
(4), 1974, December, pp. 280-282
Reversal-bounded acceptors and intersections of linear languages
R. Book
,
M. Nivat
,
M. Paterson
SIAM Journal on Computing
3
, 1974, pp. 283-295
Existence of graphs with three spanning trees and given degree sequence
Sukhamay Kundu
SIAM Journal on Computing
3
, 1974, pp. 296-298
Worst-case performance bounds for simple one-dimensional packing algorithms
D.S. Johnson
,
A. Demers
,
J.D. Ullman
,
M.R. Garey
,
R.L. Graham
SIAM Journal on Computing
3
, 1974, pp. 299-326