@Proceedings{mayr_et_al:LIPIcs.STACS.2014,
title = {{LIPIcs, Volume 25, STACS'14, Complete Volume}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014},
URN = {urn:nbn:de:0030-drops-45104},
doi = {10.4230/LIPIcs.STACS.2014},
annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory}
}
@InProceedings{mayr_et_al:LIPIcs.STACS.2014.i,
author = {Mayr, Ernst W. and Portier, Natacha},
title = {{Frontmatter, Table of Contents, Preface, Conference Organization}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {i--xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.i},
URN = {urn:nbn:de:0030-drops-44435},
doi = {10.4230/LIPIcs.STACS.2014.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{esparza:LIPIcs.STACS.2014.1,
author = {Esparza, Javier},
title = {{Keeping a Crowd Safe: On the Complexity of Parameterized Verification}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {1--10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.1},
URN = {urn:nbn:de:0030-drops-44985},
doi = {10.4230/LIPIcs.STACS.2014.1},
annote = {Keywords: Parameterized verification, automata theory}
}
@InProceedings{miltersen:LIPIcs.STACS.2014.11,
author = {Miltersen, Peter Bro},
title = {{Semi-algebraic geometry in computational game theory - a consumer's perspective}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {11--12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.11},
URN = {urn:nbn:de:0030-drops-44994},
doi = {10.4230/LIPIcs.STACS.2014.11},
annote = {Keywords: Real Algebraic Geometry, Computational Game Theory}
}
@InProceedings{segoufin:LIPIcs.STACS.2014.13,
author = {Segoufin, Luc},
title = {{A glimpse on constant delay enumeration}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {13--27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.13},
URN = {urn:nbn:de:0030-drops-45001},
doi = {10.4230/LIPIcs.STACS.2014.13},
annote = {Keywords: Enumeration, constant delay, logic}
}
@InProceedings{kayal:LIPIcs.STACS.2014.28,
author = {Kayal, Neeraj},
title = {{Arithmetic Circuit Complexity}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {28--28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.28},
URN = {urn:nbn:de:0030-drops-45012},
doi = {10.4230/LIPIcs.STACS.2014.28},
annote = {Keywords: Circuit complexity, arithmetic circuits, lower bounds, polynomial identity testing}
}
@InProceedings{adamczyk_et_al:LIPIcs.STACS.2014.29,
author = {Adamczyk, Marek and Sviridenko, Maxim and Ward, Justin},
title = {{Submodular Stochastic Probing on Matroids}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {29--40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.29},
URN = {urn:nbn:de:0030-drops-44445},
doi = {10.4230/LIPIcs.STACS.2014.29},
annote = {Keywords: approximation algorithms, stochastic optimization, submodular optimization, matroids, iterative rounding}
}
@InProceedings{anderson_et_al:LIPIcs.STACS.2014.41,
author = {Anderson, Matthew and Dawar, Anuj},
title = {{On Symmetric Circuits and Fixed-Point Logics}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {41--52},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.41},
URN = {urn:nbn:de:0030-drops-44455},
doi = {10.4230/LIPIcs.STACS.2014.41},
annote = {Keywords: symmetric circuit, fixed-point logic, majority, counting, uniformity}
}
@InProceedings{angel_et_al:LIPIcs.STACS.2014.53,
author = {Angel, Eric and Bampis, Evripidis and Chau, Vincent},
title = {{Throughput Maximization in the Speed-Scaling Setting}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {53--62},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.53},
URN = {urn:nbn:de:0030-drops-44469},
doi = {10.4230/LIPIcs.STACS.2014.53},
annote = {Keywords: energy efficiency, dynamic speed scaling, offline algorithm, throughput, dynamic programming}
}
@InProceedings{antoniadis_et_al:LIPIcs.STACS.2014.63,
author = {Antoniadis, Antonios and Barcelo, Neal and Consuegra, Mario and Kling, Peter and Nugent, Michael and Pruhs, Kirk and Scquizzato, Michele},
title = {{Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {63--74},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.63},
URN = {urn:nbn:de:0030-drops-44474},
doi = {10.4230/LIPIcs.STACS.2014.63},
annote = {Keywords: scheduling, flow time, energy efficiency, speed scaling, primal-dual}
}
@InProceedings{araujo_et_al:LIPIcs.STACS.2014.75,
author = {Araujo, Julio and Nisse, Nicolas and P\'{e}rennes, St\'{e}phane},
title = {{Weighted Coloring in Trees}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {75--86},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.75},
URN = {urn:nbn:de:0030-drops-44484},
doi = {10.4230/LIPIcs.STACS.2014.75},
annote = {Keywords: Weighted Coloring, Max Coloring, Exponential Time Hypothesis, 3-SAT}
}
@InProceedings{azar_et_al:LIPIcs.STACS.2014.87,
author = {Azar, Yossi and Englert, Matthias and Gamzu, Iftah and Kidron, Eytan},
title = {{Generalized Reordering Buffer Management}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {87--98},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.87},
URN = {urn:nbn:de:0030-drops-44498},
doi = {10.4230/LIPIcs.STACS.2014.87},
annote = {Keywords: online algorithms, paging, reordering buffer}
}
@InProceedings{aziz_et_al:LIPIcs.STACS.2014.99,
author = {Aziz, Haris and de Keijzer, Bart},
title = {{Shapley meets Shapley}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {99--111},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.99},
URN = {urn:nbn:de:0030-drops-44504},
doi = {10.4230/LIPIcs.STACS.2014.99},
annote = {Keywords: matching games, Shapley, counting complexity}
}
@InProceedings{bacquey:LIPIcs.STACS.2014.112,
author = {Bacquey, Nicolas},
title = {{Complexity classes on spatially periodic Cellular Automata}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {112--124},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.112},
URN = {urn:nbn:de:0030-drops-44519},
doi = {10.4230/LIPIcs.STACS.2014.112},
annote = {Keywords: Language recognition, cyclic languages, computable functions, algorithms on Cellular Automata, linear space, polynomial time, density classification p}
}
@InProceedings{bauwens:LIPIcs.STACS.2014.125,
author = {Bauwens, Bruno},
title = {{Asymmetry of the Kolmogorov complexity of online predicting odd and even bits}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {125--136},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.125},
URN = {urn:nbn:de:0030-drops-44520},
doi = {10.4230/LIPIcs.STACS.2014.125},
annote = {Keywords: (On-line) Kolmogorov complexity, (On-line) Algorithmic Probability, Philosophy of Causality, Information Transfer}
}
@InProceedings{bekos_et_al:LIPIcs.STACS.2014.137,
author = {Bekos, Michael A. and Gronemann, Martin and Raftopoulou, Chrysanthi N.},
title = {{Two-Page Book Embeddings of 4-Planar Graphs}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {137--148},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.137},
URN = {urn:nbn:de:0030-drops-44536},
doi = {10.4230/LIPIcs.STACS.2014.137},
annote = {Keywords: Book Embedding, Subhamiltonicity, 4-Planar Graphs}
}
@InProceedings{berenbrink_et_al:LIPIcs.STACS.2014.149,
author = {Berenbrink, Petra and Erg\"{u}n, Funda and Mallmann-Trenn, Frederik and Sadeqi Azer, Erfan},
title = {{Palindrome Recognition In The Streaming Model}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {149--161},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.149},
URN = {urn:nbn:de:0030-drops-44544},
doi = {10.4230/LIPIcs.STACS.2014.149},
annote = {Keywords: Palindromes, Streaming Model, Complementary Palindrome}
}
@InProceedings{blanchetsadri_et_al:LIPIcs.STACS.2014.162,
author = {Blanchet-Sadri, Francine and Bodnar, Michelle and De Winkle, Benjamin},
title = {{New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {162--173},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.162},
URN = {urn:nbn:de:0030-drops-44552},
doi = {10.4230/LIPIcs.STACS.2014.162},
annote = {Keywords: Indeterminate strings, Partial words, Prefix arrays, Border arrays, Undirected graphs}
}
@InProceedings{boyar_et_al:LIPIcs.STACS.2014.174,
author = {Boyar, Joan and Kamali, Shahin and Larsen, Kim S. and L\'{o}pez-Ortiz, Alejandro},
title = {{Online Bin Packing with Advice}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {174--186},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.174},
URN = {urn:nbn:de:0030-drops-44565},
doi = {10.4230/LIPIcs.STACS.2014.174},
annote = {Keywords: online algorithms, advice complexity, bin packing}
}
@InProceedings{bringmann_et_al:LIPIcs.STACS.2014.187,
author = {Bringmann, Karl and Sauerwald, Thomas and Stauffer, Alexandre and Sun, He},
title = {{Balls into bins via local search: cover time and maximum load}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {187--198},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.187},
URN = {urn:nbn:de:0030-drops-44570},
doi = {10.4230/LIPIcs.STACS.2014.187},
annote = {Keywords: Balls and Bins, Stochastic Process, Randomized Algorithm}
}
@InProceedings{bruyere_et_al:LIPIcs.STACS.2014.199,
author = {Bruy\`{e}re, V\'{e}ronique and Filiot, Emmanuel and Randour, Mickael and Raskin, Jean-Fran\c{c}ois},
title = {{Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {199--213},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.199},
URN = {urn:nbn:de:0030-drops-44589},
doi = {10.4230/LIPIcs.STACS.2014.199},
annote = {Keywords: two-player games on graphs, Markov decision processes, quantitative objectives, synthesis, worst-case and expected value, mean-payoff, shortest path}
}
@InProceedings{cao_et_al:LIPIcs.STACS.2014.214,
author = {Cao, Yixin and Marx, D\'{a}niel},
title = {{Chordal Editing is Fixed-Parameter Tractable}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {214--225},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.214},
URN = {urn:nbn:de:0030-drops-44591},
doi = {10.4230/LIPIcs.STACS.2014.214},
annote = {Keywords: chordal graph, parameterized computation, graph modification problems, chordal deletion, chordal completion, clique tree decomposition, holes, simplic}
}
@InProceedings{chen_et_al:LIPIcs.STACS.2014.226,
author = {Chen, Jian-Jia and Kao, Mong-Jen and Lee, D.T. and Rutter, Ignaz and Wagner, Dorothea},
title = {{Online Dynamic Power Management with Hard Real-Time Guarantees}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {226--238},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.226},
URN = {urn:nbn:de:0030-drops-44607},
doi = {10.4230/LIPIcs.STACS.2014.226},
annote = {Keywords: Energy-Efficient Scheduling, Online Dynamic Power Management}
}
@InProceedings{chillara_et_al:LIPIcs.STACS.2014.239,
author = {Chillara, Suryajith and Mukhopadhyay, Partha},
title = {{Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {239--250},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.239},
URN = {urn:nbn:de:0030-drops-44610},
doi = {10.4230/LIPIcs.STACS.2014.239},
annote = {Keywords: Arithmetic Circuits, Determinantal Complexity, Depth-4 Lower Bounds}
}
@InProceedings{cygan_et_al:LIPIcs.STACS.2014.251,
author = {Cygan, Marek and Kociumaka, Tomasz},
title = {{Constant Factor Approximation for Capacitated k-Center with Outliers}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {251--262},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.251},
URN = {urn:nbn:de:0030-drops-44625},
doi = {10.4230/LIPIcs.STACS.2014.251},
annote = {Keywords: approximation algorithms, k-center, capacities, outliers, LP rounding}
}
@InProceedings{dereniowski_et_al:LIPIcs.STACS.2014.263,
author = {Dereniowski, Dariusz and Kosowski, Adrian and Pajak, Dominik and Uznanski, Przemyslaw},
title = {{Bounds on the Cover Time of Parallel Rotor Walks}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {263--275},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.263},
URN = {urn:nbn:de:0030-drops-44637},
doi = {10.4230/LIPIcs.STACS.2014.263},
annote = {Keywords: Distributed graph exploration, Rotor-Router, Collaborative robots, Parallel random walks, Derandomization}
}
@InProceedings{disser_et_al:LIPIcs.STACS.2014.276,
author = {Disser, Yann and Klimm, Max and Megow, Nicole and Stiller, Sebastian},
title = {{Packing a Knapsack of Unknown Capacity}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {276--287},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.276},
URN = {urn:nbn:de:0030-drops-44642},
doi = {10.4230/LIPIcs.STACS.2014.276},
annote = {Keywords: Knapsack, unknown capacity, robustness, approximation algorithms}
}
@InProceedings{drange_et_al:LIPIcs.STACS.2014.288,
author = {Drange, Pal Gronas and Fomin, Fedor V. and Pilipczuk, Michal and Villanger, Yngve},
title = {{Exploring Subexponential Parameterized Complexity of Completion Problems}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {288--299},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.288},
URN = {urn:nbn:de:0030-drops-44659},
doi = {10.4230/LIPIcs.STACS.2014.288},
annote = {Keywords: edge completion, modification, subexponential parameterized complexity}
}
@InProceedings{filmus_et_al:LIPIcs.STACS.2014.300,
author = {Filmus, Yuval and Lauria, Massimo and Miksa, Mladen and Nordstr\"{o}m, Jakob and Vinyals, Marc},
title = {{From Small Space to Small Width in Resolution}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {300--311},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.300},
URN = {urn:nbn:de:0030-drops-44661},
doi = {10.4230/LIPIcs.STACS.2014.300},
annote = {Keywords: proof complexity, resolution, width, space, polynomial calculus, PCR}
}
@InProceedings{garnero_et_al:LIPIcs.STACS.2014.312,
author = {Garnero, Valentin and Paul, Christophe and Sau, Ignasi and Thilikos, Dimitrios M.},
title = {{Explicit Linear Kernels via Dynamic Programming}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {312--324},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.312},
URN = {urn:nbn:de:0030-drops-44675},
doi = {10.4230/LIPIcs.STACS.2014.312},
annote = {Keywords: parameterized complexity, linear kernels, dynamic programming, protrusion replacement, graph minors}
}
@InProceedings{gavinsky_et_al:LIPIcs.STACS.2014.325,
author = {Gavinsky, Dmitry and Pudl\'{a}k, Pavel},
title = {{Partition Expanders}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {325--336},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.325},
URN = {urn:nbn:de:0030-drops-44684},
doi = {10.4230/LIPIcs.STACS.2014.325},
annote = {Keywords: partitions, expanders, communication, complexity}
}
@InProceedings{gawrychowski_et_al:LIPIcs.STACS.2014.337,
author = {Gawrychowski, Pawel and Manea, Florin and Nowotka, Dirk},
title = {{Testing Generalised Freeness of Words}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {337--349},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.337},
URN = {urn:nbn:de:0030-drops-44694},
doi = {10.4230/LIPIcs.STACS.2014.337},
annote = {Keywords: Stringology, Pattern matching, Repetition, Pseudo-repetition}
}
@InProceedings{gobel_et_al:LIPIcs.STACS.2014.350,
author = {G\"{o}bel, Andreas and Goldberg, Leslie Ann and Richerby, David},
title = {{Counting Homomorphisms to Cactus Graphs Modulo 2}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {350--361},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.350},
URN = {urn:nbn:de:0030-drops-44700},
doi = {10.4230/LIPIcs.STACS.2014.350},
annote = {Keywords: modular counting, homomorphisms, cactus graph, graph algorithms}
}
@InProceedings{hoyrup:LIPIcs.STACS.2014.362,
author = {Hoyrup, Mathieu},
title = {{Irreversible computable functions}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {362--373},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.362},
URN = {urn:nbn:de:0030-drops-44712},
doi = {10.4230/LIPIcs.STACS.2014.362},
annote = {Keywords: Computability theory, computable analysis, finite injury, generic set}
}
@InProceedings{huschenbett_et_al:LIPIcs.STACS.2014.374,
author = {Huschenbett, Martin and Kufleitner, Manfred},
title = {{Ehrenfeucht-Fra\"{i}ss\'{e} Games on Omega-Terms}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {374--385},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.374},
URN = {urn:nbn:de:0030-drops-44729},
doi = {10.4230/LIPIcs.STACS.2014.374},
annote = {Keywords: regular language, first-order logic, finite monoid, Ehrenfeucht-Fra\"{i}ss\'{e} games, pseudoidentity}
}
@InProceedings{i_et_al:LIPIcs.STACS.2014.386,
author = {I, Tomohiro and K\"{a}rkk\"{a}inen, Juha and Kempa, Dominik},
title = {{Faster Sparse Suffix Sorting}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {386--396},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.386},
URN = {urn:nbn:de:0030-drops-44738},
doi = {10.4230/LIPIcs.STACS.2014.386},
annote = {Keywords: string algorithms, sparse suffix sorting, sparse suffix trees, Karp-Rabin fingerprints, space-time tradeoffs}
}
@InProceedings{ivanyos_et_al:LIPIcs.STACS.2014.397,
author = {Ivanyos, G\'{a}bor and Karpinski, Marek and Qiao, Youming and Santha, Miklos},
title = {{Generalized Wong sequences and their applications to Edmonds' problems}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {397--408},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.397},
URN = {urn:nbn:de:0030-drops-44741},
doi = {10.4230/LIPIcs.STACS.2014.397},
annote = {Keywords: symbolic determinantal identity testing, Edmonds' problem, maximum rank matrix completion, derandomization, Wong sequences}
}
@InProceedings{iwama_et_al:LIPIcs.STACS.2014.409,
author = {Iwama, Kazuo and Nagao, Atsuki},
title = {{Read-Once Branching Programs for Tree Evaluation Problems}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {409--420},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.409},
URN = {urn:nbn:de:0030-drops-44756},
doi = {10.4230/LIPIcs.STACS.2014.409},
annote = {Keywords: Lower bounds, Branching Programs, Read-Once Branching Programs, Space Complexity, Combinatorics}
}
@InProceedings{jeandel:LIPIcs.STACS.2014.421,
author = {Jeandel, Emmanuel},
title = {{Computability of the entropy of one-tape Turing machines}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {421--432},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.421},
URN = {urn:nbn:de:0030-drops-44767},
doi = {10.4230/LIPIcs.STACS.2014.421},
annote = {Keywords: Turing Machines, Dynamical Systems, Entropy, Crossing Sequences, Automata}
}
@InProceedings{jelinek_et_al:LIPIcs.STACS.2014.433,
author = {Jelinek, Tomas and Klaas, Marcus and Sch\"{a}fer, Guido},
title = {{Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {433--444},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.433},
URN = {urn:nbn:de:0030-drops-44771},
doi = {10.4230/LIPIcs.STACS.2014.433},
annote = {Keywords: Network routing games, coordination mechanisms, network tolls, taxing subnetworks, heterogeneous players}
}
@InProceedings{jez_et_al:LIPIcs.STACS.2014.445,
author = {Jez, Artur and Lohrey, Markus},
title = {{Approximation of smallest linear tree grammar}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {445--457},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.445},
URN = {urn:nbn:de:0030-drops-44789},
doi = {10.4230/LIPIcs.STACS.2014.445},
annote = {Keywords: Grammar-based compression, Tree compression, Tree-grammars}
}
@InProceedings{kawarabayashi_et_al:LIPIcs.STACS.2014.458,
author = {Kawarabayashi, Ken-ichi and Thorup, Mikkel},
title = {{Coloring 3-colorable graphs with o(n^\{1/5\}) colors}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {458--469},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.458},
URN = {urn:nbn:de:0030-drops-44797},
doi = {10.4230/LIPIcs.STACS.2014.458},
annote = {Keywords: Approximation Algorithms, Graph Coloring}
}
@InProceedings{komm_et_al:LIPIcs.STACS.2014.470,
author = {Komm, Dennis and Kr\'{a}lovic, Rastislav and Kr\'{a}lovic, Richard and M\"{o}mke, Tobias},
title = {{Randomized Online Algorithms with High Probability Guarantees}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {470--481},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.470},
URN = {urn:nbn:de:0030-drops-44803},
doi = {10.4230/LIPIcs.STACS.2014.470},
annote = {Keywords: Online Algorithms, Randomization, High Probability}
}
@InProceedings{kothari:LIPIcs.STACS.2014.482,
author = {Kothari, Robin},
title = {{An optimal quantum algorithm for the oracle identification problem}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {482--493},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.482},
URN = {urn:nbn:de:0030-drops-44813},
doi = {10.4230/LIPIcs.STACS.2014.482},
annote = {Keywords: quantum algorithms, quantum query complexity, oracle identification}
}
@InProceedings{kotzing:LIPIcs.STACS.2014.494,
author = {K\"{o}tzing, Timo},
title = {{A Solution to Wiehagen's Thesis}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {494--505},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.494},
URN = {urn:nbn:de:0030-drops-44823},
doi = {10.4230/LIPIcs.STACS.2014.494},
annote = {Keywords: Algorithmic Learning Theory, Wiehagen's Thesis, Enumeration Learning}
}
@InProceedings{lewenstein_et_al:LIPIcs.STACS.2014.506,
author = {Lewenstein, Moshe and Nekrich, Yakov and Vitter, Jeffrey Scott},
title = {{Space-Efficient String Indexing for Wildcard Pattern Matching}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {506--517},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.506},
URN = {urn:nbn:de:0030-drops-44838},
doi = {10.4230/LIPIcs.STACS.2014.506},
annote = {Keywords: compressed data structures, compressed indexes, pattern matching}
}
@InProceedings{figueira_et_al:LIPIcs.STACS.2014.518,
author = {Figueira, Diego and Libkin, Leonid},
title = {{Synchronizing Relations on Words}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {518--529},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.518},
URN = {urn:nbn:de:0030-drops-44849},
doi = {10.4230/LIPIcs.STACS.2014.518},
annote = {Keywords: Word Relations, Regular, Rational, Recognizable}
}
@InProceedings{lohrey_et_al:LIPIcs.STACS.2014.530,
author = {Lohrey, Markus and Zetzsche, Georg},
title = {{On Boolean closed full trios and rational Kripke frames}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {530--541},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.530},
URN = {urn:nbn:de:0030-drops-44853},
doi = {10.4230/LIPIcs.STACS.2014.530},
annote = {Keywords: rational transductions, full trios, arithmetical hierarchy, Boolean operations}
}
@InProceedings{marx_et_al:LIPIcs.STACS.2014.542,
author = {Marx, D\'{a}niel and Pilipczuk, Michal},
title = {{Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {542--553},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.542},
URN = {urn:nbn:de:0030-drops-44863},
doi = {10.4230/LIPIcs.STACS.2014.542},
annote = {Keywords: parameterized complexity, subgraph isomorphism}
}
@InProceedings{mitchell_et_al:LIPIcs.STACS.2014.554,
author = {Mitchell, John C. and Zimmerman, Joe},
title = {{Data-Oblivious Data Structures}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {554--565},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.554},
URN = {urn:nbn:de:0030-drops-44876},
doi = {10.4230/LIPIcs.STACS.2014.554},
annote = {Keywords: Data-oblivious algorithms, Data-oblivious data structures, Oblivious RAM, Secure multi-party computation, Secure cloud computing}
}
@InProceedings{monin:LIPIcs.STACS.2014.566,
author = {Monin, Benoit},
title = {{Higher randomness and forcing with closed sets}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {566--577},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.566},
URN = {urn:nbn:de:0030-drops-44883},
doi = {10.4230/LIPIcs.STACS.2014.566},
annote = {Keywords: Effective descriptive set theory, Higher computability, Effective randomness, Genericity}
}
@InProceedings{mustafa_et_al:LIPIcs.STACS.2014.578,
author = {Mustafa, Nabil H. and Ray, Saurabh},
title = {{Near-Optimal Generalisations of a Theorem of Macbeath}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {578--589},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.578},
URN = {urn:nbn:de:0030-drops-44890},
doi = {10.4230/LIPIcs.STACS.2014.578},
annote = {Keywords: Epsilon Nets, Cuttings, Union Complexity, Geometric Set systems, Convex Geometry}
}
@InProceedings{nguyen_et_al:LIPIcs.STACS.2014.590,
author = {Nguyen, Dung T. and Selman, Alan L.},
title = {{Non-autoreducible Sets for NEXP}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {590--601},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.590},
URN = {urn:nbn:de:0030-drops-44903},
doi = {10.4230/LIPIcs.STACS.2014.590},
annote = {Keywords: Autoreducibility, NEXP, diagonalization, structural complexity}
}
@InProceedings{nies:LIPIcs.STACS.2014.602,
author = {Nies, Andr\'{e}},
title = {{Differentiability of polynomial time computable functions}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {602--613},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.602},
URN = {urn:nbn:de:0030-drops-44919},
doi = {10.4230/LIPIcs.STACS.2014.602},
annote = {Keywords: Polynomial time randomness, feasible analysis, differentiability, porosity}
}
@InProceedings{pierrot_et_al:LIPIcs.STACS.2014.614,
author = {Pierrot, Adeline and Rossin, Dominique},
title = {{2-Stack Sorting is polynomial}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {614--626},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.614},
URN = {urn:nbn:de:0030-drops-44927},
doi = {10.4230/LIPIcs.STACS.2014.614},
annote = {Keywords: permutation, stack, sort, NP-complete}
}
@InProceedings{scquizzato_et_al:LIPIcs.STACS.2014.627,
author = {Scquizzato, Michele and Silvestri, Francesco},
title = {{Communication Lower Bounds for Distributed-Memory Computations}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {627--638},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.627},
URN = {urn:nbn:de:0030-drops-44937},
doi = {10.4230/LIPIcs.STACS.2014.627},
annote = {Keywords: Communication, lower bounds, distributed memory, parallel algorithms, BSP}
}
@InProceedings{skutella_et_al:LIPIcs.STACS.2014.639,
author = {Skutella, Martin and Sviridenko, Maxim and Uetz, Marc},
title = {{Stochastic Scheduling on Unrelated Machines}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {639--650},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.639},
URN = {urn:nbn:de:0030-drops-44946},
doi = {10.4230/LIPIcs.STACS.2014.639},
annote = {Keywords: Stochastic Scheduling, Unrelated Machines, Approximation Algorithm}
}
@InProceedings{uppman:LIPIcs.STACS.2014.651,
author = {Uppman, Hannes},
title = {{Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {651--662},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.651},
URN = {urn:nbn:de:0030-drops-44956},
doi = {10.4230/LIPIcs.STACS.2014.651},
annote = {Keywords: Complexity, Optimisation, Constraint Satisfaction}
}
@InProceedings{watson:LIPIcs.STACS.2014.663,
author = {Watson, Thomas},
title = {{The Complexity of Deciding Statistical Properties of Samplable Distributions}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {663--674},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.663},
URN = {urn:nbn:de:0030-drops-44960},
doi = {10.4230/LIPIcs.STACS.2014.663},
annote = {Keywords: Complexity, statistical properties, samplable distributions}
}
@InProceedings{yamamoto_et_al:LIPIcs.STACS.2014.675,
author = {Yamamoto, Jun'ichi and I, Tomohiro and Bannai, Hideo and Inenaga, Shunsuke and Takeda, Masayuki},
title = {{Faster Compact On-Line Lempel-Ziv Factorization}},
booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)},
pages = {675--686},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-65-1},
ISSN = {1868-8969},
year = {2014},
volume = {25},
editor = {Mayr, Ernst W. and Portier, Natacha},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.675},
URN = {urn:nbn:de:0030-drops-44976},
doi = {10.4230/LIPIcs.STACS.2014.675},
annote = {Keywords: Lempel-Ziv Factorization, String Index}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing