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=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Zone diagrams: Existence, uniqueness, and algorithmic challenge
Tetsuo Asano
,
Jiȓí Matous̑ek
,
Takeshi Tokuyama
SIAM Journal on Computing
37
(4), 2007, pp. 1182-1198
Sampling and meshing a surface with guaranteed topology and geometry
Siu-Wing Cheng
,
Tamal K. Dey
,
Edgar A. Ramos
,
Tathagata Ray
SIAM Journal on Computing
37
(4), 2007, pp. 1199-1227
An isomorphism between subexponential and parameterized complexity theory
Yijia Chen
,
Martin Grohe
SIAM Journal on Computing
37
(4), 2007, pp. 1228-1258
Localized client-server load balancing without global information
Baruch Awerbuch
,
Mohammad T. Hajiaghayi
,
Robert Kleinberg
,
Tom Leighton
SIAM Journal on Computing
37
(4), 2007, pp. 1259-1279
(t,k)
-diagnosability of multiprocessor systems with applications to grids and tori
Guey-Yun Chang
,
Gen-Huey Chen
SIAM Journal on Computing
37
(4), 2007, pp. 1280-1298
Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
Jesse Kamp
,
David Zuckerman
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1231-1247
Linear upper bounds for random walk on small density random 3-CNFs
Mikhail Alekhnovich
,
Eli Ben-Sasson
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1248-1263
The complexity of computing the size of an interval
Lane A. Hemaspaandra
,
Christopher M. Homan
,
Sven Kosub
,
Klaus W. Wagner
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1264-1300
Chosen-ciphertext security from identity-based encryption
Dan Boneh
,
Ran Canetti
,
Shai Halevi
,
Jonathan Katz
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1301-1328
A deterministic algorithm for finding all minimum
k
-way cuts
Yoko Kamidoi
,
Noriyoshi Yoshida
,
Hiroshi Nagamochi
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1329-1341
Online conflict-free coloring for intervals
Ke Chen
,
Amos Fiat
,
Haim Kaplan
,
Meital Levy
,
Jiȓí Matous̑ek
,
Elchanan Mossel
,
János Pach
,
Micha Sharir
,
Shakhar Smorodinsky
,
Uli Wagner
,
Emo Welzl
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1342-1359
Improved combinatorial group testing algorithms for real-world problem sizes
David Eppstein
,
Michael T. Goodrich
,
Daniel S. Hirschberg
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1360-1375
The hardness of metric labeling
Julia Chuzhoy
,
Joseph (Seffi) Naor
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1376-1386
Pseudorandom bits for constant-depth circuits with few arbitrary symmetric gates
Emanuele Viola
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1387-1403
Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits
Zeev Dvir
,
Amir Shpilka
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1404-1434
The probabilistic relationship between the assignment and asymmetric Traveling Salesman Problems
Alan Frieze
,
Gregory B. Sorkin
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1435-1452
The wake-up problem in multihop radio networks
Marek Chrobak
,
Leszek Ga̧sieniec
,
Dariusz R. Kowalski
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1453-1471
Quantum and classical strong direct product theorems and optimal time-space tradeoffs
Hartmut Klauck
,
Robert S̑palek
,
Ronald de Wolf
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1472-1493
Integrality ratio for group Steiner Trees and directed Steiner trees
Eran Halperin
,
Guy Kortsarz
,
Robert Krauthgamer
,
Aravind Srinivasan
,
Nan Wang
SIAM Journal on Computing
36
(5), 2006-2007, pp. 1494-1511
Zaps and their applications
Cynthia Dwork
,
Moni Naor
SIAM Journal on Computing
36
(6), 2007, pp. 1513-1543
Complexity of self-assembled shapes
David Soloveichik
,
Erik Winfree
SIAM Journal on Computing
36
(6), 2007, pp. 1544-1569
First-order languages expressing constructible spatial database queries
Bart Kuijpers
,
Gabriel Kuper
,
Jan Paredaens
,
Luc Vandeurzen
SIAM Journal on Computing
36
(6), 2007, pp. 1570-1599
Quickest flows over time
Lisa Fleischer
,
Martin Skutella
SIAM Journal on Computing
36
(6), 2007, pp. 1600-1630
A constant-factor approximation algorithm for optimal 1.5D terrain guarding
Boaz Ben-Moshe
,
Matthew J. Katz
,
Joseph S.B. Mitchell
SIAM Journal on Computing
36
(6), 2007, pp. 1631-1647
Finding paths and cycles of superpolylogarithmic length
Harold N. Gabow
SIAM Journal on Computing
36
(6), 2007, pp. 1648-1671
Seiten
<
1
2
3
4
>