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=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
Daniel A. Spielman
,
Shang-Hua Teng
SIAM Journal on Computing
42
(1), 2013, pp. 1-26
A dichotomy theorem for the resolution complexity of random constraint satisfaction problems
Siu On Chan
,
Michael Molloy
SIAM Journal on Computing
42
(1), 2013, pp. 27-60
Information cost tradeoffs for augmented index and streaming language recognition
Amit Chakrabarti
,
Graham Cormode
,
Ranganath Kondapally
,
Andrew McGregor
SIAM Journal on Computing
42
(1), 2013, pp. 61-83
Error-correcting data structures
Victor Chen
,
Elena Grigorescu
,
Ronald de Wolf
SIAM Journal on Computing
42
(1), 2013, pp. 84-111
Sherali-Adams relaxations and indistinguishability in counting logics
Albert Atserias
,
Elitza Maneva
SIAM Journal on Computing
42
(1), 2013, pp. 112-137
Approximate nearest neighbor search for low-dimensional queries
Sariel Har-Peled
,
Nirman Kumar
SIAM Journal on Computing
42
(1), 2013, pp. 138-159
The price of routing unsplittable flow
Baruch Awerbuch
,
Yossi Azar
,
Amir Epstein
SIAM Journal on Computing
42
(1), 2013, pp. 160-177
Matroid secretary problem in the random-assignment model
José A. Soto
SIAM Journal on Computing
42
(1), 2013, pp. 178-211
The limits of buffering: A tight lower bound for dynamic membership in the external memory model
Elad Verbin
,
Qin Zhang
SIAM Journal on Computing
42
(1), 2013, pp. 212-229
Circumventing the price of anarchy: Leading dynamics to good behavior
Maria-Florina Balcan
,
Avrim Blum
,
Yishay Mansour
SIAM Journal on Computing
42
(1), 2013, pp. 230-264
Symmetry and approximability of submodular maximization problems
Jan Vondrák
SIAM Journal on Computing
42
(1), 2013, pp. 265-304
Noise tolerance of expanders and sublinear expansion reconstruction
Satyen Kale
,
Yuval Peres
,
C. Seshadhri
SIAM Journal on Computing
42
(1), 2013, pp. 305-323
The complexity of symmetric Boolean parity Holant problems
Heng Guo
,
Pinyan Lu
,
Lelie G. Valiant
SIAM Journal on Computing
42
(1), 2013, pp. 324-356
Matroid matching: The power of local search
Jon Lee
,
Maxim Sviridenko
,
Jan Vondrák
SIAM Journal on Computing
42
(1), 2013, pp. 357-379
IP = PSPACE using error-correcting codes
Or Meir
SIAM Journal on Computing
42
(1), 2013, pp. 380-403
Threshold phenomena in
k
-dominant skylines of random samples
Hsien-Kuei Hwang
,
Tsung-Hsi Tsai
,
Wei-Mei Chen
SIAM Journal on Computing
42
(2), 2013, pp. 405-441
Embeddings of surfaces, curves, and moving points in Euclidean space
Pankai K. Agarwal
,
Sariel Har-Peled
,
Hai Yu
SIAM Journal on Computing
42
(2), 2013, pp. 442-458
Nearly tight bounds for testing function isomorphism
Noga Alon
,
Eric Blais
,
Sourav Chakraborty
,
David García-Soriano
,
Arie Matsliah
SIAM Journal on Computing
42
(2), 2013, pp. 459-493
Contractions, removals, and certifying 3-connectivity in linear time
Jens M. Schmidt
SIAM Journal on Computing
42
(2), 2013, pp. 494-535
Optimal testing of multivariate polynomials over small prime fields
Elad Haramaty
,
Amir Shpilka
,
Madhu Sudan
SIAM Journal on Computing
42
(2), 2013, pp. 536-562
Reconstruction of Markov random fields from samples: Some observations and algorithms
Guy Bresler
,
Elchanan Mossel
,
Allan Sly
SIAM Journal on Computing
42
(2), 2013, pp. 563-578
A harmonic algorithm for the 3D strip packing problem
Nikhil Bansal
,
Xin Han
,
Kazuo Iwama
,
Maxim Sviridenko
,
Guochuan Zhang
SIAM Journal on Computing
42
(2), 2013, pp. 579-592
Spectral gap amplification
R.D. Somma
,
S. Boixo
SIAM Journal on Computing
42
(2), 2013, pp. 593-610
Pattern matching under polynomial transformation
Ayelet Butman
,
Peter Clifford
,
Raphaël Clifford
,
Markus Jalsenius
,
Noa Lewenstein
,
Benny Porat
,
Ely Porat
,
Benjamin Sach
SIAM Journal on Computing
42
(2), 2013, pp. 611-633
Link reversal routing with binary link labels: Work complexity
Bernadette Charron-Bost
,
Antoine Gaillard
,
Jennifer L. Welch
,
Josef Widder
SIAM Journal on Computing
42
(2), 2013, pp. 634-661
Seiten 1
2
3
4
>