SODA 2010 - PDF Preprint Papers

SODA 2010 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2010 Paper

click to vote

SODA
2010
ACM

279views Algorithms» more SODA 2010»

Shape Replication Through Self-Assembly and RNase Enzymes

1 years 11 months ago

Download www.cs.panam.edu

We introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will re...

Zachary Abel, Nadia Benbernou, Mirela Damian, Erik...

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	279	Shape Replication Through Self-Assembly and RNase Enzymes	claim
2	249	Data Structures for Range Minimum Queries in Multidimensional Arrays	claim
3	222	Online Learning with Queries	claim
4	190	Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls	claim
5	144	A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover	claim
6	137	Rumour spreading and graph conductance	claim
7	135	A locality-sensitive hash for real vectors	claim
8	134	The edge disjoint paths problem in Eulerian graphs and $4$-edge-connected graphs	claim
9	128	On the Optimality of Spiral Search	claim
10	115	A Model of Computation for MapReduce	claim
11	112	Faster exponential time algorithms for the shortest vector problem	claim
12	106	Compact Ancestry Labeling Schemes for XML Trees	claim
13	102	Lower Bounds for Sparse Recovery	claim
14	101	How good is the Chord algorithm?	claim
15	98	A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics	claim
16	96	Fully-Functional Succinct Trees	claim
17	96	On linear and semidefinite programming relaxations for hypergraph matching	claim
18	94	Reconstructing approximate phylogenetic trees from quartet samples	claim
19	92	Algorithms and Complexity for Periodic Real-Time Scheduling	claim
20	91	Streaming Algorithms for extent problems in high dimensions	claim
21	87	Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs	claim
22	86	An Improved Competitive Algorithm for Reordering Buffer Management	claim
23	82	Bidimensionality and Kernels	claim
24	82	Property Testing and Parameter Testing for Permutations	claim
25	82	Fast SDP Algorithms for Constraint Satisfaction Problems	claim
26	82	Deletion Without Rebalancing in Balanced Binary Trees	claim
27	81	PTAS for maximum weight independent set problem with random weights in bounded degree graphs	claim
28	81	Efficient Broadcast on Random Geometric Graphs	claim
29	81	VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension	claim
30	81	Efficiently Decodable Non-adaptive Group Testing	claim
31	80	Monotonicity in Bargaining Networks	claim
32	80	Approximability of Robust Network Design	claim
33	80	An Improved Construction of Progression-Free Sets	claim
34	80	Lower Bounds for Testing Triangle-freeness in Boolean Functions	claim
35	79	Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface	claim
36	78	EDF-schedulability of synchronous periodic task systems is coNP-hard	claim
37	77	On the possibility of faster SAT algorithms	claim
38	77	Algorithms for ray class groups and Hilbert class fields	claim
39	77	Asymmetric Traveling Salesman Path and Directed Latency Problems	claim
40	76	SRPT is 1.86-Competitive for Completion Time Scheduling	claim
41	75	A deterministic truthful PTAS for scheduling related machines	claim
42	75	Maximum Flows and Parametric Shortest Paths in Planar Graphs	claim
43	75	An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem	claim
44	75	A Space--Time Tradeoff for Permutation Problems	claim
45	74	Sharp kernel clustering algorithms and their associated Grothendieck inequalities	claim
46	74	Differentially Private Approximation Algorithms	claim
47	74	Convergence, Stability, and Discrete Approximation of Laplace Spectra	claim
48	72	Algorithmic Lower Bounds for Problems Parameterized by Clique-width	claim
49	72	On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second Order Logic	claim
50	72	The forest hiding problem	claim
51	72	Finding the Jaccard Median	claim
52	71	A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing	claim
53	71	Inapproximability for planar embedding problems	claim
54	70	Fast distance multiplication of unit-Monge matrices	claim
55	70	An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling	claim
56	70	Solving Simple Stochastic Tail Games	claim
57	70	Tree Embeddings for Two-Edge-Connected Network Design	claim
58	69	Optimally Reconstructing Weighted Graphs Using Queries	claim
59	69	Vertices of Degree k in Random Maps	claim
60	69	A Fourier space algorithm for solving quadratic assignment problems	claim
61	69	Highway Dimension, Shortest Paths, and Provably Efficient Algorithms	claim
62	69	Solving the Replacement Paths Problem for Planar Directed Graphs in O(n*log n) Time	claim
63	69	Incentive Compatible Budget Elicitation in Multi-unit Auctions	claim
64	69	Cell-probe lower bounds for prefix sums and matching brackets	claim
65	68	Utilitarian Mechanism Design for Multi-Objective Optimization	claim
66	68	Quasirandom Load Balancing	claim
67	68	Paired Approximation Problems and Incompatible Inapproximabilities	claim
68	67	Road Network Reconstruction for Organizing Paths	claim
69	67	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem	claim
70	67	One-Counter Markov Decision Processes	claim
71	66	Differentially Private Combinatorial Optimization	claim
72	66	On the Exact Space Complexity of Sketching and Streaming Small Norms	claim
73	66	Towards a calculus for non-linear spectral gaps	claim
74	65	Correlation Robust Stochastic Optimization	claim
75	65	Resource Minimization for Fire Containment	claim
76	65	Data-Specific Analysis of String Sorting	claim
77	64	Distributed Agreement with Optimal Communication Complexity	claim
78	63	Geometric optimization and sums of algebraic functions	claim
79	63	Near-Optimal Sublinear Time Algorithms for Ulam Distance	claim
80	63	Correlation Clustering with Noisy Input	claim
81	63	Basis Reduction, and the Complexity of Branch-and-Bound	claim
82	63	The scaling window for a random graph with a given degree sequence	claim
83	62	Towards the Randomized k-Server Conjecture: A Primal-Dual Approach	claim
84	62	Regular Expression Matching with Multi-Strings	claim
85	61	Amplified Hardness of Approximation for VCG-Based Mechanisms	claim
86	61	Self-improving Algorithms for Convex Hulls	claim
87	61	The focus of attention problem	claim
88	61	Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms	claim
89	60	A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks	claim
90	60	1-Pass Relative-Error Lp-Sampling with Applications	claim
91	60	Counting Stars and Other Small Subgraphs in Sublinear Time	claim
92	60	Counting Inversions, Offline Orthogonal Range Counting, and Related Problems	claim
93	59	Terrain Guarding is NP-Hard	claim
94	59	Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications	claim
95	59	Coresets and Sketches for High Dimensional Subspace Approximation Problems	claim
96	59	The Complexity of Guarding Terrains	claim
97	58	Testing additive integrality gaps	claim
98	58	Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees	claim
99	58	On the Cell Probe Complexity of Dynamic Membership	claim
100	55	Testing monotone high-dimensional distributions	claim
101	55	Solving MAX-r-SAT Above a Tight Lower Bound	claim
102	53	Differential Privacy in New Settings	claim
103	53	Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs	claim
104	52	Classified Stable Matching	claim
105	52	Price of Anarchy for Greedy Auctions	claim
106	51	Testing Monotone Continuous Distributions on High-dimensional Real Cubes	claim
107	50	Lower bounds for Edit Distance and Product Metrics via Poincare-Type Inequalities	claim
108	50	Energy Efficient Scheduling via Partial Shutdown	claim
109	50	Genus and the Geometry of the Cut Graph	claim
110	50	Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies	claim
111	47	Hardness Results for Homology Localization	claim
112	45	Speeding up random walks with neighborhood exploration	claim
113	44	On the Equilibria of Alternating Move Games	claim
114	44	Inapproximability for VCG-Based Combinatorial Auctions	claim
115	44	Cell-Probe Lower Bounds for Succinct Partial Sums	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers