Abstract is missing.
- Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation MethodDimitris Achlioptas, Ricardo Menchaca-Mendez. 1-12 [doi]
- The NOF Multiparty Communication Complexity of Composed FunctionsAnil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen. 13-24 [doi]
- Quantum Strategies Are Better Than Classical in Almost Any XOR GameAndris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitrijs Kravcenko, Raitis Ozols, Juris Smotrovs, Madars Virza. 25-37 [doi]
- Efficient Submodular Function Maximization under Linear Packing ConstraintsYossi Azar, Iftah Gamzu. 38-50 [doi]
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract)László Babai, Paolo Codenotti, Youming Qiao. 51-62 [doi]
- Clustering under Perturbation ResilienceMaria-Florina Balcan, Yingyu Liang. 63-74 [doi]
- Secretary Problems with Convex CostsSiddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec. 75-87 [doi]
- Nearly Simultaneously Resettable Black-Box Zero KnowledgeJoshua Baron, Rafail Ostrovsky, Ivan Visconti. 88-99 [doi]
- Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov ComplexityBruno Bauwens. 100-108 [doi]
- On Quadratic Programming with a Ratio ObjectiveAditya Bhaskara, Moses Charikar, Rajsekar Manokaran, Aravindan Vijayaraghavan. 109-120 [doi]
- De-amortizing Binary Search TreesProsenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman. 121-132 [doi]
- Efficient Sampling Methods for Discrete DistributionsKarl Bringmann, Konstantinos Panagiotou. 133-144 [doi]
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid ConstraintsNiv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh. 145-156 [doi]
- Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility LocationJaroslaw Byrka, Bartosz Rybicki. 157-169 [doi]
- Testing Coverage FunctionsDeeparnab Chakrabarty, Zhiyi Huang 0002. 170-181 [doi]
- Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or DegreeT.-H. Hubert Chan, Mingfei Li, Li Ning. 182-193 [doi]
- A Dependent LP-Rounding Approach for the k-Median ProblemMoses Charikar, Shi Li. 194-205 [doi]
- Node-Weighted Network Design in Planar and Minor-Closed Families of GraphsChandra Chekuri, Alina Ene, Ali Vakilian. 206-217 [doi]
- Computing the Visibility Polygon of an Island in a Polygonal DomainDanny Z. Chen, Haitao Wang. 218-229 [doi]
- Directed Subset Feedback Vertex Set Is Fixed-Parameter TractableRajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx. 230-241 [doi]
- Max-Cut Parameterized above the Edwards-Erdős BoundRobert Crowston, Mark Jones, Matthias Mnich. 242-253 [doi]
- Clique Cover and Graph Separation: New Incompressibility ResultsMarek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström. 254-265 [doi]
- The Inverse Shapley Value ProblemAnindya De, Ilias Diakonikolas, Rocco A. Servedio. 266-277 [doi]
- Zero-One Rounding of Singular VectorsAmit Deshpande, Ravindran Kannan, Nikhil Srivastava. 278-289 [doi]
- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-SpannerMichael Dinitz, Guy Kortsarz, Ran Raz. 290-301 [doi]
- Space-Constrained Interval SelectionYuval Emek, Magnús M. Halldórsson, Adi Rosén. 302-313 [doi]
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman EquationsKousha Etessami, Alistair Stewart, Mihalis Yannakakis. 314-326 [doi]
- Succinct Indices for Range Queries with Applications to Orthogonal Range MaximaArash Farzan, J. Ian Munro, Rajeev Raman. 327-338 [doi]
- Universal Factor GraphsUriel Feige, Shlomo Jozeph. 339-350 [doi]
- Parameterized Approximation via Fidelity Preserving TransformationsMichael R. Fellows, Ariel Kulik, Frances A. Rosamond, Hadas Shachnai. 351-362 [doi]
- Backdoors to Acyclic SATSerge Gaspers, Stefan Szeider. 363-374 [doi]
- Dominators, Directed Bipolar Orders, and Independent Spanning TreesLoukas Georgiadis, Robert Endre Tarjan. 375-386 [doi]
- Hardness of Approximation for Quantum ProblemsSevag Gharibian, Julia Kempe. 387-398 [doi]
- The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)Leslie Ann Goldberg, Mark Jerrum. 399-410 [doi]
- Stochastic Vehicle Routing with RecourseInge Li Gørtz, Viswanath Nagarajan, Rishi Saket. 411-423 [doi]
- The Online Metric Matching Problem for Doubling MetricsAnupam Gupta, Kevin Lewi. 424-435 [doi]
- Approximating Sparse Covering Integer Programs OnlineAnupam Gupta, Viswanath Nagarajan. 436-448 [doi]
- Streaming and Communication Complexity of Clique ApproximationMagnús M. Halldórsson, Xiaoming Sun, Mario Szegedy, Chengu Wang. 449-460 [doi]
- Distributed Private Heavy HittersJustin Hsu, Sanjeev Khanna, Aaron Roth. 461-472 [doi]
- A Thirty Year Old Conjecture about Promise ProblemsAndrew Hughes, Aduri Pavan, Nathan Russell, Alan L. Selman. 473-484 [doi]
- Minimum Latency Submodular CoverSungjin Im, Viswanath Nagarajan, Ruben van der Zwaan. 485-497 [doi]
- Constant-Time Algorithms for Sparsity MatroidsHiro Ito, Shin-ichi Tanigawa, Yuichi Yoshida. 498-509 [doi]
- CRAM: Compressed Random Access MemoryJesper Jansson, Kunihiko Sadakane, Wing-Kin Sung. 510-521 [doi]
- Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph CollisionStacey Jeffery, Robin Kothari, Frédéric Magniez. 522-532 [doi]
- Faster Fully Compressed Pattern Matching by RecompressionArtur Jez. 533-544 [doi]
- NNS Lower Bounds via Metric Expansion for l ∞ and EMDMichael Kapralov, Rina Panigrahy. 545-556 [doi]
- Quantum Adversary (Upper) BoundShelby Kimmel. 557-568 [doi]
- Solving Planar k -Terminal Cut in $O(n^{c \sqrt{k}})$ TimePhilip N. Klein, Dániel Marx. 569-580 [doi]
- Fixed-Parameter Tractability of Multicut in Directed Acyclic GraphsStefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Magnus Wahlström. 581-593 [doi]
- Preserving Terminal Distances Using MinorsRobert Krauthgamer, Tamar Zondiner. 594-605 [doi]
- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph ProblemBundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh. 606-616 [doi]
- Classical and Quantum Partition Bound and Detector InefficiencySophie Laplante, Virginie Lerays, Jérémie Roland. 617-628 [doi]
- Testing Similar MeansReut Levi, Dana Ron, Ronitt Rubinfeld. 629-640 [doi]
- The Parameterized Complexity of k-Edge Induced SubgraphsBingkai Lin, Yijia Chen. 641-652 [doi]
- Converting Online Algorithms to Local Computation AlgorithmsYishay Mansour, Aviad Rubinstein, Shai Vardi, Ning Xie. 653-664 [doi]
- Assigning Sporadic Tasks to Unrelated Parallel MachinesAlberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster, Andreas Wiese. 665-676 [doi]
- A Tight Lower Bound for Planar Multiway Cut with Fixed Number of TerminalsDániel Marx. 677-688 [doi]
- The Power of Recourse for Online MST and TSPNicole Megow, Martin Skutella, José Verschae, Andreas Wiese. 689-700 [doi]
- Geometry of Online Packing Linear ProgramsMarco Molinaro, R. Ravi. 701-713 [doi]
- Self-assembly with Geometric TilesBin Fu, Matthew J. Patitz, Robert T. Schweller, Robert Sheline. 714-725 [doi]
- Quasi-polynomial Local Search for Restricted Max-Min Fair AllocationLukas Polacek, Ola Svensson. 726-737 [doi]
- Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial TransactionsMichael O. Rabin, Yishay Mansour, S. Muthukrishnan, Moti Yung. 738-749 [doi]
- Parameterized Tractability of Multiway Cut with Parity ConstraintsDaniel Lokshtanov, M. S. Ramanujan. 750-761 [doi]
- Set Cover Revisited: Hypergraph Cover with Hard CapacitiesBarna Saha, Samir Khuller. 762-773 [doi]
- On the Limits of SparsificationRahul Santhanam, Srikanth Srinivasan. 774-785 [doi]
- Certifying 3-Connectivity in Linear TimeJens M. Schmidt. 786-797 [doi]
- Epsilon-Net Method for Optimizations over Separable StatesYaoyun Shi, Xiaodi Wu. 798-809 [doi]
- Faster Algorithms for Privately Releasing MarginalsJustin Thaler, Jonathan Ullman, Salil P. Vadhan. 810-821 [doi]
- Stochastic Matching with CommitmentKevin P. Costello, Prasad Tetali, Pushkar Tripathi. 822-833 [doi]
- Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover DistanceElad Verbin, Qin Zhang. 834-845 [doi]
- A Matrix Hyperbolic Cosine Algorithm and ApplicationsAnastasios Zouzias. 846-858 [doi]