Table of Contents

• Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with OutliersShyam Narayanan. [doi]
• Luby-Velickovic-Wigderson Revisited: Improved Correlation Bounds and Pseudorandom Generators for Depth-Two CircuitsRocco A. Servedio, Li-Yang Tan. [doi]
• Fixed-Parameter Approximation Schemes for Weighted FlowtimeAndreas Wiese. [doi]
• Improved Composition Theorems for Functions and RelationsSajin Koroth, Or Meir. [doi]
• Semi-Direct Sum Theorem and Nearest Neighbor under l_inftyMark Braverman, Young Kun-Ko. [doi]
• Optimal Deterministic Extractors for Generalized Santha-Vazirani SourcesSalman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo. [doi]
• Greedy Bipartite Matching in Random Type Poisson Arrival ModelAllan Borodin, Christodoulos Karavasilis, Denis Pankratov. [doi]
• Approximate Degree and the Complexity of Depth Three CircuitsMark Bun, Justin Thaler. [doi]
• Preserving Randomness for Adaptive AlgorithmsWilliam M. Hoza, Adam R. Klivans. [doi]
• Polar Codes with Exponentially Small Error at Finite Block LengthJaroslaw Blasiok, Venkatesan Guruswami, Madhu Sudan. [doi]
• Generalized Assignment of Time-Sensitive Item GroupsKanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai. [doi]
• On Closeness to k-Wise UniformityRyan O'Donnell, Yu Zhao. [doi]
• Randomness Extraction in AC0 and with Small LocalityKuan Cheng, Xin Li 0006. [doi]
• The Cover Time of a Biased Random Walk on a Random Regular Graph of Odd DegreeTony Johansson. [doi]
• Satisfiability and Derandomization for Small Polynomial Threshold CircuitsValentine Kabanets, Zhenjian Lu. [doi]
• Flow-time Optimization for Concurrent Open-Shop and Precedence Constrained Scheduling ModelsJanardhan Kulkarni, Shi Li. [doi]
• List-Decoding Homomorphism Codes with Arbitrary CodomainsLászló Babai, Timothy J. F. Black, Angela Wuu. [doi]
• Improved List-Decodability of Random Linear Binary CodesRay Li, Mary Wootters. [doi]
• Sunflowers and Quasi-Sunflowers from Randomness ExtractorsXin Li, Shachar Lovett, Jiapeng Zhang. [doi]
• Nearly Optimal Distinct Elements and Heavy Hitters on Sliding WindowsVladimir Braverman, Elena Grigorescu, Harry Lang, David P. Woodruff, Samson Zhou. [doi]
• Round Complexity Versus Randomness Complexity in Interactive ProofsMaya Leshkowitz. [doi]
• On Minrank and the Lovász Theta FunctionIshay Haviv. [doi]
• Multi-Agent Submodular OptimizationRichard Santiago, F. Bruce Shepherd. [doi]
• Adaptive Lower Bound for Testing Monotonicity on the LineAleksandrs Belovs. [doi]
• Torpid Mixing of Markov Chains for the Six-vertex Model on Z^2Tianyu Liu. [doi]
• Lower Bounds for Approximating Graph Parameters via Communication ComplexityTalya Eden, Will Rosenbaum. [doi]
• Communication Complexity of Correlated Equilibrium with Small SupportAnat Ganor, Karthik C. S.. [doi]
• Pseudo-Derandomizing Learning and ApproximationIgor Carboni Oliveira, Rahul Santhanam. [doi]
• Randomly Coloring Graphs of Logarithmically Bounded PathwidthShai Vardi. [doi]
• Deterministic Heavy Hitters with Sublinear Query TimeYi Li 0002, Vasileios Nakos. [doi]
• Tensor Rank is Hard to ApproximateJoseph Swernofsky. [doi]
• Online Makespan Minimization: The Power of RestartZhiyi Huang 0002, Ning Kang, Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang. [doi]
• On the Testability of Graph Partition PropertiesYonatan Nakar, Dana Ron. [doi]
• Flipping out with Many Flips: Hardness of Testing k-MonotonicityElena Grigorescu, Akash Kumar 0003, Karl Wimmer. [doi]
• Improved Approximation Bounds for the Minimum Constraint Removal ProblemSayan Bandyapadhyay, Neeraj Kumar 0004, Subhash Suri, Kasturi R. Varadarajan. [doi]
• Survivable Network Design for Group Connectivity in Low-Treewidth GraphsParinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz. [doi]
• Percolation of Lipschitz Surface and Tight Bounds on the Spread of Information Among Mobile AgentsPeter Gracar, Alexandre Stauffer. [doi]
• On Sketching the q to p NormsAditya Krishnan, Sidhanth Mohanty, David P. Woodruff. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• How Long Can Optimal Locally Repairable Codes Be?Venkatesan Guruswami, Chaoping Xing, Chen Yuan. [doi]
• Explicit Strong LTCs with Inverse Poly-Log Rate and Constant SoundnessMichael Viderman. [doi]
• On Low-Risk Heavy Hitters and Sparse Recovery SchemesYi Li 0002, Vasileios Nakos, David P. Woodruff. [doi]
• Boolean Function Analysis on High-Dimensional ExpandersYotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha. [doi]
• On Geodesically Convex Formulations for the Brascamp-Lieb ConstantSuvrit Sra, Nisheeth K. Vishnoi, Ozan Yildiz. [doi]
• Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest CutPasin Manurangsi, Luca Trevisan. [doi]
• Low Rank Approximation in the Presence of OutliersAditya Bhaskara, Srivatsan Kumar. [doi]
• A Tight 4/3 Approximation for Capacitated Vehicle Routing in TreesAmariah Becker. [doi]
• Polylogarithmic Approximation Algorithms for Weighted-F-Deletion ProblemsAkanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Sherali-Adams Integrality Gaps Matching the Log-Density ThresholdEden Chlamtác, Pasin Manurangsi. [doi]
• Robust Online Speed Scaling With Deadline UncertaintyGoonwanth Reddy, Rahul Vaze. [doi]
• Speeding up Switch Markov Chains for Sampling Bipartite Graphs with Given Degree SequenceCorrie Jacobien Carstens, Pieter Kleer. [doi]
• Sublinear-Time Quadratic Minimization via Spectral Decomposition of MatricesAmit Levi, Yuichi Yoshida. [doi]
• Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular GraphsAntonio Blanca, Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic, Eric Vigoda, Kuan Yang. [doi]
• High Order Random Walks: Beyond Spectral GapTali Kaufman, Izhar Oppenheim. [doi]
• On Minrank and Forbidden SubgraphsIshay Haviv. [doi]
• Perturbation Resilient Clustering for k-Center and Related Problems via LP RelaxationsChandra Chekuri, Shalmoli Gupta. [doi]
• Swendsen-Wang Dynamics for General Graphs in the Tree Uniqueness RegionAntonio Blanca, Zongchen Chen, Eric Vigoda. [doi]
• Commutative Algorithms Approximate the LLL-distributionFotis Iliopoulos. [doi]
• An O(1)-Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft CapacityHao-Ting Wei, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, Kunihiko Sadakane. [doi]