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.
On the algorithmic aspects of discrete and lexicographic Helly-type theorems and the discrete LP-type model
Nir Halman
SIAM Journal on Computing
38
(1), 2008, pp. 1-45
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
Sophie Laplante
,
Frédéric Magniez
SIAM Journal on Computing
38
(1), 2008, pp. 46-62
Minimizing disjunctive normal form formulas and AC
^0
circuits given a truth table
Eric Allender
,
Lisa Hellerstein
,
Paul McCabe
,
Toniann Pitassi
,
Michael Saks
SIAM Journal on Computing
38
(1), 2008, pp. 63-84
Uniform hashing in constant time and optimal space
Anna Pagh
,
Rasmus Pagh
SIAM Journal on Computing
38
(1), 2008, pp. 85-96
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data
Yevgeniy Dodis
,
Rafail Ostrovsky
,
Leonid Reyzin
,
Adam Smith
SIAM Journal on Computing
38
(1), 2008, pp. 97-139
Sub-constant error low degree test of almost-linear size
Dana Moshkovitz
,
Ran Raz
SIAM Journal on Computing
38
(1), 2008, pp. 140-180
On approximating restricted cycle covers
Bodo Manthey
SIAM Journal on Computing
38
(1), 2008, pp. 181-206
Testing graph isomorphism
Eldar Fischer
,
Arie Matsliah
SIAM Journal on Computing
38
(1), 2008, pp. 207-225
Improving the stretch factor of a geometric network by edge augmentation
Mohammad Farshi
,
Panos Giannopoulos
,
Joachim Gudmundsson
SIAM Journal on Computing
38
(1), 2008, pp. 226-240
Equitable cost allocations via primal-dual-type algorithms
Kamal Jain
,
Vijay V. Vazirani
SIAM Journal on Computing
38
(1), 2008, pp. 241-256
Vertical ray shooting and computing depth orders for fat objects
Mark de Berg
,
Chris Gray
SIAM Journal on Computing
38
(1), 2008, pp. 257-275
Convergence of autonomous mobile robots with inaccurate sensors and movements
Reuven Cohen
,
David Peleg
SIAM Journal on Computing
38
(1), 2008, pp. 276-302
Plottable real number functions and the computable graph theorem
Vasco Brattka
SIAM Journal on Computing
38
(1), 2008, pp. 303-328
MAX ONES generalized to larger domains
Peter Jonsson
,
Fredrik Kuivinen
,
Gustav Nordh
SIAM Journal on Computing
38
(1), 2008, pp. 329-365
Exponential separation of quantum and classical one-way communication complexity
Ziv Bar-Yossef
,
T.S. Jayram
,
Iordanis Kerenidis
SIAM Journal on Computing
38
(1), 2008, pp. 366-384
The Euclidean orienteering problem revisited
Ke Chen
,
Sariel Har-Peled
SIAM Journal on Computing
38
(1), 2008, pp. 385-397
Lower bound for the online bin packing problem with restricted repacking
János Balogh
,
József Békési
,
Gábor Galambos
,
Gerhard Reinelt
SIAM Journal on Computing
38
(1), 2008, pp. 398-410
An APTAS for generalized cost variable-sized bin packing
Leah Epstein
,
Asaf Levin
SIAM Journal on Computing
38
(1), 2008, pp. 411-428
Binary space partitions for axis-aligned fat rectangles
Csaba D. Tóth
SIAM Journal on Computing
38
(1), 2008, pp. 429-447
An
O(\log n \log\log n)
space algorithm for undirected
st
-connectivity
Vladimir Trifonov
SIAM Journal on Computing
38
(2), 2008, pp. 449-483
The mixing time of the Thorp shuffle
Ben Morris
SIAM Journal on Computing
38
(2), 2008, pp. 484-504
Every monotone graph property is testable
Noga Alon
,
Asaf Shapira
SIAM Journal on Computing
38
(2), 2008, pp. 505-522
The round complexity of two-party random selection
Saurabh Sanghvi
,
Salil Vadhan
SIAM Journal on Computing
38
(2), 2008, pp. 523-550
Short PCPs with polylog query complexity
Eli Ben-Sasson
,
Madhu Sudan
SIAM Journal on Computing
38
(2), 2008, pp. 551-607
Lower-stretch spanning trees
Michael Elkin
,
Yuval Emek
,
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
38
(2), 2008, pp. 608-628
Seiten 1
2
3
4
5
>