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=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Infinitely-often autoreducible sets
Richard Beigel
,
Lance Fortnow
,
Frank Stephan
SIAM Journal on Computing
36
(3), 2006, pp. 595-608
An extension of the Lovász local lemma, and its applications to integer programming
Aravind Srinivasan
SIAM Journal on Computing
36
(3), 2006, pp. 609-634
Approximating longest cycles in graphs with bounded degrees
Guantao Chen
,
Zhicheng Gao
,
Xingxing Yu
,
Wenan Zang
SIAM Journal on Computing
36
(3), 2006, pp. 635-656
Fairness measures for resource allocation
Amit Kumar
,
Jon Kleinberg
SIAM Journal on Computing
36
(3), 2006, pp. 657-680
Dynamic subgraph connectivity with geometric applications
Timothy M. Chan
SIAM Journal on Computing
36
(3), 2006, pp. 681-694
On the number of crossing-free matchings, cycles, and partitions
Micha Sharir
,
Emo Welzl
SIAM Journal on Computing
36
(3), 2006, pp. 695-720
Counting and enumerating pointed pseudotriangulations with the greedy flip algorithm
Hervé Brönnimann
,
Lutz Kettner
,
Michel Pocchiola
,
Jack Snoeyink
SIAM Journal on Computing
36
(3), 2006, pp. 721-739
Random
k
-SAT: Two moments suffice to cross a sharp threshold
Dimitris Achlioptas
,
Cristopher Moore
SIAM Journal on Computing
36
(3), 2006, pp. 740-762
Quantum algorithms for some hidden shift problems
Wim van Dam
,
Sean Hallgren
,
Lawrence Ip
SIAM Journal on Computing
36
(3), 2006, pp. 763-778
Testing polynomials over general fields
Tali Kaufman
,
Dana Ron
SIAM Journal on Computing
36
(3), 2006, pp. 779-802
Exponential determinization for
\omega
-automata with a strong fairness acceptance condition
Shmuel Safra
SIAM Journal on Computing
36
(3), 2006, pp. 803-814
Computing maximally separated sets in the plane
Pankaj K. Agarwal
,
Mark Overmars
,
Micha Sharir
SIAM Journal on Computing
36
(3), 2006, pp. 815-834
A probabilistic approach to the dichotomy problem
Tomasz Łuczak
,
Jaroslav Nes̑etȓil
SIAM Journal on Computing
36
(3), 2006, pp. 835-843
Cryptography in NC
^0
Benny Applebaum
,
Yuval Ishai
,
Eyal Kushilevitz
SIAM Journal on Computing
36
(4), 2006, pp. 845-888
Robust PCPs of proximity, shorter PCPs, and applications to coding
Eli Ben-Sasson
,
Oded Goldreich
,
Prahladh Harsha
,
Madhu Sudan
,
Salil Vadhan
SIAM Journal on Computing
36
(4), 2006, pp. 889-974
Assignment testers: Towards a combinatorial proof of the PCP theorem
Irit Dinur
,
Omer Reingold
SIAM Journal on Computing
36
(4), 2006, pp. 975-1024
Ruling out PTAS for graph min-bisection, dense
k
-subgraph, and bipartite clique
Subhash Khot
SIAM Journal on Computing
36
(4), 2006, pp. 1025-1071
Deterministic extractors for bit-fixing sources by obtaining an independent seed
Ariel Gabizon
,
Ran Raz
,
Ronen Shaltiel
SIAM Journal on Computing
36
(4), 2006, pp. 1072-1094
Extracting randomness using few independent sources
Boaz Barak
,
Russell Impagliazzo
,
Avi Wigderson
SIAM Journal on Computing
36
(4), 2006, pp. 1095-1118
On worst-case to average-case reductions for
NP
problems
Andrej Bogdanov
,
Luca Trevisan
SIAM Journal on Computing
36
(4), 2006, pp. 1119-1159
An unconditional study of computational zero knowledge
Salil P. Vadhan
SIAM Journal on Computing
36
(4), 2006, pp. 1160-1214
Derandomizing homomorphism testing in general groups
Amir Shpilka
,
Avi Wigderson
SIAM Journal on Computing
36
(4), 2006, pp. 1215-1230
General multiprocessor task scheduling: Approximate solutions in linear time
Klaus Jansen
,
Lorant Porkolab
SIAM Journal on Computing
35
(3), 2005-2006, pp. 519-530
Optimal covering tours with turn costs
Esther M. Arkin
,
Michael A. Bender
,
Erik D. Demaine
,
Sándor P. Fekete
,
Joseph S.B. Mitchell
,
Saurabh Sethia
SIAM Journal on Computing
35
(3), 2005-2006, pp. 531-566
On the complexity of network synchronization
Darin Goldstein
,
Kojiro Kobayashi
SIAM Journal on Computing
35
(3), 2005-2006, pp. 567-589
Seiten
<
1
2
3
4
>