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=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Position-based cryptography
Nishanth Chandran
,
Vipul Goyal
,
Ryan Moriarty
,
Rafail Ostrovsky
SIAM Journal on Computing
43
(4), 2014, pp. 1291-1341
Approximating minimum-cost
k
-node connected subgraphs via independence-free graphs
Joseph Cheriyan
,
László A. Végh
SIAM Journal on Computing
43
(4), 2014, pp. 1342-1362
Reporting neighbors in high-dimensional Euclidean space
Dror Aiger
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
43
(4), 2014, pp. 1363-1395
Managing unbounded-length keys in comparison-driven data structures with applications to online indexing
Amihood Amir
,
Gianni Franceschini
,
Roberto Grossi
,
Tsvi Kopelowitz
,
Moshe Lewenstein
,
Noa Lewenstein
SIAM Journal on Computing
43
(4), 2014, pp. 1396-1416
Correlation testing for affine invariant properties on
\mathbb{F}_p^n
in the high error regime
Hamed Hatami
,
Shachar Lovett
SIAM Journal on Computing
43
(4), 2014, pp. 1417-1455
Analyzing Walksat on random formulas
Amin Coja-Oghlan
,
Alan Frieze
SIAM Journal on Computing
43
(4), 2014, pp. 1456-1485
Down the rabbit hole: Robust proximity search and density estimation in sublinear space
Sariel Har-Peled
,
Nirman Kumar
SIAM Journal on Computing
43
(4), 2014, pp. 1486-1511
Impossibility of differentially private universally optimal mechanisms
Hai Brenner
,
Kobbi Nissim
SIAM Journal on Computing
43
(5), 2014, pp. 1513-1540
Almost optimal lower bounds for problems parameterized by clique-width
Fedor V. Fomin
,
Petr A. Golovach
,
Daniel Lokshtanov
,
Saket Saurabh
SIAM Journal on Computing
43
(5), 2014, pp. 1541-1563
Protecting circuits from computationally bounded and noisy leakage
Sebastian Faust
,
Tal Rabin
,
Leonid Reyzin
,
Eran Tromer
,
Vinod Vaikuntanathan
SIAM Journal on Computing
43
(5), 2014, pp. 1564-1614
Voting with limited information and many alternatives
Flavio Chierichetti
,
Jon Kleinberg
SIAM Journal on Computing
43
(5), 2014, pp. 1615-1653
New bounds for matching vector families
Abhishek Bhowmick
,
Zeev Dvir
,
Shacher Lovett
SIAM Journal on Computing
43
(5), 2014, pp. 1654-1683
The geometry of scheduling
Nikhil Bansal
,
Kirk Pruhs
SIAM Journal on Computing
43
(5), 2014, pp. 1684-1698
On the correlation of parity and small-depth circuits
Johan Håstad
SIAM Journal on Computing
43
(5), 2014, pp. 1699-1708
Time hierarchies for sampling distributions
Thomas Watson
SIAM Journal on Computing
43
(5), 2014, pp. 1709-1727
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
Martin C̑adek
,
Marek Krc̑ál
,
Jiȓí Matous̑ek
,
Lukás Vokȓínek
,
Uli Wagner
SIAM Journal on Computing
43
(5), 2014, pp. 1728-1780
Optimal dynamic sequence representations
Gonzalo Navarro
,
Yakov Nekrich
SIAM Journal on Computing
43
(5), 2014, pp. 1781-1806
Matroid secretary for regular and decomposable matroids
Michael Dinitz
,
Guy Kortsarz
SIAM Journal on Computing
43
(5), 2014, pp. 1807-1830
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Chandra Chekuri
,
Jan Vondrák
,
Rico Zenklusen
SIAM Journal on Computing
43
(6), 2014, pp. 1831-1879
Recognizing well-parenthesized expressions in the streaming model
Frédéric Magniez
,
Claire Mathieu
,
Ashwin Nayak
SIAM Journal on Computing
43
(6), 2014, pp. 1880-1905
How to schedule a cascade in an arbitrary graph
Flavio Chierichetti
,
Jon Kleinberg
,
Alessandro Panconesi
SIAM Journal on Computing
43
(6), 2014, pp. 1906-1920
The complexity of computing the sign of the Tutte polynomial
Leslie Ann Goldberg
,
Mark Jerrum
SIAM Journal on Computing
43
(6), 2014, pp. 1921-1952
Seiten
<
1
2
3