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=35
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some 3CNF properties are hard to test
Eli Ben-Sasson
,
Prahladh Harsha
,
Sofya Raskhodnikova
SIAM Journal on Computing
35
(1), 2005, pp. 1-21
A probabilistic analysis of trie-based sorting of large collections of line segments in spatial databases
Michael Lindenbaum
,
Hanan Samet
,
Gisli R. Hjaltason
SIAM Journal on Computing
35
(1), 2005, pp. 22-58
Holographic proofs and derandomization
Dieter van Melkebeek
,
Rahul Santhanam
SIAM Journal on Computing
35
(1), 2005, pp. 59-90
Approximating the weight of the Euclidean minimum spanning tree in sublinear time
Artur Czumaj
,
Funda Ergün
,
Lance Fortnow
,
Avner Magen
,
Ilan Newman
,
Ronitt Rubinfeld
,
Christian Sohler
SIAM Journal on Computing
35
(1), 2005, pp. 91-109
Polynomial time approximation schemes for max-bisection on planar and geometric graphs
Klaus Jansen
,
Marek Karpinski
,
Andrzej Lingas
,
Eike Seidel
SIAM Journal on Computing
35
(1), 2005, pp. 110-119
Minimum-weight spanning tree construction in
O(\log \log n)
communication rounds
Zvi Lotker
,
Boaz Patt-Shamir
,
Elan Pavlov
,
David Peleg
SIAM Journal on Computing
35
(1), 2005, pp. 120-131
The complexity of approximating the entropy
Tug̑kan Batu
,
Sanjoy Dasgupta
,
Ravi Kumar
,
Ronitt Rubinfeld
SIAM Journal on Computing
35
(1), 2005, pp. 132-150
Well-separated pair decomposition for the unit-disk graph metric and its applications
Jie Gao
,
Li Zhang
SIAM Journal on Computing
35
(1), 2005, pp. 151-169
A subexponential-time quantum algorithm for the dihedral hidden subgroup problem
Greg Kuperberg
SIAM Journal on Computing
35
(1), 2005, pp. 170-188
A better-than-greedy approximation algorithm for the minimum set cover problem
Refael Hassin
,
Asaf Levin
SIAM Journal on Computing
35
(1), 2005, pp. 189-200
A superpolynomial lower bound for a circuit computing the clique function with at most
(1/6)\log \log n
negation gates
Kazuyuki Amano
,
Akira Maruoka
SIAM Journal on Computing
35
(1), 2005, pp. 201-216
Bounds on the efficiency of generic cryptographic constructions
Rosario Gennaro
,
Yael Gertner
,
Jonathan Katz
,
Luca Trevisan
SIAM Journal on Computing
35
(1), 2005, pp. 217-246
Approximating
k
-node connected subgraphs via critical graphs
Guy Kortsarz
,
Zeev Nutov
SIAM Journal on Computing
35
(1), 2005, pp. 247-257
A parametrized algorithm for matroid branch-width
Petr Hlinȇný
SIAM Journal on Computing
35
(2), 2005, pp. 259-277
On the performance of greedy algorithms in packet buffering
Susanne Albers
,
Markus Schmidt
SIAM Journal on Computing
35
(2), 2005, pp. 278-304
Analysis of link reversal routing algorithms
Costas Busch
,
Srikanta Tirthapura
SIAM Journal on Computing
35
(2), 2005, pp. 305-326
Two-way chaining with reassignment
Ketan Dalal
,
Luc Devroye
,
Ebrahim Malalla
,
Erin McLeish
SIAM Journal on Computing
35
(2), 2005, pp. 327-340
Cache-oblivious
B
-trees
Michael A. Bender
,
Erik D. Demaine
,
Martin Farach-Colton
SIAM Journal on Computing
35
(2), 2005, pp. 341-358
A powerful
LL(k)
covering transformation
Gyung-Ok Lee
,
Kwang-Moo Choe
SIAM Journal on Computing
35
(2), 2005, pp. 359-377
Compressed suffix arrays and suffix trees with applications to text indexing and string matching
Roberto Grossi
,
Jeffrey Scott Vitter
SIAM Journal on Computing
35
(2), 2005, pp. 378-407
Recognizing more unsatisfiable random
k
-SAT instances efficiently
Joel Friedman
,
Andreas Goerdt
,
Michael Krivelevich
SIAM Journal on Computing
35
(2), 2005, pp. 408-430
Optimal online algorithms for multidimensional packing problems
Leah Epstein
,
Rob van Stee
SIAM Journal on Computing
35
(2), 2005, pp. 431-448
Strictly nonblocking WDM cross-connects
April Rasala
,
Gordon Wilfong
SIAM Journal on Computing
35
(2), 2005, pp. 449-485
Strong spatial mixing with fewer colors for lattice graphs
Leslie Ann Goldberg
,
Russell Martin
,
Mike Paterson
SIAM Journal on Computing
35
(2), 2005, pp. 486-517
General multiprocessor task scheduling: Approximate solutions in linear time
Klaus Jansen
,
Lorant Porkolab
SIAM Journal on Computing
35
(3), 2005-2006, pp. 519-530
Seiten 1
2
3
>