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=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Short seed extractors against quantum storage
Amnon Ta-Shma
SIAM Journal on Computing
40
(3), 2011, pp. 664-677
Terminal backup, 3D matching, and covering cubic graphs
Elliot Anshelevich
,
Adriana Karagiozova
SIAM Journal on Computing
40
(3), 2011, pp. 678-708
An expansion tester for bounded degree graphs
Satyen Kale
,
C. Seshadhri
SIAM Journal on Computing
40
(3), 2011, pp. 709-720
Boltzmann samplers, Pólya theory, and cycle pointing
Manuel Bodirsky
,
Éric Fusy
,
Mihyun Kang
,
Stefan Vigerske
SIAM Journal on Computing
40
(3), 2011, pp. 721-769
A counterexample to strong parallel repetition
Ran Raz
SIAM Journal on Computing
40
(3), 2011, pp. 771-777
Kakeya sets, new mergers, and old extractors
Zeev Dvir
,
Avi Wigderson
SIAM Journal on Computing
40
(3), 2011, pp. 778-792
What can we learn privately?
Shiva Prasad Kasiviswanathan
,
Homin K. Lee
,
Kobbi Nissim
,
Sofya Raskhodnikova
,
Adam Smith
SIAM Journal on Computing
40
(3), 2011, pp. 793-826
Unifying the landscape of cell-probe lower bounds
Mihai Pȃtraşcu
SIAM Journal on Computing
40
(3), 2011, pp. 827-847
Entangled games are hard to approximate
Julia Kempe
,
Hirotada Kobayashi
,
Keiji Matsumoto
,
Ben Toner
,
Thomas Vidick
SIAM Journal on Computing
40
(3), 2011, pp. 848-877
Beating the random ordering is hard: Every ordering CSP is approximation resistant
Venkatesan Guruswami
,
Johan Håstad
,
Rajsekar Manokaran
,
Prasad Raghavendra
,
Moses Charikar
SIAM Journal on Computing
40
(3), 2011, pp. 878-914
Truthful approximation schemes for single-parameter agents
Peerapong Dhangwatnotai
,
Shahar Dobzinski
,
Shaddin Dughmi
,
Tim Roughgarden
SIAM Journal on Computing
40
(3), 2011, pp. 915-933
A quantitative version of the Gibbard-Satterthwaite theorem for three alternatives
Ehud Friedgut
,
Gil Kalai
,
Nathan Keller
,
Noam Nisan
SIAM Journal on Computing
40
(3), 2011, pp. 934-952
Degree bounded network design with metric costs
Yuk Hei Chan
,
Wai Shing Fung
,
Lap Chi Lau
,
Chun Kong Yung
SIAM Journal on Computing
40
(4), 2011, pp. 953-980
Spectral sparsification of graphs
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
40
(4), 2011, pp. 981-1025
Optimal homologous cycles, total unimodularity, and linear programming
Tamal K. Dey
,
Anil N. Hirani
,
Bala Krishnamoorthy
SIAM Journal on Computing
40
(4), 2011, pp. 1026-1044
Semialgebraic range reporting and emptiness searching with applications
Micha Sharir
,
Hayim Shaul
SIAM Journal on Computing
40
(4), 2011, pp. 1045-1074
Testing Fourier dimensionality and sparsity
Parikshit Gopalan
,
Ryan O'Donnell
,
Rocco A. Servedio
,
Amir Shpilka
,
Karl Wimmer
SIAM Journal on Computing
40
(4), 2011, pp. 1075-1100
Computational complexity of Holant problems
Jin-Yi Cai
,
Pinyan Lu
,
Mingji Xia
SIAM Journal on Computing
40
(4), 2011, pp. 1101-1132
Maximizing non-monotone submodular functions
Uriel Feige
,
Vahab S. Mirrokni
,
Jan Vondrák
SIAM Journal on Computing
40
(4), 2011, pp. 1133-1153
Matching vector codes
Zeev Dvir
,
Parikshit Gopalan
,
Sergey Yekhanin
SIAM Journal on Computing
40
(4), 2011, pp. 1154-1178
An overview of mathematical issues arising in the geometric complexity theory approach to
\mathbf{VP}\neq\mathbf{NP}
Peter Bürgisser
,
J.M. Landsberg
,
Laurent Manivel
,
Jerzy Weyman
SIAM Journal on Computing
40
(4), 2011, pp. 1179-1209
Exact price of anarchy for polynomial congestion games
Sebastian Aland
,
Dominic Dumrauf
,
Martin Gairing
,
Burkhard Monien
,
Florian Schoppmann
SIAM Journal on Computing
40
(5), 2011, pp. 1211-1233
The recognition of tolerance and bounded tolerance graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
SIAM Journal on Computing
40
(5), 2011, pp. 1234-1257
Hardness of precedence constrained scheduling on identical machines
Ola Svensson
SIAM Journal on Computing
40
(5), 2011, pp. 1258-1274
Fitting tree metrics: Hierarchical clustering and phylogeny
Nir Ailon
,
Moses Charikar
SIAM Journal on Computing
40
(5), 2011, pp. 1275-1291
Seiten
<
1
2
3
>