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=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simulating size-constrained Galton-Watson trees
Luc Devroye
SIAM Journal on Computing
41
(1), 2012, pp. 1-11
Envy-free makespan approximation
Edith Cohen
,
Michal Feldman
,
Amos Fiat
,
Haim Kaplan
,
Svetlana Olonetsky
SIAM Journal on Computing
41
(1), 2012, pp. 12-25
The gathering problem for two oblivious robots with unreliable compasses
Taisuke Izumi
,
Samia Souissi
,
Yoshiaki Katayama
,
Nobuhiro Inuzuka
,
Xavier Défago
,
Koichi Wada
,
Masafumi Yamashita
SIAM Journal on Computing
41
(1), 2012, pp. 26-46
On clustering to minimize the sum of radii
Matt Gibson
,
Gaurav Kanade
,
Erik Krohn
,
Imran A. Pirwani
,
Kasturi Varadarajan
SIAM Journal on Computing
41
(1), 2012, pp. 47-60
Iterated rounding algorithms for the smallest
k
-edge connected spanning subgraph
Harold N. Gabow
,
Suzanne R. Gallagher
SIAM Journal on Computing
41
(1), 2012, pp. 61-103
An optimal dynamic data structure for stabbing-semigroup queries
Pankaj K. Agarwal
,
Lars Arge
,
Haim Kaplan
,
Eyal Molad
,
Robert Robert E. Tarjan
,
Ke Yi
SIAM Journal on Computing
41
(1), 2012, pp. 104-127
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures
Toniann Pitassi
,
Nathan Segerlind
SIAM Journal on Computing
41
(1), 2012, pp. 128-159
Regular expressions with counting: Weak versus strong determinism
Wouter Gelade
,
Marc Gyssens
,
Wim Martens
SIAM Journal on Computing
41
(1), 2012, pp. 160-190
The complexity of distributions
Emanuelle Viola
SIAM Journal on Computing
41
(1), 2012, pp. 191-218
Explicit dimension reduction and its applications
Zohar S. Karnin
,
Yuval Rabani
,
Amir Shpilka
SIAM Journal on Computing
41
(1), 2012, pp. 219-249
Local versus global properties of metric spaces
Sanjeev Arora
,
László Lovász
,
Ilan Newman
,
Yuval Rabani
,
Yuri Rabinovich
,
Santosch Vempala
SIAM Journal on Computing
41
(1), 2012, pp. 250-271
The complexity of inferring a minimally resolved phylogenetic supertree
Jesper Jansson
,
Richard L. Lemence
,
Andrzej Lingas
SIAM Journal on Computing
41
(1), 2012, pp. 272-291
Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation
Mikkel Thorup
,
Yin Zhang
SIAM Journal on Computing
41
(2), 2012, pp. 293-331
Approximating the permanent via Nonabelian determinants
Cristopher Moore
,
Alexander Russell
SIAM Journal on Computing
41
(2), 2012, pp. 332-355
A deterministic polynomial-time approximation scheme for counting knapsack solutions
Daniel S̑tefankovic̑
,
Santosh Vempala
,
Eric Vigoda
SIAM Journal on Computing
41
(2), 2012, pp. 356-366
Improved bounds for geometric permutations
Natan Rubin
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
41
(2), 2012, pp. 367-390
Randomized competitive algorithms for generalized caching
Nikhil Bansal
,
Niv Buchbinder
,
Joseph (Seffi) Naor
SIAM Journal on Computing
41
(2), 2012, pp. 391-414
An optimal self-stabilizing firing squad
Danny Dolev
,
Ezra N. Hoch
,
Yoram Moses
SIAM Journal on Computing
41
(2), 2012, pp. 415-435
Approximate sparse recovery: Optimizing time and measurements
Anna C. Gilbert
,
Yi Li
,
Ely Porat
,
Martin J. Strauss
SIAM Journal on Computing
41
(2), 2012, pp. 436-453
Almost-optimal gossip-based aggregate computation
Jen-yeu Chen
,
Gopal Pandurangan
SIAM Journal on Computing
41
(3), 2012, pp. 455-483
Multiparty communication complexity and threshold circuit size of
\mathbf{AC}^0
Paul Beame
,
Trinh Huynh
SIAM Journal on Computing
41
(3), 2012, pp. 484-518
On the inherent sequentiality of concurrent objects
Faith Ellen
,
Danny Hendler
,
Nir Shavit
SIAM Journal on Computing
41
(3), 2012, pp. 519-536
Area-universal and constrained rectangular layouts
David Eppstein
,
Elena Mumford
,
Bettina Speckmann
,
Kevin Verbeek
SIAM Journal on Computing
41
(3), 2012, pp. 537-564
Universal sequencing on an unreliable machine
Leah Epstein
,
Asaf Levin
,
Alberto Marchetti-Spaccamela
,
Nicole Megow
,
Julián Mestre
,
Martin Skutella
,
Leen Stougie
SIAM Journal on Computing
41
(3), 2012, pp. 565-586
Approximating TSP on metrics with bounded global growth
T.-H. Hubert Chan
,
Anupam Gupta
SIAM Journal on Computing
41
(3), 2012, pp. 587-617
Seiten 1
2
3
>