| 2017 | *-Liftings for Differential Privacy. Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato, Pierre-Yves Strub |
| 2017 | 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, Warsaw, Poland, July 10-14, 2017 Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, Anca Muscholl |
| 2017 | A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time. Andreas Wiese |
| 2017 | A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. Pasin Manurangsi, Prasad Raghavendra |
| 2017 | A Circuit-Based Approach to Efficient Enumeration. Antoine Amarilli, Pierre Bourhis, Louis Jachiet, Stefan Mengel |
| 2017 | A Counterexample to Thiagarajan's Conjecture on Regular Event Structures. Jérémie Chalopin, Victor Chepoi |
| 2017 | A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model. Mikhail A. Raskin |
| 2017 | A New Holant Dichotomy Inspired by Quantum Computation. Miriam Backens |
| 2017 | A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry. Pascal Schweitzer |
| 2017 | A QPTAS for the General Scheduling Problem with Identical Release Dates. Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese |
| 2017 | A Strategy for Dynamic Programs: Start over and Muddle Through. Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume |
| 2017 | A Tight Lower Bound for the Capture Time of the Cops and Robbers Game. Sebastian Brandt, Yuval Emek, Jara Uitto, Roger Wattenhofer |
| 2017 | A Universal Ordinary Differential Equation. Olivier Bournez, Amaury Pouly |
| 2017 | Additive Spanners and Distance Oracles in Quadratic Time. Mathias Bæk Tejs Knudsen |
| 2017 | Admissiblity in Concurrent Games. Nicolas Basset, Gilles Geeraerts, Jean-François Raskin, Ocan Sankur |
| 2017 | All-Pairs 2-Reachability in O(n^w log n) Time. Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Nikos Parotsidis, Przemyslaw Uznanski |
| 2017 | An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention. Bernard Boigelot, Isabelle Mainz, Victor Marsault, Michel Rigo |
| 2017 | An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model. Surender Baswana, Keerti Choudhary, Liam Roditty |
| 2017 | Approximate Bounded Indistinguishability. Andrej Bogdanov, Christopher Williamson |
| 2017 | Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!. Rajesh Jayaram, Barna Saha |
| 2017 | Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems. Andreas Galanis, Leslie Ann Goldberg, Kuan Yang |
| 2017 | Approximation Strategies for Generalized Binary Search in Weighted Trees. Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski, Mengchuan Zou |
| 2017 | Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment. Fabian Reiter |
| 2017 | Automata-Based Stream Processing. Rajeev Alur, Konstantinos Mamouras, Caleb Stanford |
| 2017 | Bipartite Perfect Matching in Pseudo-Deterministic NC. Shafi Goldwasser, Ofer Grossman |
| 2017 | Bisimulation Metrics for Weighted Automata. Borja Balle, Pascale Gourdeau, Prakash Panangaden |
| 2017 | Characterizing Definability in Decidable Fixpoint Logics. Michael Benedikt, Pierre Bourhis, Michael Vanden Boom |
| 2017 | Combinatorial Secretary Problems with Ordinal Information. Martin Hoefer, Bojana Kodric |
| 2017 | Conditional Lower Bounds for All-Pairs Max-Flow. Robert Krauthgamer, Ohad Trabelsi |
| 2017 | Conservative Extensions in Guarded and Two-Variable Fragments. Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider, Frank Wolter |
| 2017 | Continuity and Rational Functions. Michaël Cadilhac, Olivier Carton, Charles Paperman |
| 2017 | Controlled Quantum Amplification. Catalin Dohotaru, Peter Høyer |
| 2017 | Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz |
| 2017 | Covering Vectors by Spaces: Regular Matroids. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh |
| 2017 | Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee |
| 2017 | Decremental Data Structures for Connectivity and Dominators in Directed Graphs. Loukas Georgiadis, Thomas Dueholm Hansen, Giuseppe F. Italiano, Sebastian Krinninger, Nikos Parotsidis |
| 2017 | Definability by Horn Formulas and Linear Time on Cellular Automata. Nicolas Bacquey, Etienne Grandjean, Frédéric Olive |
| 2017 | Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays. Omri Ben-Eliezer, Simon Korman, Daniel Reichman |
| 2017 | Deterministic Graph Exploration with Advice. Barun Gorain, Andrzej Pelc |
| 2017 | Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs. Aaron Bernstein |
| 2017 | Directed Hamiltonicity and Out-Branchings via Generalized Laplacians. Andreas Björklund, Petteri Kaski, Ioannis Koutis |
| 2017 | Distributed Monitoring of Network Properties: The Power of Hybrid Networks. Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Christian Sohler |
| 2017 | Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration. Marcin Bienkowski, Jaroslaw Byrka, Marcin Mucha |
| 2017 | Dynamic Parameterized Problems and Algorithms. Josh Alman, Matthias Mnich, Virginia Vassilevska Williams |
| 2017 | Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier. Omer Gold, Micha Sharir |
| 2017 | Edge-Orders. Lena Schlipf, Jens M. Schmidt |
| 2017 | Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk). Monika Henzinger |
| 2017 | Efficient Approximations for the Online Dispersion Problem. Jing Chen, Bo Li, Yingkai Li |
| 2017 | Efficient Construction of Probabilistic Tree Embeddings. Guy E. Blelloch, Yan Gu, Yihan Sun |
| 2017 | Efficient Quantum Algorithms for Simulating Lindblad Evolution. Richard Cleve, Chunhao Wang |
| 2017 | Embeddings of Schatten Norms with Applications to Data Streams. Yi Li, David P. Woodruff |
| 2017 | Emptiness of Zero Automata Is Decidable. Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi |
| 2017 | Exact Algorithms via Multivariate Subroutines. Serge Gaspers, Edward J. Lee |
| 2017 | Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs. Florian Barbero, Christophe Paul, Michal Pilipczuk |
| 2017 | Expressiveness of Probabilistic Modal Logics, Revisited. Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden |
| 2017 | Fast Regression with an $ell_infty$ Guarantee. Eric Price, Zhao Song, David P. Woodruff |
| 2017 | Fast and Powerful Hashing Using Tabulation (Invited Talk). Mikkel Thorup |
| 2017 | Finding Detours is Fixed-Parameter Tractable. Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin |
| 2017 | Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2017 | Front Matter, Table of Contents, Preface, Organization, List of Authors. |
| 2017 | Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs. Sara Ahmadian, Zachary Friggstad |
| 2017 | General Bounds for Incremental Maximization. Aaron Bernstein, Yann Disser, Martin Groß |
| 2017 | Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols. Amanda Belleville, David Doty, David Soloveichik |
| 2017 | Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder. Aviad Rubinstein |
| 2017 | Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger |
| 2017 | Improved Algorithms for MST and Metric-TSP Interdiction. André Linhares, Chaitanya Swamy |
| 2017 | Improved Hardness for Cut, Interdiction, and Firefighter Problems. Euiwoong Lee |
| 2017 | Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis. Pasin Manurangsi |
| 2017 | Inapproximability of the Independent Set Polynomial Below the Shearer Threshold. Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic |
| 2017 | Interactive Oracle Proofs with Constant Rate and Query Complexity. Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner |
| 2017 | Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes. Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, Marcin Wrochna |
| 2017 | Linear-Time Kernelization for Feedback Vertex Set. Yoichi Iwata |
| 2017 | Local Computation Algorithms (Invited Talk). Ronitt Rubinfeld |
| 2017 | Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory. Gilles Dowek |
| 2017 | Multiple Source Dual Fault Tolerant BFS Trees. Manoj Gupta, Shahbaz Khan |
| 2017 | Near-Optimal Closeness Testing of Discrete Histogram Distributions. Ilias Diakonikolas, Daniel M. Kane, Vladimir Nikishkin |
| 2017 | Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. Mikkel Abrahamsen, Stephen Alstrup, Jacob Holm, Mathias Bæk Tejs Knudsen, Morten Stöckel |
| 2017 | Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs. Kord Eickmeyer, Archontia C. Giannopoulou, Stephan Kreutzer, O-joung Kwon, Michal Pilipczuk, Roman Rabinovich, Sebastian Siebertz |
| 2017 | Non-Uniform Attacks Against Pseudoentropy. Krzysztof Pietrzak, Maciej Skorski |
| 2017 | On Fast Decoding of High-Dimensional Signals from One-Bit Measurements. Vasileios Nakos |
| 2017 | On Finding the Jaccard Center. Marc Bury, Chris Schwiegelshohn |
| 2017 | On Problems Equivalent to (min, +)-Convolution. Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk |
| 2017 | On Reversible Transducers. Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote |
| 2017 | On the Bit Complexity of Sum-of-Squares Proofs. Prasad Raghavendra, Benjamin Weitz |
| 2017 | On the Complexity of Quantified Integer Programming. Dmitry Chistikov, Christoph Haase |
| 2017 | On the Fine-Grained Complexity of One-Dimensional Dynamic Programming. Marvin Künnemann, Ramamohan Paturi, Stefan Schneider |
| 2017 | On the Metric-Based Approximate Minimization of Markov Chains. Giovanni Bacci, Giorgio Bacci, Kim G. Larsen, Radu Mardare |
| 2017 | On the Transformation Capability of Feasible Mechanisms for Programmable Matter. Othon Michail, George Skretas, Paul G. Spirakis |
| 2017 | On the Value of Penalties in Time-Inconsistent Planning. Susanne Albers, Dennis Kraft |
| 2017 | Online Covering with Sum of $ell_q$-Norm Objectives. Viswanath Nagarajan, Xiangkun Shen |
| 2017 | Online Market Intermediation. Yiannis Giannakopoulos, Elias Koutsoupias, Philip Lazos |
| 2017 | Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. Tung Mai, Ioannis Panageas, Vijay V. Vazirani |
| 2017 | Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps. Roksana Baleshzar, Deeparnab Chakrabarty, Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, C. Seshadhri |
| 2017 | Orbit-Finite Sets and Their Algorithms (Invited Talk). Mikolaj Bojanczyk |
| 2017 | Packing Cycles Faster Than Erdos-Posa. Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh, Meirav Zehavi |
| 2017 | Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One. Diego Figueira, Ranko Lazic, Jérôme Leroux, Filip Mazowiecki, Grégoire Sutre |
| 2017 | Polynomial-Time Rademacher Theorem, Porosity and Randomness. Alex Galicki |
| 2017 | Preserving Distances in Very Faulty Graphs. Greg Bodwin, Fabrizio Grandoni, Merav Parter, Virginia Vassilevska Williams |
| 2017 | Proof Complexity Meets Algebra. Albert Atserias, Joanna Ochremiak |
| 2017 | Pumping Lemma for Higher-order Languages. Kazuyuki Asada, Naoki Kobayashi |
| 2017 | Quantum Automata Cannot Detect Biased Coins, Even in the Limit. Guy Kindler, Ryan O'Donnell |
| 2017 | Randomized Communication vs. Partition Number. Mika Göös, T. S. Jayram, Toniann Pitassi, Thomas Watson |
| 2017 | Randomized Load Balancing on Networks with Stochastic Inputs. Leran Cai, Thomas Sauerwald |
| 2017 | Randomized Rumor Spreading Revisited. Benjamin Doerr, Anatolii Kostrygin |
| 2017 | Regular Separability of Parikh Automata. Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman |
| 2017 | Relaxations of Graph Isomorphism. Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis |
| 2017 | Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces. Matthias Kohler, Harald Räcke |
| 2017 | Rerouting Flows When Links Fail. Jannik Matuschke, S. Thomas McCormick, Gianpaolo Oriolo |
| 2017 | Reusable Garbled Deterministic Finite Automata from Learning With Errors. Shweta Agrawal, Ishaan Preet Singh |
| 2017 | Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting. Toni Böhnlein, Stefan Kratsch, Oliver Schaudt |
| 2017 | Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols. Ran Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas |
| 2017 | Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption. Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala |
| 2017 | Saving Critical Nodes with Firefighters is FPT. Jayesh Choudhari, Anirban Dasgupta, Neeldhara Misra, M. S. Ramanujan |
| 2017 | Selling Complementary Goods: Dynamics, Efficiency and Revenue. Moshe Babaioff, Liad Blumrosen, Noam Nisan |
| 2017 | Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers. Chengyu Lin, Shengyu Zhang |
| 2017 | Separation of AC^0[oplus] Formulas and Circuits. Benjamin Rossman, Srikanth Srinivasan |
| 2017 | Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems. Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Gianpiero Monaco |
| 2017 | Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups. Volker Diekert, Murray Elder |
| 2017 | Stochastic Control via Entropy Compression. Dimitris Achlioptas, Fotis Iliopoulos, Nikos Vlassis |
| 2017 | Stochastic k-Server: How Should Uber Work?. Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, Saeed Seddighin |
| 2017 | Streaming Communication Protocols. Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez |
| 2017 | String Inference from Longest-Common-Prefix Array. Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi |
| 2017 | Sublinear Random Access Generators for Preferential Attachment Graphs. Guy Even, Reut Levi, Moti Medina, Adi Rosén |
| 2017 | Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection. Talya Eden, Dana Ron, C. Seshadhri |
| 2017 | Subspace Designs Based on Algebraic Function Fields. Venkatesan Guruswami, Chaoping Xing, Chen Yuan |
| 2017 | Subspace-Invariant AC^0 Formulas. Benjamin Rossman |
| 2017 | Synchronizability of Communicating Finite State Machines is not Decidable. Alain Finkel, Étienne Lozes |
| 2017 | Testable Bounded Degree Graph Properties Are Random Order Streamable. Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, Christian Sohler |
| 2017 | Testing Core Membership in Public Goods Economies. Greg Bodwin |
| 2017 | The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights. Jiabao Lin, Hanpin Wang |
| 2017 | The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback. Amos Korman, Yoav Rodeh |
| 2017 | The Infinite Server Problem. Christian Coester, Elias Koutsoupias, Philip Lazos |
| 2017 | The Parameterized Complexity of Positional Games. Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine |
| 2017 | The Polytope-Collision Problem. Shaull Almagor, Joël Ouaknine, James Worrell |
| 2017 | The Power of Shared Randomness in Uncertain Communication. Badih Ghazi, Madhu Sudan |
| 2017 | Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. Raphaël Berthon, Mickael Randour, Jean-François Raskin |
| 2017 | Tight Lower Bounds for Multiplicative Weights Algorithmic Families. Nick Gravin, Yuval Peres, Balasubramanian Sivan |
| 2017 | Tighter Hard Instances for PPSZ. Pavel Pudlák, Dominik Scheder, Navid Talebanfard |
| 2017 | Universal Framework for Wireless Scheduling Problems. Eyjólfur Ingi Ásgeirsson, Magnús M. Halldórsson, Tigran Tonoyan |
| 2017 | When the Optimum is also Blind: a New Perspective on Universal Optimization. Marek Adamczyk, Fabrizio Grandoni, Stefano Leonardi, Michal Wlodarczyk |
| 2017 | Which Classes of Origin Graphs Are Generated by Transducers. Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle |
| 2017 | Word Equations in Nondeterministic Linear Space. Artur Jez |
| 2017 | k-Distinct In- and Out-Branchings in Digraphs. Gregory Z. Gutin, Felix Reidl, Magnus Wahlström |