28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Proceedings{schwentick_et_al:LIPIcs.STACS.2011, title = {{LIPIcs, Volume 9, STACS'11, Complete Volume}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2013}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011}, URN = {urn:nbn:de:0030-drops-41031}, doi = {10.4230/LIPIcs.STACS.2011}, annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory} }
28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. i-xvii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{schwentick_et_al:LIPIcs.STACS.2011.i, author = {Schwentick, Thomas and D\"{u}rr, Christoph}, title = {{Frontmatter, Table of Contents, Preface, Conference Organization}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {i--xvii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.i}, URN = {urn:nbn:de:0030-drops-29939}, doi = {10.4230/LIPIcs.STACS.2011.i}, annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization} }
Susanne Albers. Algorithms for Dynamic Speed Scaling. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{albers:LIPIcs.STACS.2011.1, author = {Albers, Susanne}, title = {{Algorithms for Dynamic Speed Scaling}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {1--11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.1}, URN = {urn:nbn:de:0030-drops-29954}, doi = {10.4230/LIPIcs.STACS.2011.1}, annote = {Keywords: competitive analysis, energy-efficiency, flow time, job deadline, offline algorithm, online algorithm, response time, scheduling, variable-speed proce} }
Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, and Evgenij Thorstensen. Structural Decomposition Methods and What They are Good For. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 12-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{aschinger_et_al:LIPIcs.STACS.2011.12, author = {Aschinger, Markus and Drescher, Conrad and Gottlob, Georg and Jeavons, Peter and Thorstensen, Evgenij}, title = {{Structural Decomposition Methods and What They are Good For}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {12--28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.12}, URN = {urn:nbn:de:0030-drops-29960}, doi = {10.4230/LIPIcs.STACS.2011.12}, annote = {Keywords: decompositions} }
Hubert Comon-Lundh and Véronique Cortier. How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 29-44, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{comonlundh_et_al:LIPIcs.STACS.2011.29, author = {Comon-Lundh, Hubert and Cortier, V\'{e}ronique}, title = {{How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {29--44}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.29}, URN = {urn:nbn:de:0030-drops-29993}, doi = {10.4230/LIPIcs.STACS.2011.29}, annote = {Keywords: verification, security, cryptography} }
Saverio Caminiti, Irene Finocchi, and Emanuele G. Fusco. Local dependency dynamic programming in the presence of memory faults. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 45-56, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{caminiti_et_al:LIPIcs.STACS.2011.45, author = {Caminiti, Saverio and Finocchi, Irene and Fusco, Emanuele G.}, title = {{Local dependency dynamic programming in the presence of memory faults}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {45--56}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.45}, URN = {urn:nbn:de:0030-drops-29988}, doi = {10.4230/LIPIcs.STACS.2011.45}, annote = {Keywords: unreliable memories, fault-tolerant algorithms, local dependency dynamic programming, edit distance} }
George Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 57-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{giakkoupis:LIPIcs.STACS.2011.57, author = {Giakkoupis, George}, title = {{Tight bounds for rumor spreading in graphs of a given conductance}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {57--68}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.57}, URN = {urn:nbn:de:0030-drops-29977}, doi = {10.4230/LIPIcs.STACS.2011.57}, annote = {Keywords: conductance, rumor spreading} }
Liah Kor, Amos Korman, and David Peleg. Tight Bounds For Distributed MST Verification. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 69-80, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kor_et_al:LIPIcs.STACS.2011.69, author = {Kor, Liah and Korman, Amos and Peleg, David}, title = {{Tight Bounds For Distributed MST Verification}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {69--80}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.69}, URN = {urn:nbn:de:0030-drops-30000}, doi = {10.4230/LIPIcs.STACS.2011.69}, annote = {Keywords: distributed algorithms, distributed verification, labeling schemes, minimum-weight spanning tree} }
Luc Segoufin and Szymon Torunczyk. Automata based verification over linearly ordered data domains. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 81-92, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{segoufin_et_al:LIPIcs.STACS.2011.81, author = {Segoufin, Luc and Torunczyk, Szymon}, title = {{Automata based verification over linearly ordered data domains}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {81--92}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.81}, URN = {urn:nbn:de:0030-drops-30017}, doi = {10.4230/LIPIcs.STACS.2011.81}, annote = {Keywords: register automata, data values, linear order} }
Diego Figueira and Luc Segoufin. Bottom-up automata on data trees and vertical XPath. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 93-104, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{figueira_et_al:LIPIcs.STACS.2011.93, author = {Figueira, Diego and Segoufin, Luc}, title = {{Bottom-up automata on data trees and vertical XPath}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {93--104}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.93}, URN = {urn:nbn:de:0030-drops-30029}, doi = {10.4230/LIPIcs.STACS.2011.93}, annote = {Keywords: Decidability, XPath, Data trees, Bottom-up tree automata} }
Mikolaj Bojanczyk. Data Monoids. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 105-116, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{bojanczyk:LIPIcs.STACS.2011.105, author = {Bojanczyk, Mikolaj}, title = {{Data Monoids}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {105--116}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.105}, URN = {urn:nbn:de:0030-drops-30030}, doi = {10.4230/LIPIcs.STACS.2011.105}, annote = {Keywords: Monoid, Data Words, Nominal Set, First-Order Logic} }
Haim Kaplan and Yahav Nussbaum. Minimum s-t cut in undirected planar graphs when the source and the sink are close. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 117-128, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kaplan_et_al:LIPIcs.STACS.2011.117, author = {Kaplan, Haim and Nussbaum, Yahav}, title = {{Minimum s-t cut in undirected planar graphs when the source and the sink are close}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {117--128}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.117}, URN = {urn:nbn:de:0030-drops-30049}, doi = {10.4230/LIPIcs.STACS.2011.117}, annote = {Keywords: planar graph, minimum cut, shortest path, cut cycle} }
Petr Kolman and Christian Scheideler. Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 129-140, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kolman_et_al:LIPIcs.STACS.2011.129, author = {Kolman, Petr and Scheideler, Christian}, title = {{Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {129--140}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.129}, URN = {urn:nbn:de:0030-drops-30051}, doi = {10.4230/LIPIcs.STACS.2011.129}, annote = {Keywords: Multicommodity flow, Multiroute flow, Cuts, Duality} }
Jiun-Jie Wang and Xin He. Compact Visibility Representation of Plane Graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 141-152, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{wang_et_al:LIPIcs.STACS.2011.141, author = {Wang, Jiun-Jie and He, Xin}, title = {{Compact Visibility Representation of Plane Graphs}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {141--152}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.141}, URN = {urn:nbn:de:0030-drops-30064}, doi = {10.4230/LIPIcs.STACS.2011.141}, annote = {Keywords: plane graph, plane triangulation, visibility representation, st-orientation} }
Jeremie Chalopin, Shantanu Das, Yann Disser, Matus Mihalak, and Peter Widmayer. Telling convex from reflex allows to map a polygon. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 153-164, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{chalopin_et_al:LIPIcs.STACS.2011.153, author = {Chalopin, Jeremie and Das, Shantanu and Disser, Yann and Mihalak, Matus and Widmayer, Peter}, title = {{Telling convex from reflex allows to map a polygon}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {153--164}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.153}, URN = {urn:nbn:de:0030-drops-30077}, doi = {10.4230/LIPIcs.STACS.2011.153}, annote = {Keywords: polygon mapping, map construction, autonomous agent, simple robot, visibility graph reconstruction} }
Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Cross-Composition: A New Technique for Kernelization Lower Bounds. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 165-176, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{bodlaender_et_al:LIPIcs.STACS.2011.165, author = {Bodlaender, Hans L. and Jansen, Bart M. P. and Kratsch, Stefan}, title = {{Cross-Composition: A New Technique for Kernelization Lower Bounds}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {165--176}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.165}, URN = {urn:nbn:de:0030-drops-30082}, doi = {10.4230/LIPIcs.STACS.2011.165}, annote = {Keywords: kernelization, lower bounds, parameterized complexity} }
Bart M. P. Jansen and Hans L. Bodlaender. Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 177-188, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{jansen_et_al:LIPIcs.STACS.2011.177, author = {Jansen, Bart M. P. and Bodlaender, Hans L.}, title = {{Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {177--188}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.177}, URN = {urn:nbn:de:0030-drops-30097}, doi = {10.4230/LIPIcs.STACS.2011.177}, annote = {Keywords: kernelization, lower bounds, parameterized complexity} }
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, and Saket Saurabh. Hitting forbidden minors: Approximation and Kernelization. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 189-200, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{fomin_et_al:LIPIcs.STACS.2011.189, author = {Fomin, Fedor V. and Lokshtanov, Daniel and Misra, Neeldhara and Philip, Geevarghese and Saurabh, Saket}, title = {{Hitting forbidden minors: Approximation and Kernelization}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {189--200}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.189}, URN = {urn:nbn:de:0030-drops-30103}, doi = {10.4230/LIPIcs.STACS.2011.189}, annote = {Keywords: kernelization} }
Erik D. Demaine, Matthew J. Patitz, Robert T. Schweller, and Scott M. Summers. Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (Extended Abstract). In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 201-212, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{demaine_et_al:LIPIcs.STACS.2011.201, author = {Demaine, Erik D. and Patitz, Matthew J. and Schweller, Robert T. and Summers, Scott M.}, title = {{Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {201--212}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.201}, URN = {urn:nbn:de:0030-drops-30118}, doi = {10.4230/LIPIcs.STACS.2011.201}, annote = {Keywords: Biomolecular computation, RNAse enzyme self-assembly, algorithmic self-assembly, Komogorov complexity} }
Dominik D. Freydenberger, Hossein Nevisi, and Daniel Reidenbach. Weakly Unambiguous Morphisms. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 213-224, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{freydenberger_et_al:LIPIcs.STACS.2011.213, author = {Freydenberger, Dominik D. and Nevisi, Hossein and Reidenbach, Daniel}, title = {{Weakly Unambiguous Morphisms}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {213--224}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.213}, URN = {urn:nbn:de:0030-drops-30123}, doi = {10.4230/LIPIcs.STACS.2011.213}, annote = {Keywords: Combinatorics on words, Morphisms, Ambiguity} }
Francine Blanchet-Sadri and John Lensmire. On Minimal Sturmian Partial Words. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 225-236, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{blanchetsadri_et_al:LIPIcs.STACS.2011.225, author = {Blanchet-Sadri, Francine and Lensmire, John}, title = {{On Minimal Sturmian Partial Words}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {225--236}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.225}, URN = {urn:nbn:de:0030-drops-30131}, doi = {10.4230/LIPIcs.STACS.2011.225}, annote = {Keywords: Automata and formal languages; Combinatorics on words; Graph theory; Subword complexity; Feasible functions; Partial words; Sturmian words.} }
Timon Hertli, Robin A. Moser, and Dominik Scheder. Improving PPSZ for 3-SAT using Critical Variables. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 237-248, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{hertli_et_al:LIPIcs.STACS.2011.237, author = {Hertli, Timon and Moser, Robin A. and Scheder, Dominik}, title = {{Improving PPSZ for 3-SAT using Critical Variables}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {237--248}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.237}, URN = {urn:nbn:de:0030-drops-30147}, doi = {10.4230/LIPIcs.STACS.2011.237}, annote = {Keywords: SAT, satisfiability, randomized, exponential time, algorithm, 3-SAT, 4-SAT} }
Heng Guo, Sangxia Huang, Pinyan Lu, and Mingji Xia. The Complexity of Weighted Boolean #CSP Modulo k. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 249-260, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{guo_et_al:LIPIcs.STACS.2011.249, author = {Guo, Heng and Huang, Sangxia and Lu, Pinyan and Xia, Mingji}, title = {{The Complexity of Weighted Boolean #CSP Modulo k}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {249--260}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.249}, URN = {urn:nbn:de:0030-drops-30158}, doi = {10.4230/LIPIcs.STACS.2011.249}, annote = {Keywords: #CSP, dichotomy theorem, counting problems, computational complexity} }
Martin Dyer and David Richerby. The #CSP Dichotomy is Decidable. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 261-272, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{dyer_et_al:LIPIcs.STACS.2011.261, author = {Dyer, Martin and Richerby, David}, title = {{The #CSP Dichotomy is Decidable}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {261--272}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.261}, URN = {urn:nbn:de:0030-drops-30161}, doi = {10.4230/LIPIcs.STACS.2011.261}, annote = {Keywords: constraint satisfaction problem, counting problems, complexity dichotomy, decidability} }
Alex Borelllo, Gaetan Richard, and Veronique Terrier. A speed-up of oblivious multi-head finite automata by cellular automata. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 273-283, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{borelllo_et_al:LIPIcs.STACS.2011.273, author = {Borelllo, Alex and Richard, Gaetan and Terrier, Veronique}, title = {{A speed-up of oblivious multi-head finite automata by cellular automata}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {273--283}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.273}, URN = {urn:nbn:de:0030-drops-30172}, doi = {10.4230/LIPIcs.STACS.2011.273}, annote = {Keywords: oblivious multi-head finite automata, cellular automata, parallel speed-up, simulation} }
Nazim Fates. Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 284-295, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{fates:LIPIcs.STACS.2011.284, author = {Fates, Nazim}, title = {{Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {284--295}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.284}, URN = {urn:nbn:de:0030-drops-30187}, doi = {10.4230/LIPIcs.STACS.2011.284}, annote = {Keywords: stochastic and probabilistic cellular automata, density classification problem, models of spatially distributed computing, stochastic process} }
Ana Busic, Jean Mairesse, and Irene Marcovici. Probabilistic cellular automata, invariant measures, and perfect sampling. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 296-307, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{busic_et_al:LIPIcs.STACS.2011.296, author = {Busic, Ana and Mairesse, Jean and Marcovici, Irene}, title = {{Probabilistic cellular automata, invariant measures, and perfect sampling}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {296--307}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.296}, URN = {urn:nbn:de:0030-drops-30190}, doi = {10.4230/LIPIcs.STACS.2011.296}, annote = {Keywords: probabilistic cellular automata, perfect sampling, ergodicity} }
Marcel R. Ackermann, Johannes Bloemer, Daniel Kuntze, and Christian Sohler. Analysis of Agglomerative Clustering. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 308-319, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{ackermann_et_al:LIPIcs.STACS.2011.308, author = {Ackermann, Marcel R. and Bloemer, Johannes and Kuntze, Daniel and Sohler, Christian}, title = {{Analysis of Agglomerative Clustering}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {308--319}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.308}, URN = {urn:nbn:de:0030-drops-29942}, doi = {10.4230/LIPIcs.STACS.2011.308}, annote = {Keywords: agglomerative clustering, hierarchical clustering, complete linkage, approximation guarantees} }
John Case and Timo Koetzing. Measuring Learning Complexity with Criteria Epitomizers. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 320-331, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{case_et_al:LIPIcs.STACS.2011.320, author = {Case, John and Koetzing, Timo}, title = {{Measuring Learning Complexity with Criteria Epitomizers}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {320--331}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.320}, URN = {urn:nbn:de:0030-drops-30232}, doi = {10.4230/LIPIcs.STACS.2011.320}, annote = {Keywords: Algorithmic Learning Theory, Learning Complexity, Robustness in Learning} }
Howard Karloff, Flip Korn, Konstantin Makarychev, and Yuval Rabani. On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 332-343, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{karloff_et_al:LIPIcs.STACS.2011.332, author = {Karloff, Howard and Korn, Flip and Makarychev, Konstantin and Rabani, Yuval}, title = {{On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {332--343}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.332}, URN = {urn:nbn:de:0030-drops-30246}, doi = {10.4230/LIPIcs.STACS.2011.332}, annote = {Keywords: ordered data, explanation problem} }
Balder ten Cate and Luc Segoufin. Unary negation. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 344-355, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{tencate_et_al:LIPIcs.STACS.2011.344, author = {ten Cate, Balder and Segoufin, Luc}, title = {{Unary negation}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {344--355}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.344}, URN = {urn:nbn:de:0030-drops-30256}, doi = {10.4230/LIPIcs.STACS.2011.344}, annote = {Keywords: Decidability, Logic, Unary negation} }
Jakub Kallas, Manfred Kufleitner, and Alexander Lauser. First-order Fragments with Successor over Infinite Words. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 356-367, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kallas_et_al:LIPIcs.STACS.2011.356, author = {Kallas, Jakub and Kufleitner, Manfred and Lauser, Alexander}, title = {{First-order Fragments with Successor over Infinite Words}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {356--367}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.356}, URN = {urn:nbn:de:0030-drops-30267}, doi = {10.4230/LIPIcs.STACS.2011.356}, annote = {Keywords: infinite words, regular languages, first-order logic, automata theory, semi-groups, topology} }
Martin Mundhenk and Felix Weiß. The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 368-379, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{mundhenk_et_al:LIPIcs.STACS.2011.368, author = {Mundhenk, Martin and Wei{\ss}, Felix}, title = {{The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {368--379}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.368}, URN = {urn:nbn:de:0030-drops-30278}, doi = {10.4230/LIPIcs.STACS.2011.368}, annote = {Keywords: complexity, intuitionistic logic, model checking, ACi} }
Alejandro Lopez-Ortiz and Claude-Guy Quimper. A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 380-391, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{lopezortiz_et_al:LIPIcs.STACS.2011.380, author = {Lopez-Ortiz, Alejandro and Quimper, Claude-Guy}, title = {{A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {380--391}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.380}, URN = {urn:nbn:de:0030-drops-30282}, doi = {10.4230/LIPIcs.STACS.2011.380}, annote = {Keywords: Scheduling} }
Sze-Hang Chan, Tak-Wah Lam, and Lap-Kei Lee. Scheduling for Weighted Flow Time and Energy with Rejection Penalty. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 392-403, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{chan_et_al:LIPIcs.STACS.2011.392, author = {Chan, Sze-Hang and Lam, Tak-Wah and Lee, Lap-Kei}, title = {{Scheduling for Weighted Flow Time and Energy with Rejection Penalty}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {392--403}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.392}, URN = {urn:nbn:de:0030-drops-30293}, doi = {10.4230/LIPIcs.STACS.2011.392}, annote = {Keywords: online scheduling, weighted flow time, rejection penalty, speed scaling} }
Robert Ganian, Petr Hlineny, and Jan Obdrzalek. Clique-width: When Hard Does Not Mean Impossible. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 404-415, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{ganian_et_al:LIPIcs.STACS.2011.404, author = {Ganian, Robert and Hlineny, Petr and Obdrzalek, Jan}, title = {{Clique-width: When Hard Does Not Mean Impossible}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {404--415}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.404}, URN = {urn:nbn:de:0030-drops-30309}, doi = {10.4230/LIPIcs.STACS.2011.404}, annote = {Keywords: clique-width, bi-rank-width, minimum leaf out-branching, minimum leaf spanning tree, edge-disjoint paths} }
Dariusz Dereniowski. From Pathwidth to Connected Pathwidth. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 416-427, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{dereniowski:LIPIcs.STACS.2011.416, author = {Dereniowski, Dariusz}, title = {{From Pathwidth to Connected Pathwidth}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {416--427}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.416}, URN = {urn:nbn:de:0030-drops-30311}, doi = {10.4230/LIPIcs.STACS.2011.416}, annote = {Keywords: connected pathwidth, connected searching, fugitive search games, graph searching, pathwidth} }
Andrew McGregor, Atri Rudra, and Steve Uurtamo. Polynomial Fitting of Data Streams with Applications to Codeword Testing. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 428-439, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{mcgregor_et_al:LIPIcs.STACS.2011.428, author = {McGregor, Andrew and Rudra, Atri and Uurtamo, Steve}, title = {{Polynomial Fitting of Data Streams with Applications to Codeword Testing}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {428--439}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.428}, URN = {urn:nbn:de:0030-drops-30322}, doi = {10.4230/LIPIcs.STACS.2011.428}, annote = {Keywords: Streaming, Polynomial Interpolation, Polynomial Regression} }
Jonathan A. Kelner and Alex Levin. Spectral Sparsification in the Semi-Streaming Setting. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 440-451, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kelner_et_al:LIPIcs.STACS.2011.440, author = {Kelner, Jonathan A. and Levin, Alex}, title = {{Spectral Sparsification in the Semi-Streaming Setting}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {440--451}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.440}, URN = {urn:nbn:de:0030-drops-30332}, doi = {10.4230/LIPIcs.STACS.2011.440}, annote = {Keywords: algorithms and data structures, graph algorithms, spectral graph theory, sub-linear space algorithms, spectral sparsification} }
Laurent Bienvenu, Wolfgang Merkle, and Andre Nies. Solovay functions and K-triviality. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 452-463, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{bienvenu_et_al:LIPIcs.STACS.2011.452, author = {Bienvenu, Laurent and Merkle, Wolfgang and Nies, Andre}, title = {{Solovay functions and K-triviality}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {452--463}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.452}, URN = {urn:nbn:de:0030-drops-30345}, doi = {10.4230/LIPIcs.STACS.2011.452}, annote = {Keywords: Algorithmic randomness, Kolmogorov complexity, K-triviality} }
Andrey Yu. Rumyantsev. Everywhere complex sequences and the probabilistic method. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 464-471, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{rumyantsev:LIPIcs.STACS.2011.464, author = {Rumyantsev, Andrey Yu.}, title = {{Everywhere complex sequences and the probabilistic method}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {464--471}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.464}, URN = {urn:nbn:de:0030-drops-30353}, doi = {10.4230/LIPIcs.STACS.2011.464}, annote = {Keywords: Kolmogorov complexity, everywhere complex sequences, randomized algorithms, Medvedev reducibility, Muchnik reducibility} }
Magnus M. Halldorsson, Boaz Patt-Shamir, and Dror Rawitz. Online Scheduling with Interval Conflicts. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 472-483, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{halldorsson_et_al:LIPIcs.STACS.2011.472, author = {Halldorsson, Magnus M. and Patt-Shamir, Boaz and Rawitz, Dror}, title = {{Online Scheduling with Interval Conflicts}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {472--483}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.472}, URN = {urn:nbn:de:0030-drops-30363}, doi = {10.4230/LIPIcs.STACS.2011.472}, annote = {Keywords: online scheduling, online set packing, interval conflicts, competitive analysis, compound tasks, distributed algorithms} }
Christian E.J. Eggermont, Alexander Schrijver, and Gerhard J. Woeginger. Analysis of multi-stage open shop processing systems. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 484-494, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{eggermont_et_al:LIPIcs.STACS.2011.484, author = {Eggermont, Christian E.J. and Schrijver, Alexander and Woeginger, Gerhard J.}, title = {{Analysis of multi-stage open shop processing systems}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {484--494}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.484}, URN = {urn:nbn:de:0030-drops-30373}, doi = {10.4230/LIPIcs.STACS.2011.484}, annote = {Keywords: scheduling, resource allocation, deadlock, computational complexity} }
Stefan Gulan. Graphs Encoded by Regular Expressions. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 495-506, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{gulan:LIPIcs.STACS.2011.495, author = {Gulan, Stefan}, title = {{Graphs Encoded by Regular Expressions}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {495--506}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.495}, URN = {urn:nbn:de:0030-drops-30386}, doi = {10.4230/LIPIcs.STACS.2011.495}, annote = {Keywords: Digraphs, Regular Expressions, Finite Automata, Forbidden Minors} }
Dominik D. Freydenberger. Extended Regular Expressions: Succinctness and Decidability. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 507-518, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{freydenberger:LIPIcs.STACS.2011.507, author = {Freydenberger, Dominik D.}, title = {{Extended Regular Expressions: Succinctness and Decidability}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {507--518}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.507}, URN = {urn:nbn:de:0030-drops-30396}, doi = {10.4230/LIPIcs.STACS.2011.507}, annote = {Keywords: extended regular expressions, regex, decidability, non-recursive tradeoffs} }
Maxim Babenko and Alexey Gusakov. New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 519-530, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{babenko_et_al:LIPIcs.STACS.2011.519, author = {Babenko, Maxim and Gusakov, Alexey}, title = {{New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {519--530}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.519}, URN = {urn:nbn:de:0030-drops-30402}, doi = {10.4230/LIPIcs.STACS.2011.519}, annote = {Keywords: graph algorithms, approximation algorithms, generalized matchings, flows, weighted packings} }
Antonios Antoniadis, Falk Hueffner, Pascal Lenzner, Carsten Moldenhauer, and Alexander Souza. Balanced Interval Coloring. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 531-542, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{antoniadis_et_al:LIPIcs.STACS.2011.531, author = {Antoniadis, Antonios and Hueffner, Falk and Lenzner, Pascal and Moldenhauer, Carsten and Souza, Alexander}, title = {{Balanced Interval Coloring}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {531--542}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.531}, URN = {urn:nbn:de:0030-drops-30413}, doi = {10.4230/LIPIcs.STACS.2011.531}, annote = {Keywords: Load balancing, discrepancy theory, NP-hardness} }
Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, and Natacha Portier. Symmetric Determinantal Representation of Weakly-Skew Circuits. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 543-554, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{grenet_et_al:LIPIcs.STACS.2011.543, author = {Grenet, Bruno and Kaltofen, Erich L. and Koiran, Pascal and Portier, Natacha}, title = {{Symmetric Determinantal Representation of Weakly-Skew Circuits}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {543--554}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.543}, URN = {urn:nbn:de:0030-drops-30426}, doi = {10.4230/LIPIcs.STACS.2011.543}, annote = {Keywords: algebraic complexity, determinant and permanent of symmetric matrices, formulas, skew circuits, Valiant’s classes} }
Markus Blaeser and Christian Engels. Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 555-566, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{blaeser_et_al:LIPIcs.STACS.2011.555, author = {Blaeser, Markus and Engels, Christian}, title = {{Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {555--566}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.555}, URN = {urn:nbn:de:0030-drops-30433}, doi = {10.4230/LIPIcs.STACS.2011.555}, annote = {Keywords: Descartes’ rule of signs, polynomial identity testing, sparse polynomials, black box testing} }
Youming Qiao, Jayalal Sarma M.N., and Bangsheng Tang. On Isomorphism Testing of Groups with Normal Hall Subgroups. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 567-578, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{qiao_et_al:LIPIcs.STACS.2011.567, author = {Qiao, Youming and Sarma M.N., Jayalal and Tang, Bangsheng}, title = {{On Isomorphism Testing of Groups with Normal Hall Subgroups}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {567--578}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.567}, URN = {urn:nbn:de:0030-drops-30443}, doi = {10.4230/LIPIcs.STACS.2011.567}, annote = {Keywords: Group Isomorphism Problem, Normal Hall Subgroups, Computational Complexity} }
Samir Datta, Raghav Kulkarni, Raghunath Tewari, and N. Variyam Vinodchandran. Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 579-590, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{datta_et_al:LIPIcs.STACS.2011.579, author = {Datta, Samir and Kulkarni, Raghav and Tewari, Raghunath and Vinodchandran, N. Variyam}, title = {{Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {579--590}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.579}, URN = {urn:nbn:de:0030-drops-30450}, doi = {10.4230/LIPIcs.STACS.2011.579}, annote = {Keywords: perfect matching, bounded genus graphs, isolation problem} }
George B. Mertzios. The Recognition of Triangle Graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 591-602, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{mertzios:LIPIcs.STACS.2011.591, author = {Mertzios, George B.}, title = {{The Recognition of Triangle Graphs}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {591--602}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.591}, URN = {urn:nbn:de:0030-drops-30469}, doi = {10.4230/LIPIcs.STACS.2011.591}, annote = {Keywords: Intersection graphs, trapezoid graphs, PI graphs, PI∗ graphs, recognition problem, NP-complete} }
Pawel Parys. Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 603-614, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{parys:LIPIcs.STACS.2011.603, author = {Parys, Pawel}, title = {{Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {603--614}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.603}, URN = {urn:nbn:de:0030-drops-30478}, doi = {10.4230/LIPIcs.STACS.2011.603}, annote = {Keywords: pushdown automata} }
Orna Kupferman, Yoad Lustig, Moshe Y. Vardi, and Mihalis Yannakakis. Temporal Synthesis for Bounded Systems and Environments. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 615-626, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kupferman_et_al:LIPIcs.STACS.2011.615, author = {Kupferman, Orna and Lustig, Yoad and Vardi, Moshe Y. and Yannakakis, Mihalis}, title = {{Temporal Synthesis for Bounded Systems and Environments}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {615--626}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.615}, URN = {urn:nbn:de:0030-drops-30481}, doi = {10.4230/LIPIcs.STACS.2011.615}, annote = {Keywords: temporal synthesis} }
Denis Kuperberg. Linear temporal logic for regular cost functions. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 627-636, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{kuperberg:LIPIcs.STACS.2011.627, author = {Kuperberg, Denis}, title = {{Linear temporal logic for regular cost functions}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {627--636}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.627}, URN = {urn:nbn:de:0030-drops-30499}, doi = {10.4230/LIPIcs.STACS.2011.627}, annote = {Keywords: linear temporal logic, regular cost functions, regular languages} }
Adrian Dumitrescu, Andre Schulz, Adam Sheffer, and Csaba D. Toth. Bounds on the maximum multiplicity of some common geometric graphs. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 637-648, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{dumitrescu_et_al:LIPIcs.STACS.2011.637, author = {Dumitrescu, Adrian and Schulz, Andre and Sheffer, Adam and Toth, Csaba D.}, title = {{Bounds on the maximum multiplicity of some common geometric graphs}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {637--648}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.637}, URN = {urn:nbn:de:0030-drops-30505}, doi = {10.4230/LIPIcs.STACS.2011.637}, annote = {Keywords: combinatorial geometry, matching, triangulation, spanning tree, spanning cycle, weighted structure, non-crossing condition} }
Christian Knauer, Hans Raj Tiwary, and Daniel Werner. On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 649-660, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{knauer_et_al:LIPIcs.STACS.2011.649, author = {Knauer, Christian and Tiwary, Hans Raj and Werner, Daniel}, title = {{On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {649--660}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.649}, URN = {urn:nbn:de:0030-drops-30514}, doi = {10.4230/LIPIcs.STACS.2011.649}, annote = {Keywords: computational geometry, combinatorial geometry, ham-sandwich cuts, parameterized complexity.} }
Andrew M. Childs and Robin Kothari. Quantum query complexity of minor-closed graph properties. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 661-672, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{childs_et_al:LIPIcs.STACS.2011.661, author = {Childs, Andrew M. and Kothari, Robin}, title = {{Quantum query complexity of minor-closed graph properties}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {661--672}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.661}, URN = {urn:nbn:de:0030-drops-30521}, doi = {10.4230/LIPIcs.STACS.2011.661}, annote = {Keywords: quatum query complexity, quantum algorithms, lower bounds, graph minors, graph properties} }
Anna Gal and Andrew Mills. Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 673-684, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{gal_et_al:LIPIcs.STACS.2011.673, author = {Gal, Anna and Mills, Andrew}, title = {{Three Query Locally Decodable Codes with Higher Correctness Require Exponential Length}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {673--684}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.673}, URN = {urn:nbn:de:0030-drops-30534}, doi = {10.4230/LIPIcs.STACS.2011.673}, annote = {Keywords: error correcting codes} }
Thomas Schwentick and Christoph Dürr. Index of Authors. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 685-686, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{schwentick_et_al:LIPIcs.STACS.2011.685, author = {Schwentick, Thomas and D\"{u}rr, Christoph}, title = {{Index of Authors}}, booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)}, pages = {685--686}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-25-5}, ISSN = {1868-8969}, year = {2011}, volume = {9}, editor = {Schwentick, Thomas and D\"{u}rr, Christoph}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.685}, URN = {urn:nbn:de:0030-drops-30542}, doi = {10.4230/LIPIcs.STACS.2011.685}, annote = {Keywords: Author Index} }
Feedback for Dagstuhl Publishing