@Proceedings{lodaya_et_al:LIPIcs.FSTTCS.2010,
title = {{LIPIcs, Volume 8, FSTTCS'10, Complete Volume}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2013},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010},
URN = {urn:nbn:de:0030-drops-41027},
doi = {10.4230/LIPIcs.FSTTCS.2010},
annote = {Keywords: Software/Program Verification, Models of Computation, Modes of Computation, Complexity Measures and Classes, Nonnumerical Algorithms and Problems pecifying and Verifying and Reasoning about Program}
}
@InProceedings{lodaya_et_al:LIPIcs.FSTTCS.2010.i,
author = {Lodaya, Kamal and Mahajan, Meena},
title = {{Frontmatter, Table of Contents, Preface, Conference Organization, Author Index}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {i--xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.i},
URN = {urn:nbn:de:0030-drops-28475},
doi = {10.4230/LIPIcs.FSTTCS.2010.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization, Author Index}
}
@InProceedings{alur_et_al:LIPIcs.FSTTCS.2010.1,
author = {Alur, Rajeev and \v{C}ern\'{y}, Pavol},
title = {{Expressiveness of streaming string transducers}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {1--12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.1},
URN = {urn:nbn:de:0030-drops-28538},
doi = {10.4230/LIPIcs.FSTTCS.2010.1},
annote = {Keywords: streaming string transducer, list processing, heap manipulation, monadic second-order transduction}
}
@InProceedings{courcelle:LIPIcs.FSTTCS.2010.13,
author = {Courcelle, Bruno},
title = {{Special tree-width and the verification of monadic second-order graph pr operties}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {13--29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.13},
URN = {urn:nbn:de:0030-drops-28494},
doi = {10.4230/LIPIcs.FSTTCS.2010.13},
annote = {Keywords: model-checking, monadic second-order logic, fixed-parameter tractability, special tree-width}
}
@InProceedings{pudlak:LIPIcs.FSTTCS.2010.30,
author = {Pudl\'{a}k, Pavel},
title = {{On extracting computations from propositional proofs (a survey)}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {30--41},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.30},
URN = {urn:nbn:de:0030-drops-28512},
doi = {10.4230/LIPIcs.FSTTCS.2010.30},
annote = {Keywords: proof complexity, propositional tautology, boolean circuits, resolution, feasible interpolation}
}
@InProceedings{vempala:LIPIcs.FSTTCS.2010.42,
author = {Vempala, Santosh S.},
title = {{Recent Progress and Open Problems in Algorithmic Convex Geometry}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {42--64},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.42},
URN = {urn:nbn:de:0030-drops-28529},
doi = {10.4230/LIPIcs.FSTTCS.2010.42},
annote = {Keywords: convex geometry, geometric inequalities, algorithms, sampling, optimization, integration, rounding, learning}
}
@InProceedings{zielonka:LIPIcs.FSTTCS.2010.65,
author = {Zielonka, Wieslaw},
title = {{Playing in stochastic environment: from multi-armed bandits to two-player games}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {65--72},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.65},
URN = {urn:nbn:de:0030-drops-28500},
doi = {10.4230/LIPIcs.FSTTCS.2010.65},
annote = {Keywords: two-player zero-sum game, one-player zero-sum game, multi-armed bandit, memoryless deterministic strategy}
}
@InProceedings{ganian_et_al:LIPIcs.FSTTCS.2010.73,
author = {Ganian, Robert and Hlinen\'{y}, Petr and Obdrz\'{a}lek, Jan},
title = {{Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {73--83},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.73},
URN = {urn:nbn:de:0030-drops-28541},
doi = {10.4230/LIPIcs.FSTTCS.2010.73},
annote = {Keywords: propositional model counting; satisfiability; rank-width; clique-width ; parameterized complexity}
}
@InProceedings{ordyniak_et_al:LIPIcs.FSTTCS.2010.84,
author = {Ordyniak, Sebastian and Paulusma, Daniel and Szeider, Stefan},
title = {{Satisfiability of Acyclic and Almost Acyclic CNF Formulas}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {84--95},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.84},
URN = {urn:nbn:de:0030-drops-28556},
doi = {10.4230/LIPIcs.FSTTCS.2010.84},
annote = {Keywords: Satisfiability, chordal bipartite graphs, beta-acyclic hypergraphs, backdoor sets, parameterized complexity}
}
@InProceedings{misra_et_al:LIPIcs.FSTTCS.2010.96,
author = {Misra, Neeldhara and Philip, Geevarghese and Raman, Venkatesh and Saurabh, Saket},
title = {{The effect of girth on the kernelization complexity of Connected Dominating Set}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {96--107},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.96},
URN = {urn:nbn:de:0030-drops-28567},
doi = {10.4230/LIPIcs.FSTTCS.2010.96},
annote = {Keywords: Connected Dominating Set, parameterized complexity, kernelization, girth}
}
@InProceedings{brazdil_et_al:LIPIcs.FSTTCS.2010.108,
author = {Br\'{a}zdil, Tom\'{a}s and Brozek, V\'{a}clav and Etessami, Kousha},
title = {{One-Counter Stochastic Games}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {108--119},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.108},
URN = {urn:nbn:de:0030-drops-28571},
doi = {10.4230/LIPIcs.FSTTCS.2010.108},
annote = {Keywords: one-counter automata, simple stochastic games, Markov decision process, termination, limit, long run average reward}
}
@InProceedings{dacosta_et_al:LIPIcs.FSTTCS.2010.120,
author = {Da Costa, Arnaud and Laroussinie, Fran\c{c}ois and Markey, Nicolas},
title = {{ATL with Strategy Contexts: Expressiveness and Model Checking}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {120--132},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.120},
URN = {urn:nbn:de:0030-drops-28589},
doi = {10.4230/LIPIcs.FSTTCS.2010.120},
annote = {Keywords: alternating temporal logic, agent, strategy quantifier}
}
@InProceedings{mogavero_et_al:LIPIcs.FSTTCS.2010.133,
author = {Mogavero, Fabio and Murano, Aniello and Vardi, Moshe Y.},
title = {{Reasoning About Strategies}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {133--144},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.133},
URN = {urn:nbn:de:0030-drops-28597},
doi = {10.4230/LIPIcs.FSTTCS.2010.133},
annote = {Keywords: open systems, multi-agent systems, verification, strategy quantifier, alternating temporal logic, model-checking}
}
@InProceedings{chakraborty_et_al:LIPIcs.FSTTCS.2010.145,
author = {Chakraborty, Sourav and Fischer, Eldar and Matsliah, Arie and de Wolf, Ronald},
title = {{New Results on Quantum Property Testing}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {145--156},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.145},
URN = {urn:nbn:de:0030-drops-28603},
doi = {10.4230/LIPIcs.FSTTCS.2010.145},
annote = {Keywords: quantum algorithm, property testing}
}
@InProceedings{chailloux_et_al:LIPIcs.FSTTCS.2010.157,
author = {Chailloux, Andr\'{e} and Kerenidis, Iordanis and Sikora, Jamie},
title = {{Lower bounds for Quantum Oblivious Transfer}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {157--168},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.157},
URN = {urn:nbn:de:0030-drops-28613},
doi = {10.4230/LIPIcs.FSTTCS.2010.157},
annote = {Keywords: quantum oblivious transfer, coin flipping protocol, semidefinite programming}
}
@InProceedings{khandekar_et_al:LIPIcs.FSTTCS.2010.169,
author = {Khandekar, Rohit and Schieber, Baruch and Shachnai, Hadas and Tamir, Tami},
title = {{Minimizing Busy Time in Multiple Machine Real-time Scheduling}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {169--180},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.169},
URN = {urn:nbn:de:0030-drops-28909},
doi = {10.4230/LIPIcs.FSTTCS.2010.169},
annote = {Keywords: real-time scheduling, busy time, preemption, approximation algorithm}
}
@InProceedings{chakaravarthy_et_al:LIPIcs.FSTTCS.2010.181,
author = {Chakaravarthy, Venkatesan T. and Choudhury, Anamitra R. and Sabharwal, Yogish},
title = {{A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag Constraints}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {181--191},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.181},
URN = {urn:nbn:de:0030-drops-28623},
doi = {10.4230/LIPIcs.FSTTCS.2010.181},
annote = {Keywords: Approximation Algorithms; Scheduling; Resource Allocation}
}
@InProceedings{bonnet_et_al:LIPIcs.FSTTCS.2010.192,
author = {Bonnet, R\'{e}mi and Finkel, Alain and Leroux, J\'{e}r\^{o}me and Zeitoun, Marc},
title = {{Place-Boundedness for Vector Addition Systems with one zero-test}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {192--203},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.192},
URN = {urn:nbn:de:0030-drops-28638},
doi = {10.4230/LIPIcs.FSTTCS.2010.192},
annote = {Keywords: Place-boundedness, vector addition system with one zero-test, Karp-Miller algorithm}
}
@InProceedings{akshay_et_al:LIPIcs.FSTTCS.2010.204,
author = {Akshay, S. and Gastin, Paul and Mukund, Madhavan and Narayan Kumar, K.},
title = {{Model checking time-constrained scenario-based specifications}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {204--215},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.204},
URN = {urn:nbn:de:0030-drops-28649},
doi = {10.4230/LIPIcs.FSTTCS.2010.204},
annote = {Keywords: model-checking, message-passing system, time-constrained MSC}
}
@InProceedings{atig:LIPIcs.FSTTCS.2010.216,
author = {Atig, Mohamed Faouzi},
title = {{Global Model Checking of Ordered Multi-Pushdown Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {216--227},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.216},
URN = {urn:nbn:de:0030-drops-28653},
doi = {10.4230/LIPIcs.FSTTCS.2010.216},
annote = {Keywords: Concurrent Programs, Pushdown Systems, Global Model-Checking}
}
@InProceedings{hague_et_al:LIPIcs.FSTTCS.2010.228,
author = {Hague, Matthew and To, Anthony Widjaja},
title = {{The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {228--239},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.228},
URN = {urn:nbn:de:0030-drops-28663},
doi = {10.4230/LIPIcs.FSTTCS.2010.228},
annote = {Keywords: Higher-Order, Collapsible, Pushdown Systems, Temporal Logics, Complexity, Model Checking}
}
@InProceedings{ge_et_al:LIPIcs.FSTTCS.2010.240,
author = {Ge, Qi and Stefankovic, Daniel},
title = {{A graph polynomial for independent sets of bipartite graphs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {240--250},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.240},
URN = {urn:nbn:de:0030-drops-28676},
doi = {10.4230/LIPIcs.FSTTCS.2010.240},
annote = {Keywords: graph polynomials, #P-complete, independent sets, approximate counting problems, Markov chain Monte Carlo}
}
@InProceedings{chakaravarthy_et_al:LIPIcs.FSTTCS.2010.251,
author = {Chakaravarthy, Venkatesan T. and Pandit, Vinayaka and Roy, Sambuddha and Sabharwal, Yogish},
title = {{Finding Independent Sets in Unions of Perfect Graphs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {251--259},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.251},
URN = {urn:nbn:de:0030-drops-28683},
doi = {10.4230/LIPIcs.FSTTCS.2010.251},
annote = {Keywords: Approximation Algorithms; Comparability Graphs; Hardness of approximation}
}
@InProceedings{czerwinski_et_al:LIPIcs.FSTTCS.2010.260,
author = {Czerwinski, Wojciech and Lasota, Slawomir},
title = {{Fast equivalence-checking for normed context-free processes}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {260--271},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.260},
URN = {urn:nbn:de:0030-drops-28690},
doi = {10.4230/LIPIcs.FSTTCS.2010.260},
annote = {Keywords: bisimulation, norm, context-free grammar, simple grammar}
}
@InProceedings{silva_et_al:LIPIcs.FSTTCS.2010.272,
author = {Silva, Alexandra and Bonchi, Filippo and Bonsangue, Marcello M. and Rutten, Jan J. M. M.},
title = {{Generalizing the powerset construction, coalgebraically}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {272--283},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.272},
URN = {urn:nbn:de:0030-drops-28706},
doi = {10.4230/LIPIcs.FSTTCS.2010.272},
annote = {Keywords: coalgebra, language equivalence, bisimilarity, powerset construction}
}
@InProceedings{radcliffe_et_al:LIPIcs.FSTTCS.2010.284,
author = {Radcliffe, Nicholas and Verma, Rakesh M.},
title = {{Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {284--295},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.284},
URN = {urn:nbn:de:0030-drops-28715},
doi = {10.4230/LIPIcs.FSTTCS.2010.284},
annote = {Keywords: term rewrite systems, uniqueness of normal forms, decidability, shallo w rewrite systems, flat rewrite systems}
}
@InProceedings{jansen_et_al:LIPIcs.FSTTCS.2010.296,
author = {Jansen, Maurice and Qiao, Youming and Sarma M.N., Jayalal},
title = {{Deterministic Black-Box Identity Testing \$pi\$-Ordered Algebraic Branching Programs}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {296--307},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.296},
URN = {urn:nbn:de:0030-drops-28728},
doi = {10.4230/LIPIcs.FSTTCS.2010.296},
annote = {Keywords: ordered algebraic branching program, polynomial identity testing}
}
@InProceedings{hunter_et_al:LIPIcs.FSTTCS.2010.308,
author = {Hunter, Paul and Bouyer, Patricia and Markey, Nicolas and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{Computing Rational Radical Sums in Uniform TC^0}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {308--316},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.308},
URN = {urn:nbn:de:0030-drops-28739},
doi = {10.4230/LIPIcs.FSTTCS.2010.308},
annote = {Keywords: Sum of square roots, Threshold circuits, Complexity}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.FSTTCS.2010.317,
author = {Chattopadhyay, Arkadev and Tor\'{a}n, Jacobo and Wagner, Fabian},
title = {{Graph Isomorphism is not AC^0 reducible to Group Isomorphism}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {317--326},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.317},
URN = {urn:nbn:de:0030-drops-28748},
doi = {10.4230/LIPIcs.FSTTCS.2010.317},
annote = {Keywords: Complexity, Algorithms, Group Isomorphism Problem, Circuit Com plexity}
}
@InProceedings{arvind_et_al:LIPIcs.FSTTCS.2010.327,
author = {Arvind, V. and Das, Bireswar and K\"{o}bler, Johannes and Toda, Seinosuke},
title = {{Colored Hypergraph Isomorphism is Fixed Parameter Tractable}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {327--337},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.327},
URN = {urn:nbn:de:0030-drops-28751},
doi = {10.4230/LIPIcs.FSTTCS.2010.327},
annote = {Keywords: Fixed parameter tractability, fpt algorithms, graph isomorphism, computational complexity}
}
@InProceedings{capecchi_et_al:LIPIcs.FSTTCS.2010.338,
author = {Capecchi, Sara and Giachino, Elena and Yoshida, Nobuko},
title = {{Global Escape in Multiparty Sessions}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {338--351},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.338},
URN = {urn:nbn:de:0030-drops-28760},
doi = {10.4230/LIPIcs.FSTTCS.2010.338},
annote = {Keywords: escape mechanism, exception handling, multiparty communication}
}
@InProceedings{backes_et_al:LIPIcs.FSTTCS.2010.352,
author = {Backes, Michael and Maffei, Matteo and Mohammadi, Esfandiar},
title = {{Computationally Sound Abstraction and Verification of Secure Multi-Party Computations}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {352--363},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.352},
URN = {urn:nbn:de:0030-drops-28771},
doi = {10.4230/LIPIcs.FSTTCS.2010.352},
annote = {Keywords: Computational soundness, Secure multi-party computation, Process calculi, Protocol verification}
}
@InProceedings{chadha_et_al:LIPIcs.FSTTCS.2010.364,
author = {Chadha, Rohit and Sistla, A. Prasad and Viswanathan, Mahesh},
title = {{Model Checking Concurrent Programs with Nondeterminism and Randomization}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {364--375},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.364},
URN = {urn:nbn:de:0030-drops-28788},
doi = {10.4230/LIPIcs.FSTTCS.2010.364},
annote = {Keywords: view consistent scheduler, locally Markovian scheduler, model-checking, probabilistic program}
}
@InProceedings{asarin_et_al:LIPIcs.FSTTCS.2010.376,
author = {Asarin, Eugene and Degorre, Aldric},
title = {{Two Size Measures for Timed Languages}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {376--387},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.376},
URN = {urn:nbn:de:0030-drops-28793},
doi = {10.4230/LIPIcs.FSTTCS.2010.376},
annote = {Keywords: timed automata, entropy, mean dimension}
}
@InProceedings{nicaud_et_al:LIPIcs.FSTTCS.2010.388,
author = {Nicaud, Cyril and Pivoteau, Carine and Razet, Beno\^{i}t},
title = {{Average Analysis of Glushkov Automata under a BST-Like Model}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {388--399},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.388},
URN = {urn:nbn:de:0030-drops-28809},
doi = {10.4230/LIPIcs.FSTTCS.2010.388},
annote = {Keywords: Glushkov automata, random binary search tree, regular expression}
}
@InProceedings{schewe:LIPIcs.FSTTCS.2010.400,
author = {Schewe, Sven},
title = {{Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-Complete}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {400--411},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.400},
URN = {urn:nbn:de:0030-drops-28816},
doi = {10.4230/LIPIcs.FSTTCS.2010.400},
annote = {Keywords: Automata Theory, Complexity, B\"{u}chi Automata, Parity Automata}
}
@InProceedings{boker_et_al:LIPIcs.FSTTCS.2010.412,
author = {Boker, Udi and Kupferman, Orna and Steinitz, Avital},
title = {{Parityizing Rabin and Streett}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {412--423},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.412},
URN = {urn:nbn:de:0030-drops-28822},
doi = {10.4230/LIPIcs.FSTTCS.2010.412},
annote = {Keywords: omega-automata, Rabin condition, Streett condition, parity condition}
}
@InProceedings{berman_et_al:LIPIcs.FSTTCS.2010.424,
author = {Berman, Piotr and Raskhodnikova, Sofya and Ruan, Ge},
title = {{Finding Sparser Directed Spanners}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {424--435},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.424},
URN = {urn:nbn:de:0030-drops-28830},
doi = {10.4230/LIPIcs.FSTTCS.2010.424},
annote = {Keywords: Approximation algorithms, directed graphs, spanners}
}
@InProceedings{goel_et_al:LIPIcs.FSTTCS.2010.436,
author = {Goel, Gagan and Tripathi, Pushkar and Wang, Lei},
title = {{Combinatorial Problems with Discounted Price Functions in Multi-agent Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {436--446},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.436},
URN = {urn:nbn:de:0030-drops-28847},
doi = {10.4230/LIPIcs.FSTTCS.2010.436},
annote = {Keywords: Approximation algorithm, decreasing marginal cost, submodular function, discounted price function}
}
@InProceedings{saket:LIPIcs.FSTTCS.2010.447,
author = {Saket, Rishi},
title = {{Quasi-Random PCP and Hardness of 2-Catalog Segmentation}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {447--458},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.447},
URN = {urn:nbn:de:0030-drops-28858},
doi = {10.4230/LIPIcs.FSTTCS.2010.447},
annote = {Keywords: Hardness of Approximation, PCPs, Catalog Segmentation}
}
@InProceedings{fellows_et_al:LIPIcs.FSTTCS.2010.459,
author = {Fellows, Michael and Jansen, Bart M. P. and Lokshtanov, Daniel and Rosamond, Frances A. and Saurabh, Saket},
title = {{Determining the Winner of a Dodgson Election is Hard}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {459--468},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.459},
URN = {urn:nbn:de:0030-drops-28866},
doi = {10.4230/LIPIcs.FSTTCS.2010.459},
annote = {Keywords: Dodgson Score, Parameterized Complexity, Kernelization Lower Bounds}
}
@InProceedings{genest_et_al:LIPIcs.FSTTCS.2010.469,
author = {Genest, Blaise and Muscholl, Anca and Wu, Zhilin},
title = {{Verifying Recursive Active Documents with Positive Data Tree Rewriting}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {469--480},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.469},
URN = {urn:nbn:de:0030-drops-28877},
doi = {10.4230/LIPIcs.FSTTCS.2010.469},
annote = {Keywords: Active documents, Guarded Active XML, verification, data trees, tree rewriting, well-structured systems.}
}
@InProceedings{kara_et_al:LIPIcs.FSTTCS.2010.481,
author = {Kara, Ahmet and Schwentick, Thomas and Zeume, Thomas},
title = {{Temporal Logics on Words with Multiple Data Values}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {481--492},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.481},
URN = {urn:nbn:de:0030-drops-28883},
doi = {10.4230/LIPIcs.FSTTCS.2010.481},
annote = {Keywords: Expressiveness, Decidability, Temporal Logic, Data words}
}
@InProceedings{schulz:LIPIcs.FSTTCS.2010.493,
author = {Schulz, Stefan},
title = {{First-Order Logic with Reachability Predicates on Infinite Systems}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {493--504},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.493},
URN = {urn:nbn:de:0030-drops-28896},
doi = {10.4230/LIPIcs.FSTTCS.2010.493},
annote = {Keywords: First-Order Logic, Reachability, Infinite Grid, Structure Transformati on, Unfolding, Ground Tree Rewriting, Vertex Replacement with Product}
}
@InProceedings{chatterjee_et_al:LIPIcs.FSTTCS.2010.505,
author = {Chatterjee, Krishnendu and Doyen, Laurent and Henzinger, Thomas A. and Raskin, Jean-Fran\c{c}ois},
title = {{Generalized Mean-payoff and Energy Games}},
booktitle = {IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010)},
pages = {505--516},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-23-1},
ISSN = {1868-8969},
year = {2010},
volume = {8},
editor = {Lodaya, Kamal and Mahajan, Meena},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.505},
URN = {urn:nbn:de:0030-drops-28484},
doi = {10.4230/LIPIcs.FSTTCS.2010.505},
annote = {Keywords: mean-payoff games, energy games, finite memory strategies, determinacy}
}
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