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.
Hidden translation and translating coset in quantum computing
Katalin Friedl
,
Gábor Ivanyos
,
Frédéric Magniez
,
Miklos Santha
,
Pranab Sen
SIAM Journal on Computing
43
(1), 2014, pp. 1-24
On a linear program for minimum-weight triangulation
Arman Yousefi
,
Neal E. Young
SIAM Journal on Computing
43
(1), 2014, pp. 25-51
A size-popularity tradeoff in the stable marriage problem
Telikepalli Kavitha
SIAM Journal on Computing
43
(1), 2014, pp. 52-71
Distributed
(\Delta+1)
-coloring in linear (in
\Delta
) time
Leonid Barenboim
,
Michael Elkin
,
Fabian Kuhn
SIAM Journal on Computing
43
(1), 2014, pp. 72-95
The generalized work function algorithm is competitive for the generalized 2-server problem
René Sitters
SIAM Journal on Computing
43
(1), 2014, pp. 96-125
Online scheduling with general cost functions
Sungjin Im
,
Benjamin Moseley
,
Kirk Pruhs
SIAM Journal on Computing
43
(1), 2014, pp. 126-143
New lower bounds for the rank of matrix multiplication
J.M. Landsberg
SIAM Journal on Computing
43
(1), 2014, pp. 144-149
Position-based quantum cryptography: Impossibility and constructions
Harry Buhrman
,
Nishanth Chandran
,
Serge Fehr
,
Ran Gelles
,
Vipul Goyal
,
Ravail Ostrovsky
,
Christian Schaffner
SIAM Journal on Computing
43
(1), 2014, pp. 150-178
On the NP-hardness of Max-Not-2
Johan Håstad
SIAM Journal on Computing
43
(1), 2014, pp. 179-193
Characterizing truthful multi-armed bandit mechanisms
Moshe Babaioff
,
Yogeshwer Sharma
,
Aleksandrs Slivkins
SIAM Journal on Computing
43
(1), 2014, pp. 194-230
Average sensitivity and noise sensitivity of polynomial threshold functions
Ilias Diakonikolas
,
Prasad Raghavendra
,
Rocco A. Servedio
,
Li-Yang Tan
SIAM Journal on Computing
43
(1), 2014, pp. 231-253
Erratum to ``Polynomial time algorithms for finding integer relations among real numbers''
J. Håstad
,
B. Just
,
J.C. Lagarias
,
C.P. Schnorr
SIAM Journal on Computing
43
(1), 2014, pp. 254-254
The monotone complexity of
k
-clique on random graphs
Benjamin Rossman
SIAM Journal on Computing
43
(1), 2014, pp. 256-279
Determinant sums for undirected hamiltonicity
Andreas Björklund
SIAM Journal on Computing
43
(1), 2014, pp. 280-299
Distance oracles beyond the Thorup-Zwick bound
Mihai Pa̧traşcu
,
Liam Roditty
SIAM Journal on Computing
43
(1), 2014, pp. 300-311
Black-box randomized reductions in algorithmic mechanism design
Shaddin Dughmi
,
Tim Roughgarden
SIAM Journal on Computing
43
(1), 2014, pp. 312-336
Approaching optimality for solving SDD linear systems
Ioannis Koutis
,
Gary L. Miller
,
Richard Peng
SIAM Journal on Computing
43
(1), 2014, pp. 337-354
Fixed-parameter tractability of multicut parameterized by the size of the cutset
Daniel Marx
,
Igor Razgon
SIAM Journal on Computing
43
(2), 2014, pp. 355-388
Coin flipping with constant bias implies one-way functions
Iftach Haitner
,
Eran Omri
SIAM Journal on Computing
43
(2), 2014, pp. 389-409
Approximate shortest descending paths
Siu-Wing Cheng
,
Jiongxin Jin
SIAM Journal on Computing
43
(2), 2014, pp. 410-428
Computing the discrete Fréchet distance in subquadratic time
Pankaj K. Agarwal
,
Rinat Ben Avraham
,
Haim Kaplan
,
Micha Sharir
SIAM Journal on Computing
43
(2), 2014, pp. 429-449
Nonmalleable extractors with short seeds and applications to privacy amplification
Gil Cohen
,
Ran Raz
,
Gil Segev
SIAM Journal on Computing
43
(2), 2014, pp. 450-476
Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits
Hsueh-I Lu
SIAM Journal on Computing
43
(2), 2014, pp. 477-496
Expanders via random spanning trees
Alan Frieze
,
Navin Goyal
,
Luis Rademacher
,
Santosh Vempala
SIAM Journal on Computing
43
(2), 2014, pp. 497-513
Monotone submodular maximization over a matroid via non-oblivious local search
Yuval Filmus
,
Justin Ward
SIAM Journal on Computing
43
(2), 2014, pp. 514-542
Seiten 1
2
3
>