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=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Spectral gap amplification
R.D. Somma
,
S. Boixo
SIAM Journal on Computing
42
(2), 2013, pp. 593-610
The average-case complexity of determining the majority
Laurent Alonso
,
Edward M. Reingold
,
René Schott
SIAM Journal on Computing
26
(1), 1997, pp. 1-14
Amplification by read-once formulas
Moshe Dubiner
,
Uri Zwick
SIAM Journal on Computing
26
(1), 1997, pp. 15-38
Minimal ascending and descending tree automata
Maurice Nivant
,
Andreas Podelski
SIAM Journal on Computing
26
(1), 1997, pp. 39-58
Threshold computation and cryptographic security
Yenjo Han
,
Lane A. Hemaspaandra
,
Thomas Thierauf
SIAM Journal on Computing
26
(1), 1997, pp. 59-78
Disjoint rooted spanning trees with small depths in deBruijn and Kautz graphs
Zhengyu Ge
,
S. Louis Hakimi
SIAM Journal on Computing
26
(1), 1997, pp. 79-92
Polynomial-time recognition of 2-monotonic positive Boolean functions given by an oracle
Endre Boros
,
Peter L. Hammer
,
Toshihide Ibaraki
,
Kazuhiko Kawakami
SIAM Journal on Computing
26
(1), 1997, pp. 93-109
Navigating in unfamiliar geometric terrain
Avrim Blum
,
Prabhakar Raghavan
,
Baruch Schieber
SIAM Journal on Computing
26
(1), 1997, pp. 110-137
Finite monoids: From word to circuit evaluation
Martin Beaudry
,
Pierre McKenzie
,
Pierre Péladeau
,
Denis Thérien
SIAM Journal on Computing
26
(1), 1997, pp. 138-152
Parallelism always helps
Louis Mak
SIAM Journal on Computing
26
(1), 1997, pp. 153-172
Stochastic scheduling with variable profile and precedence constraints
Zhen Liu
,
Eric Sanlaville
SIAM Journal on Computing
26
(1), 1997, pp. 173-187
On bounded queries and approximation
Richard Chang
,
William I. Gasarch
,
Carsten Lund
SIAM Journal on Computing
26
(1), 1997, pp. 188-209
Sparse dynamic programming for evolutionary-tree comparison
Martin Farach
,
Mikkel Thorup
SIAM Journal on Computing
26
(1), 1997, pp. 210-230
Total protection of analytic-invariant information in cross-tabulated tables
Ming-Yang Kao
SIAM Journal on Computing
26
(1), 1997, pp. 231-242
On the power of real Turing machines over binary inputs
Felipe Cucker
,
Dima Grigoriev
SIAM Journal on Computing
26
(1), 1997, pp. 243-254
An
NC
algorithm for minimum cuts
David R. Karger
,
Rajeev Motwani
SIAM Journal on Computing
26
(1), 1997, pp. 255-272
Resource bounds for self-stabilizing message-driven protocols
Shlomi Dolev
,
Amos Israeli
,
Shlomo Moran
SIAM Journal on Computing
26
(1), 1997, pp. 273-290
Fail-stop signatures
Torben Pryds Pedersen
,
Birgit Pfitzmann
SIAM Journal on Computing
26
(2), 1997, pp. 291-330
The vertex-disjoint Menger problem in planar graphs
Heike Ripphausen-Lipa
,
Dorothea Wagner
,
Karsten Weihe
SIAM Journal on Computing
26
(2), 1997, pp. 331-349
Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds
Alessandro Panconesi
,
Aravind Srinivasan
SIAM Journal on Computing
26
(2), 1997, pp. 350-368
Random debaters and the hardness of approximating stochastic functions
Anne Condon
,
Joan Feigenbaum
,
Carsten Lund
,
Peter Shor
SIAM Journal on Computing
26
(2), 1997, pp. 369-400
A strip-packing algorithm with absolute performance bound 2
A. Steinberg
SIAM Journal on Computing
26
(2), 1997, pp. 401-409
Approximating shortest superstrings
Shang-Hua Teng
,
Frances F. Yao
SIAM Journal on Computing
26
(2), 1997, pp. 410-417
Bounded concurrent time-stamping
Danny Dolev
,
Nir Shavit
SIAM Journal on Computing
26
(2), 1997, pp. 418-455
Probe order backtracking
Paul Walton, Jr. Purdom
,
G. Neil Haven
SIAM Journal on Computing
26
(2), 1997, pp. 456-483
Seiten 1
2
3
4
>