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
[1]
Hilfe
Suche: Journal=SIAM J. Comput. AND Volume=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Blackbox identity testing for bounded top-fanin depth-3 circuits: The field doesn't matter
Nitin Saxena
,
C. Seshadhri
SIAM Journal on Computing
41
(5), 2012, pp. 1285-1298
An optimal lower bound on the communication complexity of Gap-Hamming-Distance
Amit Chakrabarti
,
Oded Regev
SIAM Journal on Computing
41
(5), 2012, pp. 1299-1317
Santa Claus schedules jobs on unrelated machines
Ola Svensson
SIAM Journal on Computing
41
(5), 2012, pp. 1318-1341
The weakest failure detectors to solve quittable consensus and nonblocking atomic commit
Rachid Guerraoui
,
Vassos Hadzilacos
,
Petr Kuznetsov
,
Sam Toueg
SIAM Journal on Computing
41
(6), 2012, pp. 1343-1379
Transitive-closure spanners
Arnab Bhattacharyya
,
Elena Grigorescu
,
Kyomin Jung
,
Sofya Raskhodnikova
,
David P. Woodruff
SIAM Journal on Computing
41
(6), 2012, pp. 1380-1425
Quantum query complexity of minor-closed graph properties
Andrew M. Childs
,
Robin Kothari
SIAM Journal on Computing
41
(6), 2012, pp. 1426-1450
Fast information spreading in graphs with large weak conductance
Keren Censor-Hillel
,
Hadas Shachnai
SIAM Journal on Computing
41
(6), 2012, pp. 1451-1465
Reconstructing approximate phylogenetic trees from quartet samples
Sagi Snir
,
Raphael Yuster
SIAM Journal on Computing
41
(6), 2012, pp. 1466-1480
Locality from circuit lower bounds
Matthew Anderson
,
Dieter van Melkebeek
,
Nicile Schweikardt
,
Luc Segoufin
SIAM Journal on Computing
41
(6), 2012, pp. 1481-1523
On the hidden shifted power problem
Jean Bourgain
,
Moubariz Z. Garaev
,
Sergei V. Konyagin
,
Igor E. Shparlinski
SIAM Journal on Computing
41
(6), 2012, pp. 1524-1557
Agnostic learning of monomials by halfspaces is hard
Vitaly Feldman
,
Venkatesan Guruswami
,
Prasad Raghavendra
,
Yi Wu
SIAM Journal on Computing
41
(6), 2012, pp. 1558-1590
Bit-probe lower bounds for succinct data structures
Emanuele Viola
SIAM Journal on Computing
41
(6), 2012, pp. 1593-1604
Homology flows, cohomology cuts
Erin W. Chambers
,
Jeff Erickson
,
Amir Nayyeri
SIAM Journal on Computing
41
(6), 2012, pp. 1605-1634
Approximating edit distance in near-linear time
Alexandr Andoni
,
Krzysztof Onak
SIAM Journal on Computing
41
(6), 2012, pp. 1635-1648
Online and stochastic survivable network design
Aanupam Gupta
,
Ravishankar Krishnaswamy
,
R. Ravi
SIAM Journal on Computing
41
(6), 2012, pp. 1649-1672
Universally utility-maximizing privacy mechanisms
Arpita Ghosh
,
Tim Roughgarden
,
Mukund Sundararajan
SIAM Journal on Computing
41
(6), 2012, pp. 1673-1693
3-query locally decodable codes of subexponential length
Klim Efremenko
SIAM Journal on Computing
41
(6), 2012, pp. 1694-1703
Twice-Ramanujan sparsifiers
Joshua Batson
,
Daniel A. Spielman
,
Nikhil Srivastava
SIAM Journal on Computing
41
(6), 2012, pp. 1704-1721
New direct-product testers and 2-query PCPs
Russell Impagliazzo
,
Valentine Kabanets
,
Avi Wigderson
SIAM Journal on Computing
41
(6), 2012, pp. 1722-1768
Max cut and the smallest eigenvalue
Luca Trevisan
SIAM Journal on Computing
41
(6), 2012, pp. 1769-1786
Seiten
<
1
2
3