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=37
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
Oracles for distances avoiding a failed node or link
Camil Demetrescu
,
Mikkel Thorup
,
Rezaul Alam Chowdhury
,
Vijaya Ramachandran
SIAM Journal on Computing
37
(5), 2008, pp. 1299-1318
A group-strategyproof cost sharing mechanism for the Steiner forest game
Jochen Könemann
,
Stefano Leonardi
,
Guido Schäfer
,
Stefan H.M. van Zwam
SIAM Journal on Computing
37
(5), 2008, pp. 1319-1341
The Forgetron: A kernel-based Perceptron on a budget
Ofer Dekel
,
Shai Shalev-Shwartz
,
Yoram Singer
SIAM Journal on Computing
37
(5), 2008, pp. 1342-1372
On
k
-d range search with Patricia tries
Bradford G. Nickerson
,
Qingxiu Shi
SIAM Journal on Computing
37
(5), 2008, pp. 1373-1386
Quantum property testing
Harry Buhrman
,
Lance Fortnow
,
Ilan Newman
,
Hein Röhrig
SIAM Journal on Computing
37
(5), 2008, pp. 1387-1400
Compression in finite fields and torus-based cryptography
K. Rubin
,
A. Silverberg
SIAM Journal on Computing
37
(5), 2008, pp. 1401-1428
Accelerating simulated annealing for the permanent and combinatorial counting problems
Ivona Bezáková
,
Daniel S̑tefankovic̑
,
Vijay V. Vazirani
,
Eric Vigoda
SIAM Journal on Computing
37
(5), 2008, pp. 1429-1454
Improved dynamic reachability algorithms for directed graphs
Liam Roditty
,
Uri Zwick
SIAM Journal on Computing
37
(5), 2008, pp. 1455-1471
A faster, better approximation algorithm for the minimum latency problem
Aaron Archer
,
Asaf Levin
,
David P. Williamson
SIAM Journal on Computing
37
(5), 2008, pp. 1472-1498
Optimal power-down strategies
John Augustine
,
Sandy Irani
,
Chaitanya Swamy
SIAM Journal on Computing
37
(5), 2008, pp. 1499-1516
Splitting
NP
-complete sets
Christian Glaßer
,
A. Pavan
,
Alan L. Selman
,
Liyu Zhang
SIAM Journal on Computing
37
(5), 2008, pp. 1517-1535
Learning mixtures of product distributions over discrete domains
Jon Feldman
,
Ryan O'Donnell
,
Rocco A. Servedio
SIAM Journal on Computing
37
(5), 2008, pp. 1536-1564
Holographic algorithms
Leslie G. Valiant
SIAM Journal on Computing
37
(5), 2008, pp. 1565-1594
Extra unit-speed machines are almost as powerful as speedy machines for flow time scheduling
Ho-Leung Chan
,
Tak-Wah Lam
,
Kin-Shing Liu
SIAM Journal on Computing
37
(5), 2008, pp. 1595-1612
Randomization does not reduce the average delay in parallel packet switches
Hagit Attiya
,
David Hay
SIAM Journal on Computing
37
(5), 2008, pp. 1613-1636
A practical shortest path algorithm with linear expected time
Andrew V. Goldberg
SIAM Journal on Computing
37
(5), 2008, pp. 1637-1655
Stability of load balancing algorithms in dynamic adversarial systems
Elliot Anshelevich
,
David Kempe
,
Jon Kleinberg
SIAM Journal on Computing
37
(5), 2008, pp. 1656-1673
The complexity of quantified constraint satisfaction: Collapsibility, sink algebras, and the three-element case
Hubie Chen
SIAM Journal on Computing
37
(5), 2008, pp. 1674-1701
A characterization of the (natural) graph properties testable with one-sided error
Noga Alon
,
Asaf Shapira
SIAM Journal on Computing
37
(6), 2008, pp. 1703-1727
An algorithmic version of the hypergraph regularity method
P.E. Haxell
,
B. Nagle
,
V. Rödl
SIAM Journal on Computing
37
(6), 2008, pp. 1728-1776
Seiten
<
1
2
3
4
>