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=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounded-error quantum state identification and exponential separations in communication complexity
Dmitry Gavinsky
,
Julia Kempe
,
Oded Regev
,
Ronald de Wolf
SIAM Journal on Computing
39
(1), 2009, pp. 1-24
Zero-knowledge against quantum attacks
John Watrous
SIAM Journal on Computing
39
(1), 2009, pp. 25-58
Narrow proofs may be spacious: Separating space and width in resolution
Jakob Nordström
SIAM Journal on Computing
39
(1), 2009, pp. 59-121
On maximizing welfare when utility functions are subadditive
Uriel Feige
SIAM Journal on Computing
39
(1), 2009, pp. 122-142
A combinatorial characterization of the testable graph properties: It's all about regularity
Noga Alon
,
Eldar Fischer
,
Ilan Newman
,
Asaf Shapira
SIAM Journal on Computing
39
(1), 2009, pp. 143-167
Extractors for a constant number of polynomially small min-entropy independent sources
Anup Rao
SIAM Journal on Computing
39
(1), 2009, pp. 168-194
The complexity of computing a Nash equilibrium
Constantinos Daskalakis
,
Paul W. Goldberg
,
Christos H. Papadimitriou
SIAM Journal on Computing
39
(1), 2009, pp. 195-259
Random formulas have frozen variables
Dimitris Achlioptas
,
Federico Ricci-Tersenghi
SIAM Journal on Computing
39
(1), 2009, pp. 260-280
Edge-disjoint paths in planar graphs with constant congestion
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
SIAM Journal on Computing
39
(1), 2009, pp. 281-301
The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
Nir Ailon
,
Bernard Chazelle
SIAM Journal on Computing
39
(1), 2009, pp. 302-322
Gowers uniformity, influence of variables, and PCPs
Alex Samorodnitsky
,
Luca Trevisan
SIAM Journal on Computing
39
(1), 2009, pp. 323-360
The online set cover problem
Noga Alon
,
Baruch Awerbuch
,
Yossi Azar
,
Niv Buchbinder
,
Joseph (Seffi) Naor
SIAM Journal on Computing
39
(2), 2009, pp. 361-370
On earthmover distance, metric labeling, and 0-extension
Howard Karloff
,
Subhash Khot
,
Aranyak Mehta
,
Yuval Rabani
SIAM Journal on Computing
39
(2), 2009, pp. 371-387
Sparse algebraic equations over finite fields
Igor Semaev
SIAM Journal on Computing
39
(2), 2009, pp. 388-409
The power of extended top-down tree transducers
Andreas Maletti
,
Jonathan Graehl
,
Mark Hopkins
,
Kevin Knight
SIAM Journal on Computing
39
(2), 2009, pp. 410-430
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
Artur Czumaj
,
Andrzej Lingas
SIAM Journal on Computing
39
(2), 2009, pp. 431-444
Distributed approximate matching
Zvi Lotker
,
Boaz Patt-Shamir
,
Adi Rosén
SIAM Journal on Computing
39
(2), 2009, pp. 445-460
A near-tight approximation algorithm for the robot localization problem
Sven Koenig
,
Joseph S.B. Mitchell
,
Apurva Mudgal
,
Craig Tovey
SIAM Journal on Computing
39
(2), 2009, pp. 461-490
Combinatorial construction of locally testable codes
Or Meir
SIAM Journal on Computing
39
(2), 2009, pp. 491-544
Set partitioning via inclusion-exclusion
Andreas Björklund
,
Thore Husfeldt
,
Mikko Koivisto
SIAM Journal on Computing
39
(2), 2009, pp. 546-563
Approximate list-decoding of direct product codes and uniform hardness amplification
Russell Impagliazzo
,
Ragesh Jaiswal
,
Valentine Kabanets
SIAM Journal on Computing
39
(2), 2009, pp. 564-605
On agnostic learning of parities, monomials, and halfspaces
Vitaly Feldman
,
Parikshit Gopalan
,
Subhash Khot
,
Ashok Kumar Ponnuswami
SIAM Journal on Computing
39
(2), 2009, pp. 606-645
Beyond Hirsch conjecture: Walks on random polytopes and smoothed complexity of the simplex method
Roman Vershynin
SIAM Journal on Computing
39
(2), 2009, pp. 646-678
Algebraic algorithms for matching and matroid problems
Nicholas J.A. Harvey
SIAM Journal on Computing
39
(2), 2009, pp. 679-702
Transdichotomous results in computational geometry, I: Point location in sublogarithmic time
Timothy M. Chan
,
Mihai Pȃtraşcu
SIAM Journal on Computing
39
(2), 2009, pp. 703-729
Seiten 1
2
3
4
>