Natacha Portier and Thomas Wilke. LIPIcs, Volume 20, STACS'13, Complete Volume. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@Proceedings{portier_et_al:LIPIcs.STACS.2013, title = {{LIPIcs, Volume 20, STACS'13, Complete Volume}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013}, URN = {urn:nbn:de:0030-drops-41144}, doi = {10.4230/LIPIcs.STACS.2013}, annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory} }
Natacha Portier and Thomas Wilke. Frontmatter, Table of Contents, Preface, Workshop Organization. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. i-xvii, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{portier_et_al:LIPIcs.STACS.2013.i, author = {Portier, Natacha and Wilke, Thomas}, title = {{Frontmatter, Table of Contents, Preface, Workshop Organization}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {i--xvii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.i}, URN = {urn:nbn:de:0030-drops-39135}, doi = {10.4230/LIPIcs.STACS.2013.i}, annote = {Keywords: Frontmatter, Table of Contents, Preface, Workshop Organization} }
Kousha Etessami. The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited Talk). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 1-2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{etessami:LIPIcs.STACS.2013.1, author = {Etessami, Kousha}, title = {{The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {1--2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.1}, URN = {urn:nbn:de:0030-drops-39143}, doi = {10.4230/LIPIcs.STACS.2013.1}, annote = {Keywords: recursive Markov chains, Markov decision processes, stochastic games, monotone systems of nonlinear equations, least fixed points, Newton's method, co} }
Nicolas Bousquet, Aurélie Lagoutte, and Thomassé Stéphan. Graph coloring, communication complexity and the stubborn problem (Invited Talk). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 3-4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{bousquet_et_al:LIPIcs.STACS.2013.3, author = {Bousquet, Nicolas and Lagoutte, Aur\'{e}lie and St\'{e}phan, Thomass\'{e}}, title = {{Graph coloring, communication complexity and the stubborn problem}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {3--4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.3}, URN = {urn:nbn:de:0030-drops-39158}, doi = {10.4230/LIPIcs.STACS.2013.3}, annote = {Keywords: stubborn problem, graph coloring, Clique-Stable set separation, Alon-Saks-Seymour conjecture, bipartite packing} }
Kurt Mehlhorn. Physarum Computations (Invited Talk). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 5-6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{mehlhorn:LIPIcs.STACS.2013.5, author = {Mehlhorn, Kurt}, title = {{Physarum Computations}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {5--6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.5}, URN = {urn:nbn:de:0030-drops-39166}, doi = {10.4230/LIPIcs.STACS.2013.5}, annote = {Keywords: Biological computation, shortest path problems} }
Dániel Marx. Algorithmic Graph Structure Theory (Tutorial). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, p. 7, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{marx:LIPIcs.STACS.2013.7, author = {Marx, D\'{a}niel}, title = {{Algorithmic Graph Structure Theory}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {7--7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.7}, URN = {urn:nbn:de:0030-drops-39175}, doi = {10.4230/LIPIcs.STACS.2013.7}, annote = {Keywords: Graph theory, graph minors, structure theorems} }
Fedor V. Fomin and Yngve Villanger. Searching for better fill-in. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 8-19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{fomin_et_al:LIPIcs.STACS.2013.8, author = {Fomin, Fedor V. and Villanger, Yngve}, title = {{Searching for better fill-in}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {8--19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.8}, URN = {urn:nbn:de:0030-drops-39187}, doi = {10.4230/LIPIcs.STACS.2013.8}, annote = {Keywords: Local Search, Parameterized Complexity, Fill-in, Triangulation, Chordal graph} }
Andreas Björklund, Petteri Kaski, and Lukasz Kowalik. Probably Optimal Graph Motifs. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 20-31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{bjorklund_et_al:LIPIcs.STACS.2013.20, author = {Bj\"{o}rklund, Andreas and Kaski, Petteri and Kowalik, Lukasz}, title = {{Probably Optimal Graph Motifs}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {20--31}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.20}, URN = {urn:nbn:de:0030-drops-39196}, doi = {10.4230/LIPIcs.STACS.2013.20}, annote = {Keywords: graph motif, FPT algorithm} }
Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, and Yngve Villanger. Tight bounds for Parameterized Complexity of Cluster Editing. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 32-43, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{fomin_et_al:LIPIcs.STACS.2013.32, author = {Fomin, Fedor V. and Kratsch, Stefan and Pilipczuk, Marcin and Pilipczuk, Michal and Villanger, Yngve}, title = {{Tight bounds for Parameterized Complexity of Cluster Editing}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {32--43}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.32}, URN = {urn:nbn:de:0030-drops-39209}, doi = {10.4230/LIPIcs.STACS.2013.32}, annote = {Keywords: parameterized complexity, cluster editing, correlation clustering, subexponential algorithms, tight bounds} }
Albert Atserias and Sergi Oliva. Bounded-width QBF is PSPACE-complete. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 44-54, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{atserias_et_al:LIPIcs.STACS.2013.44, author = {Atserias, Albert and Oliva, Sergi}, title = {{Bounded-width QBF is PSPACE-complete}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {44--54}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.44}, URN = {urn:nbn:de:0030-drops-39217}, doi = {10.4230/LIPIcs.STACS.2013.44}, annote = {Keywords: Tree-width, QBF, PSPACE-complete} }
Daniel Paulusma, Friedrich Slivovsky, and Stefan Szeider. Model Counting for CNF Formulas of Bounded Modular Treewidth. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 55-66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{paulusma_et_al:LIPIcs.STACS.2013.55, author = {Paulusma, Daniel and Slivovsky, Friedrich and Szeider, Stefan}, title = {{Model Counting for CNF Formulas of Bounded Modular Treewidth}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {55--66}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.55}, URN = {urn:nbn:de:0030-drops-39226}, doi = {10.4230/LIPIcs.STACS.2013.55}, annote = {Keywords: Satisfiability, Model Counting, Parameterized Complexity} }
Serge Gaspers, Sebastian Ordyniak, M. S. Ramanujan, Saket Saurabh, and Stefan Szeider. Backdoors to q-Horn. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 67-79, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{gaspers_et_al:LIPIcs.STACS.2013.67, author = {Gaspers, Serge and Ordyniak, Sebastian and Ramanujan, M. S. and Saurabh, Saket and Szeider, Stefan}, title = {{Backdoors to q-Horn}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {67--79}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.67}, URN = {urn:nbn:de:0030-drops-39236}, doi = {10.4230/LIPIcs.STACS.2013.67}, annote = {Keywords: Algorithms and data structures, Backdoor sets, Satisfiability, Fixed Parameter Tractability} }
Stefan Kratsch. On Polynomial Kernels for Sparse Integer Linear Programs. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 80-91, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{kratsch:LIPIcs.STACS.2013.80, author = {Kratsch, Stefan}, title = {{On Polynomial Kernels for Sparse Integer Linear Programs}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {80--91}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.80}, URN = {urn:nbn:de:0030-drops-39241}, doi = {10.4230/LIPIcs.STACS.2013.80}, annote = {Keywords: integer linear programs, kernelization, parameterized complexity} }
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Dimitrios M. Thilikos. Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 92-103, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{fomin_et_al:LIPIcs.STACS.2013.92, author = {Fomin, Fedor V. and Lokshtanov, Daniel and Saurabh, Saket and Thilikos, Dimitrios M.}, title = {{Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {92--103}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.92}, URN = {urn:nbn:de:0030-drops-39255}, doi = {10.4230/LIPIcs.STACS.2013.92}, annote = {Keywords: Parameterized complexity, kernelization, algorithmic graph minors, dominating set, connected dominating set} }
Martijn Baartse and Klaus Meer. The PCP theorem for NP over the reals. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 104-115, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{baartse_et_al:LIPIcs.STACS.2013.104, author = {Baartse, Martijn and Meer, Klaus}, title = {{The PCP theorem for NP over the reals}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {104--115}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.104}, URN = {urn:nbn:de:0030-drops-39262}, doi = {10.4230/LIPIcs.STACS.2013.104}, annote = {Keywords: PCP, real number computation, systems of polynomials} }
Adam Case and Jack H. Lutz. Mutual Dimension. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 116-126, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{case_et_al:LIPIcs.STACS.2013.116, author = {Case, Adam and Lutz, Jack H.}, title = {{Mutual Dimension}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {116--126}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.116}, URN = {urn:nbn:de:0030-drops-39270}, doi = {10.4230/LIPIcs.STACS.2013.116}, annote = {Keywords: computable analysis, data processing inequality, effective fractal dimensions, Kolmogorov complexity, mutual information} }
Yoichi Iwata and Yuichi Yoshida. Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 127-138, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{iwata_et_al:LIPIcs.STACS.2013.127, author = {Iwata, Yoichi and Yoshida, Yuichi}, title = {{Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {127--138}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.127}, URN = {urn:nbn:de:0030-drops-39282}, doi = {10.4230/LIPIcs.STACS.2013.127}, annote = {Keywords: Constraint Satisfaction Problems, Point Algebra, Exact Algorithms, Approximation Algorithms} }
Konstantin Makarychev. Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 139-147, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{makarychev:LIPIcs.STACS.2013.139, author = {Makarychev, Konstantin}, title = {{Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {139--147}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.139}, URN = {urn:nbn:de:0030-drops-39290}, doi = {10.4230/LIPIcs.STACS.2013.139}, annote = {Keywords: approximation algorithms, approximation resistance, ordering CSPs} }
Xi Chen, Martin Dyer, Leslie Ann Goldberg, Mark Jerrum, Pinyan Lu, Colin McQuillan, and David Richerby. The complexity of approximating conservative counting CSPs. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 148-159, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{chen_et_al:LIPIcs.STACS.2013.148, author = {Chen, Xi and Dyer, Martin and Goldberg, Leslie Ann and Jerrum, Mark and Lu, Pinyan and McQuillan, Colin and Richerby, David}, title = {{The complexity of approximating conservative counting CSPs}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {148--159}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.148}, URN = {urn:nbn:de:0030-drops-39303}, doi = {10.4230/LIPIcs.STACS.2013.148}, annote = {Keywords: counting constraint satisfaction problem, approximation, complexity} }
Yuval Ishai, Eyal Kushilevitz, and Omer Strulovich. Lossy Chains and Fractional Secret Sharing. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 160-171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{ishai_et_al:LIPIcs.STACS.2013.160, author = {Ishai, Yuval and Kushilevitz, Eyal and Strulovich, Omer}, title = {{Lossy Chains and Fractional Secret Sharing}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {160--171}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.160}, URN = {urn:nbn:de:0030-drops-39319}, doi = {10.4230/LIPIcs.STACS.2013.160}, annote = {Keywords: Cryptography, secret sharing, Markov chains} }
Sarah Cannon, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Matthew J. Patitz, Robert T. Schweller, Scott M Summers, and Andrew Winslow. Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 172-184, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{cannon_et_al:LIPIcs.STACS.2013.172, author = {Cannon, Sarah and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Patitz, Matthew J. and Schweller, Robert T. and Summers, Scott M and Winslow, Andrew}, title = {{Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {172--184}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.172}, URN = {urn:nbn:de:0030-drops-39321}, doi = {10.4230/LIPIcs.STACS.2013.172}, annote = {Keywords: abstract tile assembly model, hierarchical tile assembly model, two-handed tile assembly model, algorithmic self-assembly, DNA computing, biocomputing} }
Malte Darnstädt, Hans Ulrich Simon, and Balázs Szörényi. Unlabeled Data Does Provably Help. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 185-196, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{darnstadt_et_al:LIPIcs.STACS.2013.185, author = {Darnst\"{a}dt, Malte and Simon, Hans Ulrich and Sz\"{o}r\'{e}nyi, Bal\'{a}zs}, title = {{Unlabeled Data Does Provably Help}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {185--196}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.185}, URN = {urn:nbn:de:0030-drops-39337}, doi = {10.4230/LIPIcs.STACS.2013.185}, annote = {Keywords: algorithmic learning, sample complexity, semi-supervised learning} }
Michal Pilipczuk. Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 197-208, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{pilipczuk:LIPIcs.STACS.2013.197, author = {Pilipczuk, Michal}, title = {{Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {197--208}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.197}, URN = {urn:nbn:de:0030-drops-39340}, doi = {10.4230/LIPIcs.STACS.2013.197}, annote = {Keywords: semi-complete digraph, tournament, pathwidth, cutwidth} }
Marek Cygan, Fabrizio Grandoni, and Telikepalli Kavitha. On Pairwise Spanners. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 209-220, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{cygan_et_al:LIPIcs.STACS.2013.209, author = {Cygan, Marek and Grandoni, Fabrizio and Kavitha, Telikepalli}, title = {{On Pairwise Spanners}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {209--220}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.209}, URN = {urn:nbn:de:0030-drops-39353}, doi = {10.4230/LIPIcs.STACS.2013.209}, annote = {Keywords: Undirected graphs, shortest paths, additive spanners, distance preservers} }
Jisu Jeong, O-joung Kwon, and Sang-il Oum. Excluded vertex-minors for graphs of linear rank-width at most k.. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 221-232, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{jeong_et_al:LIPIcs.STACS.2013.221, author = {Jeong, Jisu and Kwon, O-joung and Oum, Sang-il}, title = {{Excluded vertex-minors for graphs of linear rank-width at most k.}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {221--232}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.221}, URN = {urn:nbn:de:0030-drops-39369}, doi = {10.4230/LIPIcs.STACS.2013.221}, annote = {Keywords: rank-width, linear rank-width, vertex-minor, well-quasi-ordering} }
Artur Jez. Recompression: a simple and powerful technique for word equations. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 233-244, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{jez:LIPIcs.STACS.2013.233, author = {Jez, Artur}, title = {{Recompression: a simple and powerful technique for word equations}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {233--244}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.233}, URN = {urn:nbn:de:0030-drops-39376}, doi = {10.4230/LIPIcs.STACS.2013.233}, annote = {Keywords: Word equations, exponent of periodicity, string unification} }
Tomasz Kociumaka, Jakub Radoszewski, and Wojciech Rytter. Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 245-256, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{kociumaka_et_al:LIPIcs.STACS.2013.245, author = {Kociumaka, Tomasz and Radoszewski, Jakub and Rytter, Wojciech}, title = {{Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {245--256}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.245}, URN = {urn:nbn:de:0030-drops-39387}, doi = {10.4230/LIPIcs.STACS.2013.245}, annote = {Keywords: Abelian period, greatest common divisor} }
Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka, and Catalin Tiseanu. Finding Pseudo-repetitions. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 257-268, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{gawrychowski_et_al:LIPIcs.STACS.2013.257, author = {Gawrychowski, Pawel and Manea, Florin and Mercas, Robert and Nowotka, Dirk and Tiseanu, Catalin}, title = {{Finding Pseudo-repetitions}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {257--268}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.257}, URN = {urn:nbn:de:0030-drops-39394}, doi = {10.4230/LIPIcs.STACS.2013.257}, annote = {Keywords: Stringology, Pattern matching, Repetition, Pseudo-repetition} }
Zachary Abel, Erik D. Demaine, Martin L. Demaine, Sarah Eisenstat, Anna Lubiw, André Schulz, Diane L. Souvaine, Giovanni Viglietta, and Andrew Winslow. Algorithms for Designing Pop-Up Cards. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 269-280, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{abel_et_al:LIPIcs.STACS.2013.269, author = {Abel, Zachary and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Lubiw, Anna and Schulz, Andr\'{e} and Souvaine, Diane L. and Viglietta, Giovanni and Winslow, Andrew}, title = {{Algorithms for Designing Pop-Up Cards}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {269--280}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.269}, URN = {urn:nbn:de:0030-drops-39407}, doi = {10.4230/LIPIcs.STACS.2013.269}, annote = {Keywords: geometric folding, linkages, universality} }
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, and Kunihiko Sadakane. Space-Time Trade-offs for Stack-Based Algorithms. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 281-292, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{barba_et_al:LIPIcs.STACS.2013.281, author = {Barba, Luis and Korman, Matias and Langerman, Stefan and Silveira, Rodrigo I. and Sadakane, Kunihiko}, title = {{Space-Time Trade-offs for Stack-Based Algorithms}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {281--292}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.281}, URN = {urn:nbn:de:0030-drops-39411}, doi = {10.4230/LIPIcs.STACS.2013.281}, annote = {Keywords: space-time trade-off, constant workspace, stack algorithms} }
Danny Z. Chen and Haitao Wang. L_1 Shortest Path Queries among Polygonal Obstacles in the Plane. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 293-304, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{chen_et_al:LIPIcs.STACS.2013.293, author = {Chen, Danny Z. and Wang, Haitao}, title = {{L\underline1 Shortest Path Queries among Polygonal Obstacles in the Plane}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {293--304}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.293}, URN = {urn:nbn:de:0030-drops-39425}, doi = {10.4230/LIPIcs.STACS.2013.293}, annote = {Keywords: computational geometry, shortest path queries, shortest paths among obstacles, \$L\underline1\$/\$L\underlineinfty\$/rectilinear metric, shortest path maps, geodesic Vorono} }
Manfred Kufleitner and Alexander Lauser. Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 305-316, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{kufleitner_et_al:LIPIcs.STACS.2013.305, author = {Kufleitner, Manfred and Lauser, Alexander}, title = {{Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {305--316}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.305}, URN = {urn:nbn:de:0030-drops-39438}, doi = {10.4230/LIPIcs.STACS.2013.305}, annote = {Keywords: automata theory, semigroups, regular languages, first-order logic} }
Wieslaw Szwast and Lidia Tendera. FO^2 with one transitive relation is decidable. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 317-328, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{szwast_et_al:LIPIcs.STACS.2013.317, author = {Szwast, Wieslaw and Tendera, Lidia}, title = {{FO^2 with one transitive relation is decidable}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {317--328}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.317}, URN = {urn:nbn:de:0030-drops-39449}, doi = {10.4230/LIPIcs.STACS.2013.317}, annote = {Keywords: classical decision problem, two-variable first-order logic, decidability, computational complexity} }
Luc Dartois and Charles Paperman. Two-variable first order logic with modular predicates over words. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 329-340, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{dartois_et_al:LIPIcs.STACS.2013.329, author = {Dartois, Luc and Paperman, Charles}, title = {{Two-variable first order logic with modular predicates over words}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {329--340}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.329}, URN = {urn:nbn:de:0030-drops-39450}, doi = {10.4230/LIPIcs.STACS.2013.329}, annote = {Keywords: First order logic, automata theory, semigroup, modular predicates} }
Magnus Wahlström. Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 341-352, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{wahlstrom:LIPIcs.STACS.2013.341, author = {Wahlstr\"{o}m, Magnus}, title = {{Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {341--352}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.341}, URN = {urn:nbn:de:0030-drops-39465}, doi = {10.4230/LIPIcs.STACS.2013.341}, annote = {Keywords: Parameterized complexity, graph theory, kernelization, algebraic algorithms} }
Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, and Erik Jan van Leeuwen. Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 353-364, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{pilipczuk_et_al:LIPIcs.STACS.2013.353, author = {Pilipczuk, Marcin and Pilipczuk, Michal and Sankowski, Piotr and van Leeuwen, Erik Jan}, title = {{Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {353--364}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.353}, URN = {urn:nbn:de:0030-drops-39471}, doi = {10.4230/LIPIcs.STACS.2013.353}, annote = {Keywords: planar graph, Steiner tree, subexponential-time algorithms} }
Florent Capelli, Arnaud Durand, and Stefan Mengel. The arithmetic complexity of tensor contractions. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 365-376, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{capelli_et_al:LIPIcs.STACS.2013.365, author = {Capelli, Florent and Durand, Arnaud and Mengel, Stefan}, title = {{The arithmetic complexity of tensor contractions}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {365--376}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.365}, URN = {urn:nbn:de:0030-drops-39481}, doi = {10.4230/LIPIcs.STACS.2013.365}, annote = {Keywords: algebraic complexity, arithmetic circuits, tensor calculus} }
Edith Hemaspaandra, Lane A. Hemaspaandra, and Curtis Menton. Search versus Decision for Election Manipulation Problems. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 377-388, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{hemaspaandra_et_al:LIPIcs.STACS.2013.377, author = {Hemaspaandra, Edith and Hemaspaandra, Lane A. and Menton, Curtis}, title = {{Search versus Decision for Election Manipulation Problems}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {377--388}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.377}, URN = {urn:nbn:de:0030-drops-39498}, doi = {10.4230/LIPIcs.STACS.2013.377}, annote = {Keywords: Search vs. decision, application of structural complexity theory} }
Leah Epstein, Asaf Levin, Danny Segev, and Oren Weimann. Improved Bounds for Online Preemptive Matching. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 389-399, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{epstein_et_al:LIPIcs.STACS.2013.389, author = {Epstein, Leah and Levin, Asaf and Segev, Danny and Weimann, Oren}, title = {{Improved Bounds for Online Preemptive Matching}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {389--399}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.389}, URN = {urn:nbn:de:0030-drops-39501}, doi = {10.4230/LIPIcs.STACS.2013.389}, annote = {Keywords: Online algorithms, matching, lower bound} }
Markus Jalsenius, Benny Porat, and Benjamin Sach. Parameterized Matching in the Streaming Model. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 400-411, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{jalsenius_et_al:LIPIcs.STACS.2013.400, author = {Jalsenius, Markus and Porat, Benny and Sach, Benjamin}, title = {{Parameterized Matching in the Streaming Model}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {400--411}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.400}, URN = {urn:nbn:de:0030-drops-39513}, doi = {10.4230/LIPIcs.STACS.2013.400}, annote = {Keywords: Pattern matching, streaming algorithms, randomized algorithms} }
Meghana Nasre. Popular Matchings: Structure and Cheating Strategies. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 412-423, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{nasre:LIPIcs.STACS.2013.412, author = {Nasre, Meghana}, title = {{Popular Matchings: Structure and Cheating Strategies}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {412--423}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.412}, URN = {urn:nbn:de:0030-drops-39520}, doi = {10.4230/LIPIcs.STACS.2013.412}, annote = {Keywords: bipartite matchings, preferences, cheating strategies} }
Hartmut Klauck and Ronald de Wolf. Fooling One-Sided Quantum Protocols. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 424-433, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{klauck_et_al:LIPIcs.STACS.2013.424, author = {Klauck, Hartmut and de Wolf, Ronald}, title = {{Fooling One-Sided Quantum Protocols}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {424--433}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.424}, URN = {urn:nbn:de:0030-drops-39539}, doi = {10.4230/LIPIcs.STACS.2013.424}, annote = {Keywords: Quantum computing, communication complexity, fooling set, lower bound} }
Loïck Magnin and Jérémie Roland. Explicit relation between all lower bound techniques for quantum query complexity. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 434-445, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{magnin_et_al:LIPIcs.STACS.2013.434, author = {Magnin, Lo\"{i}ck and Roland, J\'{e}r\'{e}mie}, title = {{Explicit relation between all lower bound techniques for quantum query complexity}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {434--445}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.434}, URN = {urn:nbn:de:0030-drops-39548}, doi = {10.4230/LIPIcs.STACS.2013.434}, annote = {Keywords: Quantum computation, lower bound, adversary method, polynomial method} }
Andris Ambainis, Arturs Backurs, Juris Smotrovs, and Ronald de Wolf. Optimal quantum query bounds for almost all Boolean functions. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 446-453, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{ambainis_et_al:LIPIcs.STACS.2013.446, author = {Ambainis, Andris and Backurs, Arturs and Smotrovs, Juris and de Wolf, Ronald}, title = {{Optimal quantum query bounds for almost all Boolean functions}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {446--453}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.446}, URN = {urn:nbn:de:0030-drops-39557}, doi = {10.4230/LIPIcs.STACS.2013.446}, annote = {Keywords: Quantum computing, query complexity, lower bounds, polynomial method} }
Nathanael Francois and Frédéric Magniez. Streaming Complexity of Checking Priority Queues. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 454-465, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{francois_et_al:LIPIcs.STACS.2013.454, author = {Francois, Nathanael and Magniez, Fr\'{e}d\'{e}ric}, title = {{Streaming Complexity of Checking Priority Queues}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {454--465}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.454}, URN = {urn:nbn:de:0030-drops-39561}, doi = {10.4230/LIPIcs.STACS.2013.454}, annote = {Keywords: Streaming Algorithms, Communication Complexity, Priority Queue} }
Konstantin Kutzkov. Deterministic algorithms for skewed matrix products. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 466-477, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{kutzkov:LIPIcs.STACS.2013.466, author = {Kutzkov, Konstantin}, title = {{Deterministic algorithms for skewed matrix products}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {466--477}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.466}, URN = {urn:nbn:de:0030-drops-39577}, doi = {10.4230/LIPIcs.STACS.2013.466}, annote = {Keywords: approximate deterministic memory-efficient matrix multiplication} }
Tengyu Ma, Bo Tang, and Yajun Wang. The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 478-489, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{ma_et_al:LIPIcs.STACS.2013.478, author = {Ma, Tengyu and Tang, Bo and Wang, Yajun}, title = {{The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {478--489}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.478}, URN = {urn:nbn:de:0030-drops-39586}, doi = {10.4230/LIPIcs.STACS.2013.478}, annote = {Keywords: secretary problem, submodular function, matroid, online algorithm} }
Emmanuel Jeandel and Pascal Vanier. Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 490-501, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{jeandel_et_al:LIPIcs.STACS.2013.490, author = {Jeandel, Emmanuel and Vanier, Pascal}, title = {{Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {490--501}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.490}, URN = {urn:nbn:de:0030-drops-39592}, doi = {10.4230/LIPIcs.STACS.2013.490}, annote = {Keywords: Subshifts, Computability, Factorization, Embedding, Conjugacy} }
Ines Klimann. The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 502-513, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{klimann:LIPIcs.STACS.2013.502, author = {Klimann, Ines}, title = {{The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {502--513}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.502}, URN = {urn:nbn:de:0030-drops-39605}, doi = {10.4230/LIPIcs.STACS.2013.502}, annote = {Keywords: Mealy automata, automaton semigroups, decidability of finiteness, decidability of freeness, Nerode equivalence} }
Amir M. Ben-Amram. Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (Extended Abstract). In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 514-525, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{benamram:LIPIcs.STACS.2013.514, author = {Ben-Amram, Amir M.}, title = {{Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {514--525}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.514}, URN = {urn:nbn:de:0030-drops-39615}, doi = {10.4230/LIPIcs.STACS.2013.514}, annote = {Keywords: discrete-time dynamical systems, termination, Collatz problem} }
Yonatan Bilu, Amit Daniely, Nati Linial, and Michael Saks. On the practically interesting instances of MAXCUT. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 526-537, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{bilu_et_al:LIPIcs.STACS.2013.526, author = {Bilu, Yonatan and Daniely, Amit and Linial, Nati and Saks, Michael}, title = {{On the practically interesting instances of MAXCUT}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {526--537}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.526}, URN = {urn:nbn:de:0030-drops-39625}, doi = {10.4230/LIPIcs.STACS.2013.526}, annote = {Keywords: MAXCUT, Clustering, Hardness in practice, Stability, Non worst-case analysis} }
György Dósa and Jiri Sgall. First Fit bin packing: A tight analysis. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 538-549, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{dosa_et_al:LIPIcs.STACS.2013.538, author = {D\'{o}sa, Gy\"{o}rgy and Sgall, Jiri}, title = {{First Fit bin packing: A tight analysis}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {538--549}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.538}, URN = {urn:nbn:de:0030-drops-39630}, doi = {10.4230/LIPIcs.STACS.2013.538}, annote = {Keywords: Approximation algorithms, online algorithms, bin packing, First Fit} }
Amin Karbasi and Morteza Zadimoghaddam. Constrained Binary Identification Problem. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 550-561, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{karbasi_et_al:LIPIcs.STACS.2013.550, author = {Karbasi, Amin and Zadimoghaddam, Morteza}, title = {{Constrained Binary Identification Problem}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {550--561}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.550}, URN = {urn:nbn:de:0030-drops-39647}, doi = {10.4230/LIPIcs.STACS.2013.550}, annote = {Keywords: Network Tomography, Binary Identification Problem, Approximation Algorithms, Graph Algorithms, Tree Search Strategies, Entropy} }
Mikolaj Bojanczyk, Tomasz Idziaszek, and Michal Skrzypczak. Regular languages of thin trees. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 562-573, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{bojanczyk_et_al:LIPIcs.STACS.2013.562, author = {Bojanczyk, Mikolaj and Idziaszek, Tomasz and Skrzypczak, Michal}, title = {{Regular languages of thin trees}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {562--573}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.562}, URN = {urn:nbn:de:0030-drops-39655}, doi = {10.4230/LIPIcs.STACS.2013.562}, annote = {Keywords: infinite trees, regular languages, effective characterizations, topological complexity} }
Thomas Colcombet and Laure Daviaud. Approximate comparison of distance automata. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 574-585, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{colcombet_et_al:LIPIcs.STACS.2013.574, author = {Colcombet, Thomas and Daviaud, Laure}, title = {{Approximate comparison of distance automata}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {574--585}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.574}, URN = {urn:nbn:de:0030-drops-39667}, doi = {10.4230/LIPIcs.STACS.2013.574}, annote = {Keywords: Distance automata, tropical semiring, decidability, cost functions} }
Martin Huschenbett. The Rank of Tree-Automatic Linear Orderings. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 586-597, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{huschenbett:LIPIcs.STACS.2013.586, author = {Huschenbett, Martin}, title = {{The Rank of Tree-Automatic Linear Orderings}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {586--597}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.586}, URN = {urn:nbn:de:0030-drops-39672}, doi = {10.4230/LIPIcs.STACS.2013.586}, annote = {Keywords: tree-automatic structures, linear orderings, finite condensation rank, computable model theory} }
Julien Clément, Thu Hien Nguyen Thi, and Brigitte Vallée. A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 598-609, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{clement_et_al:LIPIcs.STACS.2013.598, author = {Cl\'{e}ment, Julien and Nguyen Thi, Thu Hien and Vall\'{e}e, Brigitte}, title = {{A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {598--609}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.598}, URN = {urn:nbn:de:0030-drops-39681}, doi = {10.4230/LIPIcs.STACS.2013.598}, annote = {Keywords: Probabilistic analysis of algorithms, Sorting and searching algorithms, Pattern matching, Permutations, Information theory, Rice formula, Asymptotic e} }
Mark Braverman and Gal Oshri. Search using queries on indistinguishable items. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 610-621, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{braverman_et_al:LIPIcs.STACS.2013.610, author = {Braverman, Mark and Oshri, Gal}, title = {{Search using queries on indistinguishable items}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {610--621}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.610}, URN = {urn:nbn:de:0030-drops-39696}, doi = {10.4230/LIPIcs.STACS.2013.610}, annote = {Keywords: Search, Noisy Search, Information Theory, Query Complexity} }
Balagopal Komarath and Jayalal M. N. Sarma. Pebbling, Entropy and Branching Program Size Lower Bounds. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 622-633, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{komarath_et_al:LIPIcs.STACS.2013.622, author = {Komarath, Balagopal and Sarma, Jayalal M. N.}, title = {{Pebbling, Entropy and Branching Program Size Lower Bounds}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {622--633}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.622}, URN = {urn:nbn:de:0030-drops-39709}, doi = {10.4230/LIPIcs.STACS.2013.622}, annote = {Keywords: Pebbling, Entropy Method, Branching Programs, Size Lower Bounds.} }
Thomas Watson. Advice Lower Bounds for the Dense Model Theorem. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 634-645, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{watson:LIPIcs.STACS.2013.634, author = {Watson, Thomas}, title = {{Advice Lower Bounds for the Dense Model Theorem}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {634--645}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.634}, URN = {urn:nbn:de:0030-drops-39717}, doi = {10.4230/LIPIcs.STACS.2013.634}, annote = {Keywords: Pseudorandomness, advice lower bounds, dense model theorem} }
Natacha Portier and Thomas Wilke. Author Index. In 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 20, pp. 646-647, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2013)
@InProceedings{portier_et_al:LIPIcs.STACS.2013.646, author = {Portier, Natacha and Wilke, Thomas}, title = {{Author Index}}, booktitle = {30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013)}, pages = {646--647}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-50-7}, ISSN = {1868-8969}, year = {2013}, volume = {20}, editor = {Portier, Natacha and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2013.646}, URN = {urn:nbn:de:0030-drops-39729}, doi = {10.4230/LIPIcs.STACS.2013.646}, annote = {Keywords: Author Index} }
Feedback for Dagstuhl Publishing