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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The depth of all Boolean functions
W.F. McColl
,
M.S. Paterson
SIAM Journal on Computing
6
(2), 1977, June, pp. 373-380
Some preservation properties of normal form grammars
D.B. Benson
SIAM Journal on Computing
6
(2), 1977, June, pp. 381-402
Implementation correctness involving a language with goto statements
B.D. Russell
SIAM Journal on Computing
6
(3), 1977, September, pp. 403-415
Two-processor scheduling with start-times and deadlines
M.R. Garey
,
D.S. Johnson
SIAM Journal on Computing
6
(3), 1977, September, pp. 416-426
A 2.5n-lower bound on the combinational complexity of Boolean functions
Wolfgang J. Paul
SIAM Journal on Computing
6
(3), 1977, September, pp. 427-443
On resolution with clauses of bounded size
Z. Galil
SIAM Journal on Computing
6
(3), 1977, September, pp. 444-459
The tape complexity of some classes of Szilard languages
Y. Igarashi
SIAM Journal on Computing
6
(3), 1977, September, pp. 460-466
The computational complexity of provability in systems of modal propositional logic
Richard Ladner
SIAM Journal on Computing
6
(3), 1977, September, pp. 467-480
A linear time algorithm for a
2\times n
transportation problem
D.L. Adolphson
,
G.N. Thomas
SIAM Journal on Computing
6
(3), 1977, September, pp. 481-486
Linear-time computation by nondeterministic multidimensional iterative arrays
J.I. Seiferas
SIAM Journal on Computing
6
(3), 1977, September, pp. 487-504
A new algorithm for generating all the maximal independent sets
S. Tsukiyama
,
M. Ide
,
H. Ariyoshi
,
I. Shirakawa
SIAM Journal on Computing
6
(3), 1977, September, pp. 505-517
Worst case analysis of two scheduling algorithms
Shui Lam
,
Ravi Sethi
SIAM Journal on Computing
6
(3), 1977, September, pp. 518-536
Finding a maximum independent set
R.E. Tarjan
,
A.E. Trojanowski
SIAM Journal on Computing
6
(3), 1977, September, pp. 537-546
Succinctness of descriptions of unambiguous context-free languages
E. Meineche Schmidt
,
T.G. Szymanski
SIAM Journal on Computing
6
(3), 1977, September, pp. 547-553
The partial fraction expansion problem and its inverse
F.Y. Chin
SIAM Journal on Computing
6
(3), 1977, September, pp. 554-562
An analysis of several heuristics for the traveling salesman problem
D.J. Rosenkrantz
,
R.E. Stearns
,
P.M. Lewis II
SIAM Journal on Computing
6
(3), 1977, September, pp. 563-581
Fast algorithms for partial fraction decomposition
H.T. Kung
,
D.M. Tong
SIAM Journal on Computing
6
(3), 1977, September, pp. 582-593
Location of a point in a planar subdivision and its applications
D.T. Lee
,
F.P. Preparata
SIAM Journal on Computing
6
(3), 1977, September, pp. 594-606
Internal fragmentation in a class of buddy systems
D.L. Russell
SIAM Journal on Computing
6
(4), 1977, December, pp. 607-621
A new algorithm for minimum cost binary trees
A.M. Garsia
,
M.L. Wachs
SIAM Journal on Computing
6
(4), 1977, December, pp. 622-642
Determining the stability number of a graph
V. Chvátal
SIAM Journal on Computing
6
, 1977, pp. 643-662
Minimizing garbage collection as a function of region size
R.G. Larson
SIAM Journal on Computing
6
(4), 1977, December, pp. 663-668
On the worst-case behavior of string-searching algorithms
R.L. Rivest
SIAM Journal on Computing
6
(4), 1977, December, pp. 669-674
Computational complexity of probabilistic Turing machines
J. Gill
SIAM Journal on Computing
6
(4), 1977, December, pp. 675-695
A note on Spira's algorithm for the all-pairs shortest-path problem
J.S. Carson
,
A.M. Law
SIAM Journal on Computing
6
(4), 1977, December, pp. 696-699
Seiten
<
1
2
3
>