Abstract is missing.
- Mixing Times of Markov Chains for Self-Organizing Lists and Biased PermutationsPrateek Bhakta, Sarah Miracle, Dana Randall, Amanda Pascoe Streib. 1-15 [doi]
- Balls into Bins via Local SearchPaul Bogdan, Thomas Sauerwald, Alexandre Stauffer, He Sun 0001. 16-34 [doi]
- Convergence of multivariate belief propagation, with applications to cuckoo hashing and load balancingMathieu Leconte, Marc Lelarge, Laurent Massoulié. 35-46 [doi]
- Approximate Counting via Correlation Decay on Planar GraphsYitong Yin, Chihao Zhang. 47-66 [doi]
- Correlation Decay up to Uniqueness in Spin SystemsLiang Li, Pinyan Lu, Yitong Yin. 67-84 [doi]
- Online Mixed Packing and CoveringYossi Azar, Umang Bhaskar, Lisa Fleischer, Debmalya Panigrahi. 85-100 [doi]
- Randomized Primal-Dual analysis of RANKING for Online BiPartite MatchingNikhil R. Devanur, Kamal Jain, Robert D. Kleinberg. 101-107 [doi]
- Matroid Secretary for Regular and Decomposable MatroidsMichael Dinitz, Guy Kortsarz. 108-117 [doi]
- A New Approach to Online Scheduling: Approximating the Optimal Competitive RatioElisabeth Günther, Olaf Maurer, Nicole Megow, Andreas Wiese. 118-128 [doi]
- Weighted Flowtime on Capacitated MachinesKyle Fox, Madhukar Korupolu. 129-143 [doi]
- Approximate Shortest Descending PathsSiu-Wing Cheng, Jiongxin Jin. 144-155 [doi]
- Computing the Discrete Fréchet Distance in Subquadratic TimePankaj K. Agarwal, Rinat Ben Avraham, Haim Kaplan, Micha Sharir. 156-167 [doi]
- The complexity of detecting taut angle structures on triangulationsBenjamin A. Burton, Jonathan Spreer. 168-183 [doi]
- An Infinite Class of Sparse-Yao SpannersMatthew Bauer, Mirela Damian. 184-196 [doi]
- Weighted Graph Laplace Operator under Topological NoiseTamal K. Dey, Pawas Ranjan, Yusu Wang. 197-208 [doi]
- Twisted Tabulation HashingMihai Patrascu, Mikkel Thorup. 209-228 [doi]
- Compressed static functions with applicationsDjamal Belazzougui, Rossano Venturini. 229-240 [doi]
- Adaptive and Approximate Orthogonal Range CountingTimothy M. Chan, Bryan T. Wilkinson. 241-251 [doi]
- The Space Complexity of 2-Dimensional Approximate Range CountingZhewei Wei, Ke Yi. 252-264 [doi]
- Near-Optimal Range Reporting Structures for Categorical DataKasper Green Larsen, Freek van Walderveen. 265-276 [doi]
- Better Balance by Being Biased: A 0.8776-Approximation for Max BisectionPer Austrin, Siavosh Benabbas, Konstantinos Georgiou. 277-294 [doi]
- Approximating Non-Uniform Sparsest Cut Via Generalized SpectraVenkatesan Guruswami, Ali Kemal Sinop. 295-305 [doi]
- Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning ProblemsAlina Ene, Jan Vondrák, Yi Wu. 306-325 [doi]
- Poly-logarithmic Approximation for Maximum Node Disjoint Paths with Constant CongestionChandra Chekuri, Alina Ene. 326-341 [doi]
- How to Sell Hyperedges: The Hypermatching Assignment ProblemMarek Cygan, Fabrizio Grandoni, Monaldo Mastrolilli. 342-351 [doi]
- Shortest Non-trivial Cycles in Directed and Undirected Surface GraphsKyle Fox. 352-364 [doi]
- Packing directed cycles through a specified vertex setKen-ichi Kawarabayashi, Daniel Král', Marek Krcál, Stephan Kreutzer. 365-377 [doi]
- 4-connected projective-planar graphs are hamiltonian-connectedKen-ichi Kawarabayashi, Kenta Ozeki. 378-395 [doi]
- Jungles, bundles, and fixed parameter tractabilityFedor V. Fomin, Michal Pilipczuk. 396-413 [doi]
- A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph TheoryMartin Grohe, Ken-ichi Kawarabayashi, Bruce A. Reed. 414-431 [doi]
- Restricted Isometry of Fourier Matrices and List Decodability of Random Linear CodesMahdi Cheraghchi, Venkatesan Guruswami, Ameya Velingker. 432-442 [doi]
- Fast Algorithms for Interactive CodingZvika Brakerski, Moni Naor. 443-456 [doi]
- Shift Finding in Sub-Linear TimeAlexandr Andoni, Piotr Indyk, Dina Katabi, Haitham Hassanieh. 457-465 [doi]
- The Fast Cauchy Transform and Faster Robust Linear RegressionKenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff. 466-477 [doi]
- Generalized Perron-Frobenius Theorem for Multiple Choice Matrices, and ApplicationsChen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg. 478-497 [doi]
- New Additive SpannersShiri Chechik. 498-512 [doi]
- Fast Constructions of Light-Weight Spanners for General GraphsMichael Elkin, Shay Solomon. 513-525 [doi]
- Distance Oracles for Stretch Less Than 2Rachit Agarwal 0001, Philip Brighten Godfrey. 526-538 [doi]
- Approximate Distance Oracles with Improved Query TimeChristian Wulff-Nilsen. 539-549 [doi]
- More Compact Oracles for Approximate Distances in Undirected Planar GraphsKen-ichi Kawarabayashi, Christian Sommer, Mikkel Thorup. 550-563 [doi]
- Simple and Nearly Optimal Multi-Item AuctionsYang Cai, Zhiyi Huang 0002. 564-577 [doi]
- Reducing Revenue to Welfare Maximization: Approximation Algorithms and other GeneralizationsYang Cai, Constantinos Daskalakis, S. Matthew Weinberg. 578-595 [doi]
- Optimal and Efficient Parametric AuctionsPablo Daniel Azar, Constantinos Daskalakis, Silvio Micali, S. Matthew Weinberg. 596-604 [doi]
- Clinching Auction with Online SupplyGagan Goel, Vahab S. Mirrokni, Renato Paes Leme. 605-619 [doi]
- Ironing in Dynamic Revenue Management: Posted Prices & Biased AuctionsRahul Deb, Mallesh Pai. 620-631 [doi]
- The communication complexity of additionEmanuele Viola. 632-651 [doi]
- Lower Bounds for Adaptive Sparse RecoveryEric Price, David P. Woodruff. 652-663 [doi]
- Tight Cell-Probe Bounds for Online Hamming Distance ComputationRaphaël Clifford, Markus Jalsenius, Benjamin Sach. 664-674 [doi]
- On the number of matroidsNikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol. 675-694 [doi]
- Playing Mastermind with Many ColorsBenjamin Doerr, Reto Spöhel, Henning Thomas, Carola Winzen. 695-704 [doi]
- Simple, Fast and Deterministic Gossip and Rumor SpreadingBernhard Haeupler. 705-716 [doi]
- On the Complexity of Information Spreading in Dynamic NetworksChinmoy Dutta, Gopal Pandurangan, Rajmohan Rajaraman, Zhifeng Sun, Emanuele Viola. 717-736 [doi]
- Anonymous Meeting in NetworksYoann Dieudonné, Andrzej Pelc. 737-747 [doi]
- Near Optimal Leader Election in Multi-Hop Radio NetworksMohsen Ghaffari, Bernhard Haeupler. 748-766 [doi]
- Finding Endogenously Formed CommunitiesMaria-Florina Balcan, Christian Borgs, Mark Braverman, Jennifer T. Chayes, Shang-Hua Teng. 767-783 [doi]
- Reporting neighbors in high-dimensional Euclidean spacesDror Aiger, Haim Kaplan, Micha Sharir. 784-803 [doi]
- Euclidean spanners in high dimensionsSariel Har-Peled, Piotr Indyk, Anastasios Sidiropoulos. 804-809 [doi]
- Clustering Affine Subspaces: Hardness and AlgorithmsEuiwoong Lee, Leonard J. Schulman. 810-827 [doi]
- The traveling salesman problem for lines, balls and planesAdrian Dumitrescu, Csaba D. Tóth. 828-843 [doi]
- Approximating Watchman RoutesJoseph S. B. Mitchell. 844-855 [doi]
- Windows into Relational Events: Data Structures for Contiguous Subsequences of EdgesMichael J. Bannister, Christopher DuBois, David Eppstein, Padhraic Smyth. 856-864 [doi]
- Optimal Dynamic Sequence RepresentationsGonzalo Navarro, Yakov Nekrich. 865-876 [doi]
- Towards More Realistic Probabilistic Models for Data Structures: The External Path Length in Tries under the Markov ModelRalph Neininger, Kevin Leckey, Wojciech Szpankowski. 877-886 [doi]
- Output-sensitive Skyline Algorithms in External MemoryXiaocheng Hu, Cheng Sheng, Yufei Tao, Yi Yang, Shuigeng Zhou. 887-900 [doi]
- Multiway Simple Cycle Separators and I/O-Efficient Algorithms for Planar GraphsFreek van Walderveen, Norbert Zeh, Lars Arge. 901-918 [doi]
- New Approximability Results for Two-Dimensional Bin PackingKlaus Jansen, Lars Prädel. 919-936 [doi]
- Minimum Makespan Scheduling with Low Rank Processing TimesAditya Bhaskara, Ravishankar Krishnaswamy, Kunal Talwar, Udi Wieder. 937-947 [doi]
- Energy Efficient Scheduling of Parallelizable JobsKyle Fox, Sungjin Im, Benjamin Moseley. 948-957 [doi]
- Lyndon Words and Short SuperstringsMarcin Mucha. 958-972 [doi]
- A Constant Factor Approximation Algorithm for Reordering Buffer ManagementNoa Avigdor-Elgrabli, Yuval Rabani. 973-984 [doi]
- 3, k-minor-free graphs: Beyond ThomassenKen-ichi Kawarabayashi. 985-1003 [doi]
- List-coloring embedded graphsZdenek Dvorak, Ken-ichi Kawarabayashi. 1004-1012 [doi]
- Totally odd subdivisions and parity subdivisions: Structures and ColoringKen-ichi Kawarabayashi. 1013-1029 [doi]
- Simultaneous PQ-Ordering with Applications to Constrained Embedding ProblemsThomas Bläsius, Ignaz Rutter. 1030-1043 [doi]
- Known algorithms for EDGE CLIQUE COVER are probably optimalMarek Cygan, Marcin Pilipczuk, Michal Pilipczuk. 1044-1053 [doi]
- log n Barrier for Solvable-Group IsomorphismDavid J. Rosenbaum. 1054-1073 [doi]
- Fast matrix multiplication using coherent configurationsHenry Cohn, Christopher Umans. 1074-1087 [doi]
- Lattice Sparsification and the Approximate Closest Vector ProblemDaniel Dadush, Gábor Kun. 1088-1102 [doi]
- Algorithms for the Densest Sub-Lattice ProblemDaniel Dadush, Daniele Micciancio. 1103-1122 [doi]
- Minimizing the number of lattice points in a translated polygonFriedrich Eisenbrand, Nicolai Hähnle. 1123-1130 [doi]
- Dynamic graph connectivity in polylogarithmic worst case timeBruce M. Kapron, Valerie King, Ben Mountjoy. 1131-1142 [doi]
- Decremental maintenance of strongly connected componentsLiam Roditty. 1143-1150 [doi]
- Approximate Maximum Flow on Separable Undirected GraphsGary L. Miller, Richard Peng. 1151-1170 [doi]
- n2.5) Time Barrier for Undirected Unit-Capacity Maximum FlowRan Duan. 1171-1179 [doi]
- Smoothed Analysis of the Successive Shortest Path AlgorithmTobias Brunsch, Kamiel Cornelissen, Bodo Manthey, Heiko Röglin. 1180-1189 [doi]
- Regret Minimization for Reserve Prices in Second-Price AuctionsNicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour. 1190-1204 [doi]
- Communication Complexity of Combinatorial Auctions with Submodular ValuationsShahar Dobzinski, Jan Vondrák. 1205-1215 [doi]
- Online Submodular Welfare Maximization: Greedy is OptimalMichael Kapralov, Ian Post, Jan Vondrák. 1216-1225 [doi]
- Towards Polynomial Simplex-Like Algorithms for Market EqulibriaJugal Garg, Ruta Mehta, Milind A. Sohoni, Nisheeth K. Vishnoi. 1226-1242 [doi]
- A unified approach to truthful scheduling on related machinesLeah Epstein, Asaf Levin, Rob van Stee. 1243-1252 [doi]
- k-SAT AlgorithmDominik Scheder, Bangsheng Tang, Shiteng Chen, Navid Talebanfard. 1253-1263 [doi]
- Complexity of SAT Problems, Clone Theory and the Exponential Time HypothesisPeter Jonsson, Victor Lagerkvist, Gustav Nordh, Bruno Zanuttini. 1264-1277 [doi]
- Dichotomy for Holant* Problems with Domain Size 3Jin-yi Cai, Pinyan Lu, Mingji Xia. 1278-1295 [doi]
- Skew Bisubmodularity and Valued CSPsAnna Huber, Andrei A. Krokhin, Robert Powell. 1296-1305 [doi]
- Frozen variables in random boolean constraint satisfaction problemsMichael Molloy, Ricardo Restrepo. 1306-1318 [doi]
- Exponentially Improved Algorithms and Lower Bounds for Testing Signed MajoritiesDana Ron, Rocco A. Servedio. 1319-1336 [doi]
- Testing Low Complexity Affine-Invariant PropertiesArnab Bhattacharyya, Eldar Fischer, Shachar Lovett. 1337-1355 [doi]
- k-DNF and submodular functionsSofya Raskhodnikova, Grigory Yaroslavtsev. 1356-1368 [doi]
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's"Erik D. Demaine, Morteza Zadimoghaddam. 1369-1379 [doi]
- Learning mixtures of structured distributions over discrete domainsSiu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun. 1380-1394 [doi]
- On differentially private low rank approximationMichael Kapralov, Kunal Talwar. 1395-1414 [doi]
- The Power of Linear Reconstruction AttacksShiva Prasad Kasiviswanathan, Mark Rudelson, Adam Smith. 1415-1433 [doi]
- k-means, PCA and projective clusteringDan Feldman, Melanie Schmidt, Christian Sohler. 1434-1453 [doi]
- An Almost Optimal Algorithm for Computing Nonnegative RankAnkur Moitra. 1454-1464 [doi]
- The simplex method is strongly polynomial for deterministic Markov decision processesIan Post, Yinyu Ye. 1465-1473 [doi]
- Nested Quantum Walks with Quantum Data StructuresStacey Jeffery, Robin Kothari, Frédéric Magniez. 1474-1485 [doi]
- Improved quantum query algorithms for triangle finding and associativity testingTroy Lee, Frédéric Magniez, Miklos Santha. 1486-1502 [doi]
- Efficient protocols of generating bipartite classical distributions and quantum statesRahul Jain, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang. 1503-1512 [doi]
- Fuel Efficient Computation in Passive Self-AssemblyRobert T. Schweller, Michael Sherman. 1513-1525 [doi]
- Active Self-Assembly of Simple Units Using an Insertion PrimitiveNadine Dabby, Ho-Lin Chen. 1526-1536 [doi]
- Approximability and proof complexityRyan O'Donnell, Yuan Zhou. 1537-1556 [doi]
- Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and MoreParinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai. 1557-1576 [doi]
- The Diffusion of Networking TechnologiesSharon Goldberg, Zhenming Liu. 1577-1594 [doi]
- The Power of Non-Uniform Wireless PowerMagnús M. Halldórsson, Stephan Holzer, Pradipta Mitra, Roger Wattenhofer. 1595-1606 [doi]
- Local-Search based Approximation Algorithms for Mobile Facility Location ProblemsSara Ahmadian, Zachary Friggstad, Chaitanya Swamy. 1607-1621 [doi]
- Є-Samples for KernelsJeff M. Phillips. 1622-1632 [doi]
- Higher-Order Geodesic Voronoi Diagrams in a Polygonal Domain with HolesChih-Hung Liu, D. T. Lee. 1633-1645 [doi]
- Transforming Curves on Surfaces ReduxJeff Erickson, Kim Whittlesey. 1646-1655 [doi]
- Morphing Planar Graph Drawings with a Polynomial Number of StepsSoroush Alamdari, Patrizio Angelini, Timothy M. Chan, Giuseppe Di Battista, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson. 1656-1667 [doi]
- Combinatorial and Geometric Properties of Planar Laman GraphsStephen G. Kobourov, Torsten Ueckerdt, Kevin Verbeek. 1668-1678 [doi]
- Better bounds for matchings in the streaming modelMichael Kapralov. 1679-1697 [doi]
- Space efficient streaming algorithms for the distance to monotonicity and asymmetric edit distanceMichael Saks, C. Seshadhri. 1698-1709 [doi]
- (1+ Є)-approximation for facility location in data streamsArtur Czumaj, Christiane Lammersen, Morteza Monemizadeh, Christian Sohler. 1710-1728 [doi]
- Eigenvalues of a matrix in the streaming modelAlexandr Andoni, Huy L. Nguyen. 1729-1737 [doi]
- Beating the Direct Sum Theorem in Communication Complexity with Implications for SketchingMarco Molinaro, David P. Woodruff, Grigory Yaroslavtsev. 1738-1756 [doi]
- Faster Deterministic Fully-Dynamic Graph ConnectivityChristian Wulff-Nilsen. 1757-1769 [doi]
- Discrete Convexity and Polynomial Solvability in Minimum 0-Extension ProblemsHiroshi Hirai. 1770-1788 [doi]
- Mimicking Networks and Succinct Representations of Terminal CutsRobert Krauthgamer, Inbal Rika. 1789-1799 [doi]
- Improved Algorithms for Constructing Consensus TreesJesper Jansson, Chuanqi Shen, Wing-Kin Sung. 1800-1813 [doi]
- Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degreeGerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand. 1814-1832 [doi]
- k-Modal Distributions: Optimal Algorithms via ReductionsConstantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, Paul Valiant. 1833-1852 [doi]
- Low-distortion Inference of Latent Similarities from a Multiplex Social NetworkIttai Abraham, Shiri Chechik, David Kempe, Aleksandrs Slivkins. 1853-1872 [doi]
- s-t ConnectivityAdrian Kosowski. 1873-1883 [doi]
- Optimal Listing of Cycles and st-Paths in Undirected GraphsEtienne Birmelé, Rui A. Ferreira, Roberto Grossi, Andrea Marino, Nadia Pisanti, Romeo Rizzi, Gustavo Sacomoto. 1884-1896 [doi]
- Segmentation of Trajectories for Non-Monotone CriteriaBoris Aronov, Anne Driemel, Marc J. van Kreveld, Maarten Löffler, Frank Staals. 1897-1911 [doi]