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=16
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Languages that capture complexity classes
N. Immerman
SIAM Journal on Computing
16
(4), 1987, August, pp. 760-778
Logspace hierarchies, polynomial time and the complexity of fairness problems concerning
\omega
-machines
L.E. Rosier
,
Hsu-Chun Yen
SIAM Journal on Computing
16
(5), 1987, October, pp. 779-807
Deterministic simulation of idealized parallel computers on more realistic ones
H. Alt
,
T. Hagerup
,
K. Mehlhorn
,
F.P. Preparata
SIAM Journal on Computing
16
(5), 1987, October, pp. 808-835
A DNF without regular shortest consensus path
Wenqi Huang
,
Xiangdong Yu
SIAM Journal on Computing
16
(5), 1987, October, pp. 836-840
Independent and separable database schemes
E.P.F. Chan
,
A.O. Mendelzon
SIAM Journal on Computing
16
(5), 1987, October, pp. 841-851
A note on randomized polynomial time
S.A. Kurtz
SIAM Journal on Computing
16
(5), 1987, October, pp. 852-853
Doubly lexical orderings of matrices
A. Lubiw
SIAM Journal on Computing
16
(5), 1987, October, pp. 854-879
The parallel complexity of Abelian permutation group problems
P. McKenzie
,
S.A. Cook
SIAM Journal on Computing
16
(5), 1987, October, pp. 880-909
Nonlinear algebra and optimization on rings are 'hard'
H.B. Hunt III
,
R.E. Stearns
SIAM Journal on Computing
16
(5), 1987, October, pp. 910-929
Computing powers in parallel
J. von zur Gathen
SIAM Journal on Computing
16
(5), 1987, October, pp. 930-945
On the optimal layout of planar graphs with fixed boundary
B. Becker
,
G. Hotz
SIAM Journal on Computing
16
(5), 1987, October, pp. 946-972
Three partition refinement algorithms
R. Paige
,
R.E. Tarjan
SIAM Journal on Computing
16
(6), 1987, December, pp. 973-989
Optimal parallel sorting scheme by order statistics
M.C.K. Yang
,
Jun S. Huang
,
Yuan-Chieh Chow
SIAM Journal on Computing
16
(6), 1987, December, pp. 990-1003
Fast algorithms for shortest paths in planar graphs, with applications
G.N. Frederickson
SIAM Journal on Computing
16
(6), 1987, December, pp. 1004-1022
An all pairs shortest path algorithm with expected time
O(n^2\log n)
A. Moffat
,
T. Takaoka
SIAM Journal on Computing
16
(6), 1987, December, pp. 1023-1031
Sorting and selecting in rounds
N. Pippenger
SIAM Journal on Computing
16
(6), 1987, December, pp. 1032-1038
Generalized string matching
K. Abrahamson
SIAM Journal on Computing
16
(6), 1987, December, pp. 1039-1051
On the exact solution of random travelling salesman problems with medium size integer coefficients
A.M. Frieze
SIAM Journal on Computing
16
(6), 1987, December, pp. 1052-1072
Padded lists revisited
M. Hofri
,
A.G. Konheim
SIAM Journal on Computing
16
(6), 1987, December, pp. 1073-1114
Height restricted optimal binary trees
L.L. Larmore
SIAM Journal on Computing
16
(6), 1987, December, pp. 1115-1123
Almost sure fault tolerance in random graphs
E.R. Scheinerman
SIAM Journal on Computing
16
(6), 1987, December, pp. 1124-1134
On one-way cellular arrays
O.H. Ibarra
,
Tao Jiang
SIAM Journal on Computing
16
(6), 1987, December, pp. 1135-1154
A queueing analysis of hashing with lazy deletion
J.A. Morrison
,
L.A. Shepp
,
C.J. van Wyk
SIAM Journal on Computing
16
(6), 1987, December, pp. 1155-1164
Seiten
<
1
2
3