Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi. LIPIcs, Volume 55, ICALP'16, Complete Volume. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@Proceedings{chatzigiannakis_et_al:LIPIcs.ICALP.2016, title = {{LIPIcs, Volume 55, ICALP'16, Complete Volume}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016}, URN = {urn:nbn:de:0030-drops-65844}, doi = {10.4230/LIPIcs.ICALP.2016}, annote = {Keywords: Theory of Computation} }
Ioannis Chatzigiannakis, Michael Mitzenmacher, Yuval Rabani, and Davide Sangiorgi. Front Matter, Table of Contents, Preface, Organization, List of Authors. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 0:i-0:xliv, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chatzigiannakis_et_al:LIPIcs.ICALP.2016.0, author = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, title = {{Front Matter, Table of Contents, Preface, Organization, List of Authors}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {0:i--0:xliv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.0}, URN = {urn:nbn:de:0030-drops-61917}, doi = {10.4230/LIPIcs.ICALP.2016.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Organization, List of Authors} }
Devavrat Shah. Compute Choice (Invited Talk). In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, p. 1:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{shah:LIPIcs.ICALP.2016.1, author = {Shah, Devavrat}, title = {{Compute Choice}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {1:1--1:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.1}, URN = {urn:nbn:de:0030-drops-63374}, doi = {10.4230/LIPIcs.ICALP.2016.1}, annote = {Keywords: Decision Systems, Learning Distributions, Partial observations} }
Xavier Leroy. Formally Verifying a Compiler: What Does It Mean, Exactly? (Invited Talk). In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, p. 2:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{leroy:LIPIcs.ICALP.2016.2, author = {Leroy, Xavier}, title = {{Formally Verifying a Compiler: What Does It Mean, Exactly?}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {2:1--2:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.2}, URN = {urn:nbn:de:0030-drops-63384}, doi = {10.4230/LIPIcs.ICALP.2016.2}, annote = {Keywords: Compilers, Compiler Optimization, Compiler Verification} }
Subhash Khot. Hardness of Approximation (Invited Talk). In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, p. 3:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{khot:LIPIcs.ICALP.2016.3, author = {Khot, Subhash}, title = {{Hardness of Approximation}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {3:1--3:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.3}, URN = {urn:nbn:de:0030-drops-63395}, doi = {10.4230/LIPIcs.ICALP.2016.3}, annote = {Keywords: NP-completeness, Approximation algorithms, Inapproximability, Probabilistically Checkable Proofs, Discrete Fourier analysis} }
Marta Z. Kwiatkowska. Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice (Invited Talk). In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 4:1-4:18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kwiatkowska:LIPIcs.ICALP.2016.4, author = {Kwiatkowska, Marta Z.}, title = {{Model Checking and Strategy Synthesis for Stochastic Games: From Theory to Practice}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {4:1--4:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.4}, URN = {urn:nbn:de:0030-drops-62285}, doi = {10.4230/LIPIcs.ICALP.2016.4}, annote = {Keywords: Quantitative verification, Stochastic games, Temporal logic, Model checking, Strategy synthesis} }
Mark de Berg, Kevin Buchin, Bart M. P. Jansen, and Gerhard Woeginger. Fine-Grained Complexity Analysis of Two Classic TSP Variants. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 5:1-5:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{deberg_et_al:LIPIcs.ICALP.2016.5, author = {de Berg, Mark and Buchin, Kevin and Jansen, Bart M. P. and Woeginger, Gerhard}, title = {{Fine-Grained Complexity Analysis of Two Classic TSP Variants}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {5:1--5:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.5}, URN = {urn:nbn:de:0030-drops-62770}, doi = {10.4230/LIPIcs.ICALP.2016.5}, annote = {Keywords: Traveling salesman problem, fine-grained complexity, bitonic tours, k-opt} }
Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, and Guy Kortsarz. Bicovering: Covering Edges With Two Small Subsets of Vertices. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 6:1-6:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bhangale_et_al:LIPIcs.ICALP.2016.6, author = {Bhangale, Amey and Gandhi, Rajiv and Hajiaghayi, Mohammad Taghi and Khandekar, Rohit and Kortsarz, Guy}, title = {{Bicovering: Covering Edges With Two Small Subsets of Vertices}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {6:1--6:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.6}, URN = {urn:nbn:de:0030-drops-62728}, doi = {10.4230/LIPIcs.ICALP.2016.6}, annote = {Keywords: Bi-covering, Unique Games, Max Bi-clique} }
Chandra Chekuri, Alina Ene, and Marcin Pilipczuk. Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 7:1-7:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chekuri_et_al:LIPIcs.ICALP.2016.7, author = {Chekuri, Chandra and Ene, Alina and Pilipczuk, Marcin}, title = {{Constant Congestion Routing of Symmetric Demands in Planar Directed Graphs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {7:1--7:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.7}, URN = {urn:nbn:de:0030-drops-62737}, doi = {10.4230/LIPIcs.ICALP.2016.7}, annote = {Keywords: Disjoint paths, symmetric demands, planar directed graph} }
Martin Grohe. Quasi-4-Connected Components. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 8:1-8:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{grohe:LIPIcs.ICALP.2016.8, author = {Grohe, Martin}, title = {{Quasi-4-Connected Components}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.8}, URN = {urn:nbn:de:0030-drops-62740}, doi = {10.4230/LIPIcs.ICALP.2016.8}, annote = {Keywords: decompositions, connectivity, tangles} }
Hans L. Bodlaender, Jesper Nederlof, and Tom C. van der Zanden. Subexponential Time Algorithms for Embedding H-Minor Free Graphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bodlaender_et_al:LIPIcs.ICALP.2016.9, author = {Bodlaender, Hans L. and Nederlof, Jesper and van der Zanden, Tom C.}, title = {{Subexponential Time Algorithms for Embedding H-Minor Free Graphs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.9}, URN = {urn:nbn:de:0030-drops-62756}, doi = {10.4230/LIPIcs.ICALP.2016.9}, annote = {Keywords: subgraph isomorphism, graph minors, subexponential time} }
Stephane Durocher and Debajyoti Mondal. Relating Graph Thickness to Planar Layers and Bend Complexity. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 10:1-10:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{durocher_et_al:LIPIcs.ICALP.2016.10, author = {Durocher, Stephane and Mondal, Debajyoti}, title = {{Relating Graph Thickness to Planar Layers and Bend Complexity}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.10}, URN = {urn:nbn:de:0030-drops-62767}, doi = {10.4230/LIPIcs.ICALP.2016.10}, annote = {Keywords: Graph Drawing, Thickness, Geometric Thickness, Layers; Bends} }
Michael B. Cohen, Jelani Nelson, and David P. Woodruff. Optimal Approximate Matrix Product in Terms of Stable Rank. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{cohen_et_al:LIPIcs.ICALP.2016.11, author = {Cohen, Michael B. and Nelson, Jelani and Woodruff, David P.}, title = {{Optimal Approximate Matrix Product in Terms of Stable Rank}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.11}, URN = {urn:nbn:de:0030-drops-62788}, doi = {10.4230/LIPIcs.ICALP.2016.11}, annote = {Keywords: subspace embeddings, approximate matrix multiplication, stable rank, regression, low rank approximation} }
Tsuyoshi Ito and Stacey Jeffery. Approximate Span Programs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 12:1-12:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{ito_et_al:LIPIcs.ICALP.2016.12, author = {Ito, Tsuyoshi and Jeffery, Stacey}, title = {{Approximate Span Programs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.12}, URN = {urn:nbn:de:0030-drops-62956}, doi = {10.4230/LIPIcs.ICALP.2016.12}, annote = {Keywords: Quantum algorithms, span programs, quantum query complexity, effective resistance} }
Keisuke Fujii, Hirotada Kobayashi, Tomoyuki Morimae, Harumichi Nishimura, Shuhei Tamate, and Seiichiro Tani. Power of Quantum Computation with Few Clean Qubits. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 13:1-13:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fujii_et_al:LIPIcs.ICALP.2016.13, author = {Fujii, Keisuke and Kobayashi, Hirotada and Morimae, Tomoyuki and Nishimura, Harumichi and Tamate, Shuhei and Tani, Seiichiro}, title = {{Power of Quantum Computation with Few Clean Qubits}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.13}, URN = {urn:nbn:de:0030-drops-62960}, doi = {10.4230/LIPIcs.ICALP.2016.13}, annote = {Keywords: DQC1, quantum computing, complete problems, error reduction} }
Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, and Harumichi Nishimura. Space-Efficient Error Reduction for Unitary Quantum Computations. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 14:1-14:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fefferman_et_al:LIPIcs.ICALP.2016.14, author = {Fefferman, Bill and Kobayashi, Hirotada and Yen-Yu Lin, Cedric and Morimae, Tomoyuki and Nishimura, Harumichi}, title = {{Space-Efficient Error Reduction for Unitary Quantum Computations}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.14}, URN = {urn:nbn:de:0030-drops-62975}, doi = {10.4230/LIPIcs.ICALP.2016.14}, annote = {Keywords: space-bounded computation, quantum Merlin-Arthur proof systems, error reduction, quantum computing} }
Itai Arad, Miklos Santha, Aarthi Sundaram, and Shengyu Zhang. Linear Time Algorithm for Quantum 2SAT. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 15:1-15:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{arad_et_al:LIPIcs.ICALP.2016.15, author = {Arad, Itai and Santha, Miklos and Sundaram, Aarthi and Zhang, Shengyu}, title = {{Linear Time Algorithm for Quantum 2SAT}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {15:1--15:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.15}, URN = {urn:nbn:de:0030-drops-62795}, doi = {10.4230/LIPIcs.ICALP.2016.15}, annote = {Keywords: Quantum SAT, Davis-Putnam Procedure, Linear Time Algorithm} }
Andrew M. Childs, Wim van Dam, Shih-Han Hung, and Igor E. Shparlinski. Optimal Quantum Algorithm for Polynomial Interpolation. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 16:1-16:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{childs_et_al:LIPIcs.ICALP.2016.16, author = {Childs, Andrew M. and van Dam, Wim and Hung, Shih-Han and Shparlinski, Igor E.}, title = {{Optimal Quantum Algorithm for Polynomial Interpolation}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {16:1--16:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.16}, URN = {urn:nbn:de:0030-drops-62985}, doi = {10.4230/LIPIcs.ICALP.2016.16}, annote = {Keywords: Quantum algorithms, query complexity, polynomial interpolation, finite fields} }
Justin Thaler. Lower Bounds for the Approximate Degree of Block-Composed Functions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 17:1-17:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{thaler:LIPIcs.ICALP.2016.17, author = {Thaler, Justin}, title = {{Lower Bounds for the Approximate Degree of Block-Composed Functions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {17:1--17:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.17}, URN = {urn:nbn:de:0030-drops-63133}, doi = {10.4230/LIPIcs.ICALP.2016.17}, annote = {Keywords: approximate degree, one-sided approximate degree, polynomial approx- imations, threshold degree, communication complexity} }
Zengfeng Huang and Pan Peng. Dynamic Graph Stream Algorithms in o(n) Space. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 18:1-18:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{huang_et_al:LIPIcs.ICALP.2016.18, author = {Huang, Zengfeng and Peng, Pan}, title = {{Dynamic Graph Stream Algorithms in o(n) Space}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.18}, URN = {urn:nbn:de:0030-drops-62801}, doi = {10.4230/LIPIcs.ICALP.2016.18}, annote = {Keywords: dynamic graph streams, sketching, property testing, minimum spanning tree} }
Vincent Cohen-Addad, Chris Schwiegelshohn, and Christian Sohler. Diameter and k-Center in Sliding Windows. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 19:1-19:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{cohenaddad_et_al:LIPIcs.ICALP.2016.19, author = {Cohen-Addad, Vincent and Schwiegelshohn, Chris and Sohler, Christian}, title = {{Diameter and k-Center in Sliding Windows}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {19:1--19:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.19}, URN = {urn:nbn:de:0030-drops-63401}, doi = {10.4230/LIPIcs.ICALP.2016.19}, annote = {Keywords: Streaming, k-Center, Diameter, Sliding Windows} }
Raphaël Clifford and Tatiana Starikovskaya. Approximate Hamming Distance in a Stream. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 20:1-20:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{clifford_et_al:LIPIcs.ICALP.2016.20, author = {Clifford, Rapha\"{e}l and Starikovskaya, Tatiana}, title = {{Approximate Hamming Distance in a Stream}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.20}, URN = {urn:nbn:de:0030-drops-62992}, doi = {10.4230/LIPIcs.ICALP.2016.20}, annote = {Keywords: Hamming distance, communication complexity, data stream model} }
Sina Dehghani, Mohammad Taghi Hajiaghayi, Hamid Mahini, and Saeed Seddighin. Price of Competition and Dueling Games. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 21:1-21:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{dehghani_et_al:LIPIcs.ICALP.2016.21, author = {Dehghani, Sina and Hajiaghayi, Mohammad Taghi and Mahini, Hamid and Seddighin, Saeed}, title = {{Price of Competition and Dueling Games}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.21}, URN = {urn:nbn:de:0030-drops-63009}, doi = {10.4230/LIPIcs.ICALP.2016.21}, annote = {Keywords: POC, POA, Dueling games, Nash equilibria, sponsored search} }
Telikepalli Kavitha. Popular Half-Integral Matchings. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 22:1-22:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kavitha:LIPIcs.ICALP.2016.22, author = {Kavitha, Telikepalli}, title = {{Popular Half-Integral Matchings}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {22:1--22:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.22}, URN = {urn:nbn:de:0030-drops-63011}, doi = {10.4230/LIPIcs.ICALP.2016.22}, annote = {Keywords: bipartite graphs, stable matchings, fractional matchings, polytopes} }
Meena Boppana, Rani Hod, Michael Mitzenmacher, and Tom Morgan. Voronoi Choice Games. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 23:1-23:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{boppana_et_al:LIPIcs.ICALP.2016.23, author = {Boppana, Meena and Hod, Rani and Mitzenmacher, Michael and Morgan, Tom}, title = {{Voronoi Choice Games}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.23}, URN = {urn:nbn:de:0030-drops-63022}, doi = {10.4230/LIPIcs.ICALP.2016.23}, annote = {Keywords: Voronoi games, correlated equilibria, power of two choices, Hotelling model} }
Aviv Adler, Constantinos Daskalakis, and Erik D. Demaine. The Complexity of Hex and the Jordan Curve Theorem. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 24:1-24:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{adler_et_al:LIPIcs.ICALP.2016.24, author = {Adler, Aviv and Daskalakis, Constantinos and Demaine, Erik D.}, title = {{The Complexity of Hex and the Jordan Curve Theorem}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.24}, URN = {urn:nbn:de:0030-drops-63032}, doi = {10.4230/LIPIcs.ICALP.2016.24}, annote = {Keywords: Jordan, Brouwer, Hex, PPAD, PSPACE} }
Till Fluschnik, Danny Hermelin, André Nichterlein, and Rolf Niedermeier. Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 25:1-25:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fluschnik_et_al:LIPIcs.ICALP.2016.25, author = {Fluschnik, Till and Hermelin, Danny and Nichterlein, Andr\'{e} and Niedermeier, Rolf}, title = {{Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {25:1--25:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.25}, URN = {urn:nbn:de:0030-drops-63049}, doi = {10.4230/LIPIcs.ICALP.2016.25}, annote = {Keywords: Parameterized complexity, polynomial-time data reduction, cross-compositions, lower bounds, graph modification problems, interdiction problems} }
Akanksha Agrawal, Daniel Lokshtanov, Diptapriyo Majumdar, Amer E. Mouawad, and Saket Saurabh. Kernelization of Cycle Packing with Relaxed Disjointness Constraints. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 26:1-26:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{agrawal_et_al:LIPIcs.ICALP.2016.26, author = {Agrawal, Akanksha and Lokshtanov, Daniel and Majumdar, Diptapriyo and Mouawad, Amer E. and Saurabh, Saket}, title = {{Kernelization of Cycle Packing with Relaxed Disjointness Constraints}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {26:1--26:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.26}, URN = {urn:nbn:de:0030-drops-63053}, doi = {10.4230/LIPIcs.ICALP.2016.26}, annote = {Keywords: parameterized complexity, cycle packing, kernelization, relaxation} }
Andreas Emil Feldmann and Dániel Marx. The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 27:1-27:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{feldmann_et_al:LIPIcs.ICALP.2016.27, author = {Feldmann, Andreas Emil and Marx, D\'{a}niel}, title = {{The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.27}, URN = {urn:nbn:de:0030-drops-63060}, doi = {10.4230/LIPIcs.ICALP.2016.27}, annote = {Keywords: Directed Steiner Tree, Directed Steiner Network, fixed-parameter tractability, dichotomy} }
Dániel Marx and Valia Mitsou. Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 28:1-28:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{marx_et_al:LIPIcs.ICALP.2016.28, author = {Marx, D\'{a}niel and Mitsou, Valia}, title = {{Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.28}, URN = {urn:nbn:de:0030-drops-63078}, doi = {10.4230/LIPIcs.ICALP.2016.28}, annote = {Keywords: Parameterized Complexity, List coloring, Treewidth, Lower bounds under ETH} }
Vipul Goyal, Dakshita Khurana, Ilya Mironov, Omkant Pandey, and Amit Sahai. Do Distributed Differentially-Private Protocols Require Oblivious Transfer?. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 29:1-29:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{goyal_et_al:LIPIcs.ICALP.2016.29, author = {Goyal, Vipul and Khurana, Dakshita and Mironov, Ilya and Pandey, Omkant and Sahai, Amit}, title = {{Do Distributed Differentially-Private Protocols Require Oblivious Transfer?}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {29:1--29:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.29}, URN = {urn:nbn:de:0030-drops-63080}, doi = {10.4230/LIPIcs.ICALP.2016.29}, annote = {Keywords: Oblivious Transfer, Distributed Differential Privacy, Noisy Channels, Weak Noisy Channels} }
Benoît Libert, Somindu C. Ramanna, and Moti Yung. Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 30:1-30:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{libert_et_al:LIPIcs.ICALP.2016.30, author = {Libert, Beno\^{i}t and Ramanna, Somindu C. and Yung, Moti}, title = {{Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {30:1--30:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.30}, URN = {urn:nbn:de:0030-drops-63096}, doi = {10.4230/LIPIcs.ICALP.2016.30}, annote = {Keywords: Cryptography, commitment schemes, functional commitments, accumulators, provable security, pairing-based, simple assumptions.} }
Nishanth Chandran, Vipul Goyal, Pratyay Mukherjee, Omkant Pandey, and Jalaj Upadhyay. Block-Wise Non-Malleable Codes. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 31:1-31:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chandran_et_al:LIPIcs.ICALP.2016.31, author = {Chandran, Nishanth and Goyal, Vipul and Mukherjee, Pratyay and Pandey, Omkant and Upadhyay, Jalaj}, title = {{Block-Wise Non-Malleable Codes}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {31:1--31:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.31}, URN = {urn:nbn:de:0030-drops-63102}, doi = {10.4230/LIPIcs.ICALP.2016.31}, annote = {Keywords: Non-malleable codes, Non-malleable commitments, Block-wise Tampering, Complexity-leveraging} }
Richard J. Lipton, Rafail Ostrovsky, and Vassilis Zikas. Provably Secure Virus Detection: Using The Observer Effect Against Malware. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 32:1-32:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{lipton_et_al:LIPIcs.ICALP.2016.32, author = {Lipton, Richard J. and Ostrovsky, Rafail and Zikas, Vassilis}, title = {{Provably Secure Virus Detection: Using The Observer Effect Against Malware}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {32:1--32:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.32}, URN = {urn:nbn:de:0030-drops-63113}, doi = {10.4230/LIPIcs.ICALP.2016.32}, annote = {Keywords: Cryptography, Software Attestation, Provable Security} }
Neeraj Kayal, Chandan Saha, and Sébastien Tavenas. An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 33:1-33:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kayal_et_al:LIPIcs.ICALP.2016.33, author = {Kayal, Neeraj and Saha, Chandan and Tavenas, S\'{e}bastien}, title = {{An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {33:1--33:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.33}, URN = {urn:nbn:de:0030-drops-63126}, doi = {10.4230/LIPIcs.ICALP.2016.33}, annote = {Keywords: arithmetic circuits, depth-3 circuits, shifted partials} }
Joshua A. Grochow, Ketan D. Mulmuley, and Youming Qiao. Boundaries of VP and VNP. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 34:1-34:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{grochow_et_al:LIPIcs.ICALP.2016.34, author = {Grochow, Joshua A. and Mulmuley, Ketan D. and Qiao, Youming}, title = {{Boundaries of VP and VNP}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.34}, URN = {urn:nbn:de:0030-drops-63147}, doi = {10.4230/LIPIcs.ICALP.2016.34}, annote = {Keywords: geometric complexity theory, arithmetic circuit, border complexity} }
Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, and Ning Xie. AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 35:1-35:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{cheraghchi_et_al:LIPIcs.ICALP.2016.35, author = {Cheraghchi, Mahdi and Grigorescu, Elena and Juba, Brendan and Wimmer, Karl and Xie, Ning}, title = {{AC^0 o MOD\underline2 Lower Bounds for the Boolean Inner Product}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {35:1--35:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.35}, URN = {urn:nbn:de:0030-drops-63150}, doi = {10.4230/LIPIcs.ICALP.2016.35}, annote = {Keywords: Boolean analysis, circuit complexity, lower bounds} }
Stephen Cook, Jeff Edmonds, Venkatesh Medabalimi, and Toniann Pitassi. Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 36:1-36:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{cook_et_al:LIPIcs.ICALP.2016.36, author = {Cook, Stephen and Edmonds, Jeff and Medabalimi, Venkatesh and Pitassi, Toniann}, title = {{Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {36:1--36:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.36}, URN = {urn:nbn:de:0030-drops-63166}, doi = {10.4230/LIPIcs.ICALP.2016.36}, annote = {Keywords: Branching Programs, Semantic, Non-deterministic, Lower Bounds} }
Mark Bun and Justin Thaler. Improved Bounds on the Sign-Rank of AC^0. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 37:1-37:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bun_et_al:LIPIcs.ICALP.2016.37, author = {Bun, Mark and Thaler, Justin}, title = {{Improved Bounds on the Sign-Rank of AC^0}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {37:1--37:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.37}, URN = {urn:nbn:de:0030-drops-63173}, doi = {10.4230/LIPIcs.ICALP.2016.37}, annote = {Keywords: Sign-rank, circuit complexity, communication complexity, constant-depth circuits} }
Avishay Tal. On the Sensitivity Conjecture. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 38:1-38:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{tal:LIPIcs.ICALP.2016.38, author = {Tal, Avishay}, title = {{On the Sensitivity Conjecture}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {38:1--38:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.38}, URN = {urn:nbn:de:0030-drops-63184}, doi = {10.4230/LIPIcs.ICALP.2016.38}, annote = {Keywords: sensitivity conjecture, decision tree, block sensitivity} }
Jesper W. Mikkelsen. Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 39:1-39:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{mikkelsen:LIPIcs.ICALP.2016.39, author = {Mikkelsen, Jesper W.}, title = {{Randomization Can Be as Helpful as a Glimpse of the Future in Online Computation}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {39:1--39:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.39}, URN = {urn:nbn:de:0030-drops-63199}, doi = {10.4230/LIPIcs.ICALP.2016.39}, annote = {Keywords: online algorithms, advice complexity, information theory, randomization} }
Noa Elad, Satyen Kale, and Joseph (Seffi) Naor. Online Semidefinite Programming. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 40:1-40:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{elad_et_al:LIPIcs.ICALP.2016.40, author = {Elad, Noa and Kale, Satyen and Naor, Joseph (Seffi)}, title = {{Online Semidefinite Programming}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {40:1--40:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.40}, URN = {urn:nbn:de:0030-drops-63205}, doi = {10.4230/LIPIcs.ICALP.2016.40}, annote = {Keywords: online algorithms, semidefinite programming, primal-dual} }
Sandy Heydrich and Rob van Stee. Beating the Harmonic Lower Bound for Online Bin Packing. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 41:1-41:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{heydrich_et_al:LIPIcs.ICALP.2016.41, author = {Heydrich, Sandy and van Stee, Rob}, title = {{Beating the Harmonic Lower Bound for Online Bin Packing}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {41:1--41:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.41}, URN = {urn:nbn:de:0030-drops-63214}, doi = {10.4230/LIPIcs.ICALP.2016.41}, annote = {Keywords: Bin packing, online algorithms, harmonic algorithm} }
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. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 42:1-42:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{dehghani_et_al:LIPIcs.ICALP.2016.42, author = {Dehghani, Sina and Ehsani, Soheil and Hajiaghayi, Mohammad Taghi and Liaghat, Vahid and R\"{a}cke, Harald and Seddighin, Saeed}, title = {{Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.42}, URN = {urn:nbn:de:0030-drops-63221}, doi = {10.4230/LIPIcs.ICALP.2016.42}, annote = {Keywords: Online, Steiner Tree, Approximation, Competitive ratio} }
Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Claire Mathieu, and Rotem Zach. Carpooling in Social Networks. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 43:1-43:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fiat_et_al:LIPIcs.ICALP.2016.43, author = {Fiat, Amos and Karlin, Anna R. and Koutsoupias, Elias and Mathieu, Claire and Zach, Rotem}, title = {{Carpooling in Social Networks}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {43:1--43:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.43}, URN = {urn:nbn:de:0030-drops-63234}, doi = {10.4230/LIPIcs.ICALP.2016.43}, annote = {Keywords: Online algorithms, Fairness, Randomized algorithms, Competitive ratio, Carpool problem} }
Jaroslaw Blasiok and Jelani Nelson. An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 44:1-44:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{blasiok_et_al:LIPIcs.ICALP.2016.44, author = {Blasiok, Jaroslaw and Nelson, Jelani}, title = {{An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.44}, URN = {urn:nbn:de:0030-drops-63246}, doi = {10.4230/LIPIcs.ICALP.2016.44}, annote = {Keywords: dictionary learning, stochastic processes, generic chaining} }
Ivona Bezáková, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, and Daniel Stefankovic. Approximation via Correlation Decay When Strong Spatial Mixing Fails. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 45:1-45:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bezakova_et_al:LIPIcs.ICALP.2016.45, author = {Bez\'{a}kov\'{a}, Ivona and Galanis, Andreas and Goldberg, Leslie Ann and Guo, Heng and Stefankovic, Daniel}, title = {{Approximation via Correlation Decay When Strong Spatial Mixing Fails}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {45:1--45:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.45}, URN = {urn:nbn:de:0030-drops-63257}, doi = {10.4230/LIPIcs.ICALP.2016.45}, annote = {Keywords: approximate counting, independent sets in hypergraphs, correlation decay} }
Andreas Galanis, Leslie Ann Goldberg, and Mark Jerrum. A Complexity Trichotomy for Approximately Counting List H-Colourings. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 46:1-46:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{galanis_et_al:LIPIcs.ICALP.2016.46, author = {Galanis, Andreas and Goldberg, Leslie Ann and Jerrum, Mark}, title = {{A Complexity Trichotomy for Approximately Counting List H-Colourings}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {46:1--46:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.46}, URN = {urn:nbn:de:0030-drops-63262}, doi = {10.4230/LIPIcs.ICALP.2016.46}, annote = {Keywords: approximate counting, graph homomorphisms, list colourings} }
Radu Curticapean. Parity Separation: A Scientifically Proven Method for Permanent Weight Loss. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 47:1-47:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{curticapean:LIPIcs.ICALP.2016.47, author = {Curticapean, Radu}, title = {{Parity Separation: A Scientifically Proven Method for Permanent Weight Loss}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.47}, URN = {urn:nbn:de:0030-drops-63279}, doi = {10.4230/LIPIcs.ICALP.2016.47}, annote = {Keywords: perfect matchings, counting complexity, structural complexity, exponentialtime hypothesis} }
Søren Dahlgaard. On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 48:1-48:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{dahlgaard:LIPIcs.ICALP.2016.48, author = {Dahlgaard, S{\o}ren}, title = {{On the Hardness of Partially Dynamic Graph Problems and Connections to Diameter}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {48:1--48:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.48}, URN = {urn:nbn:de:0030-drops-63289}, doi = {10.4230/LIPIcs.ICALP.2016.48}, annote = {Keywords: Conditional lower bounds, Maximum cardinality matching, Diameter in graphs, Hardness in P, Partially dynamic problems, Maximum flow} }
Loukas Georgiadis, Giuseppe F. Italiano, and Nikos Parotsidis. Incremental 2-Edge-Connectivity in Directed Graphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 49:1-49:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{georgiadis_et_al:LIPIcs.ICALP.2016.49, author = {Georgiadis, Loukas and Italiano, Giuseppe F. and Parotsidis, Nikos}, title = {{Incremental 2-Edge-Connectivity in Directed Graphs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.49}, URN = {urn:nbn:de:0030-drops-63292}, doi = {10.4230/LIPIcs.ICALP.2016.49}, annote = {Keywords: 2-edge connectivity on directed graphs; dynamic graph algorithms; incremental algorithms.} }
Di Wang, Satish Rao, and Michael W. Mahoney. Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 50:1-50:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{wang_et_al:LIPIcs.ICALP.2016.50, author = {Wang, Di and Rao, Satish and Mahoney, Michael W.}, title = {{Unified Acceleration Method for Packing and Covering Problems via Diameter Reduction}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.50}, URN = {urn:nbn:de:0030-drops-63308}, doi = {10.4230/LIPIcs.ICALP.2016.50}, annote = {Keywords: Convex optimization, Accelerated gradient descent, Linear program, Approximation algorithm, Packing and covering} }
Thomas Dueholm Hansen and Uri Zwick. Random-Edge Is Slower Than Random-Facet on Abstract Cubes. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 51:1-51:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{hansen_et_al:LIPIcs.ICALP.2016.51, author = {Hansen, Thomas Dueholm and Zwick, Uri}, title = {{Random-Edge Is Slower Than Random-Facet on Abstract Cubes}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.51}, URN = {urn:nbn:de:0030-drops-63316}, doi = {10.4230/LIPIcs.ICALP.2016.51}, annote = {Keywords: Linear programming, the Simplex Algorithm, Pivoting rules, Acyclic Unique Sink Orientations} }
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. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 52:1-52:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{mahoney_et_al:LIPIcs.ICALP.2016.52, author = {Mahoney, Michael W. and Rao, Satish and Wang, Di and Zhang, Peng}, title = {{Approximating the Solution to Mixed Packing and Covering LPs in Parallel O˜(epsilon^\{-3\}) Time}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {52:1--52:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.52}, URN = {urn:nbn:de:0030-drops-63335}, doi = {10.4230/LIPIcs.ICALP.2016.52}, annote = {Keywords: Mixed packing and covering, Linear program, Approximation algorithm, Parallel algorithm} }
Zeyuan Allen-Zhu, Zhenyu Liao, and Yang Yuan. Optimization Algorithms for Faster Computational Geometry. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 53:1-53:6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{allenzhu_et_al:LIPIcs.ICALP.2016.53, author = {Allen-Zhu, Zeyuan and Liao, Zhenyu and Yuan, Yang}, title = {{Optimization Algorithms for Faster Computational Geometry}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {53:1--53:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.53}, URN = {urn:nbn:de:0030-drops-63325}, doi = {10.4230/LIPIcs.ICALP.2016.53}, annote = {Keywords: maximum inscribed balls, minimum enclosing balls, approximation algorithms} }
Jelena Marasevic, Clifford Stein, and Gil Zussman. A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 54:1-54:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{marasevic_et_al:LIPIcs.ICALP.2016.54, author = {Marasevic, Jelena and Stein, Clifford and Zussman, Gil}, title = {{A Fast Distributed Stateless Algorithm for alpha-Fair Packing Problems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {54:1--54:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.54}, URN = {urn:nbn:de:0030-drops-63344}, doi = {10.4230/LIPIcs.ICALP.2016.54}, annote = {Keywords: Fairness, distributed and stateless algorithms, resource allocation} }
Christian Sommer. All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 55:1-55:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{sommer:LIPIcs.ICALP.2016.55, author = {Sommer, Christian}, title = {{All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {55:1--55:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.55}, URN = {urn:nbn:de:0030-drops-63354}, doi = {10.4230/LIPIcs.ICALP.2016.55}, annote = {Keywords: graph algorithms, data structures, approximate shortest paths, distance oracles, distance labels} }
Ilario Bonacina. Total Space in Resolution Is at Least Width Squared. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 56:1-56:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bonacina:LIPIcs.ICALP.2016.56, author = {Bonacina, Ilario}, title = {{Total Space in Resolution Is at Least Width Squared}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {56:1--56:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.56}, URN = {urn:nbn:de:0030-drops-62273}, doi = {10.4230/LIPIcs.ICALP.2016.56}, annote = {Keywords: Resolution, width, total space} }
Christoph Berkholz and Jakob Nordström. Supercritical Space-Width Trade-Offs for Resolution. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 57:1-57:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{berkholz_et_al:LIPIcs.ICALP.2016.57, author = {Berkholz, Christoph and Nordstr\"{o}m, Jakob}, title = {{Supercritical Space-Width Trade-Offs for Resolution}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.57}, URN = {urn:nbn:de:0030-drops-62266}, doi = {10.4230/LIPIcs.ICALP.2016.57}, annote = {Keywords: Proof complexity, resolution, space, width, trade-offs, supercritical} }
Andrea Lincoln, Virginia Vassilevska Williams, Joshua R. Wang, and R. Ryan Williams. Deterministic Time-Space Trade-Offs for k-SUM. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 58:1-58:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{lincoln_et_al:LIPIcs.ICALP.2016.58, author = {Lincoln, Andrea and Vassilevska Williams, Virginia and Wang, Joshua R. and Williams, R. Ryan}, title = {{Deterministic Time-Space Trade-Offs for k-SUM}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.58}, URN = {urn:nbn:de:0030-drops-62250}, doi = {10.4230/LIPIcs.ICALP.2016.58}, annote = {Keywords: 3SUM, kSUM, time-space tradeoff, algorithm} }
Justin Thaler. Semi-Streaming Algorithms for Annotated Graph Streams. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 59:1-59:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{thaler:LIPIcs.ICALP.2016.59, author = {Thaler, Justin}, title = {{Semi-Streaming Algorithms for Annotated Graph Streams}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {59:1--59:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.59}, URN = {urn:nbn:de:0030-drops-62247}, doi = {10.4230/LIPIcs.ICALP.2016.59}, annote = {Keywords: graph streams, stream verification, annotated data streams, probabilistic proof systems} }
Ben-David Shalev and Robin Kothari. Randomized Query Complexity of Sabotaged and Composed Functions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 60:1-60:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{shalev_et_al:LIPIcs.ICALP.2016.60, author = {Shalev, Ben-David and Kothari, Robin}, title = {{Randomized Query Complexity of Sabotaged and Composed Functions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {60:1--60:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.60}, URN = {urn:nbn:de:0030-drops-62233}, doi = {10.4230/LIPIcs.ICALP.2016.60}, annote = {Keywords: Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem} }
Mark Braverman, Ran Gelles, Jieming Mao, and Rafail Ostrovsky. Coding for Interactive Communication Correcting Insertions and Deletions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 61:1-61:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{braverman_et_al:LIPIcs.ICALP.2016.61, author = {Braverman, Mark and Gelles, Ran and Mao, Jieming and Ostrovsky, Rafail}, title = {{Coding for Interactive Communication Correcting Insertions and Deletions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {61:1--61:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.61}, URN = {urn:nbn:de:0030-drops-61981}, doi = {10.4230/LIPIcs.ICALP.2016.61}, annote = {Keywords: Interactive communication, coding, edit distance} }
Andreas Galanis, Andreas Göbel, Leslie Ann Goldberg, John Lapinskas, and David Richerby. Amplifiers for the Moran Process. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 62:1-62:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{galanis_et_al:LIPIcs.ICALP.2016.62, author = {Galanis, Andreas and G\"{o}bel, Andreas and Goldberg, Leslie Ann and Lapinskas, John and Richerby, David}, title = {{Amplifiers for the Moran Process}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {62:1--62:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.62}, URN = {urn:nbn:de:0030-drops-62227}, doi = {10.4230/LIPIcs.ICALP.2016.62}, annote = {Keywords: Moran process, randomised algorithm on graphs, evolutionary dynamics} }
Ioannis Panageas and Nisheeth K. Vishnoi. Mixing Time of Markov Chains, Dynamical Systems and Evolution. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 63:1-63:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{panageas_et_al:LIPIcs.ICALP.2016.63, author = {Panageas, Ioannis and Vishnoi, Nisheeth K.}, title = {{Mixing Time of Markov Chains, Dynamical Systems and Evolution}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.63}, URN = {urn:nbn:de:0030-drops-62213}, doi = {10.4230/LIPIcs.ICALP.2016.63}, annote = {Keywords: Markov chains, Mixing time, Dynamical Systems, Evolutionary dynamics, Language evolution} }
Jun Wan, Yu Xia, Liang Li, and Thomas Moscibroda. Information Cascades on Arbitrary Topologies. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 64:1-64:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{wan_et_al:LIPIcs.ICALP.2016.64, author = {Wan, Jun and Xia, Yu and Li, Liang and Moscibroda, Thomas}, title = {{Information Cascades on Arbitrary Topologies}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {64:1--64:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.64}, URN = {urn:nbn:de:0030-drops-63417}, doi = {10.4230/LIPIcs.ICALP.2016.64}, annote = {Keywords: Information Cascades, Herding Effect, Random Graphs} }
Samuel Hetterich. Analysing Survey Propagation Guided Decimationon Random Formulas. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 65:1-65:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{hetterich:LIPIcs.ICALP.2016.65, author = {Hetterich, Samuel}, title = {{Analysing Survey Propagation Guided Decimationon Random Formulas}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {65:1--65:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.65}, URN = {urn:nbn:de:0030-drops-62197}, doi = {10.4230/LIPIcs.ICALP.2016.65}, annote = {Keywords: Survey Propagation Guided Decimation, Message Passing Algorithm, Graph Theory, Random k-SAT} }
Anupam Gupta, Guru Guruganesh, and Melanie Schmidt. Approximation Algorithms for Aversion k-Clustering via Local k-Median. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 66:1-66:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{gupta_et_al:LIPIcs.ICALP.2016.66, author = {Gupta, Anupam and Guruganesh, Guru and Schmidt, Melanie}, title = {{Approximation Algorithms for Aversion k-Clustering via Local k-Median}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {66:1--66:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.66}, URN = {urn:nbn:de:0030-drops-62180}, doi = {10.4230/LIPIcs.ICALP.2016.66}, annote = {Keywords: Approximation algorithms, clustering, k-median, primal-dual} }
Deeparnab Chakrabarty, Prachi Goyal, and Ravishankar Krishnaswamy. The Non-Uniform k-Center Problem. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 67:1-67:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chakrabarty_et_al:LIPIcs.ICALP.2016.67, author = {Chakrabarty, Deeparnab and Goyal, Prachi and Krishnaswamy, Ravishankar}, title = {{The Non-Uniform k-Center Problem}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {67:1--67:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.67}, URN = {urn:nbn:de:0030-drops-62178}, doi = {10.4230/LIPIcs.ICALP.2016.67}, annote = {Keywords: Clustering, k-Center, Approximation Algorithms, Firefighter Problem} }
Maria-Florina Balcan, Nika Haghtalab, and Colin White. k-Center Clustering Under Perturbation Resilience. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 68:1-68:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{balcan_et_al:LIPIcs.ICALP.2016.68, author = {Balcan, Maria-Florina and Haghtalab, Nika and White, Colin}, title = {{k-Center Clustering Under Perturbation Resilience}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {68:1--68:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.68}, URN = {urn:nbn:de:0030-drops-62160}, doi = {10.4230/LIPIcs.ICALP.2016.68}, annote = {Keywords: k-center, clustering, perturbation resilience} }
Sara Ahmadian and Chaitanya Swamy. Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 69:1-69:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{ahmadian_et_al:LIPIcs.ICALP.2016.69, author = {Ahmadian, Sara and Swamy, Chaitanya}, title = {{Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {69:1--69:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.69}, URN = {urn:nbn:de:0030-drops-62153}, doi = {10.4230/LIPIcs.ICALP.2016.69}, annote = {Keywords: Approximation algorithms, facililty-location problems, primal-dual method, Lagrangian relaxation, k-center problems, minimizing sum of radii} }
Frans Schalekamp, Anke van Zuylen, and Suzanne van der Ster. A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 70:1-70:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{schalekamp_et_al:LIPIcs.ICALP.2016.70, author = {Schalekamp, Frans and van Zuylen, Anke and van der Ster, Suzanne}, title = {{A Duality Based 2-Approximation Algorithm for Maximum Agreement Forest}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {70:1--70:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.70}, URN = {urn:nbn:de:0030-drops-62149}, doi = {10.4230/LIPIcs.ICALP.2016.70}, annote = {Keywords: Maximum agreement forest, phylogenetic tree, SPR distance, subtree prune-and-regraft distance, computational biology} }
David Adjiashvili, Viktor Bindewald, and Dennis Michaels. Robust Assignments via Ear Decompositions and Randomized Rounding. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 71:1-71:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{adjiashvili_et_al:LIPIcs.ICALP.2016.71, author = {Adjiashvili, David and Bindewald, Viktor and Michaels, Dennis}, title = {{Robust Assignments via Ear Decompositions and Randomized Rounding}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {71:1--71:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.71}, URN = {urn:nbn:de:0030-drops-62133}, doi = {10.4230/LIPIcs.ICALP.2016.71}, annote = {Keywords: robust optimization, matching theory, ear decomposition, randomized rounding, approximation algorithm} }
Klaus Jansen, Kim-Manuel Klein, and José Verschae. Closing the Gap for Makespan Scheduling via Sparsification Techniques. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 72:1-72:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{jansen_et_al:LIPIcs.ICALP.2016.72, author = {Jansen, Klaus and Klein, Kim-Manuel and Verschae, Jos\'{e}}, title = {{Closing the Gap for Makespan Scheduling via Sparsification Techniques}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {72:1--72:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.72}, URN = {urn:nbn:de:0030-drops-62122}, doi = {10.4230/LIPIcs.ICALP.2016.72}, annote = {Keywords: scheduling, approximation, PTAS, makespan, ETH} }
Gökalp Demirci and Shi Li. Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 73:1-73:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{demirci_et_al:LIPIcs.ICALP.2016.73, author = {Demirci, G\"{o}kalp and Li, Shi}, title = {{Constant Approximation for Capacitated k-Median with (1+epsilon)-Capacity Violation}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {73:1--73:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.73}, URN = {urn:nbn:de:0030-drops-62112}, doi = {10.4230/LIPIcs.ICALP.2016.73}, annote = {Keywords: Approximation Algorithms, Capacitated k-Median, Pseudo Approximation, Capacity Violation} }
Bundit Laekhanukit. Approximating Directed Steiner Problems via Tree Embedding. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 74:1-74:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{laekhanukit:LIPIcs.ICALP.2016.74, author = {Laekhanukit, Bundit}, title = {{Approximating Directed Steiner Problems via Tree Embedding}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {74:1--74:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.74}, URN = {urn:nbn:de:0030-drops-62100}, doi = {10.4230/LIPIcs.ICALP.2016.74}, annote = {Keywords: Approximation Algorithms, Network Design, Graph Connectivity, Directed Graph} }
Zachary Friggstad and Yifeng Zhang. Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 75:1-75:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{friggstad_et_al:LIPIcs.ICALP.2016.75, author = {Friggstad, Zachary and Zhang, Yifeng}, title = {{Tight Analysis of a Multiple-Swap Heurstic for Budgeted Red-Blue Median}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {75:1--75:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.75}, URN = {urn:nbn:de:0030-drops-62094}, doi = {10.4230/LIPIcs.ICALP.2016.75}, annote = {Keywords: Approximation Algorithms, Local search, Red-Blue Meidan} }
Shi Bai, Damien Stehlé, and Weiqiang Wen. Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 76:1-76:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bai_et_al:LIPIcs.ICALP.2016.76, author = {Bai, Shi and Stehl\'{e}, Damien and Wen, Weiqiang}, title = {{Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {76:1--76:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.76}, URN = {urn:nbn:de:0030-drops-62085}, doi = {10.4230/LIPIcs.ICALP.2016.76}, annote = {Keywords: Lattices, Bounded Distance Decoding Problem, Unique Shortest Vector Problem, Sparsification} }
Henry Yuen. A Parallel Repetition Theorem for All Entangled Games. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 77:1-77:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{yuen:LIPIcs.ICALP.2016.77, author = {Yuen, Henry}, title = {{A Parallel Repetition Theorem for All Entangled Games}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {77:1--77:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.77}, URN = {urn:nbn:de:0030-drops-62073}, doi = {10.4230/LIPIcs.ICALP.2016.77}, annote = {Keywords: parallel repetition, direct product theorems, entangled games, quantum games} }
Adam Kurpisz, Samuli Leppänen, and Monaldo Mastrolilli. Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 78:1-78:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kurpisz_et_al:LIPIcs.ICALP.2016.78, author = {Kurpisz, Adam and Lepp\"{a}nen, Samuli and Mastrolilli, Monaldo}, title = {{Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {78:1--78:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.78}, URN = {urn:nbn:de:0030-drops-63368}, doi = {10.4230/LIPIcs.ICALP.2016.78}, annote = {Keywords: SoS/Lasserre hierarchy, lift and project methods, binary polynomial optimization} }
Jonah Brown-Cohen and Prasad Raghavendra. Correlation Decay and Tractability of CSPs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 79:1-79:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{browncohen_et_al:LIPIcs.ICALP.2016.79, author = {Brown-Cohen, Jonah and Raghavendra, Prasad}, title = {{Correlation Decay and Tractability of CSPs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {79:1--79:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.79}, URN = {urn:nbn:de:0030-drops-62064}, doi = {10.4230/LIPIcs.ICALP.2016.79}, annote = {Keywords: Constraint Satisfaction, Polymorphisms, Linear Equations, Correlation Decay} }
Huck Bennett, Daniel Reichman, and Igor Shinkar. On Percolation and NP-Hardness. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 80:1-80:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bennett_et_al:LIPIcs.ICALP.2016.80, author = {Bennett, Huck and Reichman, Daniel and Shinkar, Igor}, title = {{On Percolation and NP-Hardness}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {80:1--80:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.80}, URN = {urn:nbn:de:0030-drops-62056}, doi = {10.4230/LIPIcs.ICALP.2016.80}, annote = {Keywords: percolation, NP-hardness, random subgraphs, chromatic number} }
Arturs Backurs, Nishanth Dikkala, and Christos Tzamos. Tight Hardness Results for Maximum Weight Rectangles. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 81:1-81:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{backurs_et_al:LIPIcs.ICALP.2016.81, author = {Backurs, Arturs and Dikkala, Nishanth and Tzamos, Christos}, title = {{Tight Hardness Results for Maximum Weight Rectangles}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {81:1--81:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.81}, URN = {urn:nbn:de:0030-drops-62040}, doi = {10.4230/LIPIcs.ICALP.2016.81}, annote = {Keywords: Maximum Rectangles, Hardness in P} }
Kasper Green Larsen and Jelani Nelson. The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 82:1-82:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{larsen_et_al:LIPIcs.ICALP.2016.82, author = {Larsen, Kasper Green and Nelson, Jelani}, title = {{The Johnson-Lindenstrauss Lemma Is Optimal for Linear Dimensionality Reduction}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {82:1--82:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.82}, URN = {urn:nbn:de:0030-drops-62032}, doi = {10.4230/LIPIcs.ICALP.2016.82}, annote = {Keywords: dimensionality reduction, lower bounds, Johnson-Lindenstrauss} }
Alexandr Andoni, Assaf Naor, and Ofer Neiman. Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 83:1-83:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{andoni_et_al:LIPIcs.ICALP.2016.83, author = {Andoni, Alexandr and Naor, Assaf and Neiman, Ofer}, title = {{Impossibility of Sketching of the 3D Transportation Metric with Quadratic Cost}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {83:1--83:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.83}, URN = {urn:nbn:de:0030-drops-62028}, doi = {10.4230/LIPIcs.ICALP.2016.83}, annote = {Keywords: Transportation metric, embedding, snowflake, sketching} }
Yitong Yin. Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 84:1-84:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{yin:LIPIcs.ICALP.2016.84, author = {Yin, Yitong}, title = {{Simple Average-Case Lower Bounds for Approximate Near-Neighbor from Isoperimetric Inequalities}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {84:1--84:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.84}, URN = {urn:nbn:de:0030-drops-62010}, doi = {10.4230/LIPIcs.ICALP.2016.84}, annote = {Keywords: nearest neighbor search, approximate near-neighbor, cell-probe model, isoperimetric inequality} }
Facundo Mémoli, Anastasios Sidiropoulos, and Vijay Sridhar. Quasimetric Embeddings and Their Applications. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 85:1-85:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{memoli_et_al:LIPIcs.ICALP.2016.85, author = {M\'{e}moli, Facundo and Sidiropoulos, Anastasios and Sridhar, Vijay}, title = {{Quasimetric Embeddings and Their Applications}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {85:1--85:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.85}, URN = {urn:nbn:de:0030-drops-62007}, doi = {10.4230/LIPIcs.ICALP.2016.85}, annote = {Keywords: metric embeddings, quasimetrics, outliers, random embeddings, treewidth, Directed Sparsest-Cut, Directed Multicut} }
Mika Göös, Toniann Pitassi, and Thomas Watson. The Landscape of Communication Complexity Classes. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 86:1-86:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{goos_et_al:LIPIcs.ICALP.2016.86, author = {G\"{o}\"{o}s, Mika and Pitassi, Toniann and Watson, Thomas}, title = {{The Landscape of Communication Complexity Classes}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {86:1--86:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.86}, URN = {urn:nbn:de:0030-drops-61990}, doi = {10.4230/LIPIcs.ICALP.2016.86}, annote = {Keywords: Landscape, communication, complexity, classes} }
Mark Braverman and Jon Schneider. Information Complexity Is Computable. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 87:1-87:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{braverman_et_al:LIPIcs.ICALP.2016.87, author = {Braverman, Mark and Schneider, Jon}, title = {{Information Complexity Is Computable}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {87:1--87:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.87}, URN = {urn:nbn:de:0030-drops-62203}, doi = {10.4230/LIPIcs.ICALP.2016.87}, annote = {Keywords: Communication complexity, convergence rate, information complexity} }
Manoj M. Prabhakaran and Vinod M. Prabhakaran. Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 88:1-88:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{prabhakaran_et_al:LIPIcs.ICALP.2016.88, author = {Prabhakaran, Manoj M. and Prabhakaran, Vinod M.}, title = {{R\'{e}nyi Information Complexity and an Information Theoretic Characterization of the Partition Bound}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {88:1--88:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.88}, URN = {urn:nbn:de:0030-drops-61970}, doi = {10.4230/LIPIcs.ICALP.2016.88}, annote = {Keywords: Information Complexity, Communication Complexity, R\'{e}nyi Mutual Information} }
Pavel Hrubes and Amir Yehudayoff. On Isoperimetric Profiles and Computational Complexity. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 89:1-89:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{hrubes_et_al:LIPIcs.ICALP.2016.89, author = {Hrubes, Pavel and Yehudayoff, Amir}, title = {{On Isoperimetric Profiles and Computational Complexity}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {89:1--89:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.89}, URN = {urn:nbn:de:0030-drops-61964}, doi = {10.4230/LIPIcs.ICALP.2016.89}, annote = {Keywords: Monotone computation, separations, communication complexity, isoperimetry} }
Piotr Berman, Meiram Murzabulatov, and Sofya Raskhodnikova. Tolerant Testers of Image Properties. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 90:1-90:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{berman_et_al:LIPIcs.ICALP.2016.90, author = {Berman, Piotr and Murzabulatov, Meiram and Raskhodnikova, Sofya}, title = {{Tolerant Testers of Image Properties}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {90:1--90:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.90}, URN = {urn:nbn:de:0030-drops-61959}, doi = {10.4230/LIPIcs.ICALP.2016.90}, annote = {Keywords: Computational geometry, convexity, half-plane, connectedness, propertytesting, tolerant property testing} }
Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, and Nithin Varma. Erasure-Resilient Property Testing. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 91:1-91:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{dixit_et_al:LIPIcs.ICALP.2016.91, author = {Dixit, Kashyap and Raskhodnikova, Sofya and Thakurta, Abhradeep and Varma, Nithin}, title = {{Erasure-Resilient Property Testing}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {91:1--91:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.91}, URN = {urn:nbn:de:0030-drops-61947}, doi = {10.4230/LIPIcs.ICALP.2016.91}, annote = {Keywords: Randomized algorithms, property testing, error correction, monotoneand Lipschitz functions} }
Allan Grønlund and Kasper Green Larsen. Towards Tight Lower Bounds for Range Reporting on the RAM. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 92:1-92:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{gronlund_et_al:LIPIcs.ICALP.2016.92, author = {Gr{\o}nlund, Allan and Larsen, Kasper Green}, title = {{Towards Tight Lower Bounds for Range Reporting on the RAM}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {92:1--92:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.92}, URN = {urn:nbn:de:0030-drops-61936}, doi = {10.4230/LIPIcs.ICALP.2016.92}, annote = {Keywords: Data Structures, Lower Bounds, Cell Probe Model, Range Reporting} }
Peyman Afshani and Jesper Sindahl Nielsen. Data Structure Lower Bounds for Document Indexing Problems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 93:1-93:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{afshani_et_al:LIPIcs.ICALP.2016.93, author = {Afshani, Peyman and Nielsen, Jesper Sindahl}, title = {{Data Structure Lower Bounds for Document Indexing Problems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {93:1--93:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.93}, URN = {urn:nbn:de:0030-drops-61923}, doi = {10.4230/LIPIcs.ICALP.2016.93}, annote = {Keywords: Data Structure Lower Bounds, Pointer Machine, Set Intersection, Pattern Matching} }
Hubie Chen. Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 94:1-94:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chen:LIPIcs.ICALP.2016.94, author = {Chen, Hubie}, title = {{Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {94:1--94:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.94}, URN = {urn:nbn:de:0030-drops-62290}, doi = {10.4230/LIPIcs.ICALP.2016.94}, annote = {Keywords: proof complexity, polynomial hierarchy, quantified propositional logic} }
Thomas Wilke. Past, Present, and Infinite Future. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 95:1-95:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{wilke:LIPIcs.ICALP.2016.95, author = {Wilke, Thomas}, title = {{Past, Present, and Infinite Future}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {95:1--95:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.95}, URN = {urn:nbn:de:0030-drops-62306}, doi = {10.4230/LIPIcs.ICALP.2016.95}, annote = {Keywords: linear-time temporal logic, separation, backward deterministic omega-automata, counter freeness} }
Mikolaj Bojanczyk. Thin MSO with a Probabilistic Path Quantifier. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 96:1-96:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bojanczyk:LIPIcs.ICALP.2016.96, author = {Bojanczyk, Mikolaj}, title = {{Thin MSO with a Probabilistic Path Quantifier}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {96:1--96:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.96}, URN = {urn:nbn:de:0030-drops-62315}, doi = {10.4230/LIPIcs.ICALP.2016.96}, annote = {Keywords: Automata, mso, infinite trees, probabilistic temporal logics} }
Jean Goubault-Larrecq and Sylvain Schmitz. Deciding Piecewise Testable Separability for Regular Tree Languages. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 97:1-97:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{goubaultlarrecq_et_al:LIPIcs.ICALP.2016.97, author = {Goubault-Larrecq, Jean and Schmitz, Sylvain}, title = {{Deciding Piecewise Testable Separability for Regular Tree Languages}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {97:1--97:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.97}, URN = {urn:nbn:de:0030-drops-62321}, doi = {10.4230/LIPIcs.ICALP.2016.97}, annote = {Keywords: Well-quasi-order, ideal, tree languages, first-order logic} }
Krishnendu Chatterjee and Laurent Doyen. Computation Tree Logic for Synchronization Properties. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 98:1-98:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chatterjee_et_al:LIPIcs.ICALP.2016.98, author = {Chatterjee, Krishnendu and Doyen, Laurent}, title = {{Computation Tree Logic for Synchronization Properties}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {98:1--98:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.98}, URN = {urn:nbn:de:0030-drops-62334}, doi = {10.4230/LIPIcs.ICALP.2016.98}, annote = {Keywords: Computation Tree Logic, Synchronization, model-checking, complexity} }
Michal Skrzypczak and Igor Walukiewicz. Deciding the Topological Complexity of Büchi Languages. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 99:1-99:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{skrzypczak_et_al:LIPIcs.ICALP.2016.99, author = {Skrzypczak, Michal and Walukiewicz, Igor}, title = {{Deciding the Topological Complexity of B\"{u}chi Languages}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {99:1--99:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.99}, URN = {urn:nbn:de:0030-drops-62346}, doi = {10.4230/LIPIcs.ICALP.2016.99}, annote = {Keywords: tree automata, non-determinism, Borel sets, topological complexity, decidability} }
Ventsislav Chonev, Joël Ouaknine, and James Worrell. On the Skolem Problem for Continuous Linear Dynamical Systems. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 100:1-100:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chonev_et_al:LIPIcs.ICALP.2016.100, author = {Chonev, Ventsislav and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{On the Skolem Problem for Continuous Linear Dynamical Systems}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {100:1--100:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.100}, URN = {urn:nbn:de:0030-drops-62357}, doi = {10.4230/LIPIcs.ICALP.2016.100}, annote = {Keywords: differential equations, reachability, Baker’s Theorem, Schanuel’s Conjecture, semi-algebraic sets} }
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Pierre Carlier. Analysing Decisive Stochastic Processes. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 101:1-101:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bertrand_et_al:LIPIcs.ICALP.2016.101, author = {Bertrand, Nathalie and Bouyer, Patricia and Brihaye, Thomas and Carlier, Pierre}, title = {{Analysing Decisive Stochastic Processes}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {101:1--101:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.101}, URN = {urn:nbn:de:0030-drops-62362}, doi = {10.4230/LIPIcs.ICALP.2016.101}, annote = {Keywords: Real-time stochastic processes, Decisiveness, Approximation Scheme} }
Daniel Gburek, Christel Baier, and Sascha Klüppelholz. Composition of Stochastic Transition Systems Based on Spans and Couplings. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 102:1-102:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{gburek_et_al:LIPIcs.ICALP.2016.102, author = {Gburek, Daniel and Baier, Christel and Kl\"{u}ppelholz, Sascha}, title = {{Composition of Stochastic Transition Systems Based on Spans and Couplings}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {102:1--102:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.102}, URN = {urn:nbn:de:0030-drops-62379}, doi = {10.4230/LIPIcs.ICALP.2016.102}, annote = {Keywords: Stochastic Transition System, Composition, Stochastic Hybrid Motion Automata, Stochastically Independent, Coupling, Span, Bisimulation, Congruence, Po} }
Dmitry Chistikov, Stefan Kiefer, Ines Marusic, Mahsa Shirmohammadi, and James Worrell. On Restricted Nonnegative Matrix Factorization. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 103:1-103:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chistikov_et_al:LIPIcs.ICALP.2016.103, author = {Chistikov, Dmitry and Kiefer, Stefan and Marusic, Ines and Shirmohammadi, Mahsa and Worrell, James}, title = {{On Restricted Nonnegative Matrix Factorization}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {103:1--103:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.103}, URN = {urn:nbn:de:0030-drops-62389}, doi = {10.4230/LIPIcs.ICALP.2016.103}, annote = {Keywords: nonnegative matrix factorization, nonnegative rank, probabilistic automata, labelled Markov chains, minimization} }
Maria Bruna, Radu Grigore, Stefan Kiefer, Joël Ouaknine, and James Worrell. Proving the Herman-Protocol Conjecture. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 104:1-104:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bruna_et_al:LIPIcs.ICALP.2016.104, author = {Bruna, Maria and Grigore, Radu and Kiefer, Stefan and Ouaknine, Jo\"{e}l and Worrell, James}, title = {{Proving the Herman-Protocol Conjecture}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {104:1--104:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.104}, URN = {urn:nbn:de:0030-drops-62393}, doi = {10.4230/LIPIcs.ICALP.2016.104}, annote = {Keywords: randomized protocols, self-stabilization, Lyapunov function, expected time} }
Stefan Göller, Christoph Haase, Ranko Lazic, and Patrick Totzke. A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 105:1-105:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{goller_et_al:LIPIcs.ICALP.2016.105, author = {G\"{o}ller, Stefan and Haase, Christoph and Lazic, Ranko and Totzke, Patrick}, title = {{A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {105:1--105:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.105}, URN = {urn:nbn:de:0030-drops-62409}, doi = {10.4230/LIPIcs.ICALP.2016.105}, annote = {Keywords: branching vector addition systems, reachability, coverability, boundedness} }
Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, and Daniel Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 106:1-106:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bouyer_et_al:LIPIcs.ICALP.2016.106, author = {Bouyer, Patricia and Markey, Nicolas and Randour, Mickael and Sangnier, Arnaud and Stan, Daniel}, title = {{Reachability in Networks of Register Protocols under Stochastic Schedulers}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {106:1--106:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.106}, URN = {urn:nbn:de:0030-drops-62416}, doi = {10.4230/LIPIcs.ICALP.2016.106}, annote = {Keywords: Networks of Processes, Parametrized Systems, Stochastic Scheduler, Almost-sure Reachability, Cut-Off Property} }
Gilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, and Pierre-Yves Strub. A Program Logic for Union Bounds. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 107:1-107:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{barthe_et_al:LIPIcs.ICALP.2016.107, author = {Barthe, Gilles and Gaboardi, Marco and Gr\'{e}goire, Benjamin and Hsu, Justin and Strub, Pierre-Yves}, title = {{A Program Logic for Union Bounds}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {107:1--107:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.107}, URN = {urn:nbn:de:0030-drops-62425}, doi = {10.4230/LIPIcs.ICALP.2016.107}, annote = {Keywords: Probabilistic Algorithms, Accuracy, Formal Verification, Hoare Logic, Union Bound} }
Mathieu Hoyrup. The Decidable Properties of Subrecursive Functions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 108:1-108:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{hoyrup:LIPIcs.ICALP.2016.108, author = {Hoyrup, Mathieu}, title = {{The Decidable Properties of Subrecursive Functions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {108:1--108:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.108}, URN = {urn:nbn:de:0030-drops-62435}, doi = {10.4230/LIPIcs.ICALP.2016.108}, annote = {Keywords: Rice theorem, subrecursive class, decidable property, Kolmogorov complexity, compressibility} }
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. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 109:1-109:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bournez_et_al:LIPIcs.ICALP.2016.109, author = {Bournez, Olivier and Gra\c{c}a, Daniel S. and Pouly, Amaury}, title = {{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}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {109:1--109:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.109}, URN = {urn:nbn:de:0030-drops-62445}, doi = {10.4230/LIPIcs.ICALP.2016.109}, annote = {Keywords: Analog Models of Computation, Continuous-Time Models of Computation, Computable Analysis, Implicit Complexity, Computational Complexity, Ordinary Diff} }
Mathieu Sablik and Michael Schraudner. Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 110:1-110:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{sablik_et_al:LIPIcs.ICALP.2016.110, author = {Sablik, Mathieu and Schraudner, Michael}, title = {{Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {110:1--110:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.110}, URN = {urn:nbn:de:0030-drops-62454}, doi = {10.4230/LIPIcs.ICALP.2016.110}, annote = {Keywords: Subshift, computability, time complexity, space complexity, tilings} }
Kazuyuki Asada and Naoki Kobayashi. On Word and Frontier Languages of Unsafe Higher-Order Grammars. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 111:1-111:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{asada_et_al:LIPIcs.ICALP.2016.111, author = {Asada, Kazuyuki and Kobayashi, Naoki}, title = {{On Word and Frontier Languages of Unsafe Higher-Order Grammars}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {111:1--111:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.111}, URN = {urn:nbn:de:0030-drops-62469}, doi = {10.4230/LIPIcs.ICALP.2016.111}, annote = {Keywords: intersection types, higher-order grammars} }
Mai Gehrke, Daniela Petrisan, and Luca Reggio. The Schützenberger Product for Syntactic Spaces. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 112:1-112:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{gehrke_et_al:LIPIcs.ICALP.2016.112, author = {Gehrke, Mai and Petrisan, Daniela and Reggio, Luca}, title = {{The Sch\"{u}tzenberger Product for Syntactic Spaces}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {112:1--112:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.112}, URN = {urn:nbn:de:0030-drops-62474}, doi = {10.4230/LIPIcs.ICALP.2016.112}, annote = {Keywords: Stone duality and Stone-Cech compactification, Vietoris hyperspace construction, logic on words, algebraic language theory beyond the regular setting} }
Kohei Kishida. Logic of Local Inference for Contextuality in Quantum Physics and Beyond. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 113:1-113:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{kishida:LIPIcs.ICALP.2016.113, author = {Kishida, Kohei}, title = {{Logic of Local Inference for Contextuality in Quantum Physics and Beyond}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {113:1--113:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.113}, URN = {urn:nbn:de:0030-drops-62484}, doi = {10.4230/LIPIcs.ICALP.2016.113}, annote = {Keywords: Contextuality, quantum mechanics, regular category, regular logic, separated presheaf} }
Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. Minimizing Resources of Sweeping and Streaming String Transducers. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 114:1-114:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{baschenis_et_al:LIPIcs.ICALP.2016.114, author = {Baschenis, F\'{e}lix and Gauwin, Olivier and Muscholl, Anca and Puppis, Gabriele}, title = {{Minimizing Resources of Sweeping and Streaming String Transducers}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {114:1--114:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.114}, URN = {urn:nbn:de:0030-drops-62496}, doi = {10.4230/LIPIcs.ICALP.2016.114}, annote = {Keywords: word transducers, streaming, 2-way, sweeping transducers, minimization} }
Anaël Grandjean and Victor Poupet. A Linear Acceleration Theorem for 2D Cellular Automata on All Complete Neighborhoods. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 115:1-115:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{grandjean_et_al:LIPIcs.ICALP.2016.115, author = {Grandjean, Ana\"{e}l and Poupet, Victor}, title = {{A Linear Acceleration Theorem for 2D Cellular Automata on All Complete Neighborhoods}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {115:1--115:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.115}, URN = {urn:nbn:de:0030-drops-62502}, doi = {10.4230/LIPIcs.ICALP.2016.115}, annote = {Keywords: 2D Cellular automata, linear acceleration, language recognition} }
Hellis Tamm. New Interpretation and Generalization of the Kameda-Weiner Method. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 116:1-116:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{tamm:LIPIcs.ICALP.2016.116, author = {Tamm, Hellis}, title = {{New Interpretation and Generalization of the Kameda-Weiner Method}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {116:1--116:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.116}, URN = {urn:nbn:de:0030-drops-62518}, doi = {10.4230/LIPIcs.ICALP.2016.116}, annote = {Keywords: Nondeterministic finite automata, NFA minimization, Kameda-Weinermethod, atoms of regular languages} }
M. Praveen and B. Srivathsan. Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 117:1-117:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{praveen_et_al:LIPIcs.ICALP.2016.117, author = {Praveen, M. and Srivathsan, B.}, title = {{Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {117:1--117:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.117}, URN = {urn:nbn:de:0030-drops-62520}, doi = {10.4230/LIPIcs.ICALP.2016.117}, annote = {Keywords: graphs with data, regular data path queries, expressiveness, query evaluation, complexity} }
Laurent Feuilloley, Pierre Fraigniaud, and Juho Hirvonen. A Hierarchy of Local Decision. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 118:1-118:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{feuilloley_et_al:LIPIcs.ICALP.2016.118, author = {Feuilloley, Laurent and Fraigniaud, Pierre and Hirvonen, Juho}, title = {{A Hierarchy of Local Decision}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {118:1--118:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.118}, URN = {urn:nbn:de:0030-drops-62536}, doi = {10.4230/LIPIcs.ICALP.2016.118}, annote = {Keywords: Distributed Network Computing, Distributed Algorithm, Distributed Decision, Locality} }
Manuel Bodirsky, Barnaby Martin, Michael Pinsker, and András Pongrácz. Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 119:1-119:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{bodirsky_et_al:LIPIcs.ICALP.2016.119, author = {Bodirsky, Manuel and Martin, Barnaby and Pinsker, Michael and Pongr\'{a}cz, Andr\'{a}s}, title = {{Constraint Satisfaction Problems for Reducts of Homogeneous Graphs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {119:1--119:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.119}, URN = {urn:nbn:de:0030-drops-62543}, doi = {10.4230/LIPIcs.ICALP.2016.119}, annote = {Keywords: Constraint Satisfaction, Homogeneous Graphs, Computational Complexity, Universal Algebra, Ramsey Theory} }
Myrto Arapinis, Diego Figueira, and Marco Gaboardi. Sensitivity of Counting Queries. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 120:1-120:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{arapinis_et_al:LIPIcs.ICALP.2016.120, author = {Arapinis, Myrto and Figueira, Diego and Gaboardi, Marco}, title = {{Sensitivity of Counting Queries}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {120:1--120:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.120}, URN = {urn:nbn:de:0030-drops-62552}, doi = {10.4230/LIPIcs.ICALP.2016.120}, annote = {Keywords: Differential privacy, sensitivity, relational algebra} }
Rodica Condurache, Emmanuel Filiot, Raffaella Gentilini, and Jean-François Raskin. The Complexity of Rational Synthesis. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 121:1-121:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{condurache_et_al:LIPIcs.ICALP.2016.121, author = {Condurache, Rodica and Filiot, Emmanuel and Gentilini, Raffaella and Raskin, Jean-Fran\c{c}ois}, title = {{The Complexity of Rational Synthesis}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {121:1--121:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.121}, URN = {urn:nbn:de:0030-drops-62565}, doi = {10.4230/LIPIcs.ICALP.2016.121}, annote = {Keywords: Non-zero sum games, reactive synthesis, omega-regular objectives} }
Katrin Casel, Henning Fernau, Serge Gaspers, Benjamin Gras, and Markus L. Schmid. On the Complexity of Grammar-Based Compression over Fixed Alphabets. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 122:1-122:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{casel_et_al:LIPIcs.ICALP.2016.122, author = {Casel, Katrin and Fernau, Henning and Gaspers, Serge and Gras, Benjamin and Schmid, Markus L.}, title = {{On the Complexity of Grammar-Based Compression over Fixed Alphabets}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {122:1--122:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.122}, URN = {urn:nbn:de:0030-drops-62570}, doi = {10.4230/LIPIcs.ICALP.2016.122}, annote = {Keywords: Grammar-Based Compression, Straight-Line Programs, NP-Completeness, Exact Exponential Time Algorithms} }
Georg Zetzsche. The Complexity of Downward Closure Comparisons. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 123:1-123:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{zetzsche:LIPIcs.ICALP.2016.123, author = {Zetzsche, Georg}, title = {{The Complexity of Downward Closure Comparisons}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {123:1--123:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.123}, URN = {urn:nbn:de:0030-drops-62589}, doi = {10.4230/LIPIcs.ICALP.2016.123}, annote = {Keywords: Downward closures, Complexity, Inclusion, Equivalence} }
Gabriele Fici, Antonio Restivo, Manuel Silva, and Luca Q. Zamboni. Anti-Powers in Infinite Words. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 124:1-124:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{fici_et_al:LIPIcs.ICALP.2016.124, author = {Fici, Gabriele and Restivo, Antonio and Silva, Manuel and Zamboni, Luca Q.}, title = {{Anti-Powers in Infinite Words}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {124:1--124:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.124}, URN = {urn:nbn:de:0030-drops-62599}, doi = {10.4230/LIPIcs.ICALP.2016.124}, annote = {Keywords: infinite word, anti-power, unavoidable regularity, avoidability} }
Emmanuel Filiot, Ismaël Jecker, Christof Löding, and Sarah Winter. On Equivalence and Uniformisation Problems for Finite Transducers. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 125:1-125:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{filiot_et_al:LIPIcs.ICALP.2016.125, author = {Filiot, Emmanuel and Jecker, Isma\"{e}l and L\"{o}ding, Christof and Winter, Sarah}, title = {{On Equivalence and Uniformisation Problems for Finite Transducers}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {125:1--125:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.125}, URN = {urn:nbn:de:0030-drops-62605}, doi = {10.4230/LIPIcs.ICALP.2016.125}, annote = {Keywords: Transducers, Equivalence, Uniformisation} }
Thomas Colcombet and Nathanaël Fijalkow. The Bridge Between Regular Cost Functions and Omega-Regular Languages. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 126:1-126:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{colcombet_et_al:LIPIcs.ICALP.2016.126, author = {Colcombet, Thomas and Fijalkow, Nathana\"{e}l}, title = {{The Bridge Between Regular Cost Functions and Omega-Regular Languages}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {126:1--126:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.126}, URN = {urn:nbn:de:0030-drops-62619}, doi = {10.4230/LIPIcs.ICALP.2016.126}, annote = {Keywords: Theory of Regular Cost Functions, Automata with Counters, Costautomata, Quantitative Extensions of Automata, Determinisation of Automata} }
Volker Diekert, Artur Jez, and Manfred Kufleitner. Solutions of Word Equations Over Partially Commutative Structures. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 127:1-127:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{diekert_et_al:LIPIcs.ICALP.2016.127, author = {Diekert, Volker and Jez, Artur and Kufleitner, Manfred}, title = {{Solutions of Word Equations Over Partially Commutative Structures}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {127:1--127:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.127}, URN = {urn:nbn:de:0030-drops-62624}, doi = {10.4230/LIPIcs.ICALP.2016.127}, annote = {Keywords: Word equations, EDT0L language, trace monoid, right-angled Artin group, partial commutation} }
Dmitry Chistikov and Christoph Haase. The Taming of the Semi-Linear Set. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 128:1-128:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chistikov_et_al:LIPIcs.ICALP.2016.128, author = {Chistikov, Dmitry and Haase, Christoph}, title = {{The Taming of the Semi-Linear Set}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {128:1--128:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.128}, URN = {urn:nbn:de:0030-drops-62636}, doi = {10.4230/LIPIcs.ICALP.2016.128}, annote = {Keywords: semi-linear sets, convex polyhedra, triangulations, integer linear programming, commutative grammars} }
Volker Diekert and Tobias Walter. Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 129:1-129:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{diekert_et_al:LIPIcs.ICALP.2016.129, author = {Diekert, Volker and Walter, Tobias}, title = {{Characterizing Classes of Regular Languages Using Prefix Codes of Bounded Synchronization Delay}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {129:1--129:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.129}, URN = {urn:nbn:de:0030-drops-62642}, doi = {10.4230/LIPIcs.ICALP.2016.129}, annote = {Keywords: formal language, synchronization delay, variety, Rees extension} }
Keerti Choudhary. An Optimal Dual Fault Tolerant Reachability Oracle. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 130:1-130:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{choudhary:LIPIcs.ICALP.2016.130, author = {Choudhary, Keerti}, title = {{An Optimal Dual Fault Tolerant Reachability Oracle}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {130:1--130:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.130}, URN = {urn:nbn:de:0030-drops-62659}, doi = {10.4230/LIPIcs.ICALP.2016.130}, annote = {Keywords: Fault tolerant, Directed graph, Reachability oracle, Labeling scheme} }
Yun Kuen Cheung, Gramoz Goranci, and Monika Henzinger. Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 131:1-131:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{cheung_et_al:LIPIcs.ICALP.2016.131, author = {Cheung, Yun Kuen and Goranci, Gramoz and Henzinger, Monika}, title = {{Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {131:1--131:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.131}, URN = {urn:nbn:de:0030-drops-62675}, doi = {10.4230/LIPIcs.ICALP.2016.131}, annote = {Keywords: Distance Approximating Minor, Graph Minor, Graph Compression, Vertex Sparsification, Metric Embedding} }
Stephen Alstrup, Inge Li Gørtz, Esben Bistrup Halvorsen, and Ely Porat. Distance Labeling Schemes for Trees. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 132:1-132:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{alstrup_et_al:LIPIcs.ICALP.2016.132, author = {Alstrup, Stephen and G{\o}rtz, Inge Li and Halvorsen, Esben Bistrup and Porat, Ely}, title = {{Distance Labeling Schemes for Trees}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {132:1--132:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.132}, URN = {urn:nbn:de:0030-drops-62661}, doi = {10.4230/LIPIcs.ICALP.2016.132}, annote = {Keywords: Distributed computing, Distance labeling, Graph theory, Routing, Trees} }
Casper Petersen, Noy Rotbart, Jakob Grue Simonsen, and Christian Wulff-Nilsen. Near Optimal Adjacency Labeling Schemes for Power-Law Graphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 133:1-133:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{petersen_et_al:LIPIcs.ICALP.2016.133, author = {Petersen, Casper and Rotbart, Noy and Simonsen, Jakob Grue and Wulff-Nilsen, Christian}, title = {{Near Optimal Adjacency Labeling Schemes for Power-Law Graphs}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {133:1--133:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.133}, URN = {urn:nbn:de:0030-drops-62684}, doi = {10.4230/LIPIcs.ICALP.2016.133}, annote = {Keywords: Labeling schemes, Power-law graphs} }
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. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 134:1-134:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{chiesa_et_al:LIPIcs.ICALP.2016.134, author = {Chiesa, Marco and Gurtov, Andrei and Madry, Aleksander and Mitrovic, Slobodan and Nikolaevskiy, Ilya and Shapira, Michael and Shenker, Scott}, title = {{On the Resiliency of Randomized Routing Against Multiple Edge Failures}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {134:1--134:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.134}, URN = {urn:nbn:de:0030-drops-62692}, doi = {10.4230/LIPIcs.ICALP.2016.134}, annote = {Keywords: Randomized, Routing, Resilience, Connectivity, Arborescenses} }
Prahladh Harsha, Rahul Jain, and Jaikumar Radhakrishnan. Partition Bound Is Quadratically Tight for Product Distributions. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 135:1-135:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{harsha_et_al:LIPIcs.ICALP.2016.135, author = {Harsha, Prahladh and Jain, Rahul and Radhakrishnan, Jaikumar}, title = {{Partition Bound Is Quadratically Tight for Product Distributions}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {135:1--135:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.135}, URN = {urn:nbn:de:0030-drops-62708}, doi = {10.4230/LIPIcs.ICALP.2016.135}, annote = {Keywords: partition bound, product distribution, communication complexity, query complexity} }
Petra Berenbrink, Tom Friedetzky, George Giakkoupis, and Peter Kling. Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 136:1-136:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{berenbrink_et_al:LIPIcs.ICALP.2016.136, author = {Berenbrink, Petra and Friedetzky, Tom and Giakkoupis, George and Kling, Peter}, title = {{Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {136:1--136:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.136}, URN = {urn:nbn:de:0030-drops-62711}, doi = {10.4230/LIPIcs.ICALP.2016.136}, annote = {Keywords: plurality consensus, voting, majority, distributed, gossip} }
Bernadette Charron-Bost, Matthias Függer, and Thomas Nowak. Fast, Robust, Quantizable Approximate Consensus. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 137:1-137:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{charronbost_et_al:LIPIcs.ICALP.2016.137, author = {Charron-Bost, Bernadette and F\"{u}gger, Matthias and Nowak, Thomas}, title = {{Fast, Robust, Quantizable Approximate Consensus}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {137:1--137:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.137}, URN = {urn:nbn:de:0030-drops-62812}, doi = {10.4230/LIPIcs.ICALP.2016.137}, annote = {Keywords: approximate consensus, dynamic networks, averaging algorithms} }