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=38
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Impossibility results and lower bounds for consensus under link failures
Ulrich Schmid
,
Bettina Weiss
,
Idit Keidar
SIAM Journal on Computing
38
(5), 2008-2009, pp. 1912-1951
Locally decodable codes from nice subsets of finite fields and prime factors of Mersenne numbers
Kiran S. Kedlaya
,
Sergey Yekhanin
SIAM Journal on Computing
38
(5), 2008-2009, pp. 1952-1969
The complexity of weighted Boolean \#CSP
Martin Dyer
,
Leslie Ann Goldberg
,
Mark Jerrum
SIAM Journal on Computing
38
(5), 2008-2009, pp. 1970-1986
On the complexity of numerical analysis
Eric Allender
,
Peter Bürgisser
,
Johan Kjeldgaard-Pedersen
,
Peter Bro Miltersen
SIAM Journal on Computing
38
(5), 2008-2009, pp. 1987-2006
Interval completion is fixed parameter tractable
Yngve Villanger
,
Pinar Heggernes
,
Christophe Paul
,
Jan Arne Telle
SIAM Journal on Computing
38
(5), 2008-2009, pp. 2007-2020
Optimizing schema languages for XML: Numerical constraints and interleaving
Wouter Gelade
,
Wim Martens
,
Frank Neven
SIAM Journal on Computing
38
(5), 2008-2009, pp. 2021-2043
Stream order and order statistics: Quantile estimation in random-order streams
Sudipto Guha
,
Andrew McGregor
SIAM Journal on Computing
38
(5), 2008-2009, pp. 2044-2059
Sampling algorithms and coresets for
\l_p
regression
Anirban Dasgupta
,
Petros Drineas
,
Boulos Harb
,
Ravi Kumar
,
Michael W. Mahoney
SIAM Journal on Computing
38
(5), 2008-2009, pp. 2060-2078
Hierarchical unambiguity
Holger Spakowski
,
Rahul Tripathi
SIAM Journal on Computing
38
(5), 2008-2009, pp. 2079-2112
Separating AC
^0
from depth-2 majority circuits
Alexander A. Sherstov
SIAM Journal on Computing
38
(6), 2009, pp. 2113-2129
Interpolation of depth-3 arithmetic circuits with two multiplication gates
Amir Shpilka
SIAM Journal on Computing
38
(6), 2009, pp. 2130-2161
Breaking a time-and-space barrier in constructing full-text indices
Wing-Kai Hon
,
Kunihiko Sadakane
,
Wing-Kin Sung
SIAM Journal on Computing
38
(6), 2009, pp. 2162-2178
Linear-time haplotype inference on pedigrees without recombinations and mating loops
Mee Yee Chan
,
Wun-Tat Chan
,
Francis Y.L. Chin
,
Stanley P.Y. Fung
,
Ming-Yang Kao
SIAM Journal on Computing
38
(6), 2009, pp. 2179-2197
Efficient algorithms for reconstructing zero-recombinant haplotypes on a pedigree based on fast elimination of redundant linear equations
Jing Xiao
,
Lan Liu
,
Lirong Xia
,
Tao Jiang
SIAM Journal on Computing
38
(6), 2009, pp. 2198-2219
Polylogarithmic independence can fool DNF formulas
Louay M.J. Bazzi
SIAM Journal on Computing
38
(6), 2009, pp. 2220-2272
On the value of coordination in network design
Susanne Albers
SIAM Journal on Computing
38
(6), 2009, pp. 2273-2302
Metric embeddings with relaxed guarantees
T.-H. Hubert Chan
,
Kedar Dhamdhere
,
Anupam Gupta
,
Jon Kleinberg
,
Aleksandrs Slivkins
SIAM Journal on Computing
38
(6), 2009, pp. 2303-2329
The connectivity of Boolean satisfiability: Computational and structural dichotomies
Parikshit Gopalan
,
Phokion G. Kolaitis
,
Elitza Maneva
,
Christos H. Papadimitriou
SIAM Journal on Computing
38
(6), 2009, pp. 2330-2355
The undecidability of the infinite ribbon problem: Implications for computing by self-assembly
Leonard Adleman
,
Jarkko Kari
,
Lila Kari
,
Dustin Reishus
,
Petr Sosik
SIAM Journal on Computing
38
(6), 2009, pp. 2356-2381
Dynamic programming optimization over random data: The scaling exponent for near-optimal solutions
David J. Aldous
,
Charles Bordenave
,
Marc Lelarge
SIAM Journal on Computing
38
(6), 2009, pp. 2382-2410
Random hyperplane search trees
Luc Devroye
,
James King
,
Colin McDiarmid
SIAM Journal on Computing
38
(6), 2009, pp. 2411-2425
A constant factor approximation for the single sink edge installation problem
Sudipto Guha
,
Adam Meyerson
,
Kamesh Munagala
SIAM Journal on Computing
38
(6), 2009, pp. 2426-2442
A 2EXPTIME complete varietal membership problem
Marcin Kozik
SIAM Journal on Computing
38
(6), 2009, pp. 2443-2467
Stateless distributed gradient descent for positive linear programs
Baruch Awerbuch
,
Rohit Khandekar
SIAM Journal on Computing
38
(6), 2009, pp. 2468-2486
Improved lower bounds for embeddings into
L_1
Robert Krauthgamer
,
Yuval Rabani
SIAM Journal on Computing
38
(6), 2009, pp. 2487-2498
Seiten
<
1
2
3
4
5
>