29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Proceedings{durr_et_al:LIPIcs.STACS.2012, title = {{LIPIcs, Volume 14, STACS'12, Complete Volume}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2013}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012}, URN = {urn:nbn:de:0030-drops-41081}, doi = {10.4230/LIPIcs.STACS.2012}, annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory} }
29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. i-xvi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{durr_et_al:LIPIcs.STACS.2012.i, author = {D\"{u}rr, Christoph and Wilke, Thomas}, title = {{Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {i--xvi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.i}, URN = {urn:nbn:de:0030-drops-33850}, doi = {10.4230/LIPIcs.STACS.2012.i}, annote = {Keywords: Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents} }
Thomas Colcombet. Forms of Determinism for Automata (Invited Talk). In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{colcombet:LIPIcs.STACS.2012.1, author = {Colcombet, Thomas}, title = {{Forms of Determinism for Automata}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {1--23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.1}, URN = {urn:nbn:de:0030-drops-33862}, doi = {10.4230/LIPIcs.STACS.2012.1}, annote = {Keywords: Automata, determinism, unambiguity, words, infinite trees} }
R. Ravi. Iterative Methods in Combinatorial Optimization (Invited Talk). In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, p. 24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ravi:LIPIcs.STACS.2012.24, author = {Ravi, R.}, title = {{Iterative Methods in Combinatorial Optimization}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {24--24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.24}, URN = {urn:nbn:de:0030-drops-33876}, doi = {10.4230/LIPIcs.STACS.2012.24}, annote = {Keywords: combinatorial optimization, linear programming, matroid} }
Martin Dietzfelbinger. On Randomness in Hash Functions (Invited Talk). In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 25-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{dietzfelbinger:LIPIcs.STACS.2012.25, author = {Dietzfelbinger, Martin}, title = {{On Randomness in Hash Functions}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {25--28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.25}, URN = {urn:nbn:de:0030-drops-33884}, doi = {10.4230/LIPIcs.STACS.2012.25}, annote = {Keywords: Algorithms, hash functions, randomized algorithms, data structures, graphs, hypergraphs} }
Shafi Goldwasser. Pseudo-deterministic Algorithms (Invited Talk). In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, p. 29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{goldwasser:LIPIcs.STACS.2012.29, author = {Goldwasser, Shafi}, title = {{Pseudo-deterministic Algorithms}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {29--29}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.29}, URN = {urn:nbn:de:0030-drops-34435}, doi = {10.4230/LIPIcs.STACS.2012.29}, annote = {Keywords: randomized algorithms, distributed computing, Monte Carlo, Las Vegas} }
Marcin Mucha. 13/9-approximation for Graphic TSP. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 30-41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{mucha:LIPIcs.STACS.2012.30, author = {Mucha, Marcin}, title = {{13/9-approximation for Graphic TSP}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {30--41}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.30}, URN = {urn:nbn:de:0030-drops-34025}, doi = {10.4230/LIPIcs.STACS.2012.30}, annote = {Keywords: approximation algorithms, travelling salesman problem} }
Justin Ward. A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 42-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ward:LIPIcs.STACS.2012.42, author = {Ward, Justin}, title = {{A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {42--53}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.42}, URN = {urn:nbn:de:0030-drops-34315}, doi = {10.4230/LIPIcs.STACS.2012.42}, annote = {Keywords: k-set packing, k-exchange systems, submodular maximization, local search, approximation algorithms} }
Pawel Parys. A Pumping Lemma for Pushdown Graphs of Any Level. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 54-65, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{parys:LIPIcs.STACS.2012.54, author = {Parys, Pawel}, title = {{A Pumping Lemma for Pushdown Graphs of Any Level}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {54--65}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.54}, URN = {urn:nbn:de:0030-drops-33940}, doi = {10.4230/LIPIcs.STACS.2012.54}, annote = {Keywords: pushdown graph, epsilon-contraction, pumping lemma} }
Michael Elberfeld, Andreas Jakoby, and Till Tantau. Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 66-77, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{elberfeld_et_al:LIPIcs.STACS.2012.66, author = {Elberfeld, Michael and Jakoby, Andreas and Tantau, Till}, title = {{Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {66--77}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.66}, URN = {urn:nbn:de:0030-drops-34059}, doi = {10.4230/LIPIcs.STACS.2012.66}, annote = {Keywords: algorithmic meta theorem, monadic second-order logic, circuit complexity, tree width, tree depth} }
Marc Thurley. An Approximation Algorithm for #k-SAT. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 78-87, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{thurley:LIPIcs.STACS.2012.78, author = {Thurley, Marc}, title = {{An Approximation Algorithm for #k-SAT}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {78--87}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.78}, URN = {urn:nbn:de:0030-drops-34400}, doi = {10.4230/LIPIcs.STACS.2012.78}, annote = {Keywords: #k-SAT, approximate counting, exponential algorithms} }
Frédérique Bassino, Julien David, and Andrea Sportiello. Asymptotic enumeration of Minimal Automata. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 88-99, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bassino_et_al:LIPIcs.STACS.2012.88, author = {Bassino, Fr\'{e}d\'{e}rique and David, Julien and Sportiello, Andrea}, title = {{Asymptotic enumeration of Minimal Automata}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {88--99}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.88}, URN = {urn:nbn:de:0030-drops-34328}, doi = {10.4230/LIPIcs.STACS.2012.88}, annote = {Keywords: minimal automata, regular languages, enumeration of random structures} }
Andreas Emil Feldmann and Luca Foschini. Balanced Partitions of Trees and Applications. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 100-111, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{feldmann_et_al:LIPIcs.STACS.2012.100, author = {Feldmann, Andreas Emil and Foschini, Luca}, title = {{Balanced Partitions of Trees and Applications}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {100--111}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.100}, URN = {urn:nbn:de:0030-drops-34081}, doi = {10.4230/LIPIcs.STACS.2012.100}, annote = {Keywords: balanced partitioning, bicriteria approximation, hardness of approximation, tree embeddings} }
Gerth Stølting Brodal and Casper Kejlberg-Rasmussen. Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 112-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{stltingbrodal_et_al:LIPIcs.STACS.2012.112, author = {St{\o}lting Brodal, Gerth and Kejlberg-Rasmussen, Casper}, title = {{Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {112--123}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.112}, URN = {urn:nbn:de:0030-drops-34101}, doi = {10.4230/LIPIcs.STACS.2012.112}, annote = {Keywords: working-set property, dictionary, implicit, cache-oblivious, worst-case, external memory, I/O efficient} }
Kai-Min Chung, Henry Lam, Zhenming Liu, and Michael Mitzenmacher. Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 124-135, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{chung_et_al:LIPIcs.STACS.2012.124, author = {Chung, Kai-Min and Lam, Henry and Liu, Zhenming and Mitzenmacher, Michael}, title = {{Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {124--135}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.124}, URN = {urn:nbn:de:0030-drops-34374}, doi = {10.4230/LIPIcs.STACS.2012.124}, annote = {Keywords: probabilistic analysis, tail bounds, Markov chains} }
Artur Jez. Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P). In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 136-147, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{jez:LIPIcs.STACS.2012.136, author = {Jez, Artur}, title = {{Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {136--147}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.136}, URN = {urn:nbn:de:0030-drops-34068}, doi = {10.4230/LIPIcs.STACS.2012.136}, annote = {Keywords: Compressed membership problem, SLP, Finite Automata, Algorithms for compressed data} }
Stefan Göller and Anthony Widjaja Lin. Concurrency Makes Simple Theories Hard. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 148-159, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{goller_et_al:LIPIcs.STACS.2012.148, author = {G\"{o}ller, Stefan and Widjaja Lin, Anthony}, title = {{Concurrency Makes Simple Theories Hard}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {148--159}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.148}, URN = {urn:nbn:de:0030-drops-34214}, doi = {10.4230/LIPIcs.STACS.2012.148}, annote = {Keywords: Modal Logic, Model Checking, Asynchronous Product, Pushdown Systems, Feferman-Vaught, Nonelementary lower bounds} }
Andreas Bärtschi and Subhash Suri. Conflict-free Chromatic Art Gallery Coverage. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 160-171, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bartschi_et_al:LIPIcs.STACS.2012.160, author = {B\"{a}rtschi, Andreas and Suri, Subhash}, title = {{Conflict-free Chromatic Art Gallery Coverage}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {160--171}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.160}, URN = {urn:nbn:de:0030-drops-33952}, doi = {10.4230/LIPIcs.STACS.2012.160}, annote = {Keywords: art gallery problem, conflict-free coloring, visibility} }
Wolfgang Merkle and Jason Teutsch. Constant compression and random weights. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 172-181, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{merkle_et_al:LIPIcs.STACS.2012.172, author = {Merkle, Wolfgang and Teutsch, Jason}, title = {{Constant compression and random weights}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {172--181}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.172}, URN = {urn:nbn:de:0030-drops-34351}, doi = {10.4230/LIPIcs.STACS.2012.172}, annote = {Keywords: computational complexity, Kolmogorov complexity, algorithmic randomness, Omega number} }
Marcin Kaminski and Dimitrios M. Thilikos. Contraction checking in graphs on surfaces. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 182-193, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kaminski_et_al:LIPIcs.STACS.2012.182, author = {Kaminski, Marcin and Thilikos, Dimitrios M.}, title = {{Contraction checking in graphs on surfaces}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {182--193}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.182}, URN = {urn:nbn:de:0030-drops-34032}, doi = {10.4230/LIPIcs.STACS.2012.182}, annote = {Keywords: Surfaces, Topological Minors, Contractions, Parameterized algorithms, Linkages} }
Arnaud Carayol and Cyril Nicaud. Distribution of the number of accessible states in a random deterministic automaton. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 194-205, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{carayol_et_al:LIPIcs.STACS.2012.194, author = {Carayol, Arnaud and Nicaud, Cyril}, title = {{Distribution of the number of accessible states in a random deterministic automaton}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {194--205}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.194}, URN = {urn:nbn:de:0030-drops-34422}, doi = {10.4230/LIPIcs.STACS.2012.194}, annote = {Keywords: finite automata, random sampling, average complexity} }
Ken-ichi Kawarabayashi and Yusuke Kobayashi. Edge-disjoint Odd Cycles in 4-edge-connected Graphs. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 206-217, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kawarabayashi_et_al:LIPIcs.STACS.2012.206, author = {Kawarabayashi, Ken-ichi and Kobayashi, Yusuke}, title = {{Edge-disjoint Odd Cycles in 4-edge-connected Graphs}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {206--217}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.206}, URN = {urn:nbn:de:0030-drops-34173}, doi = {10.4230/LIPIcs.STACS.2012.206}, annote = {Keywords: odd-cycles, disjoint paths problem, Erd\"{o}s-Posa property, packing algorithm, 4-edge-connectivity} }
Volker Diekert, Jürn Laun, and Alexander Ushakov. Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 218-229, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{diekert_et_al:LIPIcs.STACS.2012.218, author = {Diekert, Volker and Laun, J\"{u}rn and Ushakov, Alexander}, title = {{Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {218--229}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.218}, URN = {urn:nbn:de:0030-drops-34204}, doi = {10.4230/LIPIcs.STACS.2012.218}, annote = {Keywords: Algorithmic group theory, Data structures, Compression, Word Problem} }
Hung Q. Ngo, Ely Porat, and Atri Rudra. Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 230-241, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ngo_et_al:LIPIcs.STACS.2012.230, author = {Ngo, Hung Q. and Porat, Ely and Rudra, Atri}, title = {{Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {230--241}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.230}, URN = {urn:nbn:de:0030-drops-34011}, doi = {10.4230/LIPIcs.STACS.2012.230}, annote = {Keywords: Compressed Sensing, Sub-Linear Time Decoding, List-Recoverable Codes} }
Antoine Durand-Gasselin and Peter Habermehl. Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 242-253, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{durandgasselin_et_al:LIPIcs.STACS.2012.242, author = {Durand-Gasselin, Antoine and Habermehl, Peter}, title = {{Ehrenfeucht-Fra\"{i}ss\'{e} goes elementarily automatic for structures of bounded degree}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {242--253}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.242}, URN = {urn:nbn:de:0030-drops-34198}, doi = {10.4230/LIPIcs.STACS.2012.242}, annote = {Keywords: Automata-based decision procedures for logical theories, Automatic Structures, Ehrenfeucht-Fra\"{i}ss\'{e} Games, Logics, Complexity} }
Samir Datta, Arjun Gopalan, Raghav Kulkarni, and Raghunath Tewari. Improved Bounds for Bipartite Matching on Surfaces. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 254-265, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{datta_et_al:LIPIcs.STACS.2012.254, author = {Datta, Samir and Gopalan, Arjun and Kulkarni, Raghav and Tewari, Raghunath}, title = {{Improved Bounds for Bipartite Matching on Surfaces}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {254--265}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.254}, URN = {urn:nbn:de:0030-drops-34141}, doi = {10.4230/LIPIcs.STACS.2012.254}, annote = {Keywords: Perfect Matching, Graphs on Surfaces, Space Complexity, NC, UL} }
Ioannis Koutis, Alex Levin, and Richard Peng. Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 266-277, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{koutis_et_al:LIPIcs.STACS.2012.266, author = {Koutis, Ioannis and Levin, Alex and Peng, Richard}, title = {{Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {266--277}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.266}, URN = {urn:nbn:de:0030-drops-34348}, doi = {10.4230/LIPIcs.STACS.2012.266}, annote = {Keywords: Spectral sparsification, linear system solving} }
Ken-ichi Kawarabayashi and Yusuke Kobayashi. Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 278-289, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kawarabayashi_et_al:LIPIcs.STACS.2012.278, author = {Kawarabayashi, Ken-ichi and Kobayashi, Yusuke}, title = {{Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {278--289}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.278}, URN = {urn:nbn:de:0030-drops-34165}, doi = {10.4230/LIPIcs.STACS.2012.278}, annote = {Keywords: grid minor, treewidth, graph minor} }
Timothy M. Chan, Stephane Durocher, Kasper Green Larsen, Jason Morrison, and Bryan T. Wilkinson. Linear-Space Data Structures for Range Mode Query in Arrays. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 290-301, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{chan_et_al:LIPIcs.STACS.2012.290, author = {Chan, Timothy M. and Durocher, Stephane and Larsen, Kasper Green and Morrison, Jason and Wilkinson, Bryan T.}, title = {{Linear-Space Data Structures for Range Mode Query in Arrays}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {290--301}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.290}, URN = {urn:nbn:de:0030-drops-34254}, doi = {10.4230/LIPIcs.STACS.2012.290}, annote = {Keywords: mode, range query, data structure, linear space, array} }
Andrei A. Bulatov, Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum. Log-supermodular functions, functional clones and counting CSPs. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 302-313, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bulatov_et_al:LIPIcs.STACS.2012.302, author = {Bulatov, Andrei A. and Dyer, Martin and Goldberg, Leslie Ann and Jerrum, Mark}, title = {{Log-supermodular functions, functional clones and counting CSPs}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {302--313}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.302}, URN = {urn:nbn:de:0030-drops-34078}, doi = {10.4230/LIPIcs.STACS.2012.302}, annote = {Keywords: counting constraint satisfaction problems, approximation, complexity} }
George Giakkoupis, Thomas Sauerwald, He Sun, and Philipp Woelfel. Low Randomness Rumor Spreading via Hashing. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 314-325, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{giakkoupis_et_al:LIPIcs.STACS.2012.314, author = {Giakkoupis, George and Sauerwald, Thomas and Sun, He and Woelfel, Philipp}, title = {{Low Randomness Rumor Spreading via Hashing}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {314--325}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.314}, URN = {urn:nbn:de:0030-drops-34417}, doi = {10.4230/LIPIcs.STACS.2012.314}, annote = {Keywords: Parallel and Distributed Computing, Randomness, Rumor Spreading} }
Robert Ganian, Petr Hlineny, Alexander Langer, Jan Obdržálek, Peter Rossmanith, and Somnath Sikdar. Lower Bounds on the Complexity of MSO_1 Model-Checking. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 326-337, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ganian_et_al:LIPIcs.STACS.2012.326, author = {Ganian, Robert and Hlineny, Petr and Langer, Alexander and Obdr\v{z}\'{a}lek, Jan and Rossmanith, Peter and Sikdar, Somnath}, title = {{Lower Bounds on the Complexity of MSO\underline1 Model-Checking}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {326--337}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.326}, URN = {urn:nbn:de:0030-drops-34185}, doi = {10.4230/LIPIcs.STACS.2012.326}, annote = {Keywords: Monadic Second-Order Logic, Treewidth, Lower Bounds, Exponential Time Hypothesis, Parameterized Complexity} }
N.S. Narayanaswamy, Venkatesh Raman, M.S. Ramanujan, and Saket Saurabh. LP can be a cure for Parameterized Problems. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 338-349, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{narayanaswamy_et_al:LIPIcs.STACS.2012.338, author = {Narayanaswamy, N.S. and Raman, Venkatesh and Ramanujan, M.S. and Saurabh, Saket}, title = {{LP can be a cure for Parameterized Problems}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {338--349}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.338}, URN = {urn:nbn:de:0030-drops-34291}, doi = {10.4230/LIPIcs.STACS.2012.338}, annote = {Keywords: Algorithms and data structures. Graph Algorithms, Parameterized Algorithms.} }
Sanjay Jain and Efim Kinber. Mind Change Speed-up for Learning Languages from Positive Data. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 350-361, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{jain_et_al:LIPIcs.STACS.2012.350, author = {Jain, Sanjay and Kinber, Efim}, title = {{Mind Change Speed-up for Learning Languages from Positive Data}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {350--361}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.350}, URN = {urn:nbn:de:0030-drops-33936}, doi = {10.4230/LIPIcs.STACS.2012.350}, annote = {Keywords: Algorithmic and automatic learning, mind changes, speedup} }
Hervé Fournier, Guillaume Malod, and Stefan Mengel. Monomials in arithmetic circuits: Complete problems in the counting hierarchy. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 362-373, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{fournier_et_al:LIPIcs.STACS.2012.362, author = {Fournier, Herv\'{e} and Malod, Guillaume and Mengel, Stefan}, title = {{Monomials in arithmetic circuits: Complete problems in the counting hierarchy}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {362--373}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.362}, URN = {urn:nbn:de:0030-drops-34240}, doi = {10.4230/LIPIcs.STACS.2012.362}, annote = {Keywords: arithmetic circuits, counting problems, polynomials} }
Christian E.J. Eggermont and Gerhard J. Woeginger. Motion planning with pulley, rope, and baskets. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 374-383, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{eggermont_et_al:LIPIcs.STACS.2012.374, author = {Eggermont, Christian E.J. and Woeginger, Gerhard J.}, title = {{Motion planning with pulley, rope, and baskets}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {374--383}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.374}, URN = {urn:nbn:de:0030-drops-33900}, doi = {10.4230/LIPIcs.STACS.2012.374}, annote = {Keywords: planning and scheduling; computational complexity} }
Ning Chen. On Computing Pareto Stable Assignments. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 384-395, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{chen:LIPIcs.STACS.2012.384, author = {Chen, Ning}, title = {{On Computing Pareto Stable Assignments}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {384--395}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.384}, URN = {urn:nbn:de:0030-drops-34042}, doi = {10.4230/LIPIcs.STACS.2012.384}, annote = {Keywords: Algorithm, stable matching, Pareto efficiency} }
André Arnold, Henryk Michalewski, and Damian Niwinski. On the separation question for tree languages. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 396-407, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{arnold_et_al:LIPIcs.STACS.2012.396, author = {Arnold, Andr\'{e} and Michalewski, Henryk and Niwinski, Damian}, title = {{On the separation question for tree languages}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {396--407}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.396}, URN = {urn:nbn:de:0030-drops-34156}, doi = {10.4230/LIPIcs.STACS.2012.396}, annote = {Keywords: Alternating automata on infinite trees, Index hierarchy, Separation property} }
Dieter Mitsche and Guillem Perarnau. On the treewidth and related parameters of random geometric graphs. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 408-419, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{mitsche_et_al:LIPIcs.STACS.2012.408, author = {Mitsche, Dieter and Perarnau, Guillem}, title = {{On the treewidth and related parameters of random geometric graphs}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {408--419}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.408}, URN = {urn:nbn:de:0030-drops-34280}, doi = {10.4230/LIPIcs.STACS.2012.408}, annote = {Keywords: Random geometric graphs, treewidth, treedepth} }
Carsten Witt. Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 420-431, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{witt:LIPIcs.STACS.2012.420, author = {Witt, Carsten}, title = {{Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {420--431}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.420}, URN = {urn:nbn:de:0030-drops-33920}, doi = {10.4230/LIPIcs.STACS.2012.420}, annote = {Keywords: Randomized Search Heuristics, Evolutionary Algorithms, Linear Functions, Running Time Analysis} }
Fedor V. Fomin and Petr A. Golovach. Parameterized Complexity of Connected Even/Odd Subgraph Problems. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 432-440, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{fomin_et_al:LIPIcs.STACS.2012.432, author = {Fomin, Fedor V. and Golovach, Petr A.}, title = {{Parameterized Complexity of Connected Even/Odd Subgraph Problems}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {432--440}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.432}, URN = {urn:nbn:de:0030-drops-33986}, doi = {10.4230/LIPIcs.STACS.2012.432}, annote = {Keywords: Parameterized complexity, Euler graph, even graph, odd graph, treewidth} }
Benjamin Doerr and Carola Winzen. Playing Mastermind With Constant-Size Memory. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 441-452, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{doerr_et_al:LIPIcs.STACS.2012.441, author = {Doerr, Benjamin and Winzen, Carola}, title = {{Playing Mastermind With Constant-Size Memory}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {441--452}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.441}, URN = {urn:nbn:de:0030-drops-34112}, doi = {10.4230/LIPIcs.STACS.2012.441}, annote = {Keywords: Algorithms, Mastermind, black-box complexity, memory-restricted algorithms, query complexity} }
László Babai and Youming Qiao. Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 453-464, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{babai_et_al:LIPIcs.STACS.2012.453, author = {Babai, L\'{a}szl\'{o} and Qiao, Youming}, title = {{Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {453--464}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.453}, URN = {urn:nbn:de:0030-drops-34008}, doi = {10.4230/LIPIcs.STACS.2012.453}, annote = {Keywords: polynomial-time algorithm, group isomorphism, solvable group} }
Sungjin Im, Maxim Sviridenko, and Ruben van der Zwaan. Preemptive and Non-Preemptive Generalized Min Sum Set Cover. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 465-476, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{im_et_al:LIPIcs.STACS.2012.465, author = {Im, Sungjin and Sviridenko, Maxim and van der Zwaan, Ruben}, title = {{Preemptive and Non-Preemptive Generalized Min Sum Set Cover}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {465--476}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.465}, URN = {urn:nbn:de:0030-drops-33991}, doi = {10.4230/LIPIcs.STACS.2012.465}, annote = {Keywords: Set Cover, Approximation, Preemption, Latency, Average cover time} }
Xiaoming Sun and Chengu Wang. Randomized Communication Complexity for Linear Algebra Problems over Finite Fields. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 477-488, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{sun_et_al:LIPIcs.STACS.2012.477, author = {Sun, Xiaoming and Wang, Chengu}, title = {{Randomized Communication Complexity for Linear Algebra Problems over Finite Fields}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {477--488}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.477}, URN = {urn:nbn:de:0030-drops-34385}, doi = {10.4230/LIPIcs.STACS.2012.477}, annote = {Keywords: communication complexity, streaming, matrix, singularity, determinant} }
Frederik Harwath and Nicole Schweikardt. Regular tree languages, cardinality predicates, and addition-invariant FO. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 489-500, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{harwath_et_al:LIPIcs.STACS.2012.489, author = {Harwath, Frederik and Schweikardt, Nicole}, title = {{Regular tree languages, cardinality predicates, and addition-invariant FO}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {489--500}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.489}, URN = {urn:nbn:de:0030-drops-34394}, doi = {10.4230/LIPIcs.STACS.2012.489}, annote = {Keywords: regular tree languages, algebraic closure properties, decidable characterisations, addition-invariant first-order logic, logical interpretations} }
Katarzyna Paluch, Khaled Elbassioni, and Anke van Zuylen. Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 501-506, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{paluch_et_al:LIPIcs.STACS.2012.501, author = {Paluch, Katarzyna and Elbassioni, Khaled and van Zuylen, Anke}, title = {{Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {501--506}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.501}, URN = {urn:nbn:de:0030-drops-34129}, doi = {10.4230/LIPIcs.STACS.2012.501}, annote = {Keywords: approximation algorithm, maximum asymmetric traveling salesman problem} }
Tomáš Brázdil and Stefan Kiefer. Stabilization of Branching Queueing Networks. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 507-518, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{brazdil_et_al:LIPIcs.STACS.2012.507, author = {Br\'{a}zdil, Tom\'{a}\v{s} and Kiefer, Stefan}, title = {{Stabilization of Branching Queueing Networks}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {507--518}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.507}, URN = {urn:nbn:de:0030-drops-34133}, doi = {10.4230/LIPIcs.STACS.2012.507}, annote = {Keywords: continuous-time Markov decision processes, infinite-state systems, performance analysis} }
Maurice Jansen and Rahul Santhanam. Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 519-530, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{jansen_et_al:LIPIcs.STACS.2012.519, author = {Jansen, Maurice and Santhanam, Rahul}, title = {{Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated Algebraic Complexity Classes}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {519--530}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.519}, URN = {urn:nbn:de:0030-drops-34307}, doi = {10.4230/LIPIcs.STACS.2012.519}, annote = {Keywords: Computational Complexity, Circuit Lower Bounds, Polynomial Identity Testing, Derandomization} }
Paul Bonsma. Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 531-542, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bonsma:LIPIcs.STACS.2012.531, author = {Bonsma, Paul}, title = {{Surface Split Decompositions and Subgraph Isomorphism in Graphs on Surfaces}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {531--542}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.531}, URN = {urn:nbn:de:0030-drops-34224}, doi = {10.4230/LIPIcs.STACS.2012.531}, annote = {Keywords: Analysis of algorithms, parameterized algorithms, graphs on surfaces, subgraph isomorphism, dynamic programming, branch decompositions, counting probl} }
Laurent Bienvenu, Rupert Hölzl, Joseph S. Miller, and André Nies. The Denjoy alternative for computable functions. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 543-554, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2012.543, author = {Bienvenu, Laurent and H\"{o}lzl, Rupert and Miller, Joseph S. and Nies, Andr\'{e}}, title = {{The Denjoy alternative for computable functions}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {543--554}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.543}, URN = {urn:nbn:de:0030-drops-34095}, doi = {10.4230/LIPIcs.STACS.2012.543}, annote = {Keywords: Differentiability, Denjoy alternative, density, porosity, randomness} }
Olivier Finkel. The Determinacy of Context-Free Games. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 555-566, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{finkel:LIPIcs.STACS.2012.555, author = {Finkel, Olivier}, title = {{The Determinacy of Context-Free Games}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {555--566}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.555}, URN = {urn:nbn:de:0030-drops-33897}, doi = {10.4230/LIPIcs.STACS.2012.555}, annote = {Keywords: Automata and formal languages, logic in computer science, Gale-Stewart games, Wadge games, determinacy, context-free games} }
Mathieu Hoyrup. The dimension of ergodic random sequences. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 567-576, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{hoyrup:LIPIcs.STACS.2012.567, author = {Hoyrup, Mathieu}, title = {{The dimension of ergodic random sequences}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {567--576}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.567}, URN = {urn:nbn:de:0030-drops-33917}, doi = {10.4230/LIPIcs.STACS.2012.567}, annote = {Keywords: Shannon-McMillan-Breiman theorem, Martin-L\"{o}f random sequence, effective Hausdorff dimension, compression rate, entropy} }
Faried Abu Zaid, Erich Grädel, and Lukasz Kaiser. The Field of Reals is not omega-Automatic. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 577-588, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{abuzaid_et_al:LIPIcs.STACS.2012.577, author = {Abu Zaid, Faried and Gr\"{a}del, Erich and Kaiser, Lukasz}, title = {{The Field of Reals is not omega-Automatic}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {577--588}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.577}, URN = {urn:nbn:de:0030-drops-34234}, doi = {10.4230/LIPIcs.STACS.2012.577}, annote = {Keywords: Logic, Algorithmic Model Theory, Automatic Structures} }
Christopher H. Broadbent. The Limits of Decidability for First Order Logic on CPDA Graphs. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 589-600, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{broadbent:LIPIcs.STACS.2012.589, author = {Broadbent, Christopher H.}, title = {{The Limits of Decidability for First Order Logic on CPDA Graphs}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {589--600}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.589}, URN = {urn:nbn:de:0030-drops-34334}, doi = {10.4230/LIPIcs.STACS.2012.589}, annote = {Keywords: Collapsible Pushdown Automata, First Order Logic, Logical Reflection} }
Yuval Filmus and Justin Ward. The Power of Local Search: Maximum Coverage over a Matroid. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 601-612, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{filmus_et_al:LIPIcs.STACS.2012.601, author = {Filmus, Yuval and Ward, Justin}, title = {{The Power of Local Search: Maximum Coverage over a Matroid}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {601--612}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.601}, URN = {urn:nbn:de:0030-drops-33968}, doi = {10.4230/LIPIcs.STACS.2012.601}, annote = {Keywords: approximation algorithms; maximum coverage; matroids; local search} }
Kei Kimura and Kazuhisa Makino. Trichotomy for Integer Linear Systems Based on Their Sign Patterns. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 613-623, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{kimura_et_al:LIPIcs.STACS.2012.613, author = {Kimura, Kei and Makino, Kazuhisa}, title = {{Trichotomy for Integer Linear Systems Based on Their Sign Patterns}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {613--623}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.613}, URN = {urn:nbn:de:0030-drops-34367}, doi = {10.4230/LIPIcs.STACS.2012.613}, annote = {Keywords: Integer linear system, Sign pattern, Complexity index, TVPI system, Horn system} }
Pawel Gawrychowski. Tying up the loose ends in fully LZW-compressed pattern matching. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 624-635, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{gawrychowski:LIPIcs.STACS.2012.624, author = {Gawrychowski, Pawel}, title = {{Tying up the loose ends in fully LZW-compressed pattern matching}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {624--635}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.624}, URN = {urn:nbn:de:0030-drops-33975}, doi = {10.4230/LIPIcs.STACS.2012.624}, annote = {Keywords: pattern matching, compression, Lempel-Ziv-Welch} }
Andris Ambainis. Variable time amplitude amplification and quantum algorithms for linear algebra problems. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 636-647, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ambainis:LIPIcs.STACS.2012.636, author = {Ambainis, Andris}, title = {{Variable time amplitude amplification and quantum algorithms for linear algebra problems}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {636--647}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.636}, URN = {urn:nbn:de:0030-drops-34261}, doi = {10.4230/LIPIcs.STACS.2012.636}, annote = {Keywords: quantum computing, quantum algorithms, amplitude amplification, linear equations} }
Mikolaj Bojanczyk and Szymon Torunczyk. Weak MSO+U over infinite trees. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 648-660, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bojanczyk_et_al:LIPIcs.STACS.2012.648, author = {Bojanczyk, Mikolaj and Torunczyk, Szymon}, title = {{Weak MSO+U over infinite trees}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {648--660}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph 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.2012.648}, URN = {urn:nbn:de:0030-drops-34279}, doi = {10.4230/LIPIcs.STACS.2012.648}, annote = {Keywords: Infinite trees, distance automata, MSO+U, profinite words} }