@Proceedings{chakraborty_et_al:LIPIcs.FSTTCS.2011,
title = {{LIPIcs, Volume 13, FSTTCS'11, Complete Volume}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2013},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011},
URN = {urn:nbn:de:0030-drops-41077},
doi = {10.4230/LIPIcs.FSTTCS.2011},
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}
}
@InProceedings{chakraborty_et_al:LIPIcs.FSTTCS.2011.i,
author = {Chakraborty, Supratik and Kumar, Amit},
title = {{Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {i--xv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.i},
URN = {urn:nbn:de:0030-drops-33196},
doi = {10.4230/LIPIcs.FSTTCS.2011.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization, External Reviewers}
}
@InProceedings{chakraborty_et_al:LIPIcs.FSTTCS.2011.xvi,
author = {Chakraborty, Supratik and Kumar, Amit},
title = {{Author Index}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {16--17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.xvi},
URN = {urn:nbn:de:0030-drops-33636},
doi = {10.4230/LIPIcs.FSTTCS.2011.xvi},
annote = {Keywords: Author Index}
}
@InProceedings{albers:LIPIcs.FSTTCS.2011.1,
author = {Albers, Susanne},
title = {{Energy-Efficient Algorithms}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {1--2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.1},
URN = {urn:nbn:de:0030-drops-33380},
doi = {10.4230/LIPIcs.FSTTCS.2011.1},
annote = {Keywords: energy efficiency, power-down mechanisms, dynamic speed scaling, offline algorithm, online algorithm}
}
@InProceedings{vardi:LIPIcs.FSTTCS.2011.3,
author = {Vardi, Moshe Y.},
title = {{Constraints, Graphs, Algebra, Logic, and Complexity}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {3--3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.3},
URN = {urn:nbn:de:0030-drops-33580},
doi = {10.4230/LIPIcs.FSTTCS.2011.3},
annote = {Keywords: constraint satisfaction, NP completeness, dichotomy}
}
@InProceedings{sudan:LIPIcs.FSTTCS.2011.4,
author = {Sudan, Madhu},
title = {{Physical limits of Communication}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {4--5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.4},
URN = {urn:nbn:de:0030-drops-33392},
doi = {10.4230/LIPIcs.FSTTCS.2011.4},
annote = {Keywords: Analog signals, information capacity, delays}
}
@InProceedings{bain_et_al:LIPIcs.FSTTCS.2011.6,
author = {Bain, Alex and Mitchell, John and Sharma, Rahul and Stefan, Deian and Zimmerman, Joe},
title = {{A Domain-Specific Language for Computing on Encrypted Data}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {6--24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.6},
URN = {urn:nbn:de:0030-drops-33604},
doi = {10.4230/LIPIcs.FSTTCS.2011.6},
annote = {Keywords: Domain-Specific Language, Secret Sharing, Homomorphic Encryption}
}
@InProceedings{kolaitis:LIPIcs.FSTTCS.2011.25,
author = {Kolaitis, Phokion G.},
title = {{Schema Mappings and Data Examples: Deriving Syntax from Semantics}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {25--25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.25},
URN = {urn:nbn:de:0030-drops-33598},
doi = {10.4230/LIPIcs.FSTTCS.2011.25},
annote = {Keywords: Schema mappings, database constraints, data exchange, data integration, universal solutions, homomorphism dualities}
}
@InProceedings{vazirani:LIPIcs.FSTTCS.2011.26,
author = {Vazirani, Umesh V.},
title = {{Quantum State Description Complexity}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {26--27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.26},
URN = {urn:nbn:de:0030-drops-33408},
doi = {10.4230/LIPIcs.FSTTCS.2011.26},
annote = {Keywords: area law, Hamiltonian, description complexity, detectability lemma, entanglement}
}
@InProceedings{cygan_et_al:LIPIcs.FSTTCS.2011.28,
author = {Cygan, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Mucha, Marcin and Pilipczuk, Marcin and Sankowski, Piotr},
title = {{Approximation Algorithms for Union and Intersection Covering Problems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {28--40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.28},
URN = {urn:nbn:de:0030-drops-33213},
doi = {10.4230/LIPIcs.FSTTCS.2011.28},
annote = {Keywords: Approximation algorithms, Partial covering problems}
}
@InProceedings{benabbas_et_al:LIPIcs.FSTTCS.2011.41,
author = {Benabbas, Siavosh and Chan, Siu On and Georgiou, Konstantinos and Magen, Avner},
title = {{Tight Gaps for Vertex Cover in the Sherali-Adams SDP Hierarchy}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {41--54},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.41},
URN = {urn:nbn:de:0030-drops-33299},
doi = {10.4230/LIPIcs.FSTTCS.2011.41},
annote = {Keywords: Vertex Cover, Integrality Gap, Lift-and-Project systems, Linear Programming, Semidefinite Programming}
}
@InProceedings{glaer_et_al:LIPIcs.FSTTCS.2011.55,
author = {Gla{\ss}er, Christian and Reitwie{\ss}ner, Christian and Witek, Maximilian},
title = {{Applications of Discrepancy Theory in Multiobjective Approximation}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {55--65},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.55},
URN = {urn:nbn:de:0030-drops-33233},
doi = {10.4230/LIPIcs.FSTTCS.2011.55},
annote = {Keywords: Discrepancy Theory, Multiobjective Optimization, Satisfiability, Traveling Salesman}
}
@InProceedings{kuperberg_et_al:LIPIcs.FSTTCS.2011.66,
author = {Kuperberg, Denis and Vanden Boom, Michael},
title = {{Quasi-Weak Cost Automata: A New Variant of Weakness}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {66--77},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.66},
URN = {urn:nbn:de:0030-drops-33517},
doi = {10.4230/LIPIcs.FSTTCS.2011.66},
annote = {Keywords: Automata, infinite trees, cost functions, weak}
}
@InProceedings{herbreteau_et_al:LIPIcs.FSTTCS.2011.78,
author = {Herbreteau, Fr\'{e}d\'{e}ric and Kini, Dileep and Srivathsan, B. and Walukiewicz, Igor},
title = {{Using non-convex approximations for efficient analysis of timed automata}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {78--89},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.78},
URN = {urn:nbn:de:0030-drops-33619},
doi = {10.4230/LIPIcs.FSTTCS.2011.78},
annote = {Keywords: Timed Automata, Model-checking, Non-convex abstraction, On-the-fly abstraction}
}
@InProceedings{sankur_et_al:LIPIcs.FSTTCS.2011.90,
author = {Sankur, Ocan and Bouyer, Patricia and Markey, Nicolas},
title = {{Shrinking Timed Automata}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {90--102},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.90},
URN = {urn:nbn:de:0030-drops-33627},
doi = {10.4230/LIPIcs.FSTTCS.2011.90},
annote = {Keywords: Timed automata, implementability, robustness}
}
@InProceedings{fahrenberg_et_al:LIPIcs.FSTTCS.2011.103,
author = {Fahrenberg, Uli and Legay, Axel and Thrane, Claus},
title = {{The Quantitative Linear-Time--Branching-Time Spectrum}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {103--114},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.103},
URN = {urn:nbn:de:0030-drops-33324},
doi = {10.4230/LIPIcs.FSTTCS.2011.103},
annote = {Keywords: Quantitative verification, System distance, Distance hierarchy, Linear time, Branching time}
}
@InProceedings{raob.v._et_al:LIPIcs.FSTTCS.2011.115,
author = {Rao B .V., Raghavendra and Sarma M. N., Jayalal},
title = {{Isomorphism testing of read-once functions and polynomials}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {115--126},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.115},
URN = {urn:nbn:de:0030-drops-33202},
doi = {10.4230/LIPIcs.FSTTCS.2011.115},
annote = {Keywords: Isomorphism Problems, Computational Complexity, Read-once formulas, Read-once Polynomials}
}
@InProceedings{grenet_et_al:LIPIcs.FSTTCS.2011.127,
author = {Grenet, Bruno and Koiran, Pascal and Portier, Natacha and Strozecki, Yann},
title = {{The Limited Power of Powering: Polynomial Identity Testing and a Depth-four Lower Bound for the Permanent}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {127--139},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.127},
URN = {urn:nbn:de:0030-drops-33501},
doi = {10.4230/LIPIcs.FSTTCS.2011.127},
annote = {Keywords: Algebraic Complexity, Sparse Polynomials, Descartes' Rule of Signs, Lower Bound for the Permanent, Polynomial Identity Testing}
}
@InProceedings{darondeau_et_al:LIPIcs.FSTTCS.2011.140,
author = {Darondeau, Philippe and Demri, St\'{e}phane and Meyer, Roland and Morvan, Christophe},
title = {{Petri Net Reachability Graphs: Decidability Status of FO Properties}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {140--151},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.140},
URN = {urn:nbn:de:0030-drops-33563},
doi = {10.4230/LIPIcs.FSTTCS.2011.140},
annote = {Keywords: Petri nets, First order logic, Reachability graph}
}
@InProceedings{atig_et_al:LIPIcs.FSTTCS.2011.152,
author = {Atig, Mohamed Faouzi and Ganty, Pierre},
title = {{Approximating Petri Net Reachability Along Context-free Traces}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {152--163},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.152},
URN = {urn:nbn:de:0030-drops-33448},
doi = {10.4230/LIPIcs.FSTTCS.2011.152},
annote = {Keywords: Petri nets, Context-free Grammars, Reachability Problem}
}
@InProceedings{fomin_et_al:LIPIcs.FSTTCS.2011.164,
author = {Fomin, Fedor V. and Philip, Geevarghese and Villanger, Yngve},
title = {{Minimum Fill-in of Sparse Graphs: Kernelization and Approximation}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {164--175},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.164},
URN = {urn:nbn:de:0030-drops-33451},
doi = {10.4230/LIPIcs.FSTTCS.2011.164},
annote = {Keywords: Minimum Fill-In, Approximation, Kernelization, Sparse graphs}
}
@InProceedings{adiga_et_al:LIPIcs.FSTTCS.2011.176,
author = {Adiga, Abhijin and Chandran, L. Sunil and Mathew, Rogers},
title = {{Cubicity, Degeneracy, and Crossing Number}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {176--190},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.176},
URN = {urn:nbn:de:0030-drops-33428},
doi = {10.4230/LIPIcs.FSTTCS.2011.176},
annote = {Keywords: Degeneracy, Cubicity, Boxicity, Crossing Number, Interval Graph, Intersection Graph, Poset Dimension, Comparability Graph}
}
@InProceedings{bruggink_et_al:LIPIcs.FSTTCS.2011.191,
author = {Bruggink, H. J. Sander and Cauderlier, Rapha\"{e}l and H\"{u}lsbusch, Mathias and K\"{o}nig, Barbara},
title = {{Conditional Reactive Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {191--203},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.191},
URN = {urn:nbn:de:0030-drops-33257},
doi = {10.4230/LIPIcs.FSTTCS.2011.191},
annote = {Keywords: reactive systems, graph transformation, graph logic, Hoare triples, critical pair analysis}
}
@InProceedings{chevalier_et_al:LIPIcs.FSTTCS.2011.204,
author = {Chevalier, C\'{e}line and Delaune, St\'{e}phanie and Kremer, Steve},
title = {{Transforming Password Protocols to Compose}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {204--216},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.204},
URN = {urn:nbn:de:0030-drops-33273},
doi = {10.4230/LIPIcs.FSTTCS.2011.204},
annote = {Keywords: Security, cryptographic protocols, composition}
}
@InProceedings{heggernes_et_al:LIPIcs.FSTTCS.2011.217,
author = {Heggernes, Pinar and van 't Hof, Pim and Lokshtanov, Daniel and Paul, Christophe},
title = {{Obtaining a Bipartite Graph by Contracting Few Edges}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {217--228},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.217},
URN = {urn:nbn:de:0030-drops-33579},
doi = {10.4230/LIPIcs.FSTTCS.2011.217},
annote = {Keywords: fixed parameter tractability, graph modification problems, edge contractions, bipartite graphs}
}
@InProceedings{crowston_et_al:LIPIcs.FSTTCS.2011.229,
author = {Crowston, Robert and Fellows, Michael and Gutin, Gregory and Jones, Mark and Rosamond, Frances and Thomass\'{e}, St\'{e}phan and Yeo, Anders},
title = {{Simultaneously Satisfying Linear Equations Over F\underline2: MaxLin2 and Max-r-Lin2 Parameterized Above Average}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {229--240},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.229},
URN = {urn:nbn:de:0030-drops-33416},
doi = {10.4230/LIPIcs.FSTTCS.2011.229},
annote = {Keywords: MaxLin, fixed-parameter tractability, kernelization, pseudo-boolean functions}
}
@InProceedings{ananth_et_al:LIPIcs.FSTTCS.2011.241,
author = {Ananth, Prabhanjan and Nasre, Meghana and Sarpatwar, Kanthi K.},
title = {{Rainbow Connectivity: Hardness and Tractability}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {241--251},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.241},
URN = {urn:nbn:de:0030-drops-33535},
doi = {10.4230/LIPIcs.FSTTCS.2011.241},
annote = {Keywords: Computational Complexity, Rainbow Connectivity, Graph Theory, Fixed Parameter Tractable Algorithms}
}
@InProceedings{durand_et_al:LIPIcs.FSTTCS.2011.252,
author = {Durand, Arnaud and Ebbing, Johannes and Kontinen, Juha and Vollmer, Heribert},
title = {{Dependence logic with a majority quantifier}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {252--263},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.252},
URN = {urn:nbn:de:0030-drops-33467},
doi = {10.4230/LIPIcs.FSTTCS.2011.252},
annote = {Keywords: dependence logic, counting hierarchy, majority quantifier, second order logic, descriptive complexity, finite model theory}
}
@InProceedings{kieronski_et_al:LIPIcs.FSTTCS.2011.264,
author = {Kieronski, Emanuel and Michaliszyn, Jakub and Otop, Jan},
title = {{Modal Logics Definable by Universal Three-Variable Formulas}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {264--275},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.264},
URN = {urn:nbn:de:0030-drops-33495},
doi = {10.4230/LIPIcs.FSTTCS.2011.264},
annote = {Keywords: modal logic, decidability}
}
@InProceedings{goller_et_al:LIPIcs.FSTTCS.2011.276,
author = {G\"{o}ller, Stefan and Lohrey, Markus},
title = {{The First-Order Theory of Ground Tree Rewrite Graphs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {276--287},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.276},
URN = {urn:nbn:de:0030-drops-33220},
doi = {10.4230/LIPIcs.FSTTCS.2011.276},
annote = {Keywords: ground tree rewriting systems, first-order theories, complexity}
}
@InProceedings{felgenhauer_et_al:LIPIcs.FSTTCS.2011.288,
author = {Felgenhauer, Bertram and Zankl, Harald and Middeldorp, Aart},
title = {{Layer Systems for Proving Confluence}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {288--299},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.288},
URN = {urn:nbn:de:0030-drops-33265},
doi = {10.4230/LIPIcs.FSTTCS.2011.288},
annote = {Keywords: Term rewriting, Confluence, Modularity, Persistence}
}
@InProceedings{madry_et_al:LIPIcs.FSTTCS.2011.300,
author = {Madry, Aleksander and Panigrahi, Debmalya},
title = {{The Semi-stochastic Ski-rental Problem}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {300--311},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.300},
URN = {urn:nbn:de:0030-drops-33305},
doi = {10.4230/LIPIcs.FSTTCS.2011.300},
annote = {Keywords: online optimization, stochastic algorithm}
}
@InProceedings{filiot_et_al:LIPIcs.FSTTCS.2011.312,
author = {Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Fr\'{e}d\'{e}ric},
title = {{Streamability of Nested Word Transductions}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {312--324},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.312},
URN = {urn:nbn:de:0030-drops-33523},
doi = {10.4230/LIPIcs.FSTTCS.2011.312},
annote = {Keywords: nested word, visibly pushdown transducer, streaming, XML}
}
@InProceedings{gupta_et_al:LIPIcs.FSTTCS.2011.325,
author = {Gupta, Manoj and Sabharwal, Yogish and Sen, Sandeep},
title = {{The update complexity of selection and related problems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {325--338},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.325},
URN = {urn:nbn:de:0030-drops-33314},
doi = {10.4230/LIPIcs.FSTTCS.2011.325},
annote = {Keywords: Uncertain data, Competitive analysis}
}
@InProceedings{cai_et_al:LIPIcs.FSTTCS.2011.339,
author = {Cai, Yang and Zhang, Ting},
title = {{A Tight Lower Bound for Streett Complementation}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {339--350},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.339},
URN = {urn:nbn:de:0030-drops-33474},
doi = {10.4230/LIPIcs.FSTTCS.2011.339},
annote = {Keywords: omega-automata, Streett automata, complementation, lower bounds}
}
@InProceedings{barcelo_et_al:LIPIcs.FSTTCS.2011.351,
author = {Barcel\'{o}, Pablo and Libkin, Leonid and Reutter, Juan L.},
title = {{Parameterized Regular Expressions and Their Languages}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {351--362},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.351},
URN = {urn:nbn:de:0030-drops-33334},
doi = {10.4230/LIPIcs.FSTTCS.2011.351},
annote = {Keywords: Regular expressions, complexity, decision problems, regular languages}
}
@InProceedings{duparc_et_al:LIPIcs.FSTTCS.2011.363,
author = {Duparc, Jacques and Facchini, Alessandro and Murlak, Filip},
title = {{Definable Operations On Weakly Recognizable Sets of Trees}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {363--374},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.363},
URN = {urn:nbn:de:0030-drops-33361},
doi = {10.4230/LIPIcs.FSTTCS.2011.363},
annote = {Keywords: alternating automata, Wadge hierarchy, index hierarchy}
}
@InProceedings{bouyer_et_al:LIPIcs.FSTTCS.2011.375,
author = {Bouyer, Patricia and Brenguier, Romain and Markey, Nicolas and Ummels, Michael},
title = {{Nash Equilibria in Concurrent Games with B\"{u}chi Objectives}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {375--386},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.375},
URN = {urn:nbn:de:0030-drops-33340},
doi = {10.4230/LIPIcs.FSTTCS.2011.375},
annote = {Keywords: Concurrent games, Nash equilibria, B\"{u}chi Objectives}
}
@InProceedings{berwanger_et_al:LIPIcs.FSTTCS.2011.387,
author = {Berwanger, Dietmar and Kaiser, Lukasz and Puchala, Bernd},
title = {{A Perfect-Information Construction for Coordination in Games}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {387--398},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.387},
URN = {urn:nbn:de:0030-drops-33354},
doi = {10.4230/LIPIcs.FSTTCS.2011.387},
annote = {Keywords: Distributed Synthesis, Games on Graphs, Imperfect Information, Epistemic Models}
}
@InProceedings{fearnley_et_al:LIPIcs.FSTTCS.2011.399,
author = {Fearnley, John and Rabe, Markus and Schewe, Sven and Zhang, Lijun},
title = {{Efficient Approximation of Optimal Control for Continuous-Time Markov Games}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {399--410},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.399},
URN = {urn:nbn:de:0030-drops-33547},
doi = {10.4230/LIPIcs.FSTTCS.2011.399},
annote = {Keywords: Continuous time Markov decision processes and games, discretisation}
}
@InProceedings{bertrand_et_al:LIPIcs.FSTTCS.2011.411,
author = {Bertrand, Nathalie and Genest, Blaise},
title = {{Minimal Disclosure in Partially Observable Markov Decision Processes}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {411--422},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.411},
URN = {urn:nbn:de:0030-drops-33286},
doi = {10.4230/LIPIcs.FSTTCS.2011.411},
annote = {Keywords: Partially Observable Markov Decision Processes, Stochastic Games, Model-Checking, Worst-Case/Average-Case Analysis}
}
@InProceedings{benkiki_et_al:LIPIcs.FSTTCS.2011.423,
author = {Ben-Kiki, Oren and Bille, Philip and Breslauer, Dany and Gasieniec, Leszek and Grossi, Roberto and Weimann, Oren},
title = {{Optimal Packed String Matching}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {423--432},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.423},
URN = {urn:nbn:de:0030-drops-33558},
doi = {10.4230/LIPIcs.FSTTCS.2011.423},
annote = {Keywords: String matching, bit parallelism, real time, space efficiency}
}
@InProceedings{caminiti_et_al:LIPIcs.FSTTCS.2011.433,
author = {Caminiti, Saverio and Finocchi, Irene and Fusco, Emanuele G. and Silvestri, Francesco},
title = {{Dynamic programming in faulty memory hierarchies (cache-obliviously)}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {433--444},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.433},
URN = {urn:nbn:de:0030-drops-33241},
doi = {10.4230/LIPIcs.FSTTCS.2011.433},
annote = {Keywords: Unreliable memories, fault-tolerant algorithms, dynamic programming, cache-oblivious algorithms, Gaussian elimination paradigm}
}
@InProceedings{fu_et_al:LIPIcs.FSTTCS.2011.445,
author = {Fu, Hongfei and Katoen, Joost-Pieter},
title = {{Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {445--456},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.445},
URN = {urn:nbn:de:0030-drops-33435},
doi = {10.4230/LIPIcs.FSTTCS.2011.445},
annote = {Keywords: infinite-state systems, probabilistic simulation, probabilistic pushdown automata}
}
@InProceedings{hague:LIPIcs.FSTTCS.2011.457,
author = {Hague, Matthew},
title = {{Parameterised Pushdown Systems with Non-Atomic Writes}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {457--468},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.457},
URN = {urn:nbn:de:0030-drops-33485},
doi = {10.4230/LIPIcs.FSTTCS.2011.457},
annote = {Keywords: Verification, Concurrency, Pushdown Systems, Reachability, Parameterised Systems, Non-atomicity}
}
@InProceedings{caucal_et_al:LIPIcs.FSTTCS.2011.469,
author = {Caucal, Didier and Knapik, Teodor},
title = {{Higher order indexed monadic systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)},
pages = {469--480},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-34-7},
ISSN = {1868-8969},
year = {2011},
volume = {13},
editor = {Chakraborty, Supratik and Kumar, Amit},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2011.469},
URN = {urn:nbn:de:0030-drops-33379},
doi = {10.4230/LIPIcs.FSTTCS.2011.469},
annote = {Keywords: Higher-order indexed languages, monadic systems}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing