LIPIcs, Volume 80, ICALP 2017

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