| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Buddhima Gamlath, Vadim Grinberg |
Approximating Star Cover Problems.  |
APPROX-RANDOM  |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Roy Schwartz 0002, Yotam Sharoni |
Approximating Requirement Cut via a Configuration LP. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandr Andoni, Collin Burns, Yi Li 0002, Sepideh Mahabadi, David P. Woodruff |
Streaming Complexity of SVMs. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Eden Chlamtác, Petr Kolman |
How to Cut a Ball Without Separating: Improved Approximations for Length Bounded Cut. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Reut Levi, Moti Medina |
Distributed Testing of Graph Isomorphism in the CONGEST Model. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Linh V. Tran, Van Vu |
Reaching a Consensus on Random Networks: The Power of Few. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty |
Almost Optimal Testers for Concise Representations. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Golan 0001, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Przemyslaw Uznanski |
Improved Circular k-Mismatch Sketches. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Ron, Asaf Rosin |
Almost Optimal Distribution-Free Sample-Based Testing of k-Modality. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeyu Guo 0001, Rohit Gurjar |
Improved Explicit Hitting-Sets for ROABPs. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Varun Gupta 0004, Ravishankar Krishnaswamy, Sai Sandeep |
Permutation Strikes Back: The Power of Recourse in Online Metric Matching. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine S. Greenhill, Bernard Mans, Ali Pourmiri |
Balanced Allocation on Dynamic Hypergraphs. |
APPROX-RANDOM |
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? |
APPROX-RANDOM |
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? |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Hendrik Fichtenberger, Pan Peng 0001, Christian Sohler |
Testable Properties in General Graphs and Random Order Streaming. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kwangjun Ahn |
A Simpler Strong Refutation of Random k-XOR. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Prantar Ghosh, Justin Thaler |
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Clément L. Canonne, Karl Wimmer |
Testing Data Binnings. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Anurag Pandey 0001 |
Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dean Doron, Amnon Ta-Shma, Roei Tell |
On Hitting-Set Generators for Polynomials That Vanish Rarely. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sébastien Bubeck, Yuval Rabani |
Parametrized Metrical Task Systems. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dor Katzelnick, Roy Schwartz 0002 |
Maximizing the Correlation: Extending Grothendieck's Inequality to Large Domains. |
APPROX-RANDOM |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Martin Farach-Colton, Meng-Tsung Tsai |
Syntactic Separation of Subset Satisfiability Problems. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Rohit Agrawal 0002 |
Samplers and Extractors for Unbounded Functions. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Moseley, Maxim Sviridenko |
Submodular Optimization with Contention Resolution Extensions. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Konstantin Golubev |
Direct Sum Testing: The General Case. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Rocco A. Servedio, Li-Yang Tan |
Improved Pseudorandom Generators from Pseudorandom Multi-Switching Lemmas. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Fu Li, David Zuckerman |
Improved Extractors for Recognizable and Algebraic Sources. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ioannis Z. Emiris, Vasilis Margonis, Ioannis Psarros |
Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of l1. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary L. Miller, Noel J. Walkington, Alex L. Wang |
Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kent Quanrud |
Fast and Deterministic Approximations for k-Cut. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronitt Rubinfeld, Arsen Vasilyan |
Approximating the Noise Sensitivity of a Monotone Boolean Function. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Harry Lang, Enayat Ullah, Samson Zhou |
Improved Algorithms for Time Decay Streams. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev |
Collapsing Superstring Conjecture. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Eden Chlamtác, Michael Dinitz, Thomas Robinson |
Approximating the Norms of Graph Spanners. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP BibTeX RDF |
|
| 1 | Domagoj Bradac, Sahil Singla 0001, Goran Zuzic |
(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Neeraj Kumar 0004, Stavros Sintos, Subhash Suri |
The Maximum Exposure Problem. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Anastos, Peleg Michaeli, Samantha Petti |
Thresholds in Random Motif Graphs. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Zongchen Chen, Santosh S. Vempala |
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas S. Schulz, Rajan Udwani |
Robust Appointment Scheduling with Heterogeneous Costs. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jack Murtagh, Omer Reingold, Aaron Sidford, Salil P. Vadhan |
Deterministic Approximation of Random Walks in Small Space. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
Efficient Black-Box Identity Testing for Free Group Algebras. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Fahrbach, Dana Randall |
Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Fotakis 0001, Jannik Matuschke, Orestis Papadigenopoulos |
Malleable Scheduling Beyond Identical Machines. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Umang Bhaskar, Gunjan Kumar |
The Complexity of Partial Function Extension for Coverage Functions. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Eden, Uriel Feige, Michal Feldman |
Max-Min Greedy Matching. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Chao Liao, Jiabao Lin, Pinyan Lu, Zhenyu Mao |
Counting Independent Sets and Colorings on Random Regular Bipartite Graphs. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Meena Jagadeesan |
Simple Analysis of Sparse, Sign-Consistent JL. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Devvrit, Ravishankar Krishnaswamy, Nived Rajaraman |
Robust Correlation Clustering. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ray Li, Mary Wootters |
Lifted Multiplicity Codes and the Disjoint Repair Group Property. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Fernandez, David P. Woodruff, Taisuke Yasuda 0002 |
The Query Complexity of Mastermind with lp Distances. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mika Göös, Thomas Watson 0001 |
A Lower Bound for Sampling Disjoint Sets. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Venkatesan Guruswami, Runzhou Tao |
Streaming Hardness of Unique Games. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golovnev, Mika Göös, Daniel Reichman 0001, Igor Shinkar |
String Matching: Communication, Circuits, and Learning. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilan Reuven Cohen, Alon Eden, Amos Fiat, Lukasz Jez |
Dynamic Pricing of Servers on Trees. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Roy Gotlib, Tali Kaufman |
Testing Odd Direct Sums Using High Dimensional Expanders. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson |
Approximate Degree, Secret Sharing, and Concentration Phenomena. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Per Austrin, Aleksa Stankovic |
Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury |
Approximation Algorithms for Partially Colorable Graphs. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Shyam Narayanan |
Pairwise Independent Random Walks Can Be Slightly Unbounded. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Grigory Yaroslavtsev, Samson Zhou |
Approximate F2-Sketching of Valuation Functions. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari |
Improved 3LIN Hardness via Linear Label Cover. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sevag Gharibian, Ojas Parekh |
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Chi-Ning Chou, Zhixian Lei, Preetum Nakkiran |
Tracking the l2 Norm with Constant Update Time. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Bun, Justin Thaler |
The Large-Error Approximate Degree of AC0. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Dhruv Rohatgi |
Conditional Hardness of Earth Mover Distance. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajesh Jayaram, David P. Woodruff |
Towards Optimal Moment Estimation in Streaming and Distributed Models. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Antonio Blanca, Reza Gheissari, Eric Vigoda |
Random-Cluster Dynamics in Z2: Rapid Mixing with General Boundary Conditions. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Svante Janson, Gregory B. Sorkin |
Successive Minimum Spanning Trees. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Reyna Hulett |
Single-Elimination Brackets Fail to Approximate Copeland Winner. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Braverman, Dan Feldman, Harry Lang, Daniela Rus |
Streaming Coreset Constructions for M-Estimators. |
APPROX-RANDOM |
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. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti, Prantar Ghosh |
Streaming Verification of Graph Computations via Graph Structure. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy Carpenter, Ario Salmasi, Anastasios Sidiropoulos |
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sainyam Galhotra, Arya Mazumdar, Soumyabrata Pal, Barna Saha |
Connectivity of Random Annulus Graphs and the Geometric Block Model. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Amos Beimel, Kobbi Nissim, Mohammad Zaheri |
Exploring Differential Obliviousness. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce Spang, Mary Wootters |
Unconstraining Graph-Constrained Group Testing. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Filtser |
On Strong Diameter Padded Decompositions. |
APPROX-RANDOM |
2019 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license