Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Xi Chen 0001, Adam Freilich, Rocco A. Servedio, Timothy Sun |
Sample-Based High-Dimensional Convexity Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 37:1-37:20, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Yuval Rabani, Rakesh Venkat |
Approximating Sparsest Cut in Low Rank Graphs via Embeddings from Approximately Low Dimensional Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 21:1-21:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang 0001, Roger Wattenhofer |
Min-Cost Bipartite Perfect Matching with Delays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 1:1-1:20, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Vijay Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee |
Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 31:1-31:20, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Anna Ben-Hamou, Yuval Peres |
Cutoff for a Stratified Random Walk on the Hypercube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 29:1-29:10, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Ameya Velingker, Santhoshini Velusamy |
Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 8:1-8:19, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Dean Doron, François Le Gall, Amnon Ta-Shma |
Probabilistic Logarithmic-Space Algorithms for Laplacian Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 41:1-41:20, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Xi Chen 0001, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten |
Adaptivity Is Exponentially Powerful for Testing Monotonicity of Halfspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 38:1-38:21, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Jansen, Kim-Manuel Klein, Maria Kosche, Leon Ladewig |
Online Strip Packing with Polynomial Migration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 13:1-13:18, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Marco L. Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
Agnostic Learning from Tolerant Natural Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 35:1-35:19, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Joshua Brakensiek, Venkatesan Guruswami |
The Quest for Strong Inapproximability Results with Perfect Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 4:1-4:20, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Vedat Levi Alev, Lap Chi Lau |
Approximating Unique Games Using Low Diameter Graph Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 18:1-18:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Glencora Borradaile, Baigong Zheng |
A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 3:1-3:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Chien-Chung Huang, Naonori Kakimura, Yuichi Yoshida |
Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 11:1-11:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang |
Scheduling Problems over Network of Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pp. 5:1-5:18, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-044-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Reut Levi, Dana Ron, Ronitt Rubinfeld |
A Local Algorithm for Constructing Spanners in Minor-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 38:1-38:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Renjie Song, Yitong Yin, Jinman Zhao |
Counting Hypergraph Matchings up to Uniqueness Threshold. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 46:1-46:29, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Anup Rao 0001, Makrand Sinha |
A Direct-Sum Theorem for Read-Once Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 44:1-44:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Nir Halman |
A Deterministic Fully Polynomial Time Approximation Scheme For Counting Integer Knapsack Solutions Made Easy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 9:1-9:11, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Sharath Raghvendra |
A Robust and Optimal Online Algorithm for Minimum Metric Bipartite Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 18:1-18:16, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Samir Khuller, Sheng Yang 0005 |
Revisiting Connected Dominating Sets: An Optimal Local Algorithm? ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 11:1-11:12, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Sungjin Im, Janardhan Kulkarni, Benjamin Moseley, Kamesh Munagala |
A Competitive Flow Time Algorithm for Heterogeneous Clusters Under Polytope Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 10:1-10:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Arnab Bhattacharyya 0001, Abhishek Bhowmick 0001, Chetan Gupta |
On Higher-Order Fourier Analysis over Non-Prime Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 23:1-23:29, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Arturs Backurs, Anastasios Sidiropoulos |
Constant-Distortion Embeddings of Hausdorff Metrics into Constant-Dimensional l_p Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 1:1-1:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Jan Hazla, Thomas Holenstein, Elchanan Mossel |
Lower Bounds on Same-Set Inner Product in Correlated Spaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 34:1-34:11, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Noah Stephens-Davidowitz |
Search-to-Decision Reductions for Lattice Problems with Approximation Factors (Slightly) Greater Than One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 19:1-19:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Dana Moshkovitz, Govind Ramnarayan, Henry Yuen |
A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 42:3-42:29, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ridwan Syed, Madhur Tulsiani |
Proving Weak Approximability Without Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 20:1-20:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ravi B. Boppana, Johan Håstad, Chin Ho Lee, Emanuele Viola |
Bounded Independence vs. Moduli. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 24:1-24:9, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Guy Kortsarz, Zeev Nutov |
LP-Relaxations for Tree Augmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 13:1-13:16, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Subhash Khot, Igor Shinkar |
An ~O(n) Queries Adaptive Tester for Unateness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 37:1-37:7, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Eden Chlamtác, Michael Dinitz, Christian Konrad 0001, Guy Kortsarz, George Rabanca |
The Densest k-Subhypergraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 6:1-6:19, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Konstantin Makarychev, Yury Makarychev, Maxim Sviridenko, Justin Ward |
A Bi-Criteria Approximation Algorithm for k-Means. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 14:1-14:20, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Anthony Kim, Vahid Liaghat, Junjie Qin, Amin Saberi |
Online Energy Storage Management: an Algorithmic Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 12:1-12:23, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Prahladh Harsha, Srikanth Srinivasan 0001 |
On Polynomial Approximations to AC^0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 32:1-32:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Dániel Marx, Ario Salmasi, Anastasios Sidiropoulos |
Constant-Factor Approximations for Asymmetric TSP on Nearly-Embeddable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 16:1-16:54, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Pooya Hatami |
On the Structure of Quintic Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 33:1-33:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Victor Bapst, Amin Coja-Oghlan |
The Condensation Phase Transition in the Regular k-SAT Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 22:1-22:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Carlos Hoppen, Yoshiharu Kohayakawa, Richard Lang, Hanno Lefmann, Henrique Stagni |
Estimating Parameters Associated with Monotone Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 35:1-35:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Braverman, Alan Roytman, Gregory Vorsanger |
Approximating Subadditive Hadamard Functions on Implicit Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 25:1-25:19, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Dhruv Medarametla, Aaron Potechin |
Bounds on the Norms of Uniform Low Degree Graph Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 40:1-40:26, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Guillaume Chapuy, Guillem Perarnau |
Local Convergence and Stability of Tight Bridge-Addable Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 26:1-26:11, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Varun Kanade, Nikos Leonardos, Frédéric Magniez |
Stable Matching with Evolving Preferences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 36:1-36:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Cyril Nicaud |
Fast Synchronization of Random Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 43:1-43:12, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Program Committees, External Reviewers, List of Authors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 0:i-0:xvi, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Amin Coja-Oghlan, Will Perkins 0001 |
Belief Propagation on Replica Symmetric Random Factor Graph Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 27:1-27:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Heng Guo 0001, Pinyan Lu |
Uniqueness, Spatial Mixing, and Approximation for Ferromagnetic 2-Spin Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 31:1-31:26, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ronen Shaltiel, Jad Silbak |
Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 45:1-45:38, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Yitong Yin, Chihao Zhang 0001 |
Sampling in Potts Model on Sparse Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 47:1-47:22, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Uriel Feige, Michal Feldman, Inbal Talgam-Cohen |
Oblivious Rounding and the Integrality Gap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 8:1-8:23, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Yi Li 0002, David P. Woodruff |
Tight Bounds for Sketching the Operator Norm, Schatten Norms, and Subspace Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 39:1-39:11, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ivan Bliznets, Marek Cygan, Pawel Komosa, Michal Pilipczuk |
Hardness of Approximation for H-Free Edge Modification Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 3:1-3:17, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Ryuhei Mori, David Witmer |
Lower Bounds for CSP Refutation by SDP Hierarchies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 41:1-41:30, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Bernd Gärtner, Antonis Thomas |
The Niceness of Unique Sink Orientations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 30:1-30:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Amitabh Basu, Michael Dinitz, Xin Li 0006 |
Computing Approximate PSD Factorizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 2:1-2:12, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Michael B. Cohen, Cameron Musco, Jakub Pachocki |
Online Row Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 7:1-7:18, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Andrew McGregor 0001, Sofya Vorotnikova |
Planar Matching in Streams Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 17:1-17:12, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Pasin Manurangsi, Preetum Nakkiran, Luca Trevisan |
Near-Optimal UGC-hardness of Approximating Max k-CSP_R. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 15:1-15:28, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Esther Ezra, Shachar Lovett |
On the Beck-Fiala Conjecture for Random Set Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 29:1-29:10, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Daniel Dadush, Shashwat Garg, Shachar Lovett, Aleksandar Nikolov |
Towards a Constructive Version of Banaszczyk's Vector Balancing Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 28:1-28:12, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Moses Charikar, Yonatan Naamad, Anthony Wirth |
On Approximating Target Set Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 4:1-4:16, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Lin Chen 0009, Deshi Ye, Guochuan Zhang |
Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 5:1-5:12, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Klaus Jansen, Claire Mathieu, José D. P. Rolim, Chris Umans (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7 The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
1 | Jasine Babu, Areej Khoury, Ilan Newman |
Every Property of Outerplanar Graphs is Testable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2016, September 7-9, 2016, Paris, France, pp. 21:1-21:19, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-018-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Marco Carmosino, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova |
Tighter Connections between Derandomization and Circuit Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 645-658, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Galanis, Daniel Stefankovic, Eric Vigoda |
Swendsen-Wang Algorithm on the Mean-Field Potts Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 815-828, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Viswanath Nagarajan, Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai, Joel L. Wolf |
The Container Selection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 416-434, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingram, Andrew Warfield, Jake Wires |
Approximating Hit Rate Curves using Streaming Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 225-241, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Michael Elkin, Arnold Filtser, Ofer Neiman |
Terminal Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 242-264, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev 0001, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright 0004 |
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 110-123, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Bernhard Haeupler, Pritish Kamath, Ameya Velingker |
Communication with Partial Noiseless Feedback. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 881-897, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Braverman, Rafail Ostrovsky, Alan Roytman |
Zero-One Laws for Sliding Windows and Universal Sketches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 573-590, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | |
Frontmatter, Table of Contents, Preface, Program Commitees, External Reviewers, List of Authors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. i-xviii, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Yogesh Anbalagan, Hao Huang, Shachar Lovett, Sergey Norin, Adrian Vetta, Hehui Wu |
Large Supports are Required for Well-Supported Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 78-84, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck |
Correlation in Hard Distributions in Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 544-572, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Robin Kothari, David Racicot-Desloges, Miklos Santha |
Separating Decision Tree Complexity from Subcube Partition Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 915-930, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ittai Abraham, Shiri Chechik, Robert Krauthgamer, Udi Wieder |
Approximate Nearest Neighbor Search in Metrics of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 20-42, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Fidaa Abed, Parinya Chalermsook, José Correa 0001, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese |
On Guillotine Cutting Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 1-19, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Pasin Manurangsi, Dana Moshkovitz |
Approximating Dense Max 2-CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 396-415, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Jayadev Acharya, Clément L. Canonne, Gautam Kamath 0001 |
A Chasm Between Identity and Equivalence Testing with Conditional Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 449-466, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Zachary Friggstad, Zhihan Gao 0002 |
On Linear Programming Relaxations for Unsplittable Flow in Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 265-283, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Gil Cohen, Avishay Tal |
Two Structural Results for Low Degree Polynomials and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 680-709, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Eric Blais, Clément L. Canonne, Igor C. Oliveira, Rocco A. Servedio, Li-Yang Tan |
Learning Circuits with few Negations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 512-527, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Rong Ge 0001, Tengyu Ma 0001 |
Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 829-849, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Balthazar Bauer, Shay Moran, Amir Yehudayoff |
Internal Compression of Protocols to Entropy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 481-496, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Shiva Prasad Kasiviswanathan, Mark Rudelson |
Spectral Norm of Random Kernel Matrices with Applications to Privacy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 898-914, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu 0001 |
Improved Bounds in Stochastic Matching and Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 124-134, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Xiaoming Sun 0001, David P. Woodruff |
Tight Bounds for Graph Problems in Insertion Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 435-448, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Sebastian Berndt 0001, Klaus Jansen, Kim-Manuel Klein |
Fully Dynamic Bin Packing Revisited . ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 135-151, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Hendrik Fichtenberger, Pan Peng 0001, Christian Sohler |
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 786-799, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Euiwoong Lee |
Inapproximability of H-Transversal/Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 284-304, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Nikhil Bansal 0001, Bouke Cloostermans |
Minimizing Maximum Flow-time on Related Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 85-95, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Victor Bapst, Amin Coja-Oghlan |
Harnessing the Bethe Free Energy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 467-480, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Naveen Garg 0001, Klaus Jansen, Anup Rao 0001, José D. P. Rolim (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7 The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
1 | Shiri Chechik, Edith Cohen, Haim Kaplan |
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 659-679, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Charilaos Efthymiou 0001 |
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 756-774, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Braverman, Stephen R. Chestnut |
Universal Sketches for the Frequency Negative Moments and Other Decreasing Streaming Sums. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 591-605, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Marek Cygan, Tomasz Kociumaka |
Approximating Upper Degree-Constrained Partial Orientations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 212-224, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Ilya Volkovich |
Deterministically Factoring Sparse Polynomials into Multilinear Factors and Sums of Univariate Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 943-958, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
1 | Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, Euiwoong Lee |
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2015, August 24-26, 2015, Princeton, NJ, USA, pp. 152-174, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-89-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|