STOC 2009 - PDF Preprint Papers

STOC 2009 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2009 Paper

click to vote

STOC
2009
ACM

364views Algorithms» more STOC 2009»

Distributed (delta+1)-coloring in linear (in delta) time

15 years 1 days ago

Download www.cs.bgu.ac.il

Leonid Barenboim, Michael Elkin

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	364	Distributed (delta+1)-coloring in linear (in delta) time	claim
2	271	A fast and efficient algorithm for low-rank approximation of a matrix	claim
3	238	On the convergence of regret minimization dynamics in concave games	claim
4	238	Fully homomorphic encryption using ideal lattices	claim
5	224	3-query locally decodable codes of subexponential length	claim
6	187	Artin automorphisms, cyclotomic function fields, and folded list-decodable codes	claim
7	182	Approximating edit distance in near-linear time	claim
8	181	The detectability lemma and quantum gap amplification	claim
9	172	Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems	claim
10	171	On the geometry of graphs with a forbidden minor	claim
11	168	Fault-tolerant spanners for general graphs	claim
12	167	Universally utility-maximizing privacy mechanisms	claim
13	167	On the complexity of communication complexity	claim
14	163	Non-monotone submodular maximization under matroid and knapsack constraints	claim
15	161	List decoding tensor products and interleaved codes	claim
16	160	CSP gaps and reductions in the lasserre hierarchy	claim
17	159	Message passing algorithms and improved LP decoding	claim
18	156	Polynomial-time theory of matrix groups	claim
19	155	A nearly optimal oracle for avoiding failed vertices and edges	claim
20	152	Small-size epsilon-nets for axis-parallel rectangles and boxes	claim
21	152	Green's conjecture and testing linear-invariant properties	claim
22	150	Integrality gaps for Sherali-Adams relaxations	claim
23	146	Conditional hardness for satisfiable 3-CSPs	claim
24	145	Finding, minimizing, and counting weighted subgraphs	claim
25	145	Differential privacy and robust statistics	claim
26	145	Intrinsic robustness of the price of anarchy	claim
27	145	Non-malleable extractors and symmetric key cryptography from weak secrets	claim
28	144	Homology flows, cohomology cuts	claim
29	143	Affine dispersers from subspace polynomials	claim
30	139	Online and stochastic survivable network design	claim
31	137	Mixing time for the solid-on-solid model	claim
32	136	Random walks on polytopes and an affine interior point method for linear programming	claim
33	133	New direct-product testers and 2-query PCPs	claim
34	133	Near-perfect load balancing by randomized rounding	claim
35	133	Numerical linear algebra in the streaming model	claim
36	123	An improved constant-time approximation algorithm for maximum~matchings	claim
37	120	A constant-factor approximation for stochastic Steiner forest	claim
38	120	An efficient algorithm for partial order production	claim
39	120	Bit-probe lower bounds for succinct data structures	claim
40	120	Short seed extractors against quantum storage	claim
41	119	Explicit construction of a small epsilon-net for linear threshold functions	claim
42	118	How long does it take to catch a wild kangaroo?	claim
43	113	The extended BG-simulation and the characterization of t-resiliency	claim
44	112	A new approach to auctions and resilient mechanism design	claim
45	107	Efficient discrete-time simulations of continuous-time quantum query algorithms	claim
46	106	On proximity oblivious testing	claim
47	106	Random graphs and the parity quantifier	claim
48	106	An axiomatic approach to algebrization	claim
49	106	Max cut and the smallest eigenvalue	claim
50	102	Multiple intents re-ranking	claim
51	99	Testing juntas nearly optimally	claim
52	98	Sherali-adams relaxations of the matching polytope	claim
53	96	MaxMin allocation via degree lower-bounded arborescences	claim
54	91	Inaccessible entropy	claim
55	87	Randomly supported independence and resistance	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers