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.
Optimal polyphase sorting
D.A. Zave
SIAM Journal on Computing
6
(1), 1977, March, pp. 1-39
Single machine job sequencing with precedence constraints
D.L. Adolphson
SIAM Journal on Computing
6
(1), 1977, March, pp. 40-54
Smallest augmentations to biconnect a graph
A. Rosenthal
,
A. Goldner
SIAM Journal on Computing
6
(1), 1977, March, pp. 55-66
Polynomial complete consecutive information retrieval problems
L.T. Kou
SIAM Journal on Computing
6
(1), 1977, March, pp. 67-75
On the complexity of local search for the traveling salesman problem
C.H. Papadimitriou
,
K. Steiglitz
SIAM Journal on Computing
6
(1), 1977, March, pp. 76-83
A fast Monte-Carlo test for primality
R. Solovay
,
V. Strassen
SIAM Journal on Computing
6
(1), 1977, March, pp. 84-85
Comments on F. Hadlock's paper: ``Finding a maximum cut of a planar graph in polynomial time''
K. Aoshima
,
M. Iri
SIAM Journal on Computing
6
(1), 1977, March, pp. 86-87
A graph-theoretic characterization of the
PV_{chunk}
class of synchronizing primitives
P.B. Henderson
,
Y. Zalcstein
SIAM Journal on Computing
6
(1), 1977, March, pp. 88-108
Evaluating relational expressions with dense and sparse arguments
T.G. Szymanski
,
J.D. Ullman
SIAM Journal on Computing
6
(1), 1977, March, pp. 109-122
Derivation complexity in context-free grammar forms
S. Ginsburg
,
N. Lynch
SIAM Journal on Computing
6
(1), 1977, March, pp. 123-138
Two algorithms for generating weighted spanning trees in order
H.N. Gabow
SIAM Journal on Computing
6
(1), 1977, March, pp. 139-150
A linear tree partitioning algorithm
S. Kundu
,
J. Misra
SIAM Journal on Computing
6
(1), 1977, March, pp. 151-154
Bounds for LPT schedules on uniform processors
T. Gonzalez
,
O.H. Ibarra
,
S. Sahni
SIAM Journal on Computing
6
(1), 1977, March, pp. 155-166
Task scheduling on a multiprocessor system with independent memories
D.G. Kafura
,
V.Y. Shen
SIAM Journal on Computing
6
(1), 1977, March, pp. 167-187
Adequate requirements for rational functions
D.G. Kirkpatrick
,
Z.M. Kedem
SIAM Journal on Computing
6
(1), 1977, March, pp. 188-200
Optimum sequence trees
M. Miyakawa
,
T. Yuba
,
Y. Sugito
,
M. Hoshi
SIAM Journal on Computing
6
(2), 1977, June, pp. 201-234
A best possible bound for the weighted path length of binary search trees
K. Mehlhorn
SIAM Journal on Computing
6
(2), 1977, June, pp. 235-239
Quicksort with equal keys
R. Sedgewick
SIAM Journal on Computing
6
(2), 1977, June, pp. 240-267
Some remarks on
p
-way merging
J. Fabri
SIAM Journal on Computing
6
(2), 1977, June, pp. 268-271
Constraints on structural descriptions: Local transformations
A.K. Joshi
,
L.S. Levy
SIAM Journal on Computing
6
(2), 1977, June, pp. 272-284
A completeness criterion for spectra
T. Hikita
,
A. Nozaki
SIAM Journal on Computing
6
(2), 1977, June, pp. 285-297
Superconcentrators
N. Pippenger
SIAM Journal on Computing
6
(2), 1977, June, pp. 298-304
On isomorphisms and density of
NP
and other complete sets
L. Berman
,
J. Harmanis
SIAM Journal on Computing
6
(2), 1977, June, pp. 305-322
Fast pattern matching in strings
D.E. Knuth
,
J.H. Morris
,
V.R. Pratt
SIAM Journal on Computing
6
(2), 1977, June, pp. 323-350
Stable sorting and merging with optimal space and time bounds
L.T. Pardo
SIAM Journal on Computing
6
(2), 1977, June, pp. 351-372
Seiten 1
2
3
>