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

160views Algorithms» more STOC 2009»

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

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

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers