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.
A polynomial-time algorithm to find the shortest cycle basis of a graph
J.D. Horton
SIAM Journal on Computing
16
(2), 1987, April, pp. 358-366
On efficient simulations of systolic arrays by random-access machines
O.H. Ibarra
,
M.A. Palis
SIAM Journal on Computing
16
(2), 1987, April, pp. 367-377
Asymptotic expansions for a closed multiple access system
C. Knessl
,
B.J. Matkowsky
,
Z. Schuss
,
C. Tier
SIAM Journal on Computing
16
(2), 1987, April, pp. 378-398
On the optimal control of two queues with server setup times and its analysis
M. Hofri
,
K.W. Ross
SIAM Journal on Computing
16
(2), 1987, April, pp. 399-420
On embedding a graph in the grid with the minimum number of bends
R. Tamassia
SIAM Journal on Computing
16
(3), 1987, June, pp. 421-444
Fast distributed agreement
S. Toueg
,
K.J. Perry
,
T.K. Srikanth
SIAM Journal on Computing
16
(3), 1987, June, pp. 445-457
Tight comparison bounds on the complexity of parallel sorting
Y. Azar
,
U. Vishkin
SIAM Journal on Computing
16
(3), 1987, June, pp. 458-464
Equational bases for if-then-else
A.H. Mekler
,
E.M. Nelson
SIAM Journal on Computing
16
(3), 1987, June, pp. 465-485
Expected computation time for Hamiltonian path problem
Y. Gurevich
,
S. Shelah
SIAM Journal on Computing
16
(3), 1987, June, pp. 486-502
Weighted leaf AVL-trees
V.K. Vaishnavi
SIAM Journal on Computing
16
(3), 1987, June, pp. 503-537
The complexity of reliable concurrency control
C.H. Papadimitriou
,
M. Yannakakis
SIAM Journal on Computing
16
(3), 1987, June, pp. 538-553
Tighter bounds for LPT scheduling on uniform processors
D.K. Friesen
SIAM Journal on Computing
16
(3), 1987, June, pp. 554-560
On shortest paths amidst convex polyhedra
M. Sharir
SIAM Journal on Computing
16
(3), 1987, June, pp. 561-572
Binary search on a tape
T.C. Hu
,
M.L. Wachs
SIAM Journal on Computing
16
(3), 1987, June, pp. 573-590
Factoring multivariate polynomials over algebraic number fields
A.K. Lenstra
SIAM Journal on Computing
16
(3), 1987, June, pp. 591-598
Optimal mixed graph augmentation
D. Gusfield
SIAM Journal on Computing
16
(4), 1987, August, pp. 599-612
Oracles for deterministic versus alternating classes
W. Gasarch
SIAM Journal on Computing
16
(4), 1987, August, pp. 613-627
The least weight subsequence problem
D.S. Hirschberg
,
L.L. Larmore
SIAM Journal on Computing
16
(4), 1987, August, pp. 628-638
A communication-time tradeoff
C.H. Papadimitriou
,
J.D. Ullman
SIAM Journal on Computing
16
(4), 1987, August, pp. 639-646
The discrete geodesic problem
J.S.B. Mitchell
,
D.M. Mount
,
C.H. Papadimitriou
SIAM Journal on Computing
16
(4), 1987, August, pp. 647-668
A 1.6 approximation algorithm for routing multiterminal nets
T.F. Gonzalez
,
Sing-Ling Lee
SIAM Journal on Computing
16
(4), 1987, August, pp. 669-704
List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations
B.J. Oommen
,
E.R. Hansen
SIAM Journal on Computing
16
(4), 1987, August, pp. 705-716
Generating random unlabelled graphs
N.C. Wormald
SIAM Journal on Computing
16
(4), 1987, August, pp. 717-727
On some distance problems in fixed orientations
P. Widmayer
,
Y.F. Wu
,
C.K. Wong
SIAM Journal on Computing
16
(4), 1987, August, pp. 728-746
Two processor scheduling is in
NC
David Helmbold
,
Ernst W. Mayr
SIAM Journal on Computing
16
(4), 1987, August, pp. 747-759
Seiten
<
1
2
3
>