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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds on the complexity of some optimal data structures
M.L. Fredman
SIAM Journal on Computing
10
(1), 1981, February, pp. 1-10
Some NP-complete problems similar to graph isomorphism
A. Lubiw
SIAM Journal on Computing
10
(1), 1981, February, pp. 11-21
Characterizations of Presburger functions
O.H. Ibarra
,
B.S. Leininger
SIAM Journal on Computing
10
(1), 1981, February, pp. 22-39
On ET0L systems with finite tree-rank
A. Ehrenfeucht
,
G. Rozenberg
,
D. Vermeir
SIAM Journal on Computing
10
(1), 1981, February, pp. 40-58
On the selection of test data for recursive mathematical subroutines
J.H. Rowland
,
P.J. Davis
SIAM Journal on Computing
10
(1), 1981, February, pp. 59-72
Generalization of Voronoi diagrams in the plane
D.T. Lee
,
R.L. Drysdale
SIAM Journal on Computing
10
(1), 1981, February, pp. 73-87
Fast sorting of Weyl sequences using comparisons
M.H. Ellis
,
J.M. Steele
SIAM Journal on Computing
10
(1), 1981, February, pp. 88-95
Relative to a random oracle
A
,
P^A \ne NP^A \ne co-NP^A
with probability 1
C.H. Bennett
,
J. Gill
SIAM Journal on Computing
10
(1), 1981, February, pp. 96-113
A note on the complexity of general DOL membership
N.D. Jones
,
S. Skyum
SIAM Journal on Computing
10
(1), 1981, February, pp. 114-117
On string pattern matching: A new model with a polynomial time algorithm
Ken-Chih Liu
SIAM Journal on Computing
10
(1), 1981, February, pp. 118-140
Listing and counting subtrees of a tree
F. Ruskey
SIAM Journal on Computing
10
(1), 1981, February, pp. 141-150
Nonpreemptive LP-scheduling on homogeneous multiprocessor systems
Manfred Kunde
SIAM Journal on Computing
10
(1), 1981, February, pp. 151-173
Operator precedence grammars and the noncounting property
S. Crespi Reghizzi
,
G. Guida
,
D. Mandrioli
SIAM Journal on Computing
10
(1), 1981, February, pp. 174-191
Sequencing jobs with unequal ready times to minimize mean flow time
M.I. Dessouky
,
J.S. Deogun
SIAM Journal on Computing
10
(1), 1981, February, pp. 192-202
Linear time automorphism algorithms for trees, interval graphs, and planar graphs
C.J. Colbourn
,
K.S. Booth
SIAM Journal on Computing
10
(1), 1981, February, pp. 203-225
The total correctness of parallel programs
L. Flon
,
N. Suzuki
SIAM Journal on Computing
10
(2), 1981, May, pp. 227-246
An algorithm for find
K
minimum spanning trees
N. Katoh
,
T. Ibaraki
,
H. Mine
SIAM Journal on Computing
10
(2), 1981, May, pp. 247-255
Scheduling unit-time tasks with arbitrary release times and deadlines
M.R. Garey
,
D.S. Johnson
,
B.B. Simons
,
R.E. Tarjan
SIAM Journal on Computing
10
, 1981, pp. 256-269
Approximation algorithms for several graph augmentation problems
G.N. Frederickson
,
J. Jájá
SIAM Journal on Computing
10
(2), 1981, May, pp. 270-283
The rational index: a complexity measure for languages
L. Boasson
,
B. Courcelle
,
M. Nivat
SIAM Journal on Computing
10
(2), 1981, May, pp. 284-296
Edge-deletion problems
Mihalis Yannakakis
SIAM Journal on Computing
10
, 1981, pp. 297-309
Node-deletion problems on bipartite graphs
M. Yannakakis
SIAM Journal on Computing
10
(2), 1981, May, pp. 310-327
An
O(n\log^2 n)
algorithm for the
k
th longest path in a tree with applications to location problems
N. Megiddo
,
A. Tamir
,
E. Zemel
,
R. Chandrasekaran
SIAM Journal on Computing
10
(2), 1981, May, pp. 328-337
Optimization problems on graphs with independent random edge weights
G.S. Lueker
SIAM Journal on Computing
10
(2), 1981, May, pp. 338-351
Equivalence of relational database schemes
C. Beeri
,
A.O. Mendelzon
,
Y. Sagiv
,
J.D. Ullman
SIAM Journal on Computing
10
(2), 1981, May, pp. 352-370
Seiten 1
2
3
>