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=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Randomly supported independence and resistance
Per Austrin
,
Johan Håstad
SIAM Journal on Computing
40
(1), 2011, pp. 1-27
Multiwriter consistency conditions for shared memory registers
Cheng Shao
,
Jennifer L. Welch
,
Evelyn Pierce
,
Hyunyoung Lee
SIAM Journal on Computing
40
(1), 2011, pp. 28-62
The complexity of early deciding set agreement
Eli Gafni
,
Rachid Guerraoui
,
Bastian Pochon
SIAM Journal on Computing
40
(1), 2011, pp. 63-78
How hard is it to approximate the best Nash equilibrium?
Elad Hazan
,
Robert Krauthgamer
SIAM Journal on Computing
40
(1), 2011, pp. 79-91
Uncoordinated two-sided matching markets
Heiner Ackermann
,
Paul W. Goldberg
,
Vahab S. Mirrokni
,
Heiko Röglin
,
Berthold Vöcking
SIAM Journal on Computing
40
(1), 2011, pp. 92-106
A near-optimal separation of regular and general resolution
Alasdair Urquhart
SIAM Journal on Computing
40
(1), 2011, pp. 107-121
On achieving the ``Best of both worlds'' in secure multiparty computation
Yuval Ishai
,
Jonathan Katz
,
Eyal Kushilevitz
,
Yehuda Lindell
,
Erez Petrank
SIAM Journal on Computing
40
(1), 2011, pp. 122-141
Search via quantum walk
Frédéric Magniez
,
Ashwin Nayak
,
Jeremie Roland
,
Miklos Santha
SIAM Journal on Computing
40
(1), 2011, pp. 142-164
The Chow parameters problem
Ryan O'Donnell
,
Rocco A. Servedio
SIAM Journal on Computing
40
(1), 2011, pp. 165-199
An almost optimal rank bound for depth-3 identities
Nitin Saxena
,
C. Seshadhri
SIAM Journal on Computing
40
(1), 2011, pp. 200-224
Black-box constructions of protocols for secure computation
Iftach Haitner
,
Yuval Ishai
,
Eyal Kushilevitz
,
Yehuda Lindell
,
Erez Petrank
SIAM Journal on Computing
40
(2), 2011, pp. 225-266
A combinatorial construction of almost-Ramanujan graphs using the zig-zag product
Avraham Ben-Aroya
,
Amnon Ta-Shma
SIAM Journal on Computing
40
(2), 2011, pp. 267-290
An analysis of random-walk cuckoo hashing
Alan Frieze
,
Páll Melsted
,
Michael Mitzenmacher
SIAM Journal on Computing
40
(2), 2011, pp. 291-308
Improved approximation algorithms for prize-collecting Steiner tree and TSP
Aaron Archer
,
MohammadHossein Bateni
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
SIAM Journal on Computing
40
(2), 2011, pp. 309-332
Dynamic connectivity: Connecting to networks and geometry
Timothy M. Chan
,
Mihai Pȃtraşcu
,
Liam Roditty
SIAM Journal on Computing
40
(2), 2011, pp. 333-349
Self-improving algorithms
Nir Ailon
,
Bernard Chazelle
,
Kenneth L. Clarkson
,
Ding Liu
,
Wolfgang Mulzer
,
C. Seshadhri
SIAM Journal on Computing
40
(2), 2011, pp. 350-375
Algorithmic aspects of property testing in the dense graphs model
Oded Goldreich
,
Dana Ron
SIAM Journal on Computing
40
(2), 2011, pp. 376-445
Deciding regularity of the set of instances of a set of terms with regular constraints is EXPTIME-complete
Omer Giménez
,
Guillem Godoy
,
Sebastian Maneth
SIAM Journal on Computing
40
(2), 2011, pp. 446-464
Space-efficient preprocessing schemes for range minimum queries on static arrays
Johannes Fischer
,
Volker Heun
SIAM Journal on Computing
40
(2), 2011, pp. 465-492
Fail-aware untrusted storage
Christian Cachin
,
Idit Keidar
,
Alexander Shraer
SIAM Journal on Computing
40
(2), 2011, pp. 493-533
On proximity-oblivious testing
Oded Goldreich
,
Dana Ron
SIAM Journal on Computing
40
(2), 2011, pp. 534-566
Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut
Christoph Ambühl
,
Monaldo Mastrolilli
,
Ola Svensson
SIAM Journal on Computing
40
(2), 2011, pp. 567-596
Sorting and selection in posets
Constantinos Daskalakis
,
Richard M. Karp
,
Elchanan Mossel
,
Samantha J. Riesenfeld
,
Elad Verbin
SIAM Journal on Computing
40
(3), 2011, pp. 597-622
Optimal envy-free pricing with metric substitutability
Ning Chen
,
Arpita Ghosh
,
Sergei Vassilvitskii
SIAM Journal on Computing
40
(3), 2011, pp. 623-645
A topological view of unsupervised learning from noisy data
P. Niyogi
,
S. Smale
,
S. Weinberger
SIAM Journal on Computing
40
(3), 2011, pp. 646-663
Seiten 1
2
3
>