Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/stacs/stacs2006.bht:"
@inproceedings{DBLP:conf/stacs/AgrawalS06, author = {Manindra Agrawal and Nitin Saxena}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Equivalence of F-Algebras and Cubic Forms}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {115--126}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_8}, doi = {10.1007/11672142\_8}, timestamp = {Wed, 19 May 2021 12:05:43 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AgrawalS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AlandDGMS06, author = {Sebastian Aland and Dominic Dumrauf and Martin Gairing and Burkhard Monien and Florian Schoppmann}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Exact Price of Anarchy for Polynomial Congestion Games}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {218--229}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_17}, doi = {10.1007/11672142\_17}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AlandDGMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AlbersF06, author = {Susanne Albers and Hiroshi Fujiwara}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Energy-Efficient Algorithms for Flow Time Minimization}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {621--633}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_51}, doi = {10.1007/11672142\_51}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AlbersF06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AmbainisS06, author = {Andris Ambainis and Robert Spalek}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Quantum Algorithms for Matching and Network Flows}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {172--183}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_13}, doi = {10.1007/11672142\_13}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AmbainisS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ArvindK06, author = {Vikraman Arvind and Johannes K{\"{o}}bler}, editor = {Bruno Durand and Wolfgang Thomas}, title = {On Hypergraph and Graph Isomorphism with Bounded Color Classes}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {384--395}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_31}, doi = {10.1007/11672142\_31}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ArvindK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AzarC06, author = {Yossi Azar and Yoel Chaiutin}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Optimal Node Routing}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {596--607}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_49}, doi = {10.1007/11672142\_49}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AzarC06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Barany06, author = {Vince B{\'{a}}r{\'{a}}ny}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Invariants of Automatic Presentations and Semi-synchronous Transductions}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {289--300}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_23}, doi = {10.1007/11672142\_23}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Barany06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BaranyLS06, author = {Vince B{\'{a}}r{\'{a}}ny and Christof L{\"{o}}ding and Olivier Serre}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Regularity Problems for Visibly Pushdown Languages}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {420--431}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_34}, doi = {10.1007/11672142\_34}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BaranyLS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BaulandHSS06, author = {Michael Bauland and Edith Hemaspaandra and Henning Schnoor and Ilka Schnoor}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Generalized Modal Satisfiability}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {500--511}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_41}, doi = {10.1007/11672142\_41}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BaulandHSS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BealP06, author = {Marie{-}Pierre B{\'{e}}al and Dominique Perrin}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Complete Codes in a Sofic Shift}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {127--136}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_9}, doi = {10.1007/11672142\_9}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BealP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BelalE06, author = {Ahmed A. Belal and Amr Elmasry}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {92--103}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_6}, doi = {10.1007/11672142\_6}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BelalE06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BerwangerDHK06, author = {Dietmar Berwanger and Anuj Dawar and Paul Hunter and Stephan Kreutzer}, editor = {Bruno Durand and Wolfgang Thomas}, title = {DAG-Width and Parity Games}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {524--536}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_43}, doi = {10.1007/11672142\_43}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/BerwangerDHK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Bialynicka-BirulaG06, author = {Iwona Bialynicka{-}Birula and Roberto Grossi}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Amortized Rigidness in Dynamic Cartesian Trees}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {80--91}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_5}, doi = {10.1007/11672142\_5}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Bialynicka-BirulaG06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BodirskyD06, author = {Manuel Bodirsky and V{\'{\i}}ctor Dalmau}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Datalog and Constraint Satisfaction with Infinite Templates}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {646--659}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_53}, doi = {10.1007/11672142\_53}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BodirskyD06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BuhrmanTU06, author = {Harry Buhrman and Leen Torenvliet and Falk Unger}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {455--468}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_37}, doi = {10.1007/11672142\_37}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BuhrmanTU06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChakaravarthyR06, author = {Venkatesan T. Chakaravarthy and Sambuddha Roy}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Oblivious Symmetric Alternation}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {230--241}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_18}, doi = {10.1007/11672142\_18}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ChakaravarthyR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChakrabartiBM06, author = {Amit Chakrabarti and Khanh Do Ba and S. Muthukrishnan}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Estimating Entropy and Entropy Norm on Data Streams}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {196--205}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_15}, doi = {10.1007/11672142\_15}, timestamp = {Fri, 07 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ChakrabartiBM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChatterjeeH06, author = {Krishnendu Chatterjee and Thomas A. Henzinger}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {512--523}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_42}, doi = {10.1007/11672142\_42}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ChatterjeeH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChatterjeeMH06, author = {Krishnendu Chatterjee and Rupak Majumdar and Thomas A. Henzinger}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Markov Decision Processes with Multiple Objectives}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {325--336}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_26}, doi = {10.1007/11672142\_26}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ChatterjeeMH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChristodoulouMS06, author = {George Christodoulou and Vahab S. Mirrokni and Anastasios Sidiropoulos}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Convergence and Approximation in Potential Games}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {349--360}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_28}, doi = {10.1007/11672142\_28}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ChristodoulouMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/CohenP06, author = {Reuven Cohen and David Peleg}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {549--560}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_45}, doi = {10.1007/11672142\_45}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/CohenP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DamianFO06, author = {Mirela Damian and Robin Y. Flatland and Joseph O'Rourke}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Grid Vertex-Unfolding Orthogonal Polyhedra}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {264--276}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_21}, doi = {10.1007/11672142\_21}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/DamianFO06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DiazT06, author = {Josep D{\'{\i}}az and Dimitrios M. Thilikos}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Fast FPT-Algorithms for Cleaning Grids}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {361--371}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_29}, doi = {10.1007/11672142\_29}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/DiazT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Doerr06, author = {Benjamin Doerr}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Generating Randomized Roundings with Cardinality Constraints and Derandomizations}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {571--583}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_47}, doi = {10.1007/11672142\_47}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Doerr06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DuttaR06, author = {Chinmoy Dutta and Jaikumar Radhakrishnan}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Tradeoffs in Depth-Two Superconcentrators}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {372--383}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_30}, doi = {10.1007/11672142\_30}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/DuttaR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ElbassioniM06, author = {Khaled M. Elbassioni and Nabil H. Mustafa}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Conflict-Free Colorings of Rectangles Ranges}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {254--263}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_20}, doi = {10.1007/11672142\_20}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ElbassioniM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/EngelfrietH06, author = {Joost Engelfriet and Hendrik Jan Hoogeboom}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Nested Pebbles and Transitive Closure}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {477--488}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_39}, doi = {10.1007/11672142\_39}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/EngelfrietH06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/EtessamiY06, author = {Kousha Etessami and Mihalis Yannakakis}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {634--645}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_52}, doi = {10.1007/11672142\_52}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/EtessamiY06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FagerbergPP06, author = {Rolf Fagerberg and Anna Pagh and Rasmus Pagh}, editor = {Bruno Durand and Wolfgang Thomas}, title = {External String Sorting: Faster and Cache-Oblivious}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {68--79}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_4}, doi = {10.1007/11672142\_4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/FagerbergPP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Finkel06, author = {Olivier Finkel}, editor = {Bruno Durand and Wolfgang Thomas}, title = {On the Accepting Power of 2-Tape B{\"{u}}chi Automata}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {301--312}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_24}, doi = {10.1007/11672142\_24}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Finkel06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Flajolet06, author = {Philippe Flajolet}, editor = {Bruno Durand and Wolfgang Thomas}, title = {The Ubiquitous Digital Tree}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {1--22}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_1}, doi = {10.1007/11672142\_1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Flajolet06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FortnowK06, author = {Lance Fortnow and Adam R. Klivans}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Linear Advice for Randomized Logarithmic Space}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {469--476}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_38}, doi = {10.1007/11672142\_38}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/FortnowK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FortnowLV06, author = {Lance Fortnow and Troy Lee and Nikolai K. Vereshchagin}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Kolmogorov Complexity with Error}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {137--148}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_10}, doi = {10.1007/11672142\_10}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/FortnowLV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Fotakis06, author = {Dimitris Fotakis}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Memoryless Facility Location in One Pass}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {608--620}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_50}, doi = {10.1007/11672142\_50}, timestamp = {Thu, 24 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/Fotakis06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Fu06, author = {Bin Fu}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Theory and Application of Width Bounded Geometric Separator}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {277--288}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_22}, doi = {10.1007/11672142\_22}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Fu06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GlasserPSZ06, author = {Christian Gla{\ss}er and Aduri Pavan and Alan L. Selman and Liyu Zhang}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Redundancy in Complete Sets}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {444--454}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_36}, doi = {10.1007/11672142\_36}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/GlasserPSZ06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GoldsteinK06, author = {Darin Goldstein and Kojiro Kobayashi}, editor = {Bruno Durand and Wolfgang Thomas}, title = {On the Complexity of the "Most General" Firing Squad Synchronization Problem}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {696--711}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_57}, doi = {10.1007/11672142\_57}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/GoldsteinK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GolovinGR06, author = {Daniel Golovin and Vineet Goyal and R. Ravi}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {206--217}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_16}, doi = {10.1007/11672142\_16}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/GolovinGR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/HealyV06, author = {Alexander Healy and Emanuele Viola}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {672--683}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_55}, doi = {10.1007/11672142\_55}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/HealyV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Hitchcock06, author = {John M. Hitchcock}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {408--419}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_33}, doi = {10.1007/11672142\_33}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Hitchcock06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ItkisL06, author = {Gene Itkis and Leonid A. Levin}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Flat Holonomies on Automata Networks}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {23--49}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_2}, doi = {10.1007/11672142\_2}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ItkisL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KhandekarP06, author = {Rohit Khandekar and Vinayaka Pandit}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Online Sorting Buffers on Line}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {584--595}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_48}, doi = {10.1007/11672142\_48}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KhandekarP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Kjos-HanssenMS06, author = {Bj{\o}rn Kjos{-}Hanssen and Wolfgang Merkle and Frank Stephan}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Kolmogorov Complexity and the Recursion Theorem}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {149--161}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_11}, doi = {10.1007/11672142\_11}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Kjos-HanssenMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Krieger06, author = {Dalia Krieger}, editor = {Bruno Durand and Wolfgang Thomas}, title = {On Critical Exponents in Fixed Points of Binary \emph{k}-Uniform Morphisms}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {104--114}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_7}, doi = {10.1007/11672142\_7}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Krieger06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Kuske06, author = {Dietrich Kuske}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Weighted Asynchronous Cellular Automata}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {684--695}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_56}, doi = {10.1007/11672142\_56}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Kuske06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/LimayeMS06, author = {Nutan Limaye and Meena Mahajan and Jayalal Sarma}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Evaluating Monotone Circuits on Cylinders, Planes and Tori}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {660--671}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_54}, doi = {10.1007/11672142\_54}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/LimayeMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Maurer06, author = {Ina M{\"{a}}urer}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Weighted Picture Automata and Weighted Logics}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {313--324}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_25}, doi = {10.1007/11672142\_25}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Maurer06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MolleRR06, author = {Daniel M{\"{o}}lle and Stefan Richter and Peter Rossmanith}, editor = {Bruno Durand and Wolfgang Thomas}, title = {A Faster Algorithm for the Steiner Tree Problem}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {561--570}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_46}, doi = {10.1007/11672142\_46}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/MolleRR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Muller-OlmPS06, author = {Markus M{\"{u}}ller{-}Olm and Michael Petter and Helmut Seidl}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Interprocedurally Analyzing Polynomial Identities}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {50--67}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_3}, doi = {10.1007/11672142\_3}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Muller-OlmPS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/PennaV06, author = {Paolo Penna and Carmine Ventre}, editor = {Bruno Durand and Wolfgang Thomas}, title = {The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {337--348}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_27}, doi = {10.1007/11672142\_27}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/PennaV06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Romashchenko06, author = {Andrei E. Romashchenko}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Reliable Computations Based on Locally Decodable Codes}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {537--548}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_44}, doi = {10.1007/11672142\_44}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Romashchenko06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/RoyS06, author = {Amitabha Roy and Howard Straubing}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Definability of Languages by Generalized First-Order Formulas over (N, +)}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {489--499}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_40}, doi = {10.1007/11672142\_40}, timestamp = {Tue, 26 Dec 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/RoyS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/RumyantsevU06, author = {Andrey Yu. Rumyantsev and M. A. Ushakov}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {396--407}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_32}, doi = {10.1007/11672142\_32}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/RumyantsevU06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Rytter06, author = {Wojciech Rytter}, editor = {Bruno Durand and Wolfgang Thomas}, title = {The Number of Runs in a String: Improved Analysis of the Linear Upper Bound}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {184--195}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_14}, doi = {10.1007/11672142\_14}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Rytter06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/SayagFM06, author = {Tzur Sayag and Shai Fine and Yishay Mansour}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Combining Multiple Heuristics}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {242--253}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_19}, doi = {10.1007/11672142\_19}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/SayagFM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Schnitger06, author = {Georg Schnitger}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Regular Expressions and NFAs Without \emph{epsilon}-Transitions}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {432--443}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_35}, doi = {10.1007/11672142\_35}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Schnitger06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Wehner06, author = {Stephanie Wehner}, editor = {Bruno Durand and Wolfgang Thomas}, title = {Entanglement in Interactive Proof Systems with Binary Answers}, booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, pages = {162--171}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142\_12}, doi = {10.1007/11672142\_12}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Wehner06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stacs/2006, editor = {Bruno Durand and Wolfgang Thomas}, title = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3884}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11672142}, doi = {10.1007/11672142}, isbn = {978-3-540-32301-3}, timestamp = {Wed, 19 May 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/2006.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.