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 YEAR=1989
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A design theory for solving the anomalies problem
Edward P.F. Chan
SIAM Journal on Computing
18
, 1989, pp. 429-448
On tally relativizations of
BP
-complexity classes
Shouwen Tang
,
Osamu Watanabe
SIAM Journal on Computing
18
, 1989, pp. 449-462
Dynamic programming by exchangeability
Shuo-Yen Robert Li
SIAM Journal on Computing
18
, 1989, pp. 463-472
Optimal bin packing with items of random sizes III
Wansoo T. Rhee
,
Michel Talagrand
SIAM Journal on Computing
18
, 1989, pp. 473-486
Optimal bin covering with items of random size
Wansoo T. Rhee
,
Michel Talagrand
SIAM Journal on Computing
18
, 1989, pp. 487-498
Cascading divide-and-conquer: A technique for designing parallel algorithms
Mikhail J. Atallah
,
Richard Cole
,
Michael T. Goodrich
SIAM Journal on Computing
18
, 1989, pp. 499-532
A new peeble game that characterizes parallel complexity classes
H. Venkateswaran
,
Martin Tompa
SIAM Journal on Computing
18
, 1989, pp. 533-549
Succinct certificates for almost all subset sum problems
Merrick L. Furst
,
Ravi Kannan
SIAM Journal on Computing
18
, 1989, pp. 550-558
Two applications of inductive counting for complementation problems
Allan Borodin
,
Stephen A. Cook
,
Patrick W. Dymond
,
Walter L. Ruzzo
,
Martin Tompa
SIAM Journal on Computing
18
, 1989, pp. 559-578
Note on Weintraub's minimum-cost circulation algorithm
Francisco Barahona
,
Eva Tardos
SIAM Journal on Computing
18
, 1989, pp. 579-583
Fast Fourier transforms for metabelian groups
Michael Clausen
SIAM Journal on Computing
18
, 1989, pp. 584-593
Optimal and sublogarithmic time randomized parallel sorting algorithms
Sanguthevar Rajasekaran
,
John H. Reif
SIAM Journal on Computing
18
, 1989, pp. 594-607
Precise analyses of the right- and left-shift greatest common divisor algorithms for
GF(q)[x]
G.H. Norton
SIAM Journal on Computing
18
, 1989, pp. 608-624
Expressibility and parallel complexity
Neil Immerman
SIAM Journal on Computing
18
, 1989, pp. 625-638
Matrix Padé fractions and their computation
George Labahn
,
Stan Cabay
SIAM Journal on Computing
18
, 1989, pp. 639-657
Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix
Costas S. Iliopoulos
SIAM Journal on Computing
18
, 1989, pp. 658-669
Worst-case complexity bounds on algorithms for computing the canonical structure of infinite Abelian groups and solving systems of linear Diophantine equations
Costas S. Iliopoulos
SIAM Journal on Computing
18
, 1989, pp. 670-678
On the complexity of partial order productions
Andrew Chi-Chih Yao
SIAM Journal on Computing
18
, 1989, pp. 679-689
A fast algorithm for multiprocessor scheduling of unit-length jobs
Barbara B. Simons
,
Manfred K. Warmuth
SIAM Journal on Computing
18
, 1989, pp. 690-710
Minimum-knowledge interactive proofs for decision problems
Zvi Galil
,
Stuart Haber
,
Moti Yungs
SIAM Journal on Computing
18
, 1989, pp. 711-739
An optimal synchronizer for the hypercube
David Peleg
,
Jeffrey D. Ullman
SIAM Journal on Computing
18
, 1989, pp. 740-747
Space-time trade-offs for orthogonal range queries
Pravin M. Vaidya
SIAM Journal on Computing
18
, 1989, pp. 748-758
A lower bound for matrix multiplication
Nader H. Bshouty
SIAM Journal on Computing
18
, 1989, pp. 759-765
Time/space trade-offs for reversible computation
Charles H. Bennett
SIAM Journal on Computing
18
, 1989, pp. 766-776
Ultimate characterizations of the burst response of an interval searching algorithm: A study of a functional equation
Philippe Jacquet
,
Wojciech Szpankowski
SIAM Journal on Computing
18
, 1989, pp. 777-791
Seiten 1
2
3
>