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=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Straight-line programs with one input variable
O.H. Ibarra
,
B.S. Leininger
SIAM Journal on Computing
11
(1), 1982, February, pp. 1-14
The complexity of the equivalence problem for simple loop-free programs
O.H. Ibarra
,
B.S. Leininger
SIAM Journal on Computing
11
(1), 1982, February, pp. 15-27
A fast algorithm for the Euclidean traveling salesman problem, optimal with probability one
J.H. Halton
,
R. Terada
SIAM Journal on Computing
11
(1), 1982, February, pp. 28-46
Dynamic programming is optimal for nonserial optimization problems
A. Rosenthal
SIAM Journal on Computing
11
(1), 1982, February, pp. 47-59
On the expected performance of scanning disks
E.G., Jr. Coffman
,
M. Hofri
SIAM Journal on Computing
11
(1), 1982, February, pp. 60-70
A hidden-line algorithm for hyperspace
R.P. Burton
,
D.R. Smith
SIAM Journal on Computing
11
(1), 1982, February, pp. 71-80
Symbolic program analysis in almost-linear time
J.H. Reif
,
R.E. Tarjan
SIAM Journal on Computing
11
(1), 1982, February, pp. 81-93
Analysis of a general mass storage system
D. Coppersmith
,
D.S. Parker
,
C.K. Wong
SIAM Journal on Computing
11
(1), 1982, February, pp. 94-116
Algorithms for edge coloring bipartite graphs and multigraphs
H.N. Gabow
,
O. Kariv
SIAM Journal on Computing
11
(1), 1982, February, pp. 117-129
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations
M. Tompa
SIAM Journal on Computing
11
(1), 1982, February, pp. 130-137
Minimum variance Huffman codes
L.T. Kou
SIAM Journal on Computing
11
(1), 1982, February, pp. 138-148
Polygon retrieval
D.E. Willard
SIAM Journal on Computing
11
(1), 1982, February, pp. 149-165
A polynomial time algorithm for deciding the equivalence problem for 2-tape deterministic finite state acceptors
E.P. Friedman
,
S.A. Greibach
SIAM Journal on Computing
11
(1), 1982, February, pp. 166-183
Complexity of matroid property algorithms
P.M. Jensen
,
B. Korte
SIAM Journal on Computing
11
, 1982, pp. 184-190
Dominating sets in chordal graphs
K.S. Booth
,
J.H. Johnson
SIAM Journal on Computing
11
(1), 1982, February, pp. 191-199
Continuous data types
M.R. Levy
,
T.S.E. Maibaum
SIAM Journal on Computing
11
(2), 1982, May, pp. 201-216
Geometric problems with application to hashing
D. Comer
,
M.J. O'Donnell
SIAM Journal on Computing
11
(2), 1982, May, pp. 217-226
Graphs that are almost binary trees
Jia-Wei Hong
,
A.L. Rosenberg
SIAM Journal on Computing
11
(2), 1982, May, pp. 227-242
An asymptotically optimal algorithm for the Dutch national flag problem
J.R. Bitner
SIAM Journal on Computing
11
(2), 1982, May, pp. 243-262
Some properties of disjoint sums of tensors related to matrix multiplication
F. Romani
SIAM Journal on Computing
11
(2), 1982, May, pp. 263-267
On transforming control structures
J. Keohane
,
J.C. Cherniavsky
,
P.B. Henderson
SIAM Journal on Computing
11
(2), 1982, May, pp. 268-286
A time-space tradeoff for sorting on a general sequential model of computation
A. Borodin
,
S. Cook
SIAM Journal on Computing
11
(2), 1982, May, pp. 287-297
The recognition of series parallel digraphs
J. Valdes
,
R.E. Tarjan
,
E.L. Lawler
SIAM Journal on Computing
11
(2), 1982, May, pp. 298-313
Parallel algorithms in graph theory: planarity testing
Joseph JáJá
,
Janos Simon
SIAM Journal on Computing
11
(2), 1982, May, pp. 314-328
Planar formulae and their uses
D. Lichtenstein
SIAM Journal on Computing
11
(2), 1982, May, pp. 329-343
Seiten 1
2
3
>