Anil Seth and Nisheeth K. Vishnoi. LIPIcs, Volume 24, FSTTCS'13, Complete Volume. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@Proceedings{seth_et_al:LIPIcs.FSTTCS.2013, title = {{LIPIcs, Volume 24, FSTTCS'13, Complete Volume}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2014}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013}, URN = {urn:nbn:de:0030-drops-44358}, doi = {10.4230/LIPIcs.FSTTCS.2013}, annote = {Keywords: Software/Program Verification, Models of Computation, Modes of Computation, Complexity Measures and Classes, Nonnumerical Algorithms and Problems, Spe Programs, Mathematical Logic, Formal Languages} }
Anil Seth and Nisheeth K. Vishnoi. Frontmatter, Table of Contents, Preface, Conference Organization. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. i-xiv, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{seth_et_al:LIPIcs.FSTTCS.2013.i, author = {Seth, Anil and Vishnoi, Nisheeth K.}, title = {{Frontmatter, Table of Contents, Preface, Conference Organization}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {i--xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.i}, URN = {urn:nbn:de:0030-drops-44041}, doi = {10.4230/LIPIcs.FSTTCS.2013.i}, annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization} }
Venkatesan Guruswami. Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity (Invited Talk). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, p. 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{guruswami:LIPIcs.FSTTCS.2013.1, author = {Guruswami, Venkatesan}, title = {{Polar Codes: Reliable Communication with Complexity Polynomial in the Gap to Shannon Capacity}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {1--1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.1}, URN = {urn:nbn:de:0030-drops-43992}, doi = {10.4230/LIPIcs.FSTTCS.2013.1}, annote = {Keywords: Error-correction algorithms, Linear Codes, Shannon capacity, Martingale convergence, Computational complexity} }
Martin Hofmann and Ramyaa Ramyaa. Computing With a Fixed Number of Pointers (Invited Talk). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 3-18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{hofmann_et_al:LIPIcs.FSTTCS.2013.3, author = {Hofmann, Martin and Ramyaa, Ramyaa}, title = {{Computing With a Fixed Number of Pointers}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {3--18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.3}, URN = {urn:nbn:de:0030-drops-44009}, doi = {10.4230/LIPIcs.FSTTCS.2013.3}, annote = {Keywords: Logarithmic space, Jumping graph automata, st-connectivity, co-st-connectivity, Cayley graphs} }
Subhash Khot. On Approximation Resistance of Predicates (Invited Talk). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, p. 19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{khot:LIPIcs.FSTTCS.2013.19, author = {Khot, Subhash}, title = {{On Approximation Resistance of Predicates}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {19--19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.19}, URN = {urn:nbn:de:0030-drops-44011}, doi = {10.4230/LIPIcs.FSTTCS.2013.19}, annote = {Keywords: Approximation resistance, Hardness of approximation, Probabilistically checkable proofs, Constraint satisfaction problem} }
Martin Grohe, Stephan Kreutzer, and Sebastian Siebertz. Characterisations of Nowhere Dense Graphs (Invited Talk). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 21-40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{grohe_et_al:LIPIcs.FSTTCS.2013.21, author = {Grohe, Martin and Kreutzer, Stephan and Siebertz, Sebastian}, title = {{Characterisations of Nowhere Dense Graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {21--40}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.21}, URN = {urn:nbn:de:0030-drops-44029}, doi = {10.4230/LIPIcs.FSTTCS.2013.21}, annote = {Keywords: Graph Algorithms, Algorithmic Graph Structure Theory, Finite Model Theory, Nowhere Dense Classes of Graphs} }
Kazushige Terui. Intersection Types for Normalization and Verification (Invited Talk). In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 41-42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{terui:LIPIcs.FSTTCS.2013.41, author = {Terui, Kazushige}, title = {{Intersection Types for Normalization and Verification}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {41--42}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.41}, URN = {urn:nbn:de:0030-drops-44032}, doi = {10.4230/LIPIcs.FSTTCS.2013.41}, annote = {Keywords: simply typed lambda calculus, computational complexity, denotational semantics, intersection types} }
Robert Crowston, Mark Jones, Gabriele Muciaccia, Geevarghese Philip, Ashutosh Rai, and Saket Saurabh. Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 43-54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{crowston_et_al:LIPIcs.FSTTCS.2013.43, author = {Crowston, Robert and Jones, Mark and Muciaccia, Gabriele and Philip, Geevarghese and Rai, Ashutosh and Saurabh, Saket}, title = {{Polynomial Kernels for lambda-extendible Properties Parameterized Above the Poljak-Turzik Bound}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {43--54}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.43}, URN = {urn:nbn:de:0030-drops-43599}, doi = {10.4230/LIPIcs.FSTTCS.2013.43}, annote = {Keywords: Kernelization, Lambda Extension, Above-Guarantee Parameterization, MaxCut} }
Henning Fernau, Markus L. Schmid, and Yngve Villanger. On the Parameterised Complexity of String Morphism Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 55-66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{fernau_et_al:LIPIcs.FSTTCS.2013.55, author = {Fernau, Henning and Schmid, Markus L. and Villanger, Yngve}, title = {{On the Parameterised Complexity of String Morphism Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {55--66}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.55}, URN = {urn:nbn:de:0030-drops-43619}, doi = {10.4230/LIPIcs.FSTTCS.2013.55}, annote = {Keywords: String Problems, String Morphisms, Parameterised Complexity, Exponential Time Hypothesis, Pattern Languages} }
Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan, and Saket Saurabh. Partially Polynomial Kernels for Set Cover and Test Cover. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 67-78, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{basavaraju_et_al:LIPIcs.FSTTCS.2013.67, author = {Basavaraju, Manu and Francis, Mathew C. and Ramanujan, M. S. and Saurabh, Saket}, title = {{Partially Polynomial Kernels for Set Cover and Test Cover}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {67--78}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.67}, URN = {urn:nbn:de:0030-drops-43621}, doi = {10.4230/LIPIcs.FSTTCS.2013.67}, annote = {Keywords: Set Cover, Test Cover, Kernelization, Parameterized Algorithms} }
Rajesh Chitnis, Fedor V. Fomin, and Petr A. Golovach. Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 79-90, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{chitnis_et_al:LIPIcs.FSTTCS.2013.79, author = {Chitnis, Rajesh and Fomin, Fedor V. and Golovach, Petr A.}, title = {{Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {79--90}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.79}, URN = {urn:nbn:de:0030-drops-43636}, doi = {10.4230/LIPIcs.FSTTCS.2013.79}, annote = {Keywords: Parameterized complexity, directed graphs, anchored \$k\$-core} }
Pierre Clairambault and Andrzej S. Murawski. Böhm Trees as Higher-Order Recursive Schemes. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 91-102, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{clairambault_et_al:LIPIcs.FSTTCS.2013.91, author = {Clairambault, Pierre and Murawski, Andrzej S.}, title = {{B\"{o}hm Trees as Higher-Order Recursive Schemes}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {91--102}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.91}, URN = {urn:nbn:de:0030-drops-43644}, doi = {10.4230/LIPIcs.FSTTCS.2013.91}, annote = {Keywords: Lambda calculus, B\"{o}hm trees, Recursion Schemes} }
Sylvain Salvati and Igor Walukiewicz. Evaluation is MSOL-compatible. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 103-114, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{salvati_et_al:LIPIcs.FSTTCS.2013.103, author = {Salvati, Sylvain and Walukiewicz, Igor}, title = {{Evaluation is MSOL-compatible}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {103--114}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.103}, URN = {urn:nbn:de:0030-drops-43652}, doi = {10.4230/LIPIcs.FSTTCS.2013.103}, annote = {Keywords: Simply typed \$lambda Y\$-calculus; Monadic second order} }
Axel Haddad. Model Checking and Functional Program Transformations. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 115-126, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{haddad:LIPIcs.FSTTCS.2013.115, author = {Haddad, Axel}, title = {{Model Checking and Functional Program Transformations}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {115--126}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.115}, URN = {urn:nbn:de:0030-drops-43605}, doi = {10.4230/LIPIcs.FSTTCS.2013.115}, annote = {Keywords: Higher-order recursion schemes, Model checking, Tree automata} }
Georgel Calin, Egor Derevenetc, Rupak Majumdar, and Roland Meyer. A Theory of Partitioned Global Address Spaces. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 127-139, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{calin_et_al:LIPIcs.FSTTCS.2013.127, author = {Calin, Georgel and Derevenetc, Egor and Majumdar, Rupak and Meyer, Roland}, title = {{A Theory of Partitioned Global Address Spaces}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {127--139}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.127}, URN = {urn:nbn:de:0030-drops-43665}, doi = {10.4230/LIPIcs.FSTTCS.2013.127}, annote = {Keywords: PGAS, SC preservation, Robustness, Semantics, Formal languages} }
Prahladh Harsha and Rahul Jain. A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 141-152, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{harsha_et_al:LIPIcs.FSTTCS.2013.141, author = {Harsha, Prahladh and Jain, Rahul}, title = {{A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {141--152}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.141}, URN = {urn:nbn:de:0030-drops-43670}, doi = {10.4230/LIPIcs.FSTTCS.2013.141}, annote = {Keywords: Rectangle bound, Tribes function, Strong direct product} }
L. Sunil Chandran and Deepak Rajendraprasad. Inapproximability of Rainbow Colouring. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 153-162, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{chandran_et_al:LIPIcs.FSTTCS.2013.153, author = {Chandran, L. Sunil and Rajendraprasad, Deepak}, title = {{Inapproximability of Rainbow Colouring}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {153--162}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.153}, URN = {urn:nbn:de:0030-drops-43689}, doi = {10.4230/LIPIcs.FSTTCS.2013.153}, annote = {Keywords: rainbow connectivity, rainbow colouring, approximation hardness} }
Anguraj Baskar, Prasad Naldurg, K. R. Raghavendra, and S. P. Suresh. Primal Infon Logic: Derivability in Polynomial Time. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 163-174, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{baskar_et_al:LIPIcs.FSTTCS.2013.163, author = {Baskar, Anguraj and Naldurg, Prasad and Raghavendra, K. R. and Suresh, S. P.}, title = {{Primal Infon Logic: Derivability in Polynomial Time}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {163--174}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.163}, URN = {urn:nbn:de:0030-drops-43708}, doi = {10.4230/LIPIcs.FSTTCS.2013.163}, annote = {Keywords: Authorization logics, Intuitionistic modal logic, Proof theory, Cut elimination, Subformula property} }
Igor Potapov. Composition Problems for Braids. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 175-187, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{potapov:LIPIcs.FSTTCS.2013.175, author = {Potapov, Igor}, title = {{Composition Problems for Braids}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {175--187}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.175}, URN = {urn:nbn:de:0030-drops-43711}, doi = {10.4230/LIPIcs.FSTTCS.2013.175}, annote = {Keywords: Braid group, automata, group alphabet, combinatorics on words, matrix semigroups, NP-hardness, decidability} }
Andreas Krebs and Nutan Limaye. DLOGTIME Proof Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 189-200, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{krebs_et_al:LIPIcs.FSTTCS.2013.189, author = {Krebs, Andreas and Limaye, Nutan}, title = {{DLOGTIME Proof Systems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {189--200}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.189}, URN = {urn:nbn:de:0030-drops-43725}, doi = {10.4230/LIPIcs.FSTTCS.2013.189}, annote = {Keywords: Proof systems, DLOGTIME, NC0} }
Srikanth Srinivasan. On Improved Degree Lower Bounds for Polynomial Approximation. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 201-212, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{srinivasan:LIPIcs.FSTTCS.2013.201, author = {Srinivasan, Srikanth}, title = {{On Improved Degree Lower Bounds for Polynomial Approximation}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {201--212}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.201}, URN = {urn:nbn:de:0030-drops-43737}, doi = {10.4230/LIPIcs.FSTTCS.2013.201}, annote = {Keywords: Polynomials, Approximation, Compression, Circuit lower bounds} }
S. Akshay, Ionut Dinca, Blaise Genest, and Alin Stefanescu. Implementing Realistic Asynchronous Automata. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 213-224, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{akshay_et_al:LIPIcs.FSTTCS.2013.213, author = {Akshay, S. and Dinca, Ionut and Genest, Blaise and Stefanescu, Alin}, title = {{Implementing Realistic Asynchronous Automata}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {213--224}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.213}, URN = {urn:nbn:de:0030-drops-43742}, doi = {10.4230/LIPIcs.FSTTCS.2013.213}, annote = {Keywords: Asynchronous automata, Zielonka construction, Implementability} }
Javier Esparza, Loig Jezequel, and Stefan Schwoon. Computation of Summaries Using Net Unfoldings. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 225-236, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{esparza_et_al:LIPIcs.FSTTCS.2013.225, author = {Esparza, Javier and Jezequel, Loig and Schwoon, Stefan}, title = {{Computation of Summaries Using Net Unfoldings}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {225--236}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.225}, URN = {urn:nbn:de:0030-drops-43759}, doi = {10.4230/LIPIcs.FSTTCS.2013.225}, annote = {Keywords: Net unfoldings, Concurrent systems, Petri nets} }
Prachi Goyal, Neeldhara Misra, and Fahad Panolan. Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 237-248, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{goyal_et_al:LIPIcs.FSTTCS.2013.237, author = {Goyal, Prachi and Misra, Neeldhara and Panolan, Fahad}, title = {{Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {237--248}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.237}, URN = {urn:nbn:de:0030-drops-43761}, doi = {10.4230/LIPIcs.FSTTCS.2013.237}, annote = {Keywords: 3-Dimensional Matching, Fixed-Parameter Algorithms, Iterative Expansion} }
Archita Agarwal, Venkatesan T. Chakaravarthy, Anamitra Roy Choudhury, Sambuddha Roy, and Yogish Sabharwal. Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 249-261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{agarwal_et_al:LIPIcs.FSTTCS.2013.249, author = {Agarwal, Archita and Chakaravarthy, Venkatesan T. and Choudhury, Anamitra Roy and Roy, Sambuddha and Sabharwal, Yogish}, title = {{Distributed and Parallel Algorithms for Set Cover Problems with Small Neighborhood Covers}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {249--261}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.249}, URN = {urn:nbn:de:0030-drops-43775}, doi = {10.4230/LIPIcs.FSTTCS.2013.249}, annote = {Keywords: approximation algorithms, set cover problem, tree cover} }
Sonika Arora, Venkatesan T. Chakaravarthy, Neelima Gupta, Koyel Mukherjee, and Yogish Sabharwal. Replica Placement via Capacitated Vertex Cover. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 263-274, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{arora_et_al:LIPIcs.FSTTCS.2013.263, author = {Arora, Sonika and Chakaravarthy, Venkatesan T. and Gupta, Neelima and Mukherjee, Koyel and Sabharwal, Yogish}, title = {{Replica Placement via Capacitated Vertex Cover}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {263--274}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.263}, URN = {urn:nbn:de:0030-drops-43784}, doi = {10.4230/LIPIcs.FSTTCS.2013.263}, annote = {Keywords: Approximation Algorithms, LP Rounding} }
Venkatesan T. Chakaravarthy, Anamitra Roy Choudhury, Sivaramakrishnan R. Natarajan, and Sambuddha Roy. Knapsack Cover Subject to a Matroid Constraint. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 275-286, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{chakaravarthy_et_al:LIPIcs.FSTTCS.2013.275, author = {Chakaravarthy, Venkatesan T. and Choudhury, Anamitra Roy and Natarajan, Sivaramakrishnan R. and Roy, Sambuddha}, title = {{Knapsack Cover Subject to a Matroid Constraint}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {275--286}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.275}, URN = {urn:nbn:de:0030-drops-43795}, doi = {10.4230/LIPIcs.FSTTCS.2013.275}, annote = {Keywords: Approximation Algorithms, LP rounding, Matroid Constraints, Knapsack problems} }
Bastien Maubert and Sophie Pinchinat. Jumping Automata for Uniform Strategies. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 287-298, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{maubert_et_al:LIPIcs.FSTTCS.2013.287, author = {Maubert, Bastien and Pinchinat, Sophie}, title = {{Jumping Automata for Uniform Strategies}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {287--298}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.287}, URN = {urn:nbn:de:0030-drops-43801}, doi = {10.4230/LIPIcs.FSTTCS.2013.287}, annote = {Keywords: Games, Imperfect information, Uniform strategies, Jumping automata} }
Nathanaël Fijalkow, Sophie Pinchinat, and Olivier Serre. Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 299-311, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{fijalkow_et_al:LIPIcs.FSTTCS.2013.299, author = {Fijalkow, Nathana\"{e}l and Pinchinat, Sophie and Serre, Olivier}, title = {{Emptiness Of Alternating Tree Automata Using Games With Imperfect Information}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {299--311}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.299}, URN = {urn:nbn:de:0030-drops-43812}, doi = {10.4230/LIPIcs.FSTTCS.2013.299}, annote = {Keywords: Alternating Automata, Emptiness checking, Two-player games, Imperfect Information Games} }
Matthew Hague. Saturation of Concurrent Collapsible Pushdown Systems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 313-325, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{hague:LIPIcs.FSTTCS.2013.313, author = {Hague, Matthew}, title = {{Saturation of Concurrent Collapsible Pushdown Systems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {313--325}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.313}, URN = {urn:nbn:de:0030-drops-43829}, doi = {10.4230/LIPIcs.FSTTCS.2013.313}, annote = {Keywords: Concurrency, Automata, Higher-Order, Verification, Model-Checking} }
Christof Löding and Stefan Repke. Decidability Results on the Existence of Lookahead Delegators for NFA. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 327-338, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{loding_et_al:LIPIcs.FSTTCS.2013.327, author = {L\"{o}ding, Christof and Repke, Stefan}, title = {{Decidability Results on the Existence of Lookahead Delegators for NFA}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {327--338}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.327}, URN = {urn:nbn:de:0030-drops-43838}, doi = {10.4230/LIPIcs.FSTTCS.2013.327}, annote = {Keywords: Automata, Lookahead Delegators, Safety Games} }
Chien-Chung Huang, Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail. Fair Matchings and Related Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 339-350, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{huang_et_al:LIPIcs.FSTTCS.2013.339, author = {Huang, Chien-Chung and Kavitha, Telikepalli and Mehlhorn, Kurt and Michail, Dimitrios}, title = {{Fair Matchings and Related Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {339--350}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.339}, URN = {urn:nbn:de:0030-drops-43841}, doi = {10.4230/LIPIcs.FSTTCS.2013.339}, annote = {Keywords: Matching with Preferences, Fairness and Rank-Maximality, Bipartite Vertex Cover, Linear Programming Duality, Complementary Slackness} }
Jian Li and Zeyu Zhang. Ranking with Diverse Intents and Correlated Contents. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 351-362, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{li_et_al:LIPIcs.FSTTCS.2013.351, author = {Li, Jian and Zhang, Zeyu}, title = {{Ranking with Diverse Intents and Correlated Contents}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {351--362}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.351}, URN = {urn:nbn:de:0030-drops-43856}, doi = {10.4230/LIPIcs.FSTTCS.2013.351}, annote = {Keywords: Approximation Algorithm, Diversification, min-sum Set Cover} }
Thomas Place, Lorijn van Rooijen, and Marc Zeitoun. Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 363-375, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{place_et_al:LIPIcs.FSTTCS.2013.363, author = {Place, Thomas and van Rooijen, Lorijn and Zeitoun, Marc}, title = {{Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {363--375}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.363}, URN = {urn:nbn:de:0030-drops-43867}, doi = {10.4230/LIPIcs.FSTTCS.2013.363}, annote = {Keywords: Automata, Logics, Monoids, Locally testable, Separation, Context-free.} }
Andreas Holzer, Christian Schallhart, Michael Tautschnig, and Helmut Veith. On the Structure and Complexity of Rational Sets of Regular Languages. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 377-388, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{holzer_et_al:LIPIcs.FSTTCS.2013.377, author = {Holzer, Andreas and Schallhart, Christian and Tautschnig, Michael and Veith, Helmut}, title = {{On the Structure and Complexity of Rational Sets of Regular Languages}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {377--388}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.377}, URN = {urn:nbn:de:0030-drops-43871}, doi = {10.4230/LIPIcs.FSTTCS.2013.377}, annote = {Keywords: Rational Sets, Regular Languages, Test Specification in FQL, Closure Properties, Decision Problems} }
Mario E. Consuegra and Giri Narasimhan. Geometric Avatar Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 389-400, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{consuegra_et_al:LIPIcs.FSTTCS.2013.389, author = {Consuegra, Mario E. and Narasimhan, Giri}, title = {{Geometric Avatar Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {389--400}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.389}, URN = {urn:nbn:de:0030-drops-43889}, doi = {10.4230/LIPIcs.FSTTCS.2013.389}, annote = {Keywords: Avatar problems, choice} }
Parinya Chalermsook and Suresh Venkatasubramanian. Clustering With Center Constraints. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 401-412, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{chalermsook_et_al:LIPIcs.FSTTCS.2013.401, author = {Chalermsook, Parinya and Venkatasubramanian, Suresh}, title = {{Clustering With Center Constraints}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {401--412}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.401}, URN = {urn:nbn:de:0030-drops-43898}, doi = {10.4230/LIPIcs.FSTTCS.2013.401}, annote = {Keywords: Clustering, vertex cover, approximation algorithms} }
Tim Smith. On Infinite Words Determined by Stack Automata. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 413-424, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{smith:LIPIcs.FSTTCS.2013.413, author = {Smith, Tim}, title = {{On Infinite Words Determined by Stack Automata}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {413--424}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.413}, URN = {urn:nbn:de:0030-drops-43692}, doi = {10.4230/LIPIcs.FSTTCS.2013.413}, annote = {Keywords: stack automaton, infinite word, pumping lemma, prefix language, multihead finite automaton} }
Olivier Bodini, Antoine Genitrini, and Frédéric Peschanski. The Combinatorics of Non-determinism. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 425-436, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{bodini_et_al:LIPIcs.FSTTCS.2013.425, author = {Bodini, Olivier and Genitrini, Antoine and Peschanski, Fr\'{e}d\'{e}ric}, title = {{The Combinatorics of Non-determinism}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {425--436}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.425}, URN = {urn:nbn:de:0030-drops-43901}, doi = {10.4230/LIPIcs.FSTTCS.2013.425}, annote = {Keywords: Concurrency theory, Analytic combinatorics, Non-deterministic choice, Partially increasing trees, Uniform random generation} }
Barna Saha. Renting a Cloud. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 437-448, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{saha:LIPIcs.FSTTCS.2013.437, author = {Saha, Barna}, title = {{Renting a Cloud}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {437--448}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.437}, URN = {urn:nbn:de:0030-drops-43918}, doi = {10.4230/LIPIcs.FSTTCS.2013.437}, annote = {Keywords: Scheduling Algorithm, Online Algorithm, Approximation Algorithm} }
Evripidis Bampis, Alexander Kononov, Dimitrios Letsios, Giorgio Lucarelli, and Maxim Sviridenko. Energy Efficient Scheduling and Routing via Randomized Rounding. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 449-460, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{bampis_et_al:LIPIcs.FSTTCS.2013.449, author = {Bampis, Evripidis and Kononov, Alexander and Letsios, Dimitrios and Lucarelli, Giorgio and Sviridenko, Maxim}, title = {{Energy Efficient Scheduling and Routing via Randomized Rounding}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {449--460}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.449}, URN = {urn:nbn:de:0030-drops-43923}, doi = {10.4230/LIPIcs.FSTTCS.2013.449}, annote = {Keywords: Randomized rounding; scheduling; approximation; energy-aware; configuration linear program} }
Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, and Georgios Stamoulis. PTAS for Ordered Instances of Resource Allocation Problems. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 461-473, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{khodamoradi_et_al:LIPIcs.FSTTCS.2013.461, author = {Khodamoradi, Kamyar and Krishnamurti, Ramesh and Rafiey, Arash and Stamoulis, Georgios}, title = {{PTAS for Ordered Instances of Resource Allocation Problems}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {461--473}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.461}, URN = {urn:nbn:de:0030-drops-43936}, doi = {10.4230/LIPIcs.FSTTCS.2013.461}, annote = {Keywords: Approximation Algorithms, Convex Bipartite Graphs, Resource Allocation} }
Florin Manea, Mike Müller, and Dirk Nowotka. On the Pseudoperiodic Extension of u^l = v^m w^n. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 475-486, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{manea_et_al:LIPIcs.FSTTCS.2013.475, author = {Manea, Florin and M\"{u}ller, Mike and Nowotka, Dirk}, title = {{On the Pseudoperiodic Extension of u^l = v^m w^n}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {475--486}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.475}, URN = {urn:nbn:de:0030-drops-43948}, doi = {10.4230/LIPIcs.FSTTCS.2013.475}, annote = {Keywords: Word equations, Pseudoperiodicity, Lyndon-Sch\"{u}tzenberger equation} }
Tomás Brázdil, Taolue Chen, Vojtech Forejt, Petr Novotný, and Aistis Simaitis. Solvency Markov Decision Processes with Interest. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 487-499, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{brazdil_et_al:LIPIcs.FSTTCS.2013.487, author = {Br\'{a}zdil, Tom\'{a}s and Chen, Taolue and Forejt, Vojtech and Novotn\'{y}, Petr and Simaitis, Aistis}, title = {{Solvency Markov Decision Processes with Interest}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {487--499}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.487}, URN = {urn:nbn:de:0030-drops-43959}, doi = {10.4230/LIPIcs.FSTTCS.2013.487}, annote = {Keywords: Markov decision processes, algorithms, complexity, market models.} }
Nathalie Bertrand and Paulin Fournier. Parameterized Verification of Many Identical Probabilistic Timed Processes. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 501-513, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{bertrand_et_al:LIPIcs.FSTTCS.2013.501, author = {Bertrand, Nathalie and Fournier, Paulin}, title = {{Parameterized Verification of Many Identical Probabilistic Timed Processes}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {501--513}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.501}, URN = {urn:nbn:de:0030-drops-43964}, doi = {10.4230/LIPIcs.FSTTCS.2013.501}, annote = {Keywords: model checking, Markov decision processes, parameterized verification} }
Piotr Hofman, Slawomir Lasota, Richard Mayr, and Patrick Totzke. Simulation Over One-counter Nets is PSPACE-Complete. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 515-526, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{hofman_et_al:LIPIcs.FSTTCS.2013.515, author = {Hofman, Piotr and Lasota, Slawomir and Mayr, Richard and Totzke, Patrick}, title = {{Simulation Over One-counter Nets is PSPACE-Complete}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {515--526}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.515}, URN = {urn:nbn:de:0030-drops-43970}, doi = {10.4230/LIPIcs.FSTTCS.2013.515}, annote = {Keywords: Simulation preorder; one-counter nets; complexity} }
Stefan Haar, Serge Haddad, Tarek Melliti, and Stefan Schwoon. Optimal Constructions for Active Diagnosis. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 24, pp. 527-539, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{haar_et_al:LIPIcs.FSTTCS.2013.527, author = {Haar, Stefan and Haddad, Serge and Melliti, Tarek and Schwoon, Stefan}, title = {{Optimal Constructions for Active Diagnosis}}, booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2013)}, pages = {527--539}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-64-4}, ISSN = {1868-8969}, year = {2013}, volume = {24}, editor = {Seth, Anil and Vishnoi, Nisheeth K.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2013.527}, URN = {urn:nbn:de:0030-drops-43981}, doi = {10.4230/LIPIcs.FSTTCS.2013.527}, annote = {Keywords: Diagnosis, Control theory, Automata theory, Games.} }
Feedback for Dagstuhl Publishing