Search dblp for Publications

export results for "toc:db/conf/stacs/stacs2005.bht:"

 download as .bib file

@inproceedings{DBLP:conf/stacs/AgrawalS05,
  author       = {Manindra Agrawal and
                  Nitin Saxena},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Automorphisms of Finite Rings and Applications to Complexity of Problems},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {1--17},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_1},
  doi          = {10.1007/978-3-540-31856-9\_1},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/AgrawalS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AilonC05,
  author       = {Nir Ailon and
                  Bernard Chazelle},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Information Theory in Property Testing and Monotonicity Testing in
                  Higher Dimension},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {434--447},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_36},
  doi          = {10.1007/978-3-540-31856-9\_36},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/AilonC05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AndelmanAS05,
  author       = {Nir Andelman and
                  Yossi Azar and
                  Motti Sorani},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Truthful Approximation Mechanisms for Scheduling Selfish Related Machines},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {69--82},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_6},
  doi          = {10.1007/978-3-540-31856-9\_6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/AndelmanAS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindV05,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {The Complexity of Solving Linear Equations over a Finite Ring},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {472--484},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_39},
  doi          = {10.1007/978-3-540-31856-9\_39},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/ArvindV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BansalP05,
  author       = {Nikhil Bansal and
                  Kirk Pruhs},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Speed Scaling to Manage Temperature},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {460--471},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_38},
  doi          = {10.1007/978-3-540-31856-9\_38},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/BansalP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaswanaGS05,
  author       = {Surender Baswana and
                  Vishrut Goyal and
                  Sandeep Sen},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {All-Pairs Nearly 2-Approximate Shortest-Paths in O(n\({}^{\mbox{2}}\)
                  polylog n) Time},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {666--679},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_55},
  doi          = {10.1007/978-3-540-31856-9\_55},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BaswanaGS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BenediktS05,
  author       = {Michael Benedikt and
                  Luc Segoufin},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Regular Tree Languages Definable in {FO}},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {327--339},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_27},
  doi          = {10.1007/978-3-540-31856-9\_27},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BenediktS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BerenbrinkFHM05,
  author       = {Petra Berenbrink and
                  Tom Friedetzky and
                  Zengjian Hu and
                  Russell A. Martin},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {On Weighted Balls-into-Bins Games},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {231--243},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_19},
  doi          = {10.1007/978-3-540-31856-9\_19},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BerenbrinkFHM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BerwangerL05,
  author       = {Dietmar Berwanger and
                  Giacomo Lenzi},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {The Variable Hierarchy of the {\(\mathrm{\mu}\)}-Calculus Is Strict},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {97--109},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_8},
  doi          = {10.1007/978-3-540-31856-9\_8},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BerwangerL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BienkowskiDK05,
  author       = {Marcin Bienkowski and
                  Miroslaw Dynia and
                  Miroslaw Korzeniowski},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Improved Algorithms for Dynamic Page Migration},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {365--376},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_30},
  doi          = {10.1007/978-3-540-31856-9\_30},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BienkowskiDK05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BiloFM05,
  author       = {Vittorio Bil{\`{o}} and
                  Michele Flammini and
                  Luca Moscardelli},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {On Nash Equilibria in Non-cooperative All-Optical Networks},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {448--459},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_37},
  doi          = {10.1007/978-3-540-31856-9\_37},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BiloFM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bodirsky05,
  author       = {Manuel Bodirsky},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {The Core of a Countably Categorical Structure},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {110--120},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_9},
  doi          = {10.1007/978-3-540-31856-9\_9},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Bodirsky05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BoseKMT05,
  author       = {Prosenjit Bose and
                  Evangelos Kranakis and
                  Pat Morin and
                  Yihui Tang},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Approximate Range Mode and Range Median Queries},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {377--388},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_31},
  doi          = {10.1007/978-3-540-31856-9\_31},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BoseKMT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bousquet-Melou05,
  author       = {Mireille Bousquet{-}M{\'{e}}lou},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Algebraic Generating Functions in Enumerative Combinatorics and Context-Free
                  Languages},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {18--35},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_2},
  doi          = {10.1007/978-3-540-31856-9\_2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Bousquet-Melou05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BrandesF05,
  author       = {Ulrik Brandes and
                  Daniel Fleischer},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Centrality Measures Based on Current Flow},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {533--544},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_44},
  doi          = {10.1007/978-3-540-31856-9\_44},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BrandesF05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BrazdilKS05,
  author       = {Tom{\'{a}}s Br{\'{a}}zdil and
                  Anton{\'{\i}}n Kucera and
                  Oldrich Strazovsk{\'{y}}},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {On the Decidability of Temporal Properties of Probabilistic Pushdown
                  Automata},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {145--157},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_12},
  doi          = {10.1007/978-3-540-31856-9\_12},
  timestamp    = {Fri, 30 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BrazdilKS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFNV05,
  author       = {Harry Buhrman and
                  Lance Fortnow and
                  Ilan Newman and
                  Nikolai K. Vereshchagin},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Increasing Kolmogorov Complexity},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {412--421},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_34},
  doi          = {10.1007/978-3-540-31856-9\_34},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BuhrmanFNV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanNRW05,
  author       = {Harry Buhrman and
                  Ilan Newman and
                  Hein R{\"{o}}hrig and
                  Ronald de Wolf},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Robust Polynomials and Quantum Algorithms},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {593--604},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_49},
  doi          = {10.1007/978-3-540-31856-9\_49},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BuhrmanNRW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BurderiR05,
  author       = {Fabio Burderi and
                  Antonio Restivo},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Varieties of Codes and Kraft Inequality},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {545--556},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_45},
  doi          = {10.1007/978-3-540-31856-9\_45},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BurderiR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChangKLP05,
  author       = {Gerard Jennhwa Chang and
                  Ton Kloks and
                  Jiping Liu and
                  Sheng{-}Lung Peng},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {The PIGs Full Monty - {A} Floor Show of Minimal Separators},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {521--532},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_43},
  doi          = {10.1007/978-3-540-31856-9\_43},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/ChangKLP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Chen05,
  author       = {Hubie Chen},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Quantified Constraint Satisfaction, Maximal Constraint Languages,
                  and Symmetric Polymorphisms},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {315--326},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_26},
  doi          = {10.1007/978-3-540-31856-9\_26},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Chen05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChenFKX05,
  author       = {Jianer Chen and
                  Henning Fernau and
                  Iyad A. Kanj and
                  Ge Xia},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Parametric Duality and Kernelization: Lower Bounds and Upper Bounds
                  on Kernel Size},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {269--280},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_22},
  doi          = {10.1007/978-3-540-31856-9\_22},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/ChenFKX05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DiazPSW05,
  author       = {Josep D{\'{\i}}az and
                  Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
                  Maria J. Serna and
                  Nicholas C. Wormald},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Connectivity for Wireless Agents Moving on a Cycle or Grid},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {353--364},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_29},
  doi          = {10.1007/978-3-540-31856-9\_29},
  timestamp    = {Thu, 11 Aug 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DiazPSW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Doerr05,
  author       = {Benjamin Doerr},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Roundings Respecting Hard Constraints},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {617--628},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_51},
  doi          = {10.1007/978-3-540-31856-9\_51},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Doerr05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DrineasKM05,
  author       = {Petros Drineas and
                  Ravi Kannan and
                  Michael W. Mahoney},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation
                  Algorithms},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {57--68},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_5},
  doi          = {10.1007/978-3-540-31856-9\_5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DrineasKM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DvorakJKKS05,
  author       = {Zdenek Dvor{\'{a}}k and
                  V{\'{\i}}t Jel{\'{\i}}nek and
                  Daniel Kr{\'{a}}l and
                  Jan Kyncl and
                  Michael E. Saks},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Three Optimal Algorithms for Balls of Three Colors},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {206--217},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_17},
  doi          = {10.1007/978-3-540-31856-9\_17},
  timestamp    = {Fri, 01 Dec 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/DvorakJKKS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EngebretsenH05,
  author       = {Lars Engebretsen and
                  Jonas Holmerin},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {More Efficient Queries in PCPs for {NP} and Improved Approximation
                  Hardness of Maximum {CSP}},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {194--205},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_16},
  doi          = {10.1007/978-3-540-31856-9\_16},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/EngebretsenH05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EtessamiY05,
  author       = {Kousha Etessami and
                  Mihalis Yannakakis},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Recursive Markov Chains, Stochastic Grammars, and Monotone Systems
                  of Nonlinear Equations},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {340--352},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_28},
  doi          = {10.1007/978-3-540-31856-9\_28},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/EtessamiY05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FlaxmanP05,
  author       = {Abraham Flaxman and
                  Bartosz Przydatek},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Solving Medium-Density Subset Sum Problems in Expected Polynomial
                  Time},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {305--314},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_25},
  doi          = {10.1007/978-3-540-31856-9\_25},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FlaxmanP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Franceschini05,
  author       = {Gianni Franceschini},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {629--640},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_52},
  doi          = {10.1007/978-3-540-31856-9\_52},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Franceschini05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Glasser05,
  author       = {Christian Gla{\ss}er},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Polylog-Time Reductions Decrease Dot-Depth},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {170--181},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_14},
  doi          = {10.1007/978-3-540-31856-9\_14},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Glasser05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GoldwurmL05,
  author       = {Massimiliano Goldwurm and
                  Violetta Lonati},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Pattern Occurrences in Multicomponent Models},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {680--692},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_56},
  doi          = {10.1007/978-3-540-31856-9\_56},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GoldwurmL05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GramlichS05,
  author       = {Gregor Gramlich and
                  Georg Schnitger},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Minimizing NFA's and Regular Expressions},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {399--411},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_33},
  doi          = {10.1007/978-3-540-31856-9\_33},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GramlichS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GudmundssonNS05,
  author       = {Joachim Gudmundsson and
                  Giri Narasimhan and
                  Michiel H. M. Smid},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Fast Pruning of Geometric Spanners},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {508--520},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_42},
  doi          = {10.1007/978-3-540-31856-9\_42},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GudmundssonNS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GutoskiW05,
  author       = {Gus Gutoski and
                  John Watrous},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Quantum Interactive Proofs with Competing Provers},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {605--616},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_50},
  doi          = {10.1007/978-3-540-31856-9\_50},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GutoskiW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HararySV05,
  author       = {Frank Harary and
                  Wolfgang Slany and
                  Oleg Verbitsky},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {On the Computational Complexity of the Forcing Chromatic Number},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {182--193},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_15},
  doi          = {10.1007/978-3-540-31856-9\_15},
  timestamp    = {Thu, 13 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/HararySV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ImmorlicaMM05,
  author       = {Nicole Immorlica and
                  Mohammad Mahdian and
                  Vahab S. Mirrokni},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Cycle Cover with Short Cycles},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {641--653},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_53},
  doi          = {10.1007/978-3-540-31856-9\_53},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/ImmorlicaMM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jeandel05,
  author       = {Emmanuel Jeandel},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Topological Automata},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {389--398},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_32},
  doi          = {10.1007/978-3-540-31856-9\_32},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Jeandel05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KahlerKW05,
  author       = {Detlef K{\"{a}}hler and
                  Ralf K{\"{u}}sters and
                  Thomas Wilke},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Deciding Properties of Contract-Signing Protocols},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {158--169},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_13},
  doi          = {10.1007/978-3-540-31856-9\_13},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KahlerKW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kaminski05,
  author       = {Michael Kaminski},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {A Lower Bound on the Complexity of Polynomial Multiplication Over
                  Finite Fields},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {485--495},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_40},
  doi          = {10.1007/978-3-540-31856-9\_40},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Kaminski05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KavithaM05,
  author       = {Telikepalli Kavitha and
                  Kurt Mehlhorn},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {654--665},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_54},
  doi          = {10.1007/978-3-540-31856-9\_54},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KavithaM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KrebsLR05,
  author       = {Andreas Krebs and
                  Klaus{-}J{\"{o}}rn Lange and
                  Stephanie Reifferscheid},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Characterizing TC\({}^{\mbox{0}}\) in Terms of Infinite Groups},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {496--507},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_41},
  doi          = {10.1007/978-3-540-31856-9\_41},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KrebsLR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kunc05,
  author       = {Michal Kunc},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {The Power of Commuting with Finite Sets of Words},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {569--580},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_47},
  doi          = {10.1007/978-3-540-31856-9\_47},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Kunc05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LiSW05,
  author       = {Xiang{-}Yang Li and
                  Zheng Sun and
                  Weizhao Wang},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Cost Sharing and Strategyproof Mechanisms for Set Cover Games},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {218--230},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_18},
  doi          = {10.1007/978-3-540-31856-9\_18},
  timestamp    = {Fri, 27 Oct 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/LiSW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MalajovichM05,
  author       = {Gregorio Malajovich and
                  Klaus Meer},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Computing Minimal Multi-homogeneous B{\'{e}}zout Numbers Is Hard},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {244--255},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_20},
  doi          = {10.1007/978-3-540-31856-9\_20},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/MalajovichM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MerkleMNRS05,
  author       = {Wolfgang Merkle and
                  Joseph S. Miller and
                  Andr{\'{e}} Nies and
                  Jan Reimann and
                  Frank Stephan},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Kolmogorov-Loveland Randomness and Stochasticity},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {422--433},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_35},
  doi          = {10.1007/978-3-540-31856-9\_35},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/MerkleMNRS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/OliverT05,
  author       = {Graham P. Oliver and
                  Richard M. Thomas},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Automatic Presentations for Finitely Generated Groups},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {693--704},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_57},
  doi          = {10.1007/978-3-540-31856-9\_57},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/OliverT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Poupet05,
  author       = {Victor Poupet},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {133--144},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_11},
  doi          = {10.1007/978-3-540-31856-9\_11},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Poupet05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RomT05,
  author       = {Eran Rom and
                  Amnon Ta{-}Shma},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Improving the Alphabet-Size in High Noise, Almost Optimal Rate List
                  Decodable Codes},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {557--568},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_46},
  doi          = {10.1007/978-3-540-31856-9\_46},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/RomT05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RoyDN05,
  author       = {Sasanka Roy and
                  Sandip Das and
                  Subhas C. Nandy},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Shortest Monotone Descent Path Problem in Polyhedral Terrain},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {281--292},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_23},
  doi          = {10.1007/978-3-540-31856-9\_23},
  timestamp    = {Sun, 24 Sep 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/RoyDN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schmidt05,
  author       = {Markus Schmidt},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Packet Buffering: Randomization Beats Deterministic Algorithms},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {293--304},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_24},
  doi          = {10.1007/978-3-540-31856-9\_24},
  timestamp    = {Mon, 11 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/Schmidt05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schoning05,
  author       = {Uwe Sch{\"{o}}ning},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Algorithmics in Exponential Time},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {36--43},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_3},
  doi          = {10.1007/978-3-540-31856-9\_3},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Schoning05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/TaniKM05,
  author       = {Seiichiro Tani and
                  Hirotada Kobayashi and
                  Keiji Matsumoto},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Exact Quantum Algorithms for the Leader Election Problem},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {581--592},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_48},
  doi          = {10.1007/978-3-540-31856-9\_48},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/TaniKM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Tendera05,
  author       = {Lidia Tendera},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Counting in the Two Variable Guarded Logic with Transitivity},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {83--96},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_7},
  doi          = {10.1007/978-3-540-31856-9\_7},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Tendera05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Theyssier05,
  author       = {Guillaume Theyssier},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {How Common Can Be Universality for Cellular Automata?},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {121--132},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_10},
  doi          = {10.1007/978-3-540-31856-9\_10},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Theyssier05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/WeberS05,
  author       = {Volker Weber and
                  Thomas Schwentick},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Dynamic Complexity Theory Revisited},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {256--268},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_21},
  doi          = {10.1007/978-3-540-31856-9\_21},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/WeberS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Witt05,
  author       = {Carsten Witt},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {Worst-Case and Average-Case Approximations by Simple Randomized Search
                  Heuristics},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {44--56},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_4},
  doi          = {10.1007/978-3-540-31856-9\_4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Witt05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2005,
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/b106485},
  doi          = {10.1007/B106485},
  isbn         = {3-540-24998-2},
  timestamp    = {Wed, 19 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/2005.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics