Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/stacs/stacs2012.bht:"
download as .bib file
@inproceedings{DBLP:conf/stacs/Ambainis12,
author = {Andris Ambainis},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Variable time amplitude amplification and quantum algorithms for linear
algebra problems},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {636--647},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.636},
doi = {10.4230/LIPICS.STACS.2012.636},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Ambainis12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArnoldMN12,
author = {Andr{\'{e}} Arnold and
Henryk Michalewski and
Damian Niwinski},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {On the separation question for tree languages},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {396--407},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.396},
doi = {10.4230/LIPICS.STACS.2012.396},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArnoldMN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BabaiQ12,
author = {L{\'{a}}szl{\'{o}} Babai and
Youming Qiao},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {453--464},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.453},
doi = {10.4230/LIPICS.STACS.2012.453},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BabaiQ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BartschiS12,
author = {Andreas B{\"{a}}rtschi and
Subhash Suri},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Conflict-free Chromatic Art Gallery Coverage},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {160--171},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.160},
doi = {10.4230/LIPICS.STACS.2012.160},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BartschiS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BassinoDS12,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Julien David and
Andrea Sportiello},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Asymptotic enumeration of Minimal Automata},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {88--99},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.88},
doi = {10.4230/LIPICS.STACS.2012.88},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BassinoDS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BienvenuHMN12,
author = {Laurent Bienvenu and
Rupert H{\"{o}}lzl and
Joseph S. Miller and
Andr{\'{e}} Nies},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {The Denjoy alternative for computable functions},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {543--554},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.543},
doi = {10.4230/LIPICS.STACS.2012.543},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BienvenuHMN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BojanczykT12,
author = {Mikolaj Bojanczyk and
Szymon Torunczyk},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Weak {MSO+U} over infinite trees},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {648--660},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.648},
doi = {10.4230/LIPICS.STACS.2012.648},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BojanczykT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bonsma12,
author = {Paul S. Bonsma},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Surface Split Decompositions and Subgraph Isomorphism in Graphs on
Surfaces},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {531--542},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.531},
doi = {10.4230/LIPICS.STACS.2012.531},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bonsma12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BrazdilK12,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
Stefan Kiefer},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Stabilization of Branching Queueing Networks},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {507--518},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.507},
doi = {10.4230/LIPICS.STACS.2012.507},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BrazdilK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Broadbent12,
author = {Christopher H. Broadbent},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {The Limits of Decidability for First Order Logic on {CPDA} Graphs},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {589--600},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.589},
doi = {10.4230/LIPICS.STACS.2012.589},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Broadbent12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BrodalK12,
author = {Gerth St{\o}lting Brodal and
Casper Kejlberg{-}Rasmussen},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set
Property},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {112--123},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.112},
doi = {10.4230/LIPICS.STACS.2012.112},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BrodalK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BulatovDGJ12,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Log-supermodular functions, functional clones and counting CSPs},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {302--313},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.302},
doi = {10.4230/LIPICS.STACS.2012.302},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BulatovDGJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CarayolN12,
author = {Arnaud Carayol and
Cyril Nicaud},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Distribution of the number of accessible states in a random deterministic
automaton},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {194--205},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.194},
doi = {10.4230/LIPICS.STACS.2012.194},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CarayolN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChanDLMW12,
author = {Timothy M. Chan and
Stephane Durocher and
Kasper Green Larsen and
Jason Morrison and
Bryan T. Wilkinson},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Linear-Space Data Structures for Range Mode Query in Arrays},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {290--301},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.290},
doi = {10.4230/LIPICS.STACS.2012.290},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ChanDLMW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Chen12,
author = {Ning Chen},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {On Computing Pareto Stable Assignments},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {384--395},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.384},
doi = {10.4230/LIPICS.STACS.2012.384},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Chen12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChungLLM12,
author = {Kai{-}Min Chung and
Henry Lam and
Zhenming Liu and
Michael Mitzenmacher},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {124--135},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.124},
doi = {10.4230/LIPICS.STACS.2012.124},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChungLLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Colcombet12,
author = {Thomas Colcombet},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Forms of Determinism for Automata (Invited Talk)},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {1--23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.1},
doi = {10.4230/LIPICS.STACS.2012.1},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Colcombet12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DattaGKT12,
author = {Samir Datta and
Arjun Gopalan and
Raghav Kulkarni and
Raghunath Tewari},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Improved Bounds for Bipartite Matching on Surfaces},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {254--265},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.254},
doi = {10.4230/LIPICS.STACS.2012.254},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DattaGKT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DiekertLU12,
author = {Volker Diekert and
J{\"{u}}rn Laun and
Alexander Ushakov},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Efficient algorithms for highly compressed data: The Word Problem
in Higman's group is in {P}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {218--229},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.218},
doi = {10.4230/LIPICS.STACS.2012.218},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DiekertLU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Dietzfelbinger12,
author = {Martin Dietzfelbinger},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {On Randomness in Hash Functions (Invited Talk)},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {25--28},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.25},
doi = {10.4230/LIPICS.STACS.2012.25},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Dietzfelbinger12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DoerrW12,
author = {Benjamin Doerr and
Carola Winzen},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Playing Mastermind With Constant-Size Memory},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {441--452},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.441},
doi = {10.4230/LIPICS.STACS.2012.441},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DoerrW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Durand-GasselinH12,
author = {Antoine Durand{-}Gasselin and
Peter Habermehl},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Ehrenfeucht-Fra{\"{\i}}ss{\'{e}} goes elementarily automatic
for structures of bounded degree},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {242--253},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.242},
doi = {10.4230/LIPICS.STACS.2012.242},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Durand-GasselinH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DurrW12,
author = {Christoph D{\"{u}}rr and
Thomas Wilke},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Frontmatter, Foreword, Conference Organization, External Reviewers,
Table of Contents},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.i},
doi = {10.4230/LIPICS.STACS.2012.I},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DurrW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EggermontW12,
author = {Christian Eggermont and
Gerhard J. Woeginger},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Motion planning with pulley, rope, and baskets},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {374--383},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.374},
doi = {10.4230/LIPICS.STACS.2012.374},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EggermontW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ElberfeldJT12,
author = {Michael Elberfeld and
Andreas Jakoby and
Till Tantau},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic
Depth},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {66--77},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.66},
doi = {10.4230/LIPICS.STACS.2012.66},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ElberfeldJT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FeldmannF12,
author = {Andreas Emil Feldmann and
Luca Foschini},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Balanced Partitions of Trees and Applications},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {100--111},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.100},
doi = {10.4230/LIPICS.STACS.2012.100},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FeldmannF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FilmusW12,
author = {Yuval Filmus and
Justin Ward},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {The Power of Local Search: Maximum Coverage over a Matroid},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {601--612},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.601},
doi = {10.4230/LIPICS.STACS.2012.601},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FilmusW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Finkel12,
author = {Olivier Finkel},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {The Determinacy of Context-Free Games},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {555--566},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.555},
doi = {10.4230/LIPICS.STACS.2012.555},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Finkel12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FominG12,
author = {Fedor V. Fomin and
Petr A. Golovach},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Parameterized Complexity of Connected Even/Odd Subgraph Problems},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {432--440},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.432},
doi = {10.4230/LIPICS.STACS.2012.432},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FominG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FournierMM12,
author = {Herv{\'{e}} Fournier and
Guillaume Malod and
Stefan Mengel},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Monomials in arithmetic circuits: Complete problems in the counting
hierarchy},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {362--373},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.362},
doi = {10.4230/LIPICS.STACS.2012.362},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FournierMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GanianHLOR12,
author = {Robert Ganian and
Petr Hlinen{\'{y}} and
Alexander Langer and
Jan Obdrz{\'{a}}lek and
Peter Rossmanith and
Somnath Sikdar},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Lower Bounds on the Complexity of MSO{\_}1 Model-Checking},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {326--337},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.326},
doi = {10.4230/LIPICS.STACS.2012.326},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GanianHLOR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Gawrychowski12,
author = {Pawel Gawrychowski},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Tying up the loose ends in fully LZW-compressed pattern matching},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {624--635},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.624},
doi = {10.4230/LIPICS.STACS.2012.624},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Gawrychowski12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GiakkoupisSSW12,
author = {George Giakkoupis and
Thomas Sauerwald and
He Sun and
Philipp Woelfel},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Low Randomness Rumor Spreading via Hashing},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {314--325},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.314},
doi = {10.4230/LIPICS.STACS.2012.314},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GiakkoupisSSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Goldwasser12,
author = {Shafi Goldwasser},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Pseudo-deterministic Algorithms (Invited Talk)},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {29--29},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.29},
doi = {10.4230/LIPICS.STACS.2012.29},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Goldwasser12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GollerL12,
author = {Stefan G{\"{o}}ller and
Anthony Widjaja Lin},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Concurrency Makes Simple Theories Hard},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {148--159},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.148},
doi = {10.4230/LIPICS.STACS.2012.148},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GollerL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HarwathS12,
author = {Frederik Harwath and
Nicole Schweikardt},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Regular tree languages, cardinality predicates, and addition-invariant
{FO}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {489--500},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.489},
doi = {10.4230/LIPICS.STACS.2012.489},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HarwathS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hoyrup12,
author = {Mathieu Hoyrup},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {The dimension of ergodic random sequences},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {567--576},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.567},
doi = {10.4230/LIPICS.STACS.2012.567},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hoyrup12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ImSZ12,
author = {Sungjin Im and
Maxim Sviridenko and
Ruben van der Zwaan},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Preemptive and Non-Preemptive Generalized Min Sum Set Cover},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {465--476},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.465},
doi = {10.4230/LIPICS.STACS.2012.465},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ImSZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JainK12,
author = {Sanjay Jain and
Efim B. Kinber},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Mind Change Speed-up for Learning Languages from Positive Data},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {350--361},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.350},
doi = {10.4230/LIPICS.STACS.2012.350},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JainK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenS12,
author = {Maurice J. Jansen and
Rahul Santhanam},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Stronger Lower Bounds and Randomness-Hardness Trade-Offs Using Associated
Algebraic Complexity Classes},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {519--530},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.519},
doi = {10.4230/LIPICS.STACS.2012.519},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JansenS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jez12,
author = {Artur Jez},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Compressed Membership for {NFA} {(DFA)} with Compressed Labels is
in {NP} {(P)}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {136--147},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.136},
doi = {10.4230/LIPICS.STACS.2012.136},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jez12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KaminskiT12,
author = {Marcin Kaminski and
Dimitrios M. Thilikos},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Contraction checking in graphs on surfaces},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {182--193},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.182},
doi = {10.4230/LIPICS.STACS.2012.182},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KaminskiT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KawarabayashiK12,
author = {Ken{-}ichi Kawarabayashi and
Yusuke Kobayashi},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Edge-disjoint Odd Cycles in 4-edge-connected Graphs},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {206--217},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.206},
doi = {10.4230/LIPICS.STACS.2012.206},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KawarabayashiK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KawarabayashiK12a,
author = {Ken{-}ichi Kawarabayashi and
Yusuke Kobayashi},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Linear min-max relation between the treewidth of H-minor-free graphs
and its largest grid},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {278--289},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.278},
doi = {10.4230/LIPICS.STACS.2012.278},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KawarabayashiK12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KimuraM12,
author = {Kei Kimura and
Kazuhisa Makino},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Trichotomy for Integer Linear Systems Based on Their Sign Patterns},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {613--623},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.613},
doi = {10.4230/LIPICS.STACS.2012.613},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KimuraM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KoutisLP12,
author = {Ioannis Koutis and
Alex Levin and
Richard Peng},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Improved Spectral Sparsification and Numerical Algorithms for {SDD}
Matrices},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {266--277},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.266},
doi = {10.4230/LIPICS.STACS.2012.266},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KoutisLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MerkleT12,
author = {Wolfgang Merkle and
Jason Teutsch},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Constant compression and random weights},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {172--181},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.172},
doi = {10.4230/LIPICS.STACS.2012.172},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MerkleT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MitscheP12,
author = {Dieter Mitsche and
Guillem Perarnau},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {On the treewidth and related parameters of random geometric graphs},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {408--419},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.408},
doi = {10.4230/LIPICS.STACS.2012.408},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MitscheP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Mucha12,
author = {Marcin Mucha},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {13/9-approximation for Graphic {TSP}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {30--41},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.30},
doi = {10.4230/LIPICS.STACS.2012.30},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Mucha12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NarayanaswamyRRS12,
author = {N. S. Narayanaswamy and
Venkatesh Raman and
M. S. Ramanujan and
Saket Saurabh},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {{LP} can be a cure for Parameterized Problems},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {338--349},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.338},
doi = {10.4230/LIPICS.STACS.2012.338},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/NarayanaswamyRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NgoPR12,
author = {Hung Q. Ngo and
Ely Porat and
Atri Rudra},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Efficiently Decodable Compressed Sensing by List-Recoverable Codes
and Recursion},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {230--241},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.230},
doi = {10.4230/LIPICS.STACS.2012.230},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/NgoPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/PaluchEZ12,
author = {Katarzyna E. Paluch and
Khaled M. Elbassioni and
Anke van Zuylen},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Simpler Approximation of the Maximum Asymmetric Traveling Salesman
Problem},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {501--506},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.501},
doi = {10.4230/LIPICS.STACS.2012.501},
timestamp = {Thu, 20 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/PaluchEZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Parys12,
author = {Pawel Parys},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {A Pumping Lemma for Pushdown Graphs of Any Level},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {54--65},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.54},
doi = {10.4230/LIPICS.STACS.2012.54},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Parys12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ravi12,
author = {R. Ravi},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Iterative Methods in Combinatorial Optimization (Invited Talk)},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {24--24},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.24},
doi = {10.4230/LIPICS.STACS.2012.24},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ravi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SunW12,
author = {Xiaoming Sun and
Chengu Wang},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Randomized Communication Complexity for Linear Algebra Problems over
Finite Fields},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {477--488},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.477},
doi = {10.4230/LIPICS.STACS.2012.477},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SunW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Thurley12,
author = {Marc Thurley},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {An Approximation Algorithm for {\#}k-SAT},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {78--87},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.78},
doi = {10.4230/LIPICS.STACS.2012.78},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Thurley12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ward12,
author = {Justin Ward},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {A (k+3)/2-approximation algorithm for monotone submodular k-set packing
and general k-exchange systems},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {42--53},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.42},
doi = {10.4230/LIPICS.STACS.2012.42},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ward12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Witt12,
author = {Carsten Witt},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Optimizing Linear Functions with Randomized Search Heuristics - The
Robustness of Mutation},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {420--431},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.420},
doi = {10.4230/LIPICS.STACS.2012.420},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Witt12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ZaidGK12,
author = {Faried Abu Zaid and
Erich Gr{\"{a}}del and
Lukasz Kaiser},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {The Field of Reals is not omega-Automatic},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {577--588},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.577},
doi = {10.4230/LIPICS.STACS.2012.577},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ZaidGK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2012,
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {http://drops.dagstuhl.de/portals/extern/index.php?semnr=12001},
isbn = {978-3-939897-35-4},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-30 14:59 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
