@Proceedings{albers_et_al:LIPIcs.STACS.2009,
title = {{LIPIcs, Volume 3, STACS'09, Complete Volume}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2013},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009},
URN = {urn:nbn:de:0030-drops-40975},
doi = {10.4230/LIPIcs.STACS.2009},
annote = {Keywords: LIPIcs, Volume 3, STACS'09, Complete Volume}
}
@InProceedings{albers_et_al:LIPIcs.STACS.2009.1858,
author = {Albers, Susanne and Marion, Jean-Yves},
title = {{Preface -- 26th International Symposium on Theoretical Aspects of Computer Science}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {i--vii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1858},
URN = {urn:nbn:de:0030-drops-18584},
doi = {10.4230/LIPIcs.STACS.2009.1858},
annote = {Keywords: Symposium, Theoretical computer science, Algorithms and data structures, Automata and formal languages, Computational and structural complex}
}
@InProceedings{baykan_et_al:LIPIcs.STACS.2009.1809,
author = {Baykan, Eda and Henzinger, Monika and Keller, Stefan F. and de Castelberg, Sebastian and Kinzler, Markus},
title = {{A Comparison of Techniques for Sampling Web Pages}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {13--30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1809},
URN = {urn:nbn:de:0030-drops-18091},
doi = {10.4230/LIPIcs.STACS.2009.1809},
annote = {Keywords: Random walks, Sampling web pages}
}
@InProceedings{pin:LIPIcs.STACS.2009.1856,
author = {Pin, Jean-Eric},
title = {{Profinite Methods in Automata Theory}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {31--50},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1856},
URN = {urn:nbn:de:0030-drops-18561},
doi = {10.4230/LIPIcs.STACS.2009.1856},
annote = {Keywords: Profinite topology, Regular languages, Uniform space, Finite automata}
}
@InProceedings{schweikardt:LIPIcs.STACS.2009.1857,
author = {Schweikardt, Nicole},
title = {{Lower Bounds for Multi-Pass Processing of Multiple Data Streams}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {51--62},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1857},
URN = {urn:nbn:de:0030-drops-18575},
doi = {10.4230/LIPIcs.STACS.2009.1857},
annote = {Keywords: Data streams, Lower bounds, Machine models, Automata, The set disjointness problem}
}
@InProceedings{ahmed_et_al:LIPIcs.STACS.2009.1831,
author = {Ahmed, Mustaq and Lubiw, Anna},
title = {{Shortest Paths Avoiding Forbidden Subpaths}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {63--74},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1831},
URN = {urn:nbn:de:0030-drops-18318},
doi = {10.4230/LIPIcs.STACS.2009.1831},
annote = {Keywords: Algorithms and data structures, Graph algorithms, Optical networks}
}
@InProceedings{alwen_et_al:LIPIcs.STACS.2009.1832,
author = {Alwen, Joel and Peikert, Chris},
title = {{Generating Shorter Bases for Hard Random Lattices}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {75--86},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1832},
URN = {urn:nbn:de:0030-drops-18327},
doi = {10.4230/LIPIcs.STACS.2009.1832},
annote = {Keywords: Lattices, Random, Short basis, Average-case hardness, Hermite normal form, Cryptography}
}
@InProceedings{arvind_et_al:LIPIcs.STACS.2009.1801,
author = {Arvind, Vikraman and Mukhopadhyay, Partha},
title = {{Quantum Query Complexity of Multilinear Identity Testing}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {87--98},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1801},
URN = {urn:nbn:de:0030-drops-18014},
doi = {10.4230/LIPIcs.STACS.2009.1801},
annote = {Keywords: Quantum algorithm, Identity testing, Query complexity, Multilinear polynomials}
}
@InProceedings{aubrun_et_al:LIPIcs.STACS.2009.1833,
author = {Aubrun, Nathalie and Sablik, Mathieu},
title = {{An Order on Sets of Tilings Corresponding to an Order on Languages}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {99--110},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1833},
URN = {urn:nbn:de:0030-drops-18336},
doi = {10.4230/LIPIcs.STACS.2009.1833},
annote = {Keywords: Tiling, Subshift, Turing machine with oracle, Subdynamics}
}
@InProceedings{barbay_et_al:LIPIcs.STACS.2009.1814,
author = {Barbay, Jeremy and Navarro, Gonzalo},
title = {{Compressed Representations of Permutations, and Applications}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {111--122},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1814},
URN = {urn:nbn:de:0030-drops-18148},
doi = {10.4230/LIPIcs.STACS.2009.1814},
annote = {Keywords: Compression, Permutations, Succinct data structures, Adaptive sorting}
}
@InProceedings{bassino_et_al:LIPIcs.STACS.2009.1822,
author = {Bassino, Frederique and David, Julien and Nicaud, Cyril},
title = {{On the Average Complexity of Moore's State Minimization Algorithm}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {123--134},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1822},
URN = {urn:nbn:de:0030-drops-18222},
doi = {10.4230/LIPIcs.STACS.2009.1822},
annote = {Keywords: Finite automata, State minimization, Moore’s algorithm, Average complexity}
}
@InProceedings{bhattacharyya_et_al:LIPIcs.STACS.2009.1823,
author = {Bhattacharyya, Arnab and Chen, Victor and Sudan, Madhu and Xie, Ning},
title = {{Testing Linear-Invariant Non-Linear Properties}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {135--146},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1823},
URN = {urn:nbn:de:0030-drops-18235},
doi = {10.4230/LIPIcs.STACS.2009.1823},
annote = {Keywords: }
}
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2009.1810,
author = {Bienvenu, Laurent and Downey, Rod},
title = {{Kolmogorov Complexity and Solovay Functions}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {147--158},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1810},
URN = {urn:nbn:de:0030-drops-18107},
doi = {10.4230/LIPIcs.STACS.2009.1810},
annote = {Keywords: Algorithmic randomness, Kolmogorov complexity, K-triviality}
}
@InProceedings{bojanczyk:LIPIcs.STACS.2009.1834,
author = {Bojanczyk, Mikolaj},
title = {{Weak MSO with the Unbounding Quantifier}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {159--170},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1834},
URN = {urn:nbn:de:0030-drops-18345},
doi = {10.4230/LIPIcs.STACS.2009.1834},
annote = {Keywords: Automata, Monadic second-order logic}
}
@InProceedings{borradaile_et_al:LIPIcs.STACS.2009.1835,
author = {Borradaile, Glencora and Demaine, Erik D. and Tazari, Siamak},
title = {{Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {171--182},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1835},
URN = {urn:nbn:de:0030-drops-18355},
doi = {10.4230/LIPIcs.STACS.2009.1835},
annote = {Keywords: Polynomial-time approximation scheme, Bounded-genus graph, Embedded graph, Steiner tree, Survivable-network design, Subset TSP}
}
@InProceedings{bousquet_et_al:LIPIcs.STACS.2009.1824,
author = {Bousquet, Nicolas and Daligault, Jean and Thomasse, Stephan and Yeo, Anders},
title = {{A Polynomial Kernel for Multicut in Trees}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {183--194},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1824},
URN = {urn:nbn:de:0030-drops-18247},
doi = {10.4230/LIPIcs.STACS.2009.1824},
annote = {Keywords: }
}
@InProceedings{boyer_et_al:LIPIcs.STACS.2009.1836,
author = {Boyer, Laurent and Theyssier, Guillaume},
title = {{On Local Symmetries and Universality in Cellular Automata}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {195--206},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1836},
URN = {urn:nbn:de:0030-drops-18369},
doi = {10.4230/LIPIcs.STACS.2009.1836},
annote = {Keywords: Cellular automata, Universality, Asymptotic density}
}
@InProceedings{brazdil_et_al:LIPIcs.STACS.2009.1837,
author = {Brazdil, Tomas and Brozek, Vaclav and Kucera, Antonin and Obdrzalek, Jan},
title = {{Qualitative Reachability in Stochastic BPA Games}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {207--218},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1837},
URN = {urn:nbn:de:0030-drops-18375},
doi = {10.4230/LIPIcs.STACS.2009.1837},
annote = {Keywords: Stochastic games, Reachability, Pushdown automata}
}
@InProceedings{briet_et_al:LIPIcs.STACS.2009.1813,
author = {Briet, Jop and de Wolf, Ronald},
title = {{Locally Decodable Quantum Codes}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {219--230},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1813},
URN = {urn:nbn:de:0030-drops-18134},
doi = {10.4230/LIPIcs.STACS.2009.1813},
annote = {Keywords: Data structures, Locally decodable codes, Quantum computing}
}
@InProceedings{bulatov_et_al:LIPIcs.STACS.2009.1838,
author = {Bulatov, Andrei A. and Dalmau, Victor and Grohe, Martin and Marx, Daniel},
title = {{Enumerating Homomorphisms}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {231--242},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1838},
URN = {urn:nbn:de:0030-drops-18385},
doi = {10.4230/LIPIcs.STACS.2009.1838},
annote = {Keywords: }
}
@InProceedings{chakraborty_et_al:LIPIcs.STACS.2009.1811,
author = {Chakraborty, Sourav and Fischer, Eldar and Matsliah, Arie and Yuster, Raphael},
title = {{Hardness and Algorithms for Rainbow Connectivity}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {243--254},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1811},
URN = {urn:nbn:de:0030-drops-18115},
doi = {10.4230/LIPIcs.STACS.2009.1811},
annote = {Keywords: }
}
@InProceedings{chan_et_al:LIPIcs.STACS.2009.1815,
author = {Chan, Ho-Leung and Edmonds, Jeff and Lam, Tak-Wah and Lee, Lap-Kei and Marchetti-Spaccamela, Alberto and Pruhs, Kirk},
title = {{Nonclairvoyant Speed Scaling for Flow and Energy}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {255--264},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1815},
URN = {urn:nbn:de:0030-drops-18151},
doi = {10.4230/LIPIcs.STACS.2009.1815},
annote = {Keywords: }
}
@InProceedings{chepoi_et_al:LIPIcs.STACS.2009.1816,
author = {Chepoi, Victor and Seston, Morgan},
title = {{An Approximation Algorithm for l\underlineinfinity Fitting Robinson Structures to Distances}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {265--276},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1816},
URN = {urn:nbn:de:0030-drops-18167},
doi = {10.4230/LIPIcs.STACS.2009.1816},
annote = {Keywords: Robinsonian dissimilarity, Approximation algorithm, Fitting problem}
}
@InProceedings{cheraghchi_et_al:LIPIcs.STACS.2009.1817,
author = {Cheraghchi, Mahdi and Shokrollahi, Amin},
title = {{Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {277--288},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1817},
URN = {urn:nbn:de:0030-drops-18174},
doi = {10.4230/LIPIcs.STACS.2009.1817},
annote = {Keywords: Uniform sampling, Algebraic varieties, Randomized algorithms, Computational complexity}
}
@InProceedings{clement_et_al:LIPIcs.STACS.2009.1825,
author = {Clement, Julien and Crochemore, Maxime and Rindone, Giuseppina},
title = {{Reverse Engineering Prefix Tables}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {289--300},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1825},
URN = {urn:nbn:de:0030-drops-18258},
doi = {10.4230/LIPIcs.STACS.2009.1825},
annote = {Keywords: Design and analysis of algorithms, Algorithms on strings, Pattern matching, String matching, Combinatorics on words, Prefix table, Suffix table}
}
@InProceedings{demaine_et_al:LIPIcs.STACS.2009.1839,
author = {Demaine, Erik D. and Hajiaghayi, MohammadTaghi and Mahini, Hamid and Zadimoghaddam, Morteza},
title = {{The Price of Anarchy in Cooperative Network Creation Games}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {301--312},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1839},
URN = {urn:nbn:de:0030-drops-18390},
doi = {10.4230/LIPIcs.STACS.2009.1839},
annote = {Keywords: }
}
@InProceedings{dewolf:LIPIcs.STACS.2009.1802,
author = {de Wolf, Ronald},
title = {{Error-Correcting Data Structures}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {313--324},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1802},
URN = {urn:nbn:de:0030-drops-18024},
doi = {10.4230/LIPIcs.STACS.2009.1802},
annote = {Keywords: Data structures, Error-correcting codes, Locally decodable codes, Membership}
}
@InProceedings{diekert_et_al:LIPIcs.STACS.2009.1818,
author = {Diekert, Volker and Kufleitner, Manfred},
title = {{Fragments of First-Order Logic over Infinite Words}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {325--336},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1818},
URN = {urn:nbn:de:0030-drops-18185},
doi = {10.4230/LIPIcs.STACS.2009.1818},
annote = {Keywords: Infinite words, Regular languages, First-order logic, Automata theory, Semigroups, Topology}
}
@InProceedings{dilena_et_al:LIPIcs.STACS.2009.1819,
author = {Di Lena, Pietro and Margara, Luciano},
title = {{Undecidable Properties of Limit Set Dynamics of Cellular Automata}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {337--348},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1819},
URN = {urn:nbn:de:0030-drops-18194},
doi = {10.4230/LIPIcs.STACS.2009.1819},
annote = {Keywords: Cellular automata, Undecidability, Symbolic dynamics}
}
@InProceedings{ebenlendr_et_al:LIPIcs.STACS.2009.1840,
author = {Ebenlendr, Tomas and Sgall, Jiri},
title = {{Semi-Online Preemptive Scheduling: One Algorithm for All Variants}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {349--360},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1840},
URN = {urn:nbn:de:0030-drops-18406},
doi = {10.4230/LIPIcs.STACS.2009.1840},
annote = {Keywords: On-line algorithms, Scheduling}
}
@InProceedings{elbassioni_et_al:LIPIcs.STACS.2009.1841,
author = {Elbassioni, Khaled and Krohn, Erik and Matijevic, Domagoj and Mestre, Julian and Severdija, Domagoj},
title = {{Improved Approximations for Guarding 1.5-Dimensional Terrains}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {361--372},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1841},
URN = {urn:nbn:de:0030-drops-18410},
doi = {10.4230/LIPIcs.STACS.2009.1841},
annote = {Keywords: Covering problems, Guarding 1.5-terrains, Approximation algorithms, Linear programming, Totally balanced matrices}
}
@InProceedings{elsasser_et_al:LIPIcs.STACS.2009.1842,
author = {Els\"{a}sser, Robert and Sauerwald, Thomas},
title = {{Cover Time and Broadcast Time}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {373--384},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1842},
URN = {urn:nbn:de:0030-drops-18421},
doi = {10.4230/LIPIcs.STACS.2009.1842},
annote = {Keywords: Random walk, Randomized algorithms, Parallel and distributed algorithms}
}
@InProceedings{englert_et_al:LIPIcs.STACS.2009.1826,
author = {Englert, Matthias and R\"{o}glin, Heiko and Sp\"{o}nemann, Jacob and V\"{o}cking, Berthold},
title = {{Economical Caching}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {385--396},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1826},
URN = {urn:nbn:de:0030-drops-18263},
doi = {10.4230/LIPIcs.STACS.2009.1826},
annote = {Keywords: Online algorithms, Competitive analysis, Storage management}
}
@InProceedings{farzad_et_al:LIPIcs.STACS.2009.1827,
author = {Farzad, Babak and Lau, Lap Chi and Le, Van Bang and Tuy, Nguyen Ngoc},
title = {{Computing Graph Roots Without Short Cycles}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {397--408},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1827},
URN = {urn:nbn:de:0030-drops-18279},
doi = {10.4230/LIPIcs.STACS.2009.1827},
annote = {Keywords: Graph roots, Graph powers, Recognition algorithms, NP-completeness}
}
@InProceedings{fellows_et_al:LIPIcs.STACS.2009.1820,
author = {Fellows, Michael R. and Guo, Jiong and Moser, Hannes and Niedermeier, Rolf},
title = {{A Generalization of Nemhauser and Trotter's Local Optimization Theorem}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {409--420},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1820},
URN = {urn:nbn:de:0030-drops-18200},
doi = {10.4230/LIPIcs.STACS.2009.1820},
annote = {Keywords: Algorithms, Computational complexity, NP-hard problems, W\lbrack2\rbrack-completeness, Graph problems, Combinatorial optimization, Fixed-parameter tractability, K}
}
@InProceedings{fernau_et_al:LIPIcs.STACS.2009.1843,
author = {Fernau, Henning and Fomin, Fedor V. and Lokshtanov, Daniel and Raible, Daniel and Saurabh, Saket and Villanger, Yngve},
title = {{Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {421--432},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1843},
URN = {urn:nbn:de:0030-drops-18437},
doi = {10.4230/LIPIcs.STACS.2009.1843},
annote = {Keywords: Parameterized algorithms, Kernelization, Out-branching, Max-leaf, Lower bounds}
}
@InProceedings{finkel_et_al:LIPIcs.STACS.2009.1844,
author = {Finkel, Alain and Goubault-Larrecq, Jean},
title = {{Forward Analysis for WSTS, Part I: Completions}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {433--444},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1844},
URN = {urn:nbn:de:0030-drops-18444},
doi = {10.4230/LIPIcs.STACS.2009.1844},
annote = {Keywords: WSTS, Forward analysis, Completion, Karp-Miller procedure, Domain theory, Sober spaces, Noetherian spaces}
}
@InProceedings{fomin_et_al:LIPIcs.STACS.2009.1803,
author = {Fomin, Fedor V. and Golovach, Petr A. and Thilikos, Dimitrios M.},
title = {{Approximating Acyclicity Parameters of Sparse Hypergraphs}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {445--456},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1803},
URN = {urn:nbn:de:0030-drops-18034},
doi = {10.4230/LIPIcs.STACS.2009.1803},
annote = {Keywords: Graph, Hypergraph, Hypertree width, Treewidth}
}
@InProceedings{franceschini_et_al:LIPIcs.STACS.2009.1845,
author = {Franceschini, Gianni and Grossi, Roberto and Muthukrishnan, S.},
title = {{Optimal Cache-Aware Suffix Selection}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {457--468},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1845},
URN = {urn:nbn:de:0030-drops-18452},
doi = {10.4230/LIPIcs.STACS.2009.1845},
annote = {Keywords: }
}
@InProceedings{gacs_et_al:LIPIcs.STACS.2009.1828,
author = {Gacs, Peter and Hoyrup, Mathieu and Rojas, Cristobal},
title = {{Randomness on Computable Probability Spaces - A Dynamical Point of View}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {469--480},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1828},
URN = {urn:nbn:de:0030-drops-18280},
doi = {10.4230/LIPIcs.STACS.2009.1828},
annote = {Keywords: Schnorr randomness, Birkhoff's ergodic theorem, Computable measures}
}
@InProceedings{gelade_et_al:LIPIcs.STACS.2009.1829,
author = {Gelade, Wouter and Marquardt, Marcel and Schwentick, Thomas},
title = {{The Dynamic Complexity of Formal Languages}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {481--492},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1829},
URN = {urn:nbn:de:0030-drops-18297},
doi = {10.4230/LIPIcs.STACS.2009.1829},
annote = {Keywords: Dynamic complexity, Regular languages, Context-free languages, DynFO}
}
@InProceedings{goldberg_et_al:LIPIcs.STACS.2009.1821,
author = {Goldberg, Leslie Ann and Grohe, Martin and Jerrum, Mark and Thurley, Marc},
title = {{A Complexity Dichotomy for Partition Functions with Mixed Signs}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {493--504},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1821},
URN = {urn:nbn:de:0030-drops-18217},
doi = {10.4230/LIPIcs.STACS.2009.1821},
annote = {Keywords: Computational complexity}
}
@InProceedings{gronemeier:LIPIcs.STACS.2009.1846,
author = {Gronemeier, Andre},
title = {{Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {505--516},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1846},
URN = {urn:nbn:de:0030-drops-18465},
doi = {10.4230/LIPIcs.STACS.2009.1846},
annote = {Keywords: Computational complexity, Communication complexity}
}
@InProceedings{grossi_et_al:LIPIcs.STACS.2009.1847,
author = {Grossi, Roberto and Orlandi, Alessio and Raman, Rajeev and Rao, S. Srinivasa},
title = {{More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {517--528},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1847},
URN = {urn:nbn:de:0030-drops-18470},
doi = {10.4230/LIPIcs.STACS.2009.1847},
annote = {Keywords: }
}
@InProceedings{hermelin_et_al:LIPIcs.STACS.2009.1804,
author = {Hermelin, Danny and Landau, Gad M. and Landau, Shir and Weimann, Oren},
title = {{A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {529--540},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1804},
URN = {urn:nbn:de:0030-drops-18040},
doi = {10.4230/LIPIcs.STACS.2009.1804},
annote = {Keywords: Edit distance, Straight-line Programs, Dynamic programming acceleration via compression, Combinatorial pattern matching}
}
@InProceedings{horn:LIPIcs.STACS.2009.1848,
author = {Horn, Florian},
title = {{Random Fruits on the Zielonka Tree}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {541--552},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1848},
URN = {urn:nbn:de:0030-drops-18489},
doi = {10.4230/LIPIcs.STACS.2009.1848},
annote = {Keywords: Model checking, Controller synthesis, Stochastic games, Randomisation}
}
@InProceedings{hromkovic_et_al:LIPIcs.STACS.2009.1805,
author = {Hromkovic, Juraj and Schnitger, Georg},
title = {{Ambiguity and Communication}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {553--564},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1805},
URN = {urn:nbn:de:0030-drops-18054},
doi = {10.4230/LIPIcs.STACS.2009.1805},
annote = {Keywords: Nondeterministic finite automata, Ambiguity, Communication complexity}
}
@InProceedings{hummel_et_al:LIPIcs.STACS.2009.1849,
author = {Hummel, Szczepan and Michalewski, Henryk and Niwinski, Damian},
title = {{On the Borel Inseparability of Game Tree Languages}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {565--576},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1849},
URN = {urn:nbn:de:0030-drops-18493},
doi = {10.4230/LIPIcs.STACS.2009.1849},
annote = {Keywords: Tree automata, Separation property, Borel sets, Parity games}
}
@InProceedings{jez_et_al:LIPIcs.STACS.2009.1806,
author = {Jez, Artur and Okhotin, Alexander},
title = {{Equations over Sets of Natural Numbers with Addition Only}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {577--588},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1806},
URN = {urn:nbn:de:0030-drops-18061},
doi = {10.4230/LIPIcs.STACS.2009.1806},
annote = {Keywords: }
}
@InProceedings{kirsten_et_al:LIPIcs.STACS.2009.1850,
author = {Kirsten, Daniel and Lombardy, Sylvain},
title = {{Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {589--600},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1850},
URN = {urn:nbn:de:0030-drops-18509},
doi = {10.4230/LIPIcs.STACS.2009.1850},
annote = {Keywords: Min-plus automata, Determinization, Finite semigroups}
}
@InProceedings{kratsch:LIPIcs.STACS.2009.1851,
author = {Kratsch, Stefan},
title = {{Polynomial Kernelizations for MIN F^+Pi\underline1 and MAX NP}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {601--612},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1851},
URN = {urn:nbn:de:0030-drops-18511},
doi = {10.4230/LIPIcs.STACS.2009.1851},
annote = {Keywords: Parameterized complexity, Kernelization, Approximation algorithms}
}
@InProceedings{kuhn:LIPIcs.STACS.2009.1852,
author = {Kuhn, Fabian},
title = {{Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {613--624},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1852},
URN = {urn:nbn:de:0030-drops-18525},
doi = {10.4230/LIPIcs.STACS.2009.1852},
annote = {Keywords: Distributed algorithms, Graph coloring, Local algorithms, Medium access control, Multicoloring, TDMA, Wireless networks}
}
@InProceedings{legall:LIPIcs.STACS.2009.1830,
author = {Le Gall, Francois},
title = {{Efficient Isomorphism Testing for a Class of Group Extensions}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {625--636},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1830},
URN = {urn:nbn:de:0030-drops-18303},
doi = {10.4230/LIPIcs.STACS.2009.1830},
annote = {Keywords: Polynomial-time algorithms, Group isomorphism, Black-box groups}
}
@InProceedings{manthey:LIPIcs.STACS.2009.1853,
author = {Manthey, Bodo},
title = {{On Approximating Multi-Criteria TSP}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {637--648},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1853},
URN = {urn:nbn:de:0030-drops-18537},
doi = {10.4230/LIPIcs.STACS.2009.1853},
annote = {Keywords: Approximation algorithms, Traveling salesman, Multi-criteria optimization}
}
@InProceedings{marx:LIPIcs.STACS.2009.1807,
author = {Marx, Daniel},
title = {{Tractable Structures for Constraint Satisfaction with Truth Tables}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {649--660},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1807},
URN = {urn:nbn:de:0030-drops-18079},
doi = {10.4230/LIPIcs.STACS.2009.1807},
annote = {Keywords: Computational complexity, Constraint satisfaction, Treewidth, Adaptive width}
}
@InProceedings{schewe:LIPIcs.STACS.2009.1854,
author = {Schewe, Sven},
title = {{B\"{u}chi Complementation Made Tight}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {661--672},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1854},
URN = {urn:nbn:de:0030-drops-18543},
doi = {10.4230/LIPIcs.STACS.2009.1854},
annote = {Keywords: Automata and formal languages, Buchi complementation, Automata theory, Nondeterministic Buchi automata}
}
@InProceedings{schroder_et_al:LIPIcs.STACS.2009.1855,
author = {Schr\"{o}der, Lutz and Pattinson, Dirk},
title = {{Strong Completeness of Coalgebraic Modal Logics}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {673--684},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1855},
URN = {urn:nbn:de:0030-drops-18559},
doi = {10.4230/LIPIcs.STACS.2009.1855},
annote = {Keywords: Logic in computer science, Semantics, Deduction, Modal logic, Coalgebra}
}
@InProceedings{ueno:LIPIcs.STACS.2009.1808,
author = {Ueno, Kenya},
title = {{A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {685--696},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1808},
URN = {urn:nbn:de:0030-drops-18080},
doi = {10.4230/LIPIcs.STACS.2009.1808},
annote = {Keywords: Computational and structural complexity}
}
@InProceedings{zimand:LIPIcs.STACS.2009.1812,
author = {Zimand, Marius},
title = {{Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {697--708},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Albers, Susanne and Marion, Jean-Yves},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1812},
URN = {urn:nbn:de:0030-drops-18128},
doi = {10.4230/LIPIcs.STACS.2009.1812},
annote = {Keywords: Algorithmic information theory, Computational complexity, Kolmogorov complexity, Randomness extractors}
}
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