Susanne Albers and Pascal Weil. LIPIcs, Volume 1, STACS'08, Complete Volume. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@Proceedings{albers_et_al:LIPIcs.STACS.2008, title = {{LIPIcs, Volume 1, STACS'08, Complete Volume}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2013}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008}, URN = {urn:nbn:de:0030-drops-40958}, doi = {10.4230/LIPIcs.STACS.2008}, annote = {Keywords: LIPIcs, Volume 1, STACS'08, Complete Volume} }
Susanne Albers and Pascal Weil. Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. i-xxviii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{albers_et_al:LIPIcs.STACS.2008.1378, author = {Albers, Susanne and Weil, Pascal}, title = {{Abstracts Collection -- 25th International Symposium on Theoretical Aspects of Computer Science}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {i--xxviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1378}, URN = {urn:nbn:de:0030-drops-13780}, doi = {10.4230/LIPIcs.STACS.2008.1378}, annote = {Keywords: Symposium, theoretical computer science, algorithms and data structures, automata and formal languages, computational and structural complexity, logic in computer science, applications} }
Susanne Albers and Pascal Weil. Preface -- 25th International Symposium on Theoretical Aspects of Computer Science. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 1-10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{albers_et_al:LIPIcs.STACS.2008.1326, author = {Albers, Susanne and Weil, Pascal}, title = {{Preface -- 25th International Symposium on Theoretical Aspects of Computer Science}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {1--10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1326}, URN = {urn:nbn:de:0030-drops-13263}, doi = {10.4230/LIPIcs.STACS.2008.1326}, annote = {Keywords: Symposium, theoretical computer science, algorithms and data structures, automata and formal languages, computational and structural complexity, logic in computer science, applications} }
Maxime Crochemore and Lucian Ilie. Understanding Maximal Repetitions in Strings. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 11-16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{crochemore_et_al:LIPIcs.STACS.2008.1344, author = {Crochemore, Maxime and Ilie, Lucian}, title = {{Understanding Maximal Repetitions in Strings}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {11--16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1344}, URN = {urn:nbn:de:0030-drops-13442}, doi = {10.4230/LIPIcs.STACS.2008.1344}, annote = {Keywords: Combinatorics on words, repetitions in strings, runs, maximal repetitions, maximal periodicities, sum of exponents} }
Thomas Schwentick. A Little Bit Infinite? On Adding Data to Finitely Labelled Structures (Abstract). In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 17-18, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{schwentick:LIPIcs.STACS.2008.1325, author = {Schwentick, Thomas}, title = {{A Little Bit Infinite? On Adding Data to Finitely Labelled Structures}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {17--18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1325}, URN = {urn:nbn:de:0030-drops-13253}, doi = {10.4230/LIPIcs.STACS.2008.1325}, annote = {Keywords: } }
Mihalis Yannakakis. Equilibria, Fixed Points, and Complexity Classes. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 19-38, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{yannakakis:LIPIcs.STACS.2008.1311, author = {Yannakakis, Mihalis}, title = {{Equilibria, Fixed Points, and Complexity Classes}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {19--38}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1311}, URN = {urn:nbn:de:0030-drops-13110}, doi = {10.4230/LIPIcs.STACS.2008.1311}, annote = {Keywords: Equilibria, Fixed points, Computational Complexity, Game Theory} }
Pilar Albert, Elvira Mayordomo, Philip Moser, and Sylvain Perifel. Pushdown Compression. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 39-48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{albert_et_al:LIPIcs.STACS.2008.1332, author = {Albert, Pilar and Mayordomo, Elvira and Moser, Philip and Perifel, Sylvain}, title = {{Pushdown Compression}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {39--48}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1332}, URN = {urn:nbn:de:0030-drops-13327}, doi = {10.4230/LIPIcs.STACS.2008.1332}, annote = {Keywords: Finite-state compression, Lempel-Ziv algorithm, pumping-lemma, pushdown compression, XML document} }
Andris Ambainis. Quantum search with variable times. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 49-60, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{ambainis:LIPIcs.STACS.2008.1333, author = {Ambainis, Andris}, title = {{Quantum search with variable times}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {49--60}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1333}, URN = {urn:nbn:de:0030-drops-13333}, doi = {10.4230/LIPIcs.STACS.2008.1333}, annote = {Keywords: } }
Alexis Ballier, Bruno Durand, and Emmanuel Jeandal. Structural aspects of tilings. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 61-72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{ballier_et_al:LIPIcs.STACS.2008.1334, author = {Ballier, Alexis and Durand, Bruno and Jeandal, Emmanuel}, title = {{Structural aspects of tilings}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {61--72}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1334}, URN = {urn:nbn:de:0030-drops-13343}, doi = {10.4230/LIPIcs.STACS.2008.1334}, annote = {Keywords: Tiling, domino, patterns, tiling preorder, tiling structure} }
Laurent Bienvenu, Andrej Muchnik, Alexander Shen, and Nikolay Veraschagin. Limit complexities revisited. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 73-84, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2008.1335, author = {Bienvenu, Laurent and Muchnik, Andrej and Shen, Alexander and Veraschagin, Nikolay}, title = {{Limit complexities revisited}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {73--84}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1335}, URN = {urn:nbn:de:0030-drops-13350}, doi = {10.4230/LIPIcs.STACS.2008.1335}, annote = {Keywords: Kolmogorov complexity, limit complexities, limit frequencies, 2-randomness, low basis} }
Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto. Trimmed Moebius Inversion and Graphs of Bounded Degree. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 85-96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{bjorklund_et_al:LIPIcs.STACS.2008.1336, author = {Bj\"{o}rklund, Andreas and Husfeldt, Thore and Kaski, Petteri and Koivisto, Mikko}, title = {{Trimmed Moebius Inversion and Graphs of Bounded Degree}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {85--96}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1336}, URN = {urn:nbn:de:0030-drops-13369}, doi = {10.4230/LIPIcs.STACS.2008.1336}, annote = {Keywords: } }
Markus Bläser and Christian Hoffmann. On the Complexity of the Interlace Polynomial. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 97-108, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{blaser_et_al:LIPIcs.STACS.2008.1337, author = {Bl\"{a}ser, Markus and Hoffmann, Christian}, title = {{On the Complexity of the Interlace Polynomial}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {97--108}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1337}, URN = {urn:nbn:de:0030-drops-13378}, doi = {10.4230/LIPIcs.STACS.2008.1337}, annote = {Keywords: Computational complexity, approximation, interlace polynomial, independent set polynomial, graph transformation} }
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, and Leen Stougie. Minimizing Flow Time in the Wireless Gathering Problem. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 109-120, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{bonifaci_et_al:LIPIcs.STACS.2008.1338, author = {Bonifaci, Vincenzo and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Stougie, Leen}, title = {{Minimizing Flow Time in the Wireless Gathering Problem}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {109--120}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1338}, URN = {urn:nbn:de:0030-drops-13381}, doi = {10.4230/LIPIcs.STACS.2008.1338}, annote = {Keywords: Wireless networks, data gathering, approximation algorithms, distributed algorithms} }
Patricia Bouyer, Nicolas Markey, Joël Ouaknine, Philippe Schnoebelen, and James Worrell. On Termination for Faulty Channel Machines. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 121-132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{bouyer_et_al:LIPIcs.STACS.2008.1339, author = {Bouyer, Patricia and Markey, Nicolas and Ouaknine, Jo\"{e}l and Schnoebelen, Philippe and Worrell, James}, title = {{On Termination for Faulty Channel Machines}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {121--132}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1339}, URN = {urn:nbn:de:0030-drops-13390}, doi = {10.4230/LIPIcs.STACS.2008.1339}, annote = {Keywords: Automated Verification, Computational Complexity} }
Patrick Briest, Martin Hoefer, and Piotr Krysta. Stackelberg Network Pricing Games. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 133-142, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{briest_et_al:LIPIcs.STACS.2008.1340, author = {Briest, Patrick and Hoefer, Martin and Krysta, Piotr}, title = {{Stackelberg Network Pricing Games}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {133--142}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1340}, URN = {urn:nbn:de:0030-drops-13406}, doi = {10.4230/LIPIcs.STACS.2008.1340}, annote = {Keywords: Stackelberg Games, Algorithmic Pricing, Approximation Algorithms, Inapproximability.} }
Joshua Brody and Amit Chakrabarti. Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 145-156, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{brody_et_al:LIPIcs.STACS.2008.1341, author = {Brody, Joshua and Chakrabarti, Amit}, title = {{Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {145--156}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1341}, URN = {urn:nbn:de:0030-drops-13415}, doi = {10.4230/LIPIcs.STACS.2008.1341}, annote = {Keywords: Communication complexity, pointer jumping, number on the forehead} }
Venkatesan T. Chakaravarthy and Sambuddha Roy. Finding Irrefutable Certificates for S_2^p via Arthur and Merlin. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 157-168, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{chakaravarthy_et_al:LIPIcs.STACS.2008.1342, author = {Chakaravarthy, Venkatesan T. and Roy, Sambuddha}, title = {{Finding Irrefutable Certificates for S\underline2^p via Arthur and Merlin}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {157--168}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1342}, URN = {urn:nbn:de:0030-drops-13421}, doi = {10.4230/LIPIcs.STACS.2008.1342}, annote = {Keywords: Symmetric alternation, promise-AM, Karp--Lipton theorem, learning circuits} }
Chao Chen and Daniel Freedman. Quantifying Homology Classes. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 169-180, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{chen_et_al:LIPIcs.STACS.2008.1343, author = {Chen, Chao and Freedman, Daniel}, title = {{Quantifying Homology Classes}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {169--180}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1343}, URN = {urn:nbn:de:0030-drops-13434}, doi = {10.4230/LIPIcs.STACS.2008.1343}, annote = {Keywords: Computational Topology, Computational Geometry, Homology, Persistent Homology, Localization, Optimization} }
Éric Colin de Verdiére and Alexander Schrijver. Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 181-192, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{colindeverdiere_et_al:LIPIcs.STACS.2008.1347, author = {Colin de Verdi\'{e}re, \'{E}ric and Schrijver, Alexander}, title = {{Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {181--192}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1347}, URN = {urn:nbn:de:0030-drops-13474}, doi = {10.4230/LIPIcs.STACS.2008.1347}, annote = {Keywords: Algorithm, planar graph, disjoint paths, shortest path} }
Carola Wenk and Atlas F. Cook. Geodesic Fréchet Distance Inside a Simple Polygon. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 193-204, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{wenk_et_al:LIPIcs.STACS.2008.1330, author = {Wenk, Carola and Cook, Atlas F.}, title = {{Geodesic Fr\'{e}chet Distance Inside a Simple Polygon}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {193--204}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1330}, URN = {urn:nbn:de:0030-drops-13303}, doi = {10.4230/LIPIcs.STACS.2008.1330}, annote = {Keywords: Fr\'{e}chet Distance, Geodesic, Parametric Search, Simple Polygon} }
Costas S. Iliopoulos, Maxime Crochemore, Marcin Kubica, M. Sohel Rahman, and Tomasz Walen. Improved Algorithms for the Range Next Value Problem and Applications. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 205-216, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{iliopoulos_et_al:LIPIcs.STACS.2008.1359, author = {Iliopoulos, Costas S. and Crochemore, Maxime and Kubica, Marcin and Rahman, M. Sohel and Walen, Tomasz}, title = {{Improved Algorithms for the Range Next Value Problem and Applications}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {205--216}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1359}, URN = {urn:nbn:de:0030-drops-13596}, doi = {10.4230/LIPIcs.STACS.2008.1359}, annote = {Keywords: Algorithms, Data structures} }
Mirela Damian, Robin Flatland, Joseph O'Rourke, and Suneeta Ramaswani. Connecting Polygonizations via Stretches and Twangs. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 217-228, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{damian_et_al:LIPIcs.STACS.2008.1345, author = {Damian, Mirela and Flatland, Robin and O'Rourke, Joseph and Ramaswani, Suneeta}, title = {{Connecting Polygonizations via Stretches and Twangs}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {217--228}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1345}, URN = {urn:nbn:de:0030-drops-13457}, doi = {10.4230/LIPIcs.STACS.2008.1345}, annote = {Keywords: Polygons, polygonization, random polygons, connected configuration space} }
Samir Datta, Raghav Kulkarni, and Sambuddha Roy. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 229-240, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{datta_et_al:LIPIcs.STACS.2008.1346, author = {Datta, Samir and Kulkarni, Raghav and Roy, Sambuddha}, title = {{Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {229--240}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1346}, URN = {urn:nbn:de:0030-drops-13465}, doi = {10.4230/LIPIcs.STACS.2008.1346}, annote = {Keywords: } }
Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, and Philipp Woelfel. Tight Bounds for Blind Search on the Integers. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 241-252, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{dietzfelbinger_et_al:LIPIcs.STACS.2008.1348, author = {Dietzfelbinger, Martin and Rowe, Jonathan E. and Wegener, Ingo and Woelfel, Philipp}, title = {{Tight Bounds for Blind Search on the Integers}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {241--252}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1348}, URN = {urn:nbn:de:0030-drops-13486}, doi = {10.4230/LIPIcs.STACS.2008.1348}, annote = {Keywords: } }
Jean-Francois Dufourd. Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 253-264, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{dufourd:LIPIcs.STACS.2008.1349, author = {Dufourd, Jean-Francois}, title = {{Discrete Jordan Curve Theorem: A proof formalized in Coq with hypermaps}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {253--264}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1349}, URN = {urn:nbn:de:0030-drops-13493}, doi = {10.4230/LIPIcs.STACS.2008.1349}, annote = {Keywords: Formal specifications, Computational topology, Computer-aided proofs, Coq, Planar subdivisions, Hypermaps, Jordan Curve Theorem} }
Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff. Trimming of Graphs, with Application to Point Labeling. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 265-276, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{erlebach_et_al:LIPIcs.STACS.2008.1350, author = {Erlebach, Thomas and Hagerup, Torben and Jansen, Klaus and Minzlaff, Moritz and Wolff, Alexander}, title = {{Trimming of Graphs, with Application to Point Labeling}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {265--276}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1350}, URN = {urn:nbn:de:0030-drops-13509}, doi = {10.4230/LIPIcs.STACS.2008.1350}, annote = {Keywords: Trimming weighted graphs, domino treewidth, planar graphs, point-feature label placement, map labeling, polynomial-time approximation schemes} }
Michael Hoffmann, Thomas Erlebach, Danny Krizanc, Matús Mihal'ák, and Rajeev Raman. Computing Minimum Spanning Trees with Uncertainty. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 277-288, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{hoffmann_et_al:LIPIcs.STACS.2008.1358, author = {Hoffmann, Michael and Erlebach, Thomas and Krizanc, Danny and Mihal'\'{a}k, Mat\'{u}s and Raman, Rajeev}, title = {{Computing Minimum Spanning Trees with Uncertainty}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {277--288}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1358}, URN = {urn:nbn:de:0030-drops-13581}, doi = {10.4230/LIPIcs.STACS.2008.1358}, annote = {Keywords: Algorithms and data structures; Current challenges: mobile and net computing} }
Javier Esparza, Stefan Kiefer, and Michael Luttenberger. Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 289-300, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{esparza_et_al:LIPIcs.STACS.2008.1351, author = {Esparza, Javier and Kiefer, Stefan and Luttenberger, Michael}, title = {{Convergence Thresholds of Newton's Method for Monotone Polynomial Equations}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {289--300}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1351}, URN = {urn:nbn:de:0030-drops-13516}, doi = {10.4230/LIPIcs.STACS.2008.1351}, annote = {Keywords: Newton's Method, Fixed-Point Equations, Formal Verification of Software, Probabilistic Pushdown Systems} }
Diana Fischer, Erich Grädel, and Lukasz Kaiser. Model Checking Games for the Quantitative µ-Calculus. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 301-312, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{fischer_et_al:LIPIcs.STACS.2008.1352, author = {Fischer, Diana and Gr\"{a}del, Erich and Kaiser, Lukasz}, title = {{Model Checking Games for the Quantitative µ-Calculus}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {301--312}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1352}, URN = {urn:nbn:de:0030-drops-13525}, doi = {10.4230/LIPIcs.STACS.2008.1352}, annote = {Keywords: Games, logic, model checking, quantitative logics} }
Tobias Ganzow and Sasha Rubin. Order-Invariant MSO is Stronger than Counting MSO in the Finite. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 313-324, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{ganzow_et_al:LIPIcs.STACS.2008.1353, author = {Ganzow, Tobias and Rubin, Sasha}, title = {{Order-Invariant MSO is Stronger than Counting MSO in the Finite}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {313--324}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1353}, URN = {urn:nbn:de:0030-drops-13535}, doi = {10.4230/LIPIcs.STACS.2008.1353}, annote = {Keywords: MSO, Counting MSO, order-invariance, expressiveness, Ehrenfeucht-Fraiss\'{e} game} }
Wouter Gelade and Frank Neven. Succinctness of the Complement and Intersection of Regular Expressions. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 325-336, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{gelade_et_al:LIPIcs.STACS.2008.1354, author = {Gelade, Wouter and Neven, Frank}, title = {{Succinctness of the Complement and Intersection of Regular Expressions}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {325--336}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1354}, URN = {urn:nbn:de:0030-drops-13541}, doi = {10.4230/LIPIcs.STACS.2008.1354}, annote = {Keywords: } }
Christian Glasser, Heinz Schmitz, and Victor Selivanov. Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 337-348, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{glasser_et_al:LIPIcs.STACS.2008.1355, author = {Glasser, Christian and Schmitz, Heinz and Selivanov, Victor}, title = {{Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {337--348}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1355}, URN = {urn:nbn:de:0030-drops-13554}, doi = {10.4230/LIPIcs.STACS.2008.1355}, annote = {Keywords: Automata and formal languages, computational complexity, dot-depth hierarchy, Boolean hierarchy, decidability, efficient algorithms} }
Edith Hemaspaandra and Henning Schnoor. On the Complexity of Elementary Modal Logics. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 349-360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{hemaspaandra_et_al:LIPIcs.STACS.2008.1356, author = {Hemaspaandra, Edith and Schnoor, Henning}, title = {{On the Complexity of Elementary Modal Logics}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {349--360}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1356}, URN = {urn:nbn:de:0030-drops-13561}, doi = {10.4230/LIPIcs.STACS.2008.1356}, annote = {Keywords: } }
Viet Tung Hoang and Wing-Kin Sung. Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 361-372, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{hoang_et_al:LIPIcs.STACS.2008.1357, author = {Hoang, Viet Tung and Sung, Wing-Kin}, title = {{Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {361--372}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1357}, URN = {urn:nbn:de:0030-drops-13579}, doi = {10.4230/LIPIcs.STACS.2008.1357}, annote = {Keywords: Maximum agreement supertree, maximum compatible supertree} }
Alexander Okhotin and Artur Jez. Complexity of solutions of equations over sets of natural numbers. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 373-384, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{okhotin_et_al:LIPIcs.STACS.2008.1319, author = {Okhotin, Alexander and Jez, Artur}, title = {{Complexity of solutions of equations over sets of natural numbers}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {373--384}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1319}, URN = {urn:nbn:de:0030-drops-13194}, doi = {10.4230/LIPIcs.STACS.2008.1319}, annote = {Keywords: } }
Lukasz Kaiser, Sasha Rubin, and Vince Bárány. Cardinality and counting quantifiers on omega-automatic structures. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 385-396, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kaiser_et_al:LIPIcs.STACS.2008.1360, author = {Kaiser, Lukasz and Rubin, Sasha and B\'{a}r\'{a}ny, Vince}, title = {{Cardinality and counting quantifiers on omega-automatic structures}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {385--396}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1360}, URN = {urn:nbn:de:0030-drops-13602}, doi = {10.4230/LIPIcs.STACS.2008.1360}, annote = {Keywords: \$omega\$-automatic presentations, \$omega\$-semigroups, \$omega\$-automata} }
Iyad A. Kanj, Michael J. Pelsmajer, Ge Xia, and Marcus Schaefer. On the Induced Matching Problem. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 397-408, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kanj_et_al:LIPIcs.STACS.2008.1361, author = {Kanj, Iyad A. and Pelsmajer, Michael J. and Xia, Ge and Schaefer, Marcus}, title = {{On the Induced Matching Problem}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {397--408}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1361}, URN = {urn:nbn:de:0030-drops-13618}, doi = {10.4230/LIPIcs.STACS.2008.1361}, annote = {Keywords: Induced matching, bounded genus graphs, parameterized algorithms, kernel} }
Ljubomir Perkovic and Iyad A. Kanj. On Geometric Spanners of Euclidean and Unit Disk Graphs. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 409-420, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{perkovic_et_al:LIPIcs.STACS.2008.1320, author = {Perkovic, Ljubomir and Kanj, Iyad A.}, title = {{On Geometric Spanners of Euclidean and Unit Disk Graphs}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {409--420}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1320}, URN = {urn:nbn:de:0030-drops-13200}, doi = {10.4230/LIPIcs.STACS.2008.1320}, annote = {Keywords: Geometric spanner, euclidean graph, unit disk graph, wireless ad-hoc networks} }
Jui-Yi Kao, Jeffrey Shallit, and Zhi Xu. The Frobenius Problem in a Free Monoid. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 421-432, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kao_et_al:LIPIcs.STACS.2008.1362, author = {Kao, Jui-Yi and Shallit, Jeffrey and Xu, Zhi}, title = {{The Frobenius Problem in a Free Monoid}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {421--432}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1362}, URN = {urn:nbn:de:0030-drops-13620}, doi = {10.4230/LIPIcs.STACS.2008.1362}, annote = {Keywords: Combinatorics on words, Frobenius problem, free monoid} }
Jeff Kinne and Dieter van Melkebeek. Space Hierarchy Results for Randomized Models. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 433-444, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kinne_et_al:LIPIcs.STACS.2008.1363, author = {Kinne, Jeff and van Melkebeek, Dieter}, title = {{Space Hierarchy Results for Randomized Models}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {433--444}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1363}, URN = {urn:nbn:de:0030-drops-13636}, doi = {10.4230/LIPIcs.STACS.2008.1363}, annote = {Keywords: Computations with Advice, Space Hierarchy, Randomized Machine, Promise Classes, Semantic Models} }
Felix Klaedtke. Ehrenfeucht-Fraissé Goes Automatic for Real Addition. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 445-456, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{klaedtke:LIPIcs.STACS.2008.1364, author = {Klaedtke, Felix}, title = {{Ehrenfeucht-Fraiss\'{e} Goes Automatic for Real Addition}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {445--456}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1364}, URN = {urn:nbn:de:0030-drops-13649}, doi = {10.4230/LIPIcs.STACS.2008.1364}, annote = {Keywords: Automata theory, automata-based decision procedures for logical theories, upper bounds, minimal sizes of automata, linear arithmetic over the reals, f} }
Arist Kojevnikov and Sergey I. Nikolenko. New Combinatorial Complete One-Way Functions. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 457-466, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kojevnikov_et_al:LIPIcs.STACS.2008.1365, author = {Kojevnikov, Arist and Nikolenko, Sergey I.}, title = {{New Combinatorial Complete One-Way Functions}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {457--466}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1365}, URN = {urn:nbn:de:0030-drops-13652}, doi = {10.4230/LIPIcs.STACS.2008.1365}, annote = {Keywords: } }
Dietrich Kuske. Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 467-478, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{kuske:LIPIcs.STACS.2008.1366, author = {Kuske, Dietrich}, title = {{Compatibility of Shelah and Stupp's and Muchnik's iteration with fragments of monadic second order logic}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {467--478}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1366}, URN = {urn:nbn:de:0030-drops-13668}, doi = {10.4230/LIPIcs.STACS.2008.1366}, annote = {Keywords: Logic in computer science, Rabin's tree theorem} }
Sören Lauen. Geometric Set Cover and Hitting Sets for Polytopes in R³. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 479-490, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{lauen:LIPIcs.STACS.2008.1367, author = {Lauen, S\"{o}ren}, title = {{Geometric Set Cover and Hitting Sets for Polytopes in R³}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {479--490}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1367}, URN = {urn:nbn:de:0030-drops-13675}, doi = {10.4230/LIPIcs.STACS.2008.1367}, annote = {Keywords: Computational Geometry, Epsilon-Nets, Set Cover, Hitting Sets} }
Angsheng Li and Mingji Xia. A Theory for Valiant's Matchcircuits (Extended Abstract). In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 491-502, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{li_et_al:LIPIcs.STACS.2008.1368, author = {Li, Angsheng and Xia, Mingji}, title = {{A Theory for Valiant's Matchcircuits}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {491--502}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1368}, URN = {urn:nbn:de:0030-drops-13686}, doi = {10.4230/LIPIcs.STACS.2008.1368}, annote = {Keywords: Pfaffian, Matchgate, Matchcircuit} }
Zvi Lotker, Boaz Patt-Shamir, and Dror Rawitz. Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 503-514, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{lotker_et_al:LIPIcs.STACS.2008.1331, author = {Lotker, Zvi and Patt-Shamir, Boaz and Rawitz, Dror}, title = {{Rent, Lease or Buy: Randomized Algorithms for Multislope Ski Rental}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {503--514}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1331}, URN = {urn:nbn:de:0030-drops-13313}, doi = {10.4230/LIPIcs.STACS.2008.1331}, annote = {Keywords: Competitive analysis, ski rental, randomized algorithms} }
Shachar Lovett. Lower bounds for adaptive linearity tests. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 515-526, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{lovett:LIPIcs.STACS.2008.1313, author = {Lovett, Shachar}, title = {{Lower bounds for adaptive linearity tests}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {515--526}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1313}, URN = {urn:nbn:de:0030-drops-13132}, doi = {10.4230/LIPIcs.STACS.2008.1313}, annote = {Keywords: Property testing, Linearity testing, Adaptive tests, Lower Property testing, Linearity testing, Adaptive tests, Lower} }
Julián Mestre. Lagrangian Relaxation and Partial Cover (Extended Abstract). In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 539-550, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{mestre:LIPIcs.STACS.2008.1315, author = {Mestre, Juli\'{a}n}, title = {{Lagrangian Relaxation and Partial Cover}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {539--550}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1315}, URN = {urn:nbn:de:0030-drops-13156}, doi = {10.4230/LIPIcs.STACS.2008.1315}, annote = {Keywords: Lagrangian Relaxation, Partial Cover, Primal-Dual Algorithms} }
Pinyan Lu and Changyuan Yu. An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 527-538, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{lu_et_al:LIPIcs.STACS.2008.1314, author = {Lu, Pinyan and Yu, Changyuan}, title = {{An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {527--538}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1314}, URN = {urn:nbn:de:0030-drops-13146}, doi = {10.4230/LIPIcs.STACS.2008.1314}, annote = {Keywords: Truthful mechanism, scheduling} }
Ulrich Meyer. On Dynamic Breadth-First Search in External-Memory. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 551-560, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{meyer:LIPIcs.STACS.2008.1316, author = {Meyer, Ulrich}, title = {{On Dynamic Breadth-First Search in External-Memory}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {551--560}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1316}, URN = {urn:nbn:de:0030-drops-13167}, doi = {10.4230/LIPIcs.STACS.2008.1316}, annote = {Keywords: External Memory, Dynamic Graph Algorithms, BFS, Randomization} }
Marni Mishna and Mike Zabrocki. Analytic aspects of the shuffle product. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 561-572, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{mishna_et_al:LIPIcs.STACS.2008.1317, author = {Mishna, Marni and Zabrocki, Mike}, title = {{Analytic aspects of the shuffle product}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {561--572}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1317}, URN = {urn:nbn:de:0030-drops-13178}, doi = {10.4230/LIPIcs.STACS.2008.1317}, annote = {Keywords: Generating functions, formal languages, shuffle product} }
Filip Murlak. Weak index versus Borel rank. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 573-584, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{murlak:LIPIcs.STACS.2008.1318, author = {Murlak, Filip}, title = {{Weak index versus Borel rank}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {573--584}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1318}, URN = {urn:nbn:de:0030-drops-13182}, doi = {10.4230/LIPIcs.STACS.2008.1318}, annote = {Keywords: Weak index, Borel rank, deterministic tree automata} }
Jean-Eric Pin and Pedro V. Silva. A Mahler's theorem for functions from words to integers. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 585-596, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{pin_et_al:LIPIcs.STACS.2008.1321, author = {Pin, Jean-Eric and Silva, Pedro V.}, title = {{A Mahler's theorem for functions from words to integers}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {585--596}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1321}, URN = {urn:nbn:de:0030-drops-13212}, doi = {10.4230/LIPIcs.STACS.2008.1321}, annote = {Keywords: \$p\$-adic topology, binomial coefficients, Mahler's theorem, \$p\$-group languages} }
Bill Rosgen. Distinguishing Short Quantum Computations. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 597-608, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{rosgen:LIPIcs.STACS.2008.1322, author = {Rosgen, Bill}, title = {{Distinguishing Short Quantum Computations}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {597--608}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1322}, URN = {urn:nbn:de:0030-drops-13222}, doi = {10.4230/LIPIcs.STACS.2008.1322}, annote = {Keywords: Quantum information, computational complexity, quantum circuits, quantum interactive proof systems} }
Chandan Saha. Factoring Polynomials over Finite Fields using Balance Test. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 609-620, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{saha:LIPIcs.STACS.2008.1323, author = {Saha, Chandan}, title = {{Factoring Polynomials over Finite Fields using Balance Test}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {609--620}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1323}, URN = {urn:nbn:de:0030-drops-13233}, doi = {10.4230/LIPIcs.STACS.2008.1323}, annote = {Keywords: Algebraic Algorithms, polynomial factorization, finite fields} }
Jacques Sakarovitch and Rodrigo de Souza. On the decomposition of k-valued rational relations. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 621-632, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{sakarovitch_et_al:LIPIcs.STACS.2008.1324, author = {Sakarovitch, Jacques and de Souza, Rodrigo}, title = {{On the decomposition of k-valued rational relations}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {621--632}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1324}, URN = {urn:nbn:de:0030-drops-13245}, doi = {10.4230/LIPIcs.STACS.2008.1324}, annote = {Keywords: Rational relation, \$k\$-valued transducer, unambiguous transducer, covering of automata} }
Thomas Thierauf and Fabian Wagner. The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 633-644, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{thierauf_et_al:LIPIcs.STACS.2008.1327, author = {Thierauf, Thomas and Wagner, Fabian}, title = {{The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {633--644}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1327}, URN = {urn:nbn:de:0030-drops-13273}, doi = {10.4230/LIPIcs.STACS.2008.1327}, annote = {Keywords: } }
Antti Valmari and Petri Lehtinen. Efficient Minimization of DFAs with Partial Transition. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 645-656, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{valmari_et_al:LIPIcs.STACS.2008.1328, author = {Valmari, Antti and Lehtinen, Petri}, title = {{Efficient Minimization of DFAs with Partial Transition}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {645--656}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1328}, URN = {urn:nbn:de:0030-drops-13286}, doi = {10.4230/LIPIcs.STACS.2008.1328}, annote = {Keywords: Deterministic finite automaton, sparse adjacency matrix, partition refinement} }
Johan M. M. van Rooij and Hans L. Bodlaender. Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 657-668, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{vanrooij_et_al:LIPIcs.STACS.2008.1329, author = {van Rooij, Johan M. M. and Bodlaender, Hans L.}, title = {{Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {657--668}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1329}, URN = {urn:nbn:de:0030-drops-13297}, doi = {10.4230/LIPIcs.STACS.2008.1329}, annote = {Keywords: Exact algorithms, exponential time algorithms, branch and reduce, measure and conquer, dominating set, computer aided algorithm design} }
Mariano Zelke. Weighted Matching in the Semi-Streaming Model. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 669-680, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
@InProceedings{zelke:LIPIcs.STACS.2008.1312, author = {Zelke, Mariano}, title = {{Weighted Matching in the Semi-Streaming Model}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {669--680}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Albers, Susanne and Weil, Pascal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2008.1312}, URN = {urn:nbn:de:0030-drops-13128}, doi = {10.4230/LIPIcs.STACS.2008.1312}, annote = {Keywords: Semi-streaming algorithm, matching, approximation algorithm, graph algorithm} }
Feedback for Dagstuhl Publishing