Prahladh Harsha and G. Ramalingam. LIPIcs, Volume 45, FSTTCS'15, Complete Volume. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@Proceedings{harsha_et_al:LIPIcs.FSTTCS.2015, title = {{LIPIcs, Volume 45, FSTTCS'15, Complete Volume }}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015}, URN = {urn:nbn:de:0030-drops-56671}, doi = {10.4230/LIPIcs.FSTTCS.2015}, annote = {Keywords: Software/Program Verification, Models of Computation, Modes of Computation, Complexity Measures and Classes, Nonnumerical Algorithms and Problems Specifying and Verifying and Reasoning about Programs, Mathematical Logic, Formal Languages} }
Prahladh Harsha and G. Ramalingam. Front Matter, Table of Contents, Preface, Conference Organization. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. i-xiv, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{harsha_et_al:LIPIcs.FSTTCS.2015.i, author = {Harsha, Prahladh and Ramalingam, G.}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {i--xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.i}, URN = {urn:nbn:de:0030-drops-56174}, doi = {10.4230/LIPIcs.FSTTCS.2015.i}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Moses S. Charikar. Bypassing Worst Case Analysis: Tensor Decomposition and Clustering (Invited Talk). In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, p. 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{charikar:LIPIcs.FSTTCS.2015.1, author = {Charikar, Moses S.}, title = {{Bypassing Worst Case Analysis: Tensor Decomposition and Clustering}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {1--1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.1}, URN = {urn:nbn:de:0030-drops-56647}, doi = {10.4230/LIPIcs.FSTTCS.2015.1}, annote = {Keywords: tensor decomposition, smoothed analysis, convex relaxations, integrality} }
Ahmed Bouajjani, Michael Emmi, Constantin Enea, and Jad Hamza. Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk). In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 2-4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{bouajjani_et_al:LIPIcs.FSTTCS.2015.2, author = {Bouajjani, Ahmed and Emmi, Michael and Enea, Constantin and Hamza, Jad}, title = {{Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {2--4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.2}, URN = {urn:nbn:de:0030-drops-56638}, doi = {10.4230/LIPIcs.FSTTCS.2015.2}, annote = {Keywords: Concurrent objects, linearizability, verification, bug detection} }
James Worrell. Reachability Problems for Continuous Linear Dynamical Systems (Invited Talk). In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 5-6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{worrell:LIPIcs.FSTTCS.2015.5, author = {Worrell, James}, title = {{Reachability Problems for Continuous Linear Dynamical Systems}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {5--6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.5}, URN = {urn:nbn:de:0030-drops-56410}, doi = {10.4230/LIPIcs.FSTTCS.2015.5}, annote = {Keywords: Linear Differential Equations, Continuous-Time Markov Chains, Hybrid Automata, Schanuel's Conjecture} }
Boaz Barak. Convexity, Bayesianism, and the Quest Towards Optimal Algorithms (Invited Talk). In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, p. 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{barak:LIPIcs.FSTTCS.2015.7, author = {Barak, Boaz}, title = {{Convexity, Bayesianism, and the Quest Towards Optimal Algorithms}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {7--7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.7}, URN = {urn:nbn:de:0030-drops-56626}, doi = {10.4230/LIPIcs.FSTTCS.2015.7}, annote = {Keywords: Convex programming, Bayesian probability, Average-case complexity, Planted clique} }
Ankur Moitra. Beyond Matrix Completion (Invited Talk). In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, p. 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{moitra:LIPIcs.FSTTCS.2015.8, author = {Moitra, Ankur}, title = {{Beyond Matrix Completion}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {8--8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.8}, URN = {urn:nbn:de:0030-drops-56650}, doi = {10.4230/LIPIcs.FSTTCS.2015.8}, annote = {Keywords: matrix completion, recommendation systems, tensor prediction} }
Suresh Jagannathan. Relational Refinement Types for Higher-Order Shape Transformers (Invited Talk). In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, p. 9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{jagannathan:LIPIcs.FSTTCS.2015.9, author = {Jagannathan, Suresh}, title = {{Relational Refinement Types for Higher-Order Shape Transformers}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {9--9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.9}, URN = {urn:nbn:de:0030-drops-56406}, doi = {10.4230/LIPIcs.FSTTCS.2015.9}, annote = {Keywords: Relational Specifications; Inductive and Parametric Relations; Refinement Types, Shape Analysis, Data Structure Verification\}} }
Keshav Goyal and Tobias Mömke. Robust Reoptimization of Steiner Trees. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 10-24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{goyal_et_al:LIPIcs.FSTTCS.2015.10, author = {Goyal, Keshav and M\"{o}mke, Tobias}, title = {{Robust Reoptimization of Steiner Trees}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {10--24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.10}, URN = {urn:nbn:de:0030-drops-56251}, doi = {10.4230/LIPIcs.FSTTCS.2015.10}, annote = {Keywords: reoptimization, approximation algorithms, Steiner tree problem, robustness} }
Anamitra Roy Choudhury, Syamantak Das, and Amit Kumar. Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 25-37, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{roychoudhury_et_al:LIPIcs.FSTTCS.2015.25, author = {Roy Choudhury, Anamitra and Das, Syamantak and Kumar, Amit}, title = {{Minimizing Weighted lp-Norm of Flow-Time in the Rejection Model}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {25--37}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.25}, URN = {urn:nbn:de:0030-drops-56341}, doi = {10.4230/LIPIcs.FSTTCS.2015.25}, annote = {Keywords: online scheduling, flow-time, competitive analysis} }
Hal Daumé III, Samir Khuller, Manish Purohit, and Gregory Sanders. On Correcting Inputs: Inverse Optimization for Online Structured Prediction. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 38-51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{daumeiii_et_al:LIPIcs.FSTTCS.2015.38, author = {Daum\'{e} III, Hal and Khuller, Samir and Purohit, Manish and Sanders, Gregory}, title = {{On Correcting Inputs: Inverse Optimization for Online Structured Prediction}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {38--51}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.38}, URN = {urn:nbn:de:0030-drops-56375}, doi = {10.4230/LIPIcs.FSTTCS.2015.38}, annote = {Keywords: Inverse Optimization, Structured Prediction, Online Learning} }
Sepehr Assadi, Sanjeev Khanna, Yang Li, and Val Tannen. Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 52-68, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{assadi_et_al:LIPIcs.FSTTCS.2015.52, author = {Assadi, Sepehr and Khanna, Sanjeev and Li, Yang and Tannen, Val}, title = {{Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {52--68}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.52}, URN = {urn:nbn:de:0030-drops-56361}, doi = {10.4230/LIPIcs.FSTTCS.2015.52}, annote = {Keywords: Small-space Algorithms, Maximum Matchings, Vertex Sparsifiers} }
Patricia Bouyer, Patrick Gardy, and Nicolas Markey. Weighted Strategy Logic with Boolean Goals Over One-Counter Games. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 69-83, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{bouyer_et_al:LIPIcs.FSTTCS.2015.69, author = {Bouyer, Patricia and Gardy, Patrick and Markey, Nicolas}, title = {{Weighted Strategy Logic with Boolean Goals Over One-Counter Games}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {69--83}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.69}, URN = {urn:nbn:de:0030-drops-56537}, doi = {10.4230/LIPIcs.FSTTCS.2015.69}, annote = {Keywords: Temporal logics, multi-player games, strategy logic, quantitative games} }
Prateek Karandikar and Philippe Schnoebelen. Decidability in the Logic of Subsequences and Supersequences. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 84-97, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{karandikar_et_al:LIPIcs.FSTTCS.2015.84, author = {Karandikar, Prateek and Schnoebelen, Philippe}, title = {{Decidability in the Logic of Subsequences and Supersequences}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {84--97}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.84}, URN = {urn:nbn:de:0030-drops-56428}, doi = {10.4230/LIPIcs.FSTTCS.2015.84}, annote = {Keywords: subsequence, subword, logic, first-order logic, decidability, piecewise- testability, Simon’s congruence} }
Thomas Colcombet and Amaldev Manuel. Fragments of Fixpoint Logic on Data Words. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 98-111, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{colcombet_et_al:LIPIcs.FSTTCS.2015.98, author = {Colcombet, Thomas and Manuel, Amaldev}, title = {{Fragments of Fixpoint Logic on Data Words}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {98--111}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.98}, URN = {urn:nbn:de:0030-drops-56289}, doi = {10.4230/LIPIcs.FSTTCS.2015.98}, annote = {Keywords: Data words, Data automata, Fixpoint logic} }
Lukas Fleischer and Manfred Kufleitner. Efficient Algorithms for Morphisms over Omega-Regular Languages. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 112-124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{fleischer_et_al:LIPIcs.FSTTCS.2015.112, author = {Fleischer, Lukas and Kufleitner, Manfred}, title = {{Efficient Algorithms for Morphisms over Omega-Regular Languages}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {112--124}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.112}, URN = {urn:nbn:de:0030-drops-56200}, doi = {10.4230/LIPIcs.FSTTCS.2015.112}, annote = {Keywords: B\"{u}chi automata, omega-regular language, syntactic semigroup, recognizing morphism, MSO} }
Ashish Chiplunkar and Sundar Vishwanathan. Approximating the Regular Graphic TSP in Near Linear Time. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 125-135, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{chiplunkar_et_al:LIPIcs.FSTTCS.2015.125, author = {Chiplunkar, Ashish and Vishwanathan, Sundar}, title = {{Approximating the Regular Graphic TSP in Near Linear Time}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {125--135}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.125}, URN = {urn:nbn:de:0030-drops-56264}, doi = {10.4230/LIPIcs.FSTTCS.2015.125}, annote = {Keywords: traveling salesperson problem, approximation, linear time} }
Arindam Khan and Mohit Singh. On Weighted Bipartite Edge Coloring. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 136-150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{khan_et_al:LIPIcs.FSTTCS.2015.136, author = {Khan, Arindam and Singh, Mohit}, title = {{On Weighted Bipartite Edge Coloring}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {136--150}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.136}, URN = {urn:nbn:de:0030-drops-56437}, doi = {10.4230/LIPIcs.FSTTCS.2015.136}, annote = {Keywords: Edge coloring, Bin packing, Clos networks, Approximation algorithms, Graph algorithms} }
Karthekeyan Chandrasekaran, Venkata Gandikota, and Elena Grigorescu. Deciding Orthogonality in Construction-A Lattices. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 151-162, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{chandrasekaran_et_al:LIPIcs.FSTTCS.2015.151, author = {Chandrasekaran, Karthekeyan and Gandikota, Venkata and Grigorescu, Elena}, title = {{Deciding Orthogonality in Construction-A Lattices}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {151--162}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.151}, URN = {urn:nbn:de:0030-drops-56509}, doi = {10.4230/LIPIcs.FSTTCS.2015.151}, annote = {Keywords: Orthogonal Lattices, Construction-A, Orthogonal Decomposition, Lattice isomorphism} }
Lorenzo Clemente, Pawel Parys, Sylvain Salvati, and Igor Walukiewicz. Ordered Tree-Pushdown Systems. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 163-177, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{clemente_et_al:LIPIcs.FSTTCS.2015.163, author = {Clemente, Lorenzo and Parys, Pawel and Salvati, Sylvain and Walukiewicz, Igor}, title = {{Ordered Tree-Pushdown Systems}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {163--177}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.163}, URN = {urn:nbn:de:0030-drops-56470}, doi = {10.4230/LIPIcs.FSTTCS.2015.163}, annote = {Keywords: reachability analysis, saturation technique, pushdown automata, ordered pushdown automata, higher-order pushdown automata, higher-order recursive sche} }
Félix Baschenis, Olivier Gauwin, Anca Muscholl, and Gabriele Puppis. One-way Definability of Sweeping Transducer. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 178-191, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{baschenis_et_al:LIPIcs.FSTTCS.2015.178, author = {Baschenis, F\'{e}lix and Gauwin, Olivier and Muscholl, Anca and Puppis, Gabriele}, title = {{One-way Definability of Sweeping Transducer}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {178--191}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.178}, URN = {urn:nbn:de:0030-drops-56297}, doi = {10.4230/LIPIcs.FSTTCS.2015.178}, annote = {Keywords: Regular word transductions, sweeping transducers, one-way definability} }
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Roland Meyer, and Mehdi Seyed Salehi. What's Decidable about Availability Languages?. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 192-205, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{abdulla_et_al:LIPIcs.FSTTCS.2015.192, author = {Abdulla, Parosh Aziz and Atig, Mohamed Faouzi and Meyer, Roland and Seyed Salehi, Mehdi}, title = {{What's Decidable about Availability Languages?}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {192--205}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.192}, URN = {urn:nbn:de:0030-drops-56602}, doi = {10.4230/LIPIcs.FSTTCS.2015.192}, annote = {Keywords: Availability, formal languages, emptiness, decidability} }
Sagnik Mukhopadhyay and Swagato Sanyal. Towards Better Separation between Deterministic and Randomized Query Complexity. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 206-220, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{mukhopadhyay_et_al:LIPIcs.FSTTCS.2015.206, author = {Mukhopadhyay, Sagnik and Sanyal, Swagato}, title = {{Towards Better Separation between Deterministic and Randomized Query Complexity}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {206--220}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.206}, URN = {urn:nbn:de:0030-drops-56467}, doi = {10.4230/LIPIcs.FSTTCS.2015.206}, annote = {Keywords: Deterministic Decision Tree, Randomized Decision Tree, Query Complexity, Models of Computation.} }
Manindra Agrawal, Diptarka Chakraborty, Debarati Das, and Satyadev Nandakumar. Dimension, Pseudorandomness and Extraction of Pseudorandomness. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 221-235, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{agrawal_et_al:LIPIcs.FSTTCS.2015.221, author = {Agrawal, Manindra and Chakraborty, Diptarka and Das, Debarati and Nandakumar, Satyadev}, title = {{Dimension, Pseudorandomness and Extraction of Pseudorandomness}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {221--235}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.221}, URN = {urn:nbn:de:0030-drops-56184}, doi = {10.4230/LIPIcs.FSTTCS.2015.221}, annote = {Keywords: Pseudorandomness, Dimension, Martingale, Unpredictability, Pseudoentropy, Pseudorandom Extractor, Hard Function} }
John M. Hitchcock and A. Pavan. On the NP-Completeness of the Minimum Circuit Size Problem. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 236-245, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{hitchcock_et_al:LIPIcs.FSTTCS.2015.236, author = {Hitchcock, John M. and Pavan, A.}, title = {{On the NP-Completeness of the Minimum Circuit Size Problem}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {236--245}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.236}, URN = {urn:nbn:de:0030-drops-56613}, doi = {10.4230/LIPIcs.FSTTCS.2015.236}, annote = {Keywords: Minimum Circuit Size, NP-completeness, truth-table reductions, circuit complexity} }
Nikhil Balaji, Samir Datta, and Venkatesh Ganesan. Counting Euler Tours in Undirected Bounded Treewidth Graphs. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 246-260, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{balaji_et_al:LIPIcs.FSTTCS.2015.246, author = {Balaji, Nikhil and Datta, Samir and Ganesan, Venkatesh}, title = {{Counting Euler Tours in Undirected Bounded Treewidth Graphs}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {246--260}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.246}, URN = {urn:nbn:de:0030-drops-56493}, doi = {10.4230/LIPIcs.FSTTCS.2015.246}, annote = {Keywords: Euler Tours, Bounded Treewidth, Bounded clique-width, Hamiltonian cycles, Parallel algorithms} }
Shibashis Guha, Shankara Narayanan Krishna, Lakshmi Manasa, and Ashutosh Trivedi. Revisiting Robustness in Priced Timed Games. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 261-277, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{guha_et_al:LIPIcs.FSTTCS.2015.261, author = {Guha, Shibashis and Krishna, Shankara Narayanan and Manasa, Lakshmi and Trivedi, Ashutosh}, title = {{Revisiting Robustness in Priced Timed Games}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {261--277}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.261}, URN = {urn:nbn:de:0030-drops-56440}, doi = {10.4230/LIPIcs.FSTTCS.2015.261}, annote = {Keywords: Priced Timed Games, Decidability, Optimal strategies, Robustness} }
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege. Simple Priced Timed Games are not That Simple. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 278-292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{brihaye_et_al:LIPIcs.FSTTCS.2015.278, author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Lefaucheux, Engel and Monmege, Benjamin}, title = {{Simple Priced Timed Games are not That Simple}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {278--292}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.278}, URN = {urn:nbn:de:0030-drops-56235}, doi = {10.4230/LIPIcs.FSTTCS.2015.278}, annote = {Keywords: Priced timed games, real-time systems, game theory} }
Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo A. Pérez, and Gabriel Renault. Quantitative Games under Failures. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 293-306, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{brihaye_et_al:LIPIcs.FSTTCS.2015.293, author = {Brihaye, Thomas and Geeraerts, Gilles and Haddad, Axel and Monmege, Benjamin and P\'{e}rez, Guillermo A. and Renault, Gabriel}, title = {{Quantitative Games under Failures}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {293--306}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.293}, URN = {urn:nbn:de:0030-drops-56229}, doi = {10.4230/LIPIcs.FSTTCS.2015.293}, annote = {Keywords: Quantitative games, verification, synthesis, game theory} }
Dietmar Berwanger and Marie van den Bogaard. Games with Delays - A Frankenstein Approach. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 307-319, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{berwanger_et_al:LIPIcs.FSTTCS.2015.307, author = {Berwanger, Dietmar and van den Bogaard, Marie}, title = {{Games with Delays - A Frankenstein Approach}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {307--319}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.307}, URN = {urn:nbn:de:0030-drops-56575}, doi = {10.4230/LIPIcs.FSTTCS.2015.307}, annote = {Keywords: infinite games on graphs, imperfect information, delayed monitoring, distributed synthesis} }
Sudip Biswas, Arnab Ganguly, Rahul Shah, and Sharma V. Thankachan. Forbidden Extension Queries. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 320-335, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{biswas_et_al:LIPIcs.FSTTCS.2015.320, author = {Biswas, Sudip and Ganguly, Arnab and Shah, Rahul and Thankachan, Sharma V.}, title = {{Forbidden Extension Queries}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {320--335}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.320}, URN = {urn:nbn:de:0030-drops-56522}, doi = {10.4230/LIPIcs.FSTTCS.2015.320}, annote = {Keywords: document retrieval, suffix trees, range queries, succinct data structure} }
Arijit Bishnu, Amit Chakrabarti, Subhas C. Nandy, and Sandeep Sen. On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 336-349, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{bishnu_et_al:LIPIcs.FSTTCS.2015.336, author = {Bishnu, Arijit and Chakrabarti, Amit and Nandy, Subhas C. and Sen, Sandeep}, title = {{On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {336--349}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.336}, URN = {urn:nbn:de:0030-drops-56488}, doi = {10.4230/LIPIcs.FSTTCS.2015.336}, annote = {Keywords: Density, threshold, emptiness queries, interval queries, streaming model, heavy hitter, frequency estimation} }
Vladimir Braverman, Harry Lang, Keith Levin, and Morteza Monemizadeh. Clustering on Sliding Windows in Polylogarithmic Space. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 350-364, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{braverman_et_al:LIPIcs.FSTTCS.2015.350, author = {Braverman, Vladimir and Lang, Harry and Levin, Keith and Monemizadeh, Morteza}, title = {{Clustering on Sliding Windows in Polylogarithmic Space}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {350--364}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.350}, URN = {urn:nbn:de:0030-drops-56549}, doi = {10.4230/LIPIcs.FSTTCS.2015.350}, annote = {Keywords: Streaming, Clustering, Sliding windows} }
Guy Avni, Orna Kupferman, and Tami Tamir. Congestion Games with Multisets of Resources and Applications in Synthesis. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 365-379, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{avni_et_al:LIPIcs.FSTTCS.2015.365, author = {Avni, Guy and Kupferman, Orna and Tamir, Tami}, title = {{Congestion Games with Multisets of Resources and Applications in Synthesis}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {365--379}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.365}, URN = {urn:nbn:de:0030-drops-56358}, doi = {10.4230/LIPIcs.FSTTCS.2015.365}, annote = {Keywords: Congestion games, Multiset strategies, Equilibrium existence and computation, Equilibrium inefficiency} }
Shaull Almagor, Denis Kuperberg, and Orna Kupferman. The Sensing Cost of Monitoring and Synthesis. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 380-393, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{almagor_et_al:LIPIcs.FSTTCS.2015.380, author = {Almagor, Shaull and Kuperberg, Denis and Kupferman, Orna}, title = {{The Sensing Cost of Monitoring and Synthesis}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {380--393}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.380}, URN = {urn:nbn:de:0030-drops-56563}, doi = {10.4230/LIPIcs.FSTTCS.2015.380}, annote = {Keywords: Automata, regular languages, omega-regular languages, complexity, sensing, minimization} }
David Cachera, Uli Fahrenberg, and Axel Legay. An omega-Algebra for Real-Time Energy Problems. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 394-407, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{cachera_et_al:LIPIcs.FSTTCS.2015.394, author = {Cachera, David and Fahrenberg, Uli and Legay, Axel}, title = {{An omega-Algebra for Real-Time Energy Problems}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {394--407}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.394}, URN = {urn:nbn:de:0030-drops-56511}, doi = {10.4230/LIPIcs.FSTTCS.2015.394}, annote = {Keywords: Energy problem, Real time, Star-continuous Kleene algebra} }
Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, and Alexander S. Kulikov. Parameterized Complexity of Secluded Connectivity Problems. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 408-419, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{fomin_et_al:LIPIcs.FSTTCS.2015.408, author = {Fomin, Fedor V. and Golovach, Petr A. and Karpov, Nikolay and Kulikov, Alexander S.}, title = {{Parameterized Complexity of Secluded Connectivity Problems}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {408--419}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.408}, URN = {urn:nbn:de:0030-drops-56318}, doi = {10.4230/LIPIcs.FSTTCS.2015.408}, annote = {Keywords: Secluded path, Secluded Steiner tree, parameterized complexity} }
Sudeshna Kolay and Fahad Panolan. Parameterized Algorithms for Deletion to (r,ell)-Graphs. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 420-433, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{kolay_et_al:LIPIcs.FSTTCS.2015.420, author = {Kolay, Sudeshna and Panolan, Fahad}, title = {{Parameterized Algorithms for Deletion to (r,ell)-Graphs}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {420--433}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.420}, URN = {urn:nbn:de:0030-drops-56456}, doi = {10.4230/LIPIcs.FSTTCS.2015.420}, annote = {Keywords: FPT, Turing kernels, Approximation algorithms} }
Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, and Saket Saurabh. Finding Even Subgraphs Even Faster. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 434-447, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{goyal_et_al:LIPIcs.FSTTCS.2015.434, author = {Goyal, Prachi and Misra, Pranabendu and Panolan, Fahad and Philip, Geevarghese and Saurabh, Saket}, title = {{Finding Even Subgraphs Even Faster}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {434--447}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.434}, URN = {urn:nbn:de:0030-drops-56336}, doi = {10.4230/LIPIcs.FSTTCS.2015.434}, annote = {Keywords: Eulerian Edge Deletion, FPT, Representative Family.} }
Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, and Manuel Sorge. The Parameterized Complexity of the Minimum Shared Edges Problem. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 448-462, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{fluschnik_et_al:LIPIcs.FSTTCS.2015.448, author = {Fluschnik, Till and Kratsch, Stefan and Niedermeier, Rolf and Sorge, Manuel}, title = {{The Parameterized Complexity of the Minimum Shared Edges Problem}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {448--462}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.448}, URN = {urn:nbn:de:0030-drops-56323}, doi = {10.4230/LIPIcs.FSTTCS.2015.448}, annote = {Keywords: Parameterized complexity, kernelization, treewidth, treewidth reduction} }
Daniel J. Fremont, Alexandre Donzé, Sanjit A. Seshia, and David Wessel. Control Improvisation. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 463-474, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{fremont_et_al:LIPIcs.FSTTCS.2015.463, author = {Fremont, Daniel J. and Donz\'{e}, Alexandre and Seshia, Sanjit A. and Wessel, David}, title = {{Control Improvisation}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {463--474}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.463}, URN = {urn:nbn:de:0030-drops-56596}, doi = {10.4230/LIPIcs.FSTTCS.2015.463}, annote = {Keywords: finite automata, random sampling, Boolean satisfiability, testing, computational music, control theory} }
Chung-Kil Hur, Aditya V. Nori, Sriram K. Rajamani, and Selva Samuel. A Provably Correct Sampler for Probabilistic Programs. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 475-488, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{hur_et_al:LIPIcs.FSTTCS.2015.475, author = {Hur, Chung-Kil and Nori, Aditya V. and Rajamani, Sriram K. and Samuel, Selva}, title = {{A Provably Correct Sampler for Probabilistic Programs}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {475--488}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.475}, URN = {urn:nbn:de:0030-drops-56553}, doi = {10.4230/LIPIcs.FSTTCS.2015.475}, annote = {Keywords: Probabilistic Programming, Program Correctness, Probabilistic Inference, Markov Chain Monte Carlo Sampling} }
Henryk Michalewski and Matteo Mio. On the Problem of Computing the Probability of Regular Sets of Trees. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 489-502, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{michalewski_et_al:LIPIcs.FSTTCS.2015.489, author = {Michalewski, Henryk and Mio, Matteo}, title = {{On the Problem of Computing the Probability of Regular Sets of Trees}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {489--502}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.489}, URN = {urn:nbn:de:0030-drops-56390}, doi = {10.4230/LIPIcs.FSTTCS.2015.489}, annote = {Keywords: regular languages of trees, probability, meta-parity games} }
Thomas Weidner. Probabilistic Regular Expressions and MSO Logic on Finite Trees. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 503-516, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{weidner:LIPIcs.FSTTCS.2015.503, author = {Weidner, Thomas}, title = {{Probabilistic Regular Expressions and MSO Logic on Finite Trees}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {503--516}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.503}, URN = {urn:nbn:de:0030-drops-56303}, doi = {10.4230/LIPIcs.FSTTCS.2015.503}, annote = {Keywords: Probabilistic Regular Expressions, MSO Logic, Tree Automata} }
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, and Ravi Sundaram. Rumors Across Radio, Wireless, Telephone. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 517-528, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{iglesias_et_al:LIPIcs.FSTTCS.2015.517, author = {Iglesias, Jennifer and Rajaraman, Rajmohan and Ravi, R. and Sundaram, Ravi}, title = {{Rumors Across Radio, Wireless, Telephone}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {517--528}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.517}, URN = {urn:nbn:de:0030-drops-56383}, doi = {10.4230/LIPIcs.FSTTCS.2015.517}, annote = {Keywords: Broadcast, Gossip, Approximation algorithms, Graph algorithms, Hardness of Approximation} }
Magnús M. Halldórsson and Tigran Tonoyan. The Price of Local Power Control in Wireless Scheduling. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 529-542, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{halldorsson_et_al:LIPIcs.FSTTCS.2015.529, author = {Halld\'{o}rsson, Magn\'{u}s M. and Tonoyan, Tigran}, title = {{The Price of Local Power Control in Wireless Scheduling}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {529--542}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.529}, URN = {urn:nbn:de:0030-drops-56243}, doi = {10.4230/LIPIcs.FSTTCS.2015.529}, annote = {Keywords: Wireless Scheduling, Physical Model, Oblivious Power} }
Leonard J. Schulman and Vijay V. Vazirani. Allocation of Divisible Goods Under Lexicographic Preferences. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 543-559, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{schulman_et_al:LIPIcs.FSTTCS.2015.543, author = {Schulman, Leonard J. and Vazirani, Vijay V.}, title = {{Allocation of Divisible Goods Under Lexicographic Preferences}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {543--559}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.543}, URN = {urn:nbn:de:0030-drops-56279}, doi = {10.4230/LIPIcs.FSTTCS.2015.543}, annote = {Keywords: Mechanism design, lexicographic preferences, strategyproof, Pareto optimal, incentive compatible} }
Romain Demangeon and Nobuko Yoshida. On the Expressiveness of Multiparty Sessions. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 560-574, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{demangeon_et_al:LIPIcs.FSTTCS.2015.560, author = {Demangeon, Romain and Yoshida, Nobuko}, title = {{On the Expressiveness of Multiparty Sessions}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {560--574}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.560}, URN = {urn:nbn:de:0030-drops-56217}, doi = {10.4230/LIPIcs.FSTTCS.2015.560}, annote = {Keywords: concurrency, message-passing, session, asynchrony, expressiveness} }
Vincent Cheval, Véronique Cortier, and Eric le Morvan. Secure Refinements of Communication Channels. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 575-589, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{cheval_et_al:LIPIcs.FSTTCS.2015.575, author = {Cheval, Vincent and Cortier, V\'{e}ronique and le Morvan, Eric}, title = {{Secure Refinements of Communication Channels}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {575--589}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.575}, URN = {urn:nbn:de:0030-drops-56583}, doi = {10.4230/LIPIcs.FSTTCS.2015.575}, annote = {Keywords: Protocol, Composition, Formal methods, Channels, Implementation} }
David Basin, Felix Klaedtke, and Eugen Zalinescu. Failure-aware Runtime Verification of Distributed Systems. In 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 45, pp. 590-603, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
@InProceedings{basin_et_al:LIPIcs.FSTTCS.2015.590, author = {Basin, David and Klaedtke, Felix and Zalinescu, Eugen}, title = {{Failure-aware Runtime Verification of Distributed Systems}}, booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)}, pages = {590--603}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-97-2}, ISSN = {1868-8969}, year = {2015}, volume = {45}, editor = {Harsha, Prahladh and Ramalingam, G.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.590}, URN = {urn:nbn:de:0030-drops-56194}, doi = {10.4230/LIPIcs.FSTTCS.2015.590}, annote = {Keywords: Runtime verification, monitoring algorithm, real-time logics, multi-valued semantics, distributed systems, asynchronous communication} }
Feedback for Dagstuhl Publishing