Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Buddhima Gamlath, Vadim Grinberg |
Approximating Star Cover Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 57:1-57:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Spoorthy Gunda, Pallavi Jain 0001, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale |
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 51:1-51:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Jaroslaw Byrka, Raghu Meka (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1 The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
1 | Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li 0001, Daniel Vaz 0001, Jiayi Xian |
On Approximating Degree-Bounded Network Design Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 39:1-39:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Roy Schwartz 0002, Yotam Sharoni |
Approximating Requirement Cut via a Configuration LP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 53:1-53:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Alexandr Andoni, Collin Burns, Yi Li 0002, Sepideh Mahabadi, David P. Woodruff |
Streaming Complexity of SVMs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 50:1-50:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eden Chlamtác, Petr Kolman |
How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 41:1-41:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Reut Levi, Moti Medina |
Distributed Testing of Graph Isomorphism in the CONGEST Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 19:1-19:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Linh V. Tran, Van Vu |
Reaching a Consensus on Random Networks: The Power of Few. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 20:1-20:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Waldo Gálvez, Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan 0001, Malin Rau |
A Tight (3/2+ε) Approximation for Skewed Strip Packing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 44:1-44:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Nader H. Bshouty |
Almost Optimal Testers for Concise Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 5:1-5:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski |
Improved Circular k-Mismatch Sketches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 46:1-46:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dana Ron, Asaf Rosin |
Almost Optimal Distribution-Free Sample-Based Testing of k-Modality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 27:1-27:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Zeyu Guo 0001, Rohit Gurjar |
Improved Explicit Hitting-Sets for ROABPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 4:1-4:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Varun Gupta 0004, Ravishankar Krishnaswamy, Sai Sandeep |
Permutation Strikes Back: The Power of Recourse in Online Metric Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 40:1-40:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters |
Bounds for List-Decoding and List-Recovery of Random Linear Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 9:1-9:21, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Catherine S. Greenhill, Bernard Mans, Ali Pourmiri |
Balanced Allocation on Dynamic Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 11:1-11:22, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Shalev Ben-David, Mika Göös, Robin Kothari, Thomas Watson 0001 |
When Is Amplification Necessary for Composition in Randomized Query Complexity? ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 28:1-28:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Ronen Shaltiel |
Is It Possible to Improve Yao's XOR Lemma Using Reductions That Exploit the Efficiency of Their Oracle? ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 10:1-10:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Artur Czumaj, Hendrik Fichtenberger, Pan Peng 0001, Christian Sohler |
Testable Properties in General Graphs and Random Order Streaming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 16:1-16:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov |
Low-Rank Binary Matrix Approximation in Column-Sum Norm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 32:1-32:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Kwangjun Ahn |
A Simpler Strong Refutation of Random k-XOR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 2:1-2:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Amit Chakrabarti, Prantar Ghosh, Justin Thaler |
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 22:1-22:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Anup Bhattacharya, Sourav Chakraborty 0001, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar |
Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 23:1-23:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Clément L. Canonne, Karl Wimmer |
Testing Data Binnings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 24:1-24:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Markus Bläser, Anurag Pandey 0001 |
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 8:1-8:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dean Doron, Amnon Ta-Shma, Roei Tell |
On Hitting-Set Generators for Polynomials That Vanish Rarely. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 7:1-7:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Sébastien Bubeck, Yuval Rabani |
Parametrized Metrical Task Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 54:1-54:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Joanna Chybowska-Sokól, Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Patryk Mikos, Adam Polak 0001 |
Online Coloring of Short Intervals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 52:1-52:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Dor Katzelnick, Roy Schwartz 0002 |
Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 49:1-49:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
1 | Eric Allender, Martin Farach-Colton, Meng-Tsung Tsai |
Syntactic Separation of Subset Satisfiability Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 16:1-16:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Rohit Agrawal 0002 |
Samplers and Extractors for Unbounded Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 59:1-59:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Benjamin Moseley, Maxim Sviridenko |
Submodular Optimization with Contention Resolution Extensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 3:1-3:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Irit Dinur, Konstantin Golubev |
Direct Sum Testing: The General Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 40:1-40:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Rocco A. Servedio, Li-Yang Tan |
Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 45:1-45:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | David Ellis Hershkowitz, R. Ravi 0001, Sahil Singla 0001 |
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 4:1-4:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Fu Li, David Zuckerman |
Improved Extractors for Recognizable and Algebraic Sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 72:1-72:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ioannis Z. Emiris, Vasilis Margonis, Ioannis Psarros |
Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 47:1-47:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Gary L. Miller, Noel J. Walkington, Alex L. Wang |
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 8:1-8:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Kent Quanrud |
Fast and Deterministic Approximations for k-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 23:1-23:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ronitt Rubinfeld, Arsen Vasilyan |
Approximating the Noise Sensitivity of a Monotone Boolean Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 52:1-52:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Braverman, Harry Lang, Enayat Ullah, Samson Zhou |
Improved Algorithms for Time Decay Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 27:1-27:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev |
Collapsing Superstring Conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 26:1-26:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Eden Chlamtác, Michael Dinitz, Thomas Robinson |
Approximating the Norms of Graph Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 11:1-11:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Achlioptas, László A. Végh (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2 The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
1 | Domagoj Bradac, Sahil Singla 0001, Goran Zuzic |
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 49:1-49:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Frank Ban, Xi Chen 0001, Rocco A. Servedio, Sandip Sinha |
Efficient Average-Case Population Recovery in the Presence of Insertions and Deletions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 44:1-44:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Josep Díaz, Mordecai J. Golin |
The Expected Number of Maximal Points of the Convolution of Two 2-D Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 35:1-35:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Neeraj Kumar 0004, Stavros Sintos, Subhash Suri |
The Maximum Exposure Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 19:1-19:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Michael Anastos, Peleg Michaeli, Samantha Petti |
Thresholds in Random Motif Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 66:1-66:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Zongchen Chen, Santosh S. Vempala |
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 64:1-64:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Andreas S. Schulz, Rajan Udwani |
Robust Appointment Scheduling with Heterogeneous Costs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 25:1-25:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan |
Deterministic Approximation of Random Walks in Small Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 42:1-42:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
Efficient Black-Box Identity Testing for Free Group Algebras. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 57:1-57:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Matthew Fahrbach, Dana Randall |
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 37:1-37:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dimitris Fotakis 0001, Jannik Matuschke, Orestis Papadigenopoulos |
Malleable Scheduling Beyond Identical Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 17:1-17:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Umang Bhaskar, Gunjan Kumar |
The Complexity of Partial Function Extension for Coverage Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 30:1-30:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Alon Eden, Uriel Feige, Michal Feldman |
Max-Min Greedy Matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 7:1-7:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao |
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 34:1-34:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Avraham Ben-Aroya, Gil Cohen, Dean Doron, Amnon Ta-Shma |
Two-Source Condensers with Low Error and Small Entropy Gap via Entropy-Resilient Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 43:1-43:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Charilaos Efthymiou 0001, Andreas Galanis, Thomas P. Hayes, Daniel Stefankovic, Eric Vigoda |
Improved Strong Spatial Mixing for Colorings on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 48:1-48:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Chien-Chung Huang, Mathieu Mari, Claire Mathieu, Joseph S. B. Mitchell, Nabil H. Mustafa |
Maximizing Covered Area in the Euclidean Plane with Connectivity Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 32:1-32:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 0:1-0:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Grant Schoenebeck, Biaoshuai Tao, Fang-Yi Yu |
Think Globally, Act Locally: On the Optimal Seeding for Nonsubmodular Influence Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 39:1-39:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Meena Jagadeesan |
Simple Analysis of Sparse, Sign-Consistent JL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 61:1-61:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Devvrit, Ravishankar Krishnaswamy, Nived Rajaraman |
Robust Correlation Clustering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 33:1-33:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ray Li, Mary Wootters |
Lifted Multiplicity Codes and the Disjoint Repair Group Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 38:1-38:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Fernandez, David P. Woodruff, Taisuke Yasuda 0002 |
The Query Complexity of Mastermind with lp Distances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 1:1-1:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mika Göös, Thomas Watson 0001 |
A Lower Bound for Sampling Disjoint Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 51:1-51:13, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ioana Oriana Bercea, Martin Groß 0001, Samir Khuller, Aounon Kumar, Clemens Rösner, Daniel R. Schmidt, Melanie Schmidt 0001 |
On the Cost of Essentially Fair Clusterings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 18:1-18:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas |
On List Recovery of High-Rate Tensor Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 68:1-68:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Venkatesan Guruswami, Runzhou Tao |
Streaming Hardness of Unique Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 5:1-5:12, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Golovnev, Mika Göös, Daniel Reichman 0001, Igor Shinkar |
String Matching: Communication, Circuits, and Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 56:1-56:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez |
Dynamic Pricing of Servers on Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 10:1-10:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins 0001, James Stewart 0001, Eric Vigoda |
Fast Algorithms at Low Temperatures via Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 41:1-41:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Roy Gotlib, Tali Kaufman |
Testing Odd Direct Sums Using High Dimensional Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 50:1-50:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson |
Approximate Degree, Secret Sharing, and Concentration Phenomena. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 71:1-71:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Susanne Albers, Arindam Khan 0001, Leon Ladewig |
Improved Online Algorithms for Knapsack and GAP in the Random Order Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 22:1-22:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Per Austrin, Aleksa Stankovic |
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 24:1-24:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury |
Approximation Algorithms for Partially Colorable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 28:1-28:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Shyam Narayanan |
Pairwise Independent Random Walks Can Be Slightly Unbounded. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 63:1-63:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Grigory Yaroslavtsev, Samson Zhou |
Approximate F2-Sketching of Valuation Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 69:1-69:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari |
Improved 3LIN Hardness via Linear Label Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 9:1-9:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sevag Gharibian, Ojas Parekh |
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 31:1-31:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Chi-Ning Chou, Zhixian Lei, Preetum Nakkiran |
Tracking the l2 Norm with Constant Update Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 2:1-2:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Mark Bun, Justin Thaler |
The Large-Error Approximate Degree of AC0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 55:1-55:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Dhruv Rohatgi |
Conditional Hardness of Earth Mover Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 12:1-12:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Rajesh Jayaram, David P. Woodruff |
Towards Optimal Moment Estimation in Streaming and Distributed Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 29:1-29:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Antonio Blanca, Reza Gheissari, Eric Vigoda |
Random-Cluster Dynamics in Z2: Rapid Mixing with General Boundary Conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 67:1-67:19, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Svante Janson, Gregory B. Sorkin |
Successive Minimum Spanning Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 60:1-60:16, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Charlotte Knierim, Johannes Lengler, Pascal Pfister, Ulysse Schaller, Angelika Steger |
The Maximum Label Propagation Algorithm on Sparse Random Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 58:1-58:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Reyna Hulett |
Single-Elimination Brackets Fail to Approximate Copeland Winner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 13:1-13:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Vladimir Braverman, Dan Feldman, Harry Lang, Daniela Rus |
Streaming Coreset Constructions for M-Estimators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 62:1-62:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sarah Cannon, Joshua J. Daymude, Cem Gökmen, Dana Randall, Andréa W. Richa |
A Local Stochastic Algorithm for Separation in Heterogeneous Self-Organizing Particle Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 54:1-54:22, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amit Chakrabarti, Prantar Ghosh |
Streaming Verification of Graph Computations via Graph Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 70:1-70:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos |
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 14:1-14:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha |
Connectivity of Random Annulus Graphs and the Geometric Block Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 53:1-53:23, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Amos Beimel, Kobbi Nissim, Mohammad Zaheri |
Exploring Differential Obliviousness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 65:1-65:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Bruce Spang, Mary Wootters |
Unconstraining Graph-Constrained Group Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 46:1-46:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
1 | Arnold Filtser |
On Strong Diameter Padded Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, USA., pp. 6:1-6:21, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-125-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|