Abstract is missing.
- Spectral Sparsification in Dynamic Graph StreamsKook Jin Ahn, Sudipto Guha, Andrew McGregor. 1-10 [doi]
- The Online Stochastic Generalized Assignment ProblemSaeed Alaei, MohammadTaghi Hajiaghayi, Vahid Liaghat. 11-25 [doi]
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction ProblemsPer Austrin, Rajsekar Manokaran, Cenny Wenner. 26-41 [doi]
- Approximating Large Frequency Moments with Pick-and-Drop SamplingVladimir Braverman, Rafail Ostrovsky. 42-57 [doi]
- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on StreamsVladimir Braverman, Rafail Ostrovsky. 58-70 [doi]
- Capacitated Network Design on Undirected GraphsDeeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan. 71-80 [doi]
- Scheduling Subset Tests: One-Time, Continuous, and How They RelateEdith Cohen, Haim Kaplan, Yishay Mansour. 81-95 [doi]
- On the Total Perimeter of Homothetic Convex Bodies in a Convex ContainerAdrian Dumitrescu, Csaba D. Tóth. 96-109 [doi]
- Partial Interval Set Cover - Trade-Offs between Scalability and OptimalityKatherine Edwards, Simon Griffiths, William Sean Kennedy. 110-125 [doi]
- Online Square-into-Square PackingSándor P. Fekete, Hella-Franziska Hoffmann. 126-141 [doi]
- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex FunctionsKyle Fox, Sungjin Im, Janardhan Kulkarni, Benjamin Moseley. 142-157 [doi]
- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering ProblemsPierre Fraigniaud, Magnús M. Halldórsson, Boaz Patt-Shamir, Dror Rawitz, Adi Rosén. 158-172 [doi]
- Multiple Traveling Salesmen in Asymmetric MetricsZachary Friggstad. 173-188 [doi]
- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed FeedbackSudipto Guha, Kamesh Munagala. 189-204 [doi]
- The Approximability of the Binary Paintshop ProblemAnupam Gupta, Satyen Kale, Viswanath Nagarajan, Rishi Saket, Baruch Schieber. 205-217 [doi]
- Approximation Algorithms for Movement RepairmenMohammadTaghi Hajiaghayi, Rohit Khandekar, M. Reza Khani, Guy Kortsarz. 218-232 [doi]
- Improved Hardness of Approximating Chromatic NumberSangxia Huang. 233-243 [doi]
- A Pseudo-approximation for the Genus of Hamiltonian GraphsYury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos. 244-259 [doi]
- A Local Computation Approximation Scheme to Maximum MatchingYishay Mansour, Shai Vardi. 260-273 [doi]
- Sketching Earth-Mover Distance on Graph MetricsAndrew McGregor, Daniel Stubbs. 274-286 [doi]
- Online Multidimensional Load BalancingAdam Meyerson, Alan Roytman, Brian Tagiku. 287-302 [doi]
- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank GraphsShayan Oveis Gharan, Luca Trevisan. 303-316 [doi]
- Interdiction Problems on Planar GraphsFeng Pan, Aaron Schild. 317-331 [doi]
- Conditional Random Fields, Planted Constraint Satisfaction and Entropy ConcentrationEmmanuel Abbe, Andrea Montanari. 332-346 [doi]
- Finding Heavy Hitters from Lossy or Noisy DataLucia Batman, Russell Impagliazzo, Cody Murray, Ramamohan Paturi. 347-362 [doi]
- Private Learning and Sanitization: Pure vs. Approximate Differential PrivacyAmos Beimel, Kobbi Nissim, Uri Stemmer. 363-378 [doi]
- Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ2Antonio Blanca, David Galvin, Dana Randall, Prasad Tetali. 379-394 [doi]
- Fast Private Data Release Algorithms for Sparse QueriesAvrim Blum, Aaron Roth. 395-410 [doi]
- Local Reconstructors and Tolerant Testers for Connectivity and DiameterAndrea Campagna, Alan Guo, Ronitt Rubinfeld. 411-424 [doi]
- An Optimal Lower Bound for Monotonicity Testing over HypergridsDeeparnab Chakrabarty, C. Seshadhri. 425-435 [doi]
- Small-Bias Sets for Nonabelian Groups - Derandomizations of the Alon-Roichman TheoremSixia Chen, Cristopher Moore, Alexander Russell. 436-451 [doi]
- What You Can Do with Coordinated SamplesEdith Cohen, Haim Kaplan. 452-467 [doi]
- Robust Randomness Amplifiers: Upper and Lower BoundsMatthew Coudron, Thomas Vidick, Henry Yuen. 468-483 [doi]
- The Power of Choice for Random SatisfiabilityVarsha Dani, Josep Diaz, Thomas P. Hayes, Cristopher Moore. 484-496 [doi]
- Connectivity of Random High Dimensional Geometric GraphsRoee David, Uriel Feige. 497-512 [doi]
- Matching-Vector Families and LDCs over Large ModuloZeev Dvir, Guangda Hu. 513-526 [doi]
- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity TestingMichael A. Forbes, Amir Shpilka. 527-542 [doi]
- Testing Membership in Counter Automaton LanguagesYonatan Goldhirsh, Michael Viderman. 543-558 [doi]
- Tight Lower Bounds for Testing Linear IsomorphismElena Grigorescu, Karl Wimmer, Ning Xie. 559-574 [doi]
- Randomness-Efficient Curve SamplersZeyu Guo. 575-590 [doi]
- Combinatorial Limitations of Average-Radius List DecodingVenkatesan Guruswami, Srivatsan Narayanan. 591-606 [doi]
- Zero Knowledge LTCs and Their ApplicationsYuval Ishai, Amit Sahai, Michael Viderman, Mor Weiss. 607-622 [doi]
- A Tight Lower Bound for High Frequency Moment Estimation with Small ErrorYi Li, David P. Woodruff. 623-638 [doi]
- Improved FPTAS for Multi-spin SystemsPinyan Lu, Yitong Yin. 639-654 [doi]
- Pseudorandomness for Regular Branching Programs via Fourier AnalysisOmer Reingold, Thomas Steinke, Salil P. Vadhan. 655-670 [doi]
- Absolutely Sound Testing of Lifted CodesElad Haramaty, Noga Ron-Zewi, Madhu Sudan. 671-682 [doi]
- On the Average Sensitivity and Density of k-CNF FormulasDominik Scheder, Li-Yang Tan. 683-698 [doi]
- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-DimensionsJuan Carlos Vera, Eric Vigoda, Linji Yang. 699-713 [doi]