SODA 2016 - PDF Preprint Papers

SODA 2016 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2016 Paper

click to vote

SODA
2016
ACM

97views Algorithms» more SODA 2016»

Bounds for Random Constraint Satisfaction Problems via Spatial Coupling

8 years 7 months ago

Download people.inf.ethz.ch

We report on a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial coupling was invented as an en...

Dimitris Achlioptas, Seyed Hamed Hassani, Nicolas ...

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	97	Bounds for Random Constraint Satisfaction Problems via Spatial Coupling	claim
2	71	Improved Deterministic Algorithms for Linear Programming in Low Dimensions	claim
3	71	Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky	claim
4	69	Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut	claim
5	66	New directions in nearest neighbor searching with applications to lattice sieving	claim
6	65	Expanders via Local Edge Flips	claim
7	65	A Fast Approximation for Maximum Weight Matroid Intersection	claim
8	62	Communication Complexity of Permutation-Invariant Functions	claim
9	62	Clustering Problems on Sliding Windows	claim
10	61	Locality-sensitive Hashing without False Negatives	claim
11	61	Stabilizing Consensus with Many Opinions	claim
12	60	Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover	claim
13	60	Packing Small Vectors	claim
14	60	Phase Transitions in Group Testing	claim
15	59	The Restricted Isometry Property of Subsampled Fourier Matrices	claim
16	58	Make-to-Order Integrated Scheduling and Distribution	claim
17	58	Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics	claim
18	58	Improved Approximation for Vector Bin Packing	claim
19	58	Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams	claim
20	57	Towards Optimal Deterministic Coding for Interactive Communication	claim
21	57	On the maximum quartet distance between phylogenetic trees	claim
22	56	Nearly-optimal bounds for sparse recovery in generic norms, with applications to k-median sketching	claim
23	56	Evolutionary Dynamics in Finite Populations Mix Rapidly	claim
24	55	Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation	claim
25	53	Persistent Homology and Nested Dissection	claim
26	53	Sampling on Lattices with Free Boundary Conditions Using Randomized Extensions	claim
27	53	An Algorithmic Hypergraph Regularity Lemma	claim
28	53	Raising The Bar For Vertex Cover: Fixed-parameter Tractability Above A Higher Guarantee	claim
29	52	The Adversarial Noise Threshold for Distributed Protocols	claim
30	51	Communication with Contextual Uncertainty	claim
31	50	On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion	claim
32	50	Algorithms and Adaptivity Gaps for Stochastic Probing	claim
33	49	Simple Pricing Schemes For Consumers With Evolving Values	claim
34	48	Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers