LIPIcs, Volume 55, ICALP 2016

• Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi LIPIcs, Volume 55, ICALP'16, Complete Volume 10.4230/LIPIcs.ICALP.2016
• Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi Front Matter, Table of Contents, Preface, Organization, List of Authors 10.4230/LIPIcs.ICALP.2016.0
• Devavrat Shah Compute Choice (Invited Talk) 10.4230/LIPIcs.ICALP.2016.1
• Xavier Leroy Formally Verifying a Compiler: What Does It Mean, Exactly? (Invited Talk) 10.4230/LIPIcs.ICALP.2016.2
• Subhash Khot Hardness of Approximation (Invited Talk) 10.4230/LIPIcs.ICALP.2016.3
• Marta Z. Kwiatkowska Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice (Invited Talk) 10.4230/LIPIcs.ICALP.2016.4
• Mark de Berg, Kevin Buchin, Bart M. P. Jansen, and Gerhard Woeginger Fine-Grained Complexity Analysis of Two Classic TSP Variants 10.4230/LIPIcs.ICALP.2016.5
• Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, and Guy Kortsarz Bicovering: Covering Edges With Two Small Subsets of Vertices 10.4230/LIPIcs.ICALP.2016.6
• Chandra Chekuri, Alina Ene, and Marcin Pilipczuk Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs 10.4230/LIPIcs.ICALP.2016.7
• Martin Grohe Quasi-4-Connected Components 10.4230/LIPIcs.ICALP.2016.8
• Hans L. Bodlaender, Jesper Nederlof, and Tom C. van der Zanden Subexponential Time Algorithms for Embedding H-Minor Free Graphs 10.4230/LIPIcs.ICALP.2016.9
• Stephane Durocher and Debajyoti Mondal Relating Graph Thickness to Planar Layers and Bend Complexity 10.4230/LIPIcs.ICALP.2016.10
• Michael B. Cohen, Jelani Nelson, and David P. Woodruff Optimal Approximate Matrix Product in Terms of Stable Rank 10.4230/LIPIcs.ICALP.2016.11
• Tsuyoshi Ito and Stacey Jeffery Approximate Span Programs 10.4230/LIPIcs.ICALP.2016.12
• Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, and Seiichiro Tani Power of Quantum Computation with Few Clean Qubits 10.4230/LIPIcs.ICALP.2016.13
• Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, and Harumichi Nishimura Space-Efficient Error Reduction for Unitary Quantum Computations 10.4230/LIPIcs.ICALP.2016.14
• Itai Arad, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang Linear Time Algorithm for Quantum 2SAT 10.4230/LIPIcs.ICALP.2016.15
• Andrew M. Childs, Wim van Dam, Shih-Han Hung, and Igor E. Shparlinski Optimal Quantum Algorithm for Polynomial Interpolation 10.4230/LIPIcs.ICALP.2016.16
• Justin Thaler Lower Bounds for the Approximate Degree of Block-Composed Functions 10.4230/LIPIcs.ICALP.2016.17
• Zengfeng Huang and Pan Peng Dynamic Graph Stream Algorithms in o(n) Space 10.4230/LIPIcs.ICALP.2016.18
• Vincent Cohen-Addad, Chris Schwiegelshohn, and Christian Sohler Diameter and k-Center in Sliding Windows 10.4230/LIPIcs.ICALP.2016.19
• Raphaël Clifford and Tatiana Starikovskaya Approximate Hamming Distance in a Stream 10.4230/LIPIcs.ICALP.2016.20
• Sina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, and Saeed Seddighin Price of Competition and Dueling Games 10.4230/LIPIcs.ICALP.2016.21
• Telikepalli Kavitha Popular Half-Integral Matchings 10.4230/LIPIcs.ICALP.2016.22
• Meena Boppana, Rani Hod, Michael Mitzenmacher, and Tom Morgan Voronoi Choice Games 10.4230/LIPIcs.ICALP.2016.23
• Aviv Adler, Constantinos Daskalakis, and Erik D. Demaine The Complexity of Hex and the Jordan Curve Theorem 10.4230/LIPIcs.ICALP.2016.24
• Till Fluschnik, Danny Hermelin, André Nichterlein, and Rolf Niedermeier Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems 10.4230/LIPIcs.ICALP.2016.25
• Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, and Saket Saurabh Kernelization of Cycle Packing with Relaxed Disjointness Constraints 10.4230/LIPIcs.ICALP.2016.26
• Andreas Emil Feldmann and Dániel Marx The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems 10.4230/LIPIcs.ICALP.2016.27
• Dániel Marx and Valia Mitsou Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth 10.4230/LIPIcs.ICALP.2016.28
• Vipul Goyal, Dakshita Khurana, Ilya Mironov, Omkant Pandey, and Amit Sahai Do Distributed Differentially-Private Protocols Require Oblivious Transfer? 10.4230/LIPIcs.ICALP.2016.29
• Benoît Libert, Somindu C. Ramanna, and Moti Yung Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions 10.4230/LIPIcs.ICALP.2016.30
• Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, and Jalaj Upadhyay Block-Wise Non-Malleable Codes 10.4230/LIPIcs.ICALP.2016.31
• Richard J. Lipton, Rafail Ostrovsky, and Vassilis Zikas Provably Secure Virus Detection: Using The Observer Effect Against Malware 10.4230/LIPIcs.ICALP.2016.32
• Neeraj Kayal, Chandan Saha, and Sébastien Tavenas An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits 10.4230/LIPIcs.ICALP.2016.33
• Joshua A. Grochow, Ketan D. Mulmuley, and Youming Qiao Boundaries of VP and VNP 10.4230/LIPIcs.ICALP.2016.34
• Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, and Ning Xie AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product 10.4230/LIPIcs.ICALP.2016.35
• Stephen Cook, Jeff Edmonds, Venkatesh Medabalimi, and Toniann Pitassi Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs 10.4230/LIPIcs.ICALP.2016.36
• Mark Bun and Justin Thaler Improved Bounds on the Sign-Rank of AC^0 10.4230/LIPIcs.ICALP.2016.37
• Avishay Tal On the Sensitivity Conjecture 10.4230/LIPIcs.ICALP.2016.38
• Jesper W. Mikkelsen Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation 10.4230/LIPIcs.ICALP.2016.39
• Noa Elad, Satyen Kale, and Joseph (Seffi) Naor Online Semidefinite Programming 10.4230/LIPIcs.ICALP.2016.40
• Sandy Heydrich and Rob van Stee Beating the Harmonic Lower Bound for Online Bin Packing 10.4230/LIPIcs.ICALP.2016.41
• Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, and Saeed Seddighin Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering 10.4230/LIPIcs.ICALP.2016.42
• Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, and Rotem Zach Carpooling in Social Networks 10.4230/LIPIcs.ICALP.2016.43
• Jaroslaw Blasiok and Jelani Nelson An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm 10.4230/LIPIcs.ICALP.2016.44
• Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Daniel Stefankovic Approximation via Correlation Decay When Strong Spatial Mixing Fails 10.4230/LIPIcs.ICALP.2016.45
• Andreas Galanis, Leslie Ann Goldberg, and Mark Jerrum A Complexity Trichotomy for Approximately Counting List H-Colourings 10.4230/LIPIcs.ICALP.2016.46
• Radu Curticapean Parity Separation: A Scientifically Proven Method for Permanent Weight Loss 10.4230/LIPIcs.ICALP.2016.47
• Søren Dahlgaard On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter 10.4230/LIPIcs.ICALP.2016.48
• Loukas Georgiadis, Giuseppe F. Italiano, and Nikos Parotsidis Incremental 2-Edge-Connectivity in Directed Graphs 10.4230/LIPIcs.ICALP.2016.49
• Di Wang, Satish Rao, and Michael W. Mahoney Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction 10.4230/LIPIcs.ICALP.2016.50
• Thomas Dueholm Hansen and Uri Zwick Random-Edge Is Slower Than Random-Facet on Abstract Cubes 10.4230/LIPIcs.ICALP.2016.51
• Michael W. Mahoney, Satish Rao, Di Wang, and Peng Zhang Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^{-3}) Time 10.4230/LIPIcs.ICALP.2016.52
• Zeyuan Allen-Zhu, Zhenyu Liao, and Yang Yuan Optimization Algorithms for Faster Computational Geometry 10.4230/LIPIcs.ICALP.2016.53
• Jelena Marasevic, Clifford Stein, and Gil Zussman A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems 10.4230/LIPIcs.ICALP.2016.54
• Christian Sommer All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing 10.4230/LIPIcs.ICALP.2016.55
• Ilario Bonacina Total Space in Resolution Is at Least Width Squared 10.4230/LIPIcs.ICALP.2016.56
• Christoph Berkholz and Jakob Nordström Supercritical Space-Width Trade-Offs for Resolution 10.4230/LIPIcs.ICALP.2016.57
• Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, and R. Ryan Williams Deterministic Time-Space Trade-Offs for k-SUM 10.4230/LIPIcs.ICALP.2016.58
• Justin Thaler Semi-Streaming Algorithms for Annotated Graph Streams 10.4230/LIPIcs.ICALP.2016.59
• Ben-David Shalev and Robin Kothari Randomized Query Complexity of Sabotaged and Composed Functions 10.4230/LIPIcs.ICALP.2016.60
• Mark Braverman, Ran Gelles, Jieming Mao, and Rafail Ostrovsky Coding for Interactive Communication Correcting Insertions and Deletions 10.4230/LIPIcs.ICALP.2016.61
• Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, and David Richerby Amplifiers for the Moran Process 10.4230/LIPIcs.ICALP.2016.62
• Ioannis Panageas and Nisheeth K. Vishnoi Mixing Time of Markov Chains, Dynamical Systems and Evolution 10.4230/LIPIcs.ICALP.2016.63
• Jun Wan, Yu Xia, Liang Li, and Thomas Moscibroda Information Cascades on Arbitrary Topologies 10.4230/LIPIcs.ICALP.2016.64
• Samuel Hetterich Analysing Survey Propagation Guided Decimationon Random Formulas 10.4230/LIPIcs.ICALP.2016.65
• Anupam Gupta, Guru Guruganesh, and Melanie Schmidt Approximation Algorithms for Aversion k-Clustering via Local k-Median 10.4230/LIPIcs.ICALP.2016.66
• Deeparnab Chakrabarty, Prachi Goyal, and Ravishankar Krishnaswamy The Non-Uniform k-Center Problem 10.4230/LIPIcs.ICALP.2016.67
• Maria-Florina Balcan, Nika Haghtalab, and Colin White k-Center Clustering Under Perturbation Resilience 10.4230/LIPIcs.ICALP.2016.68
• Sara Ahmadian and Chaitanya Swamy Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers 10.4230/LIPIcs.ICALP.2016.69
• Frans Schalekamp, Anke van Zuylen, and Suzanne van der Ster A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest 10.4230/LIPIcs.ICALP.2016.70
• David Adjiashvili, Viktor Bindewald, and Dennis Michaels Robust Assignments via Ear Decompositions and Randomized Rounding 10.4230/LIPIcs.ICALP.2016.71
• Klaus Jansen, Kim-Manuel Klein, and José Verschae Closing the Gap for Makespan Scheduling via Sparsification Techniques 10.4230/LIPIcs.ICALP.2016.72
• Gökalp Demirci and Shi Li Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation 10.4230/LIPIcs.ICALP.2016.73
• Bundit Laekhanukit Approximating Directed Steiner Problems via Tree Embedding 10.4230/LIPIcs.ICALP.2016.74
• Zachary Friggstad and Yifeng Zhang Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median 10.4230/LIPIcs.ICALP.2016.75
• Shi Bai, Damien Stehlé, and Weiqiang Wen Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices 10.4230/LIPIcs.ICALP.2016.76
• Henry Yuen A Parallel Repetition Theorem for All Entangled Games 10.4230/LIPIcs.ICALP.2016.77
• Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems 10.4230/LIPIcs.ICALP.2016.78
• Jonah Brown-Cohen and Prasad Raghavendra Correlation Decay and Tractability of CSPs 10.4230/LIPIcs.ICALP.2016.79
• Huck Bennett, Daniel Reichman, and Igor Shinkar On Percolation and NP-Hardness 10.4230/LIPIcs.ICALP.2016.80
• Arturs Backurs, Nishanth Dikkala, and Christos Tzamos Tight Hardness Results for Maximum Weight Rectangles 10.4230/LIPIcs.ICALP.2016.81
• Kasper Green Larsen and Jelani Nelson The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction 10.4230/LIPIcs.ICALP.2016.82
• Alexandr Andoni, Assaf Naor, and Ofer Neiman Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost 10.4230/LIPIcs.ICALP.2016.83
• Yitong Yin Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities 10.4230/LIPIcs.ICALP.2016.84
• Facundo Mémoli, Anastasios Sidiropoulos, and Vijay Sridhar Quasimetric Embeddings and Their Applications 10.4230/LIPIcs.ICALP.2016.85
• Mika Göös, Toniann Pitassi, and Thomas Watson The Landscape of Communication Complexity Classes 10.4230/LIPIcs.ICALP.2016.86
• Mark Braverman and Jon Schneider Information Complexity Is Computable 10.4230/LIPIcs.ICALP.2016.87
• Manoj M. Prabhakaran and Vinod M. Prabhakaran Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound 10.4230/LIPIcs.ICALP.2016.88
• Pavel Hrubes and Amir Yehudayoff On Isoperimetric Profiles and Computational Complexity 10.4230/LIPIcs.ICALP.2016.89
• Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova Tolerant Testers of Image Properties 10.4230/LIPIcs.ICALP.2016.90
• Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, and Nithin Varma Erasure-Resilient Property Testing 10.4230/LIPIcs.ICALP.2016.91
• Allan Grønlund and Kasper Green Larsen Towards Tight Lower Bounds for Range Reporting on the RAM 10.4230/LIPIcs.ICALP.2016.92
• Peyman Afshani and Jesper Sindahl Nielsen Data Structure Lower Bounds for Document Indexing Problems 10.4230/LIPIcs.ICALP.2016.93
• Hubie Chen Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness 10.4230/LIPIcs.ICALP.2016.94
• Thomas Wilke Past, Present, and Infinite Future 10.4230/LIPIcs.ICALP.2016.95
• Mikolaj Bojanczyk Thin MSO with a Probabilistic Path Quantifier 10.4230/LIPIcs.ICALP.2016.96
• Jean Goubault-Larrecq and Sylvain Schmitz Deciding Piecewise Testable Separability for Regular Tree Languages 10.4230/LIPIcs.ICALP.2016.97
• Krishnendu Chatterjee and Laurent Doyen Computation Tree Logic for Synchronization Properties 10.4230/LIPIcs.ICALP.2016.98
• Michal Skrzypczak and Igor Walukiewicz Deciding the Topological Complexity of Büchi Languages 10.4230/LIPIcs.ICALP.2016.99
• Ventsislav Chonev, Joël Ouaknine, and James Worrell On the Skolem Problem for Continuous Linear Dynamical Systems 10.4230/LIPIcs.ICALP.2016.100
• Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Pierre Carlier Analysing Decisive Stochastic Processes 10.4230/LIPIcs.ICALP.2016.101
• Daniel Gburek, Christel Baier, and Sascha Klüppelholz Composition of Stochastic Transition Systems Based on Spans and Couplings 10.4230/LIPIcs.ICALP.2016.102
• Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, and James Worrell On Restricted Nonnegative Matrix Factorization 10.4230/LIPIcs.ICALP.2016.103
• Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, and James Worrell Proving the Herman-Protocol Conjecture 10.4230/LIPIcs.ICALP.2016.104
• Stefan Göller, Christoph Haase, Ranko Lazic, and Patrick Totzke A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One 10.4230/LIPIcs.ICALP.2016.105
• Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, and Daniel Stan Reachability in Networks of Register Protocols under Stochastic Schedulers 10.4230/LIPIcs.ICALP.2016.106
• Gilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub A Program Logic for Union Bounds 10.4230/LIPIcs.ICALP.2016.107
• Mathieu Hoyrup The Decidable Properties of Subrecursive Functions 10.4230/LIPIcs.ICALP.2016.108
• Olivier Bournez, Daniel S. Graça, and Amaury Pouly Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations 10.4230/LIPIcs.ICALP.2016.109
• Mathieu Sablik and Michael Schraudner Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic 10.4230/LIPIcs.ICALP.2016.110
• Kazuyuki Asada and Naoki Kobayashi On Word and Frontier Languages of Unsafe Higher-Order Grammars 10.4230/LIPIcs.ICALP.2016.111
• Mai Gehrke, Daniela Petrisan, and Luca Reggio The Schützenberger Product for Syntactic Spaces 10.4230/LIPIcs.ICALP.2016.112
• Kohei Kishida Logic of Local Inference for Contextuality in Quantum Physics and Beyond 10.4230/LIPIcs.ICALP.2016.113
• Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis Minimizing Resources of Sweeping and Streaming String Transducers 10.4230/LIPIcs.ICALP.2016.114
• Anaël Grandjean and Victor Poupet A Linear Acceleration Theorem for 2D Cellular Automata on All Complete Neighborhoods 10.4230/LIPIcs.ICALP.2016.115
• Hellis Tamm New Interpretation and Generalization of the Kameda-Weiner Method 10.4230/LIPIcs.ICALP.2016.116
• M. Praveen and B. Srivathsan Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity 10.4230/LIPIcs.ICALP.2016.117
• Laurent Feuilloley, Pierre Fraigniaud, and Juho Hirvonen A Hierarchy of Local Decision 10.4230/LIPIcs.ICALP.2016.118
• Manuel Bodirsky, Barnaby Martin, Michael Pinsker, and András Pongrácz Constraint Satisfaction Problems for Reducts of Homogeneous Graphs 10.4230/LIPIcs.ICALP.2016.119
• Myrto Arapinis, Diego Figueira, and Marco Gaboardi Sensitivity of Counting Queries 10.4230/LIPIcs.ICALP.2016.120
• Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin The Complexity of Rational Synthesis 10.4230/LIPIcs.ICALP.2016.121
• Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, and Markus L. Schmid On the Complexity of Grammar-Based Compression over Fixed Alphabets 10.4230/LIPIcs.ICALP.2016.122
• Georg Zetzsche The Complexity of Downward Closure Comparisons 10.4230/LIPIcs.ICALP.2016.123
• Gabriele Fici, Antonio Restivo, Manuel Silva, and Luca Q. Zamboni Anti-Powers in Infinite Words 10.4230/LIPIcs.ICALP.2016.124
• Emmanuel Filiot, Ismaël Jecker, Christof Löding, and Sarah Winter On Equivalence and Uniformisation Problems for Finite Transducers 10.4230/LIPIcs.ICALP.2016.125
• Thomas Colcombet and Nathanaël Fijalkow The Bridge Between Regular Cost Functions and Omega-Regular Languages 10.4230/LIPIcs.ICALP.2016.126
• Volker Diekert, Artur Jez, and Manfred Kufleitner Solutions of Word Equations Over Partially Commutative Structures 10.4230/LIPIcs.ICALP.2016.127
• Dmitry Chistikov and Christoph Haase The Taming of the Semi-Linear Set 10.4230/LIPIcs.ICALP.2016.128
• Volker Diekert and Tobias Walter Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay 10.4230/LIPIcs.ICALP.2016.129
• Keerti Choudhary An Optimal Dual Fault Tolerant Reachability Oracle 10.4230/LIPIcs.ICALP.2016.130
• Yun Kuen Cheung, Gramoz Goranci, and Monika Henzinger Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds 10.4230/LIPIcs.ICALP.2016.131
• Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, and Ely Porat Distance Labeling Schemes for Trees 10.4230/LIPIcs.ICALP.2016.132
• Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, and Christian Wulff-Nilsen Near Optimal Adjacency Labeling Schemes for Power-Law Graphs 10.4230/LIPIcs.ICALP.2016.133
• Marco Chiesa, Andrei Gurtov, Aleksander Madry, Slobodan Mitrovic, Ilya Nikolaevskiy, Michael Shapira, and Scott Shenker On the Resiliency of Randomized Routing Against Multiple Edge Failures 10.4230/LIPIcs.ICALP.2016.134
• Prahladh Harsha, Rahul Jain, and Jaikumar Radhakrishnan Partition Bound Is Quadratically Tight for Product Distributions 10.4230/LIPIcs.ICALP.2016.135
• Petra Berenbrink, Tom Friedetzky, George Giakkoupis, and Peter Kling Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time 10.4230/LIPIcs.ICALP.2016.136
• Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak Fast, Robust, Quantizable Approximate Consensus 10.4230/LIPIcs.ICALP.2016.137
• Mohsen Ghaffari and Calvin Newport Leader Election in Unreliable Radio Networks 10.4230/LIPIcs.ICALP.2016.138
• Artur Czumaj and Peter Davies Faster Deterministic Communication in Radio Networks 10.4230/LIPIcs.ICALP.2016.139
• Moshe Babaioff, Liad Blumrosen, and Noam Nisan Networks of Complements 10.4230/LIPIcs.ICALP.2016.140
• Piotr Krysta and Jinshan Zhang House Markets with Matroid and Knapsack Constraints 10.4230/LIPIcs.ICALP.2016.141
• Gagan Goel, Stefano Leonardi, Vahab Mirrokni, Afshin Nikzad, and Renato Paes-Leme Reservation Exchange Markets for Internet Advertising 10.4230/LIPIcs.ICALP.2016.142
• Sungjin Im, Janardhan Kulkarni, and Kamesh Munagala Competitive Analysis of Constrained Queueing Systems 10.4230/LIPIcs.ICALP.2016.143
• Colin Cooper and Nicolás Rivera The Linear Voting Model 10.4230/LIPIcs.ICALP.2016.144
• Colin Cooper, Martin Dyer, Alan Frieze, and Nicolás Rivera Discordant Voting Processes on Finite Graphs 10.4230/LIPIcs.ICALP.2016.145
• Petra Berenbrink, George Giakkoupis, Anne-Marie Kermarrec, and Frederik Mallmann-Trenn Bounds on the Voter Model in Dynamic Networks 10.4230/LIPIcs.ICALP.2016.146
• Christoph Koch and Johannes Lengler Bootstrap Percolation on Geometric Inhomogeneous Random Graphs 10.4230/LIPIcs.ICALP.2016.147
• Alessio Conte, Roberto Grossi, Andrea Marino, and Luca Versari Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques 10.4230/LIPIcs.ICALP.2016.148
• Kyriakos Axiotis and Dimitris Fotakis On the Size and the Approximability of Minimum Temporally Connected Subgraphs 10.4230/LIPIcs.ICALP.2016.149
• Benjamin Doerr and Marvin Künnemann Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem 10.4230/LIPIcs.ICALP.2016.150