default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/stacs/stacs2000.bht:"
download as .bib file
@inproceedings{DBLP:conf/stacs/AcetoEI00,
author = {Luca Aceto and
Zolt{\'{a}}n {\'{E}}sik and
Anna Ing{\'{o}}lfsd{\'{o}}ttir},
editor = {Horst Reichel and
Sophie Tison},
title = {On the Two-Variable Fragment of the Equational Theory of the Max-Sum
Algebra of the Natural Numbers},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {267--278},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_22},
doi = {10.1007/3-540-46541-3\_22},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AcetoEI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Al-AmmalGM00,
author = {Hesham Al{-}Ammal and
Leslie Ann Goldberg and
Philip D. MacKenzie},
editor = {Horst Reichel and
Sophie Tison},
title = {Binary Exponential Backoff Is Stable for High Arrival Rates},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {169--180},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_14},
doi = {10.1007/3-540-46541-3\_14},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Al-AmmalGM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AllenderM00,
author = {Eric Allender and
Meena Mahajan},
editor = {Horst Reichel and
Sophie Tison},
title = {The Complexity of Planarity Testing},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {87--98},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_7},
doi = {10.1007/3-540-46541-3\_7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AllenderM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AmbainisW00,
author = {Andris Ambainis and
Ronald de Wolf},
editor = {Horst Reichel and
Sophie Tison},
title = {Average-Case Quantum Query Complexity},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {133--144},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_11},
doi = {10.1007/3-540-46541-3\_11},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbainisW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-SpiesMRT00,
author = {Klaus Ambos{-}Spies and
Wolfgang Merkle and
Jan Reimann and
Sebastiaan Terwijn},
editor = {Horst Reichel and
Sophie Tison},
title = {Almost Complete Sets},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {419--430},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_35},
doi = {10.1007/3-540-46541-3\_35},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-SpiesMRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindK00,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler},
editor = {Horst Reichel and
Sophie Tison},
title = {Graph Isomorphism Is Low for {ZPP(NP)} and Other Lowness Results},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {431--442},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_36},
doi = {10.1007/3-540-46541-3\_36},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArvindK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindKMT00,
author = {Vikraman Arvind and
Johannes K{\"{o}}bler and
Martin Mundhenk and
Jacobo Tor{\'{a}}n},
editor = {Horst Reichel and
Sophie Tison},
title = {Nondeterministic Instance Complexity and Hard-to-Prove Tautologies},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {314--323},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_26},
doi = {10.1007/3-540-46541-3\_26},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArvindKMT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AscheuerKR00,
author = {Norbert Ascheuer and
Sven Oliver Krumke and
J{\"{o}}rg Rambau},
editor = {Horst Reichel and
Sophie Tison},
title = {Online Dial-a-Ride Problems: Minimizing the Completion Time},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {639--650},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_53},
doi = {10.1007/3-540-46541-3\_53},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AscheuerKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BampisGK00,
author = {Evripidis Bampis and
Rodolphe Giroudeau and
Jean{-}Claude K{\"{o}}nig},
editor = {Horst Reichel and
Sophie Tison},
title = {An Approximation Algorithm for the Precedence Constrained Scheduling
Problem with Hierarchical Communications},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {443--454},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_37},
doi = {10.1007/3-540-46541-3\_37},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BampisGK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BartalK00,
author = {Yair Bartal and
Elias Koutsoupias},
editor = {Horst Reichel and
Sophie Tison},
title = {On the Competitive Ratio of the Work Function Algorithm for the k-Server
Problem},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {605--613},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_50},
doi = {10.1007/3-540-46541-3\_50},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BartalK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BertoniGS00,
author = {Alberto Bertoni and
Massimiliano Goldwurm and
Massimo Santini},
editor = {Horst Reichel and
Sophie Tison},
title = {Random Generation and Approximate Counting of Ambiguously Described
Combinatorial Structures},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {567--580},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_47},
doi = {10.1007/3-540-46541-3\_47},
timestamp = {Tue, 02 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BertoniGS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BlondelBKT00,
author = {Vincent D. Blondel and
Olivier Bournez and
Pascal Koiran and
John N. Tsitsiklis},
editor = {Horst Reichel and
Sophie Tison},
title = {The Stability of Saturated Linear Dynamical Systems Is Undecidable},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {479--490},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_40},
doi = {10.1007/3-540-46541-3\_40},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BlondelBKT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BockenhauerHKSU00,
author = {Hans{-}Joachim B{\"{o}}ckenhauer and
Juraj Hromkovic and
Ralf Klasing and
Sebastian Seibert and
Walter Unger},
editor = {Horst Reichel and
Sophie Tison},
title = {An Improved Lower Bound on the Approximability of Metric {TSP} and
Approximation Algorithms for the {TSP} with Sharpened Triangle Inequality},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {382--394},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_32},
doi = {10.1007/3-540-46541-3\_32},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BockenhauerHKSU00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderKTL00,
author = {Hans L. Bodlaender and
Ton Kloks and
Richard B. Tan and
Jan van Leeuwen},
editor = {Horst Reichel and
Sophie Tison},
title = {lambda-Coloring of Graphs},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {395--406},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_33},
doi = {10.1007/3-540-46541-3\_33},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderKTL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BonisS00,
author = {Annalisa De Bonis and
Alfredo De Santis},
editor = {Horst Reichel and
Sophie Tison},
title = {Randomness in Visual Cryptography},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {626--638},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_52},
doi = {10.1007/3-540-46541-3\_52},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BonisS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BouchitteT00,
author = {Vincent Bouchitt{\'{e}} and
Ioan Todinca},
editor = {Horst Reichel and
Sophie Tison},
title = {Listing All Potential Maximal Cliques of a Graph},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {503--515},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_42},
doi = {10.1007/3-540-46541-3\_42},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BouchitteT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFFM00,
author = {Harry Buhrman and
Stephen A. Fenner and
Lance Fortnow and
Dieter van Melkebeek},
editor = {Horst Reichel and
Sophie Tison},
title = {Optimal Proof Systems and Sparse Sets},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {407--418},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_34},
doi = {10.1007/3-540-46541-3\_34},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanFFM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CervelleD00,
author = {Julien Cervelle and
Bruno Durand},
editor = {Horst Reichel and
Sophie Tison},
title = {Tilings: Recursivity and Regularity},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {491--502},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_41},
doi = {10.1007/3-540-46541-3\_41},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CervelleD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ChrobakS00,
author = {Marek Chrobak and
Jir{\'{\i}} Sgall},
editor = {Horst Reichel and
Sophie Tison},
title = {The Weighted 2-Server Problem},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {593--604},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_49},
doi = {10.1007/3-540-46541-3\_49},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ChrobakS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ClementiPS00,
author = {Andrea E. F. Clementi and
Paolo Penna and
Riccardo Silvestri},
editor = {Horst Reichel and
Sophie Tison},
title = {The Power Range Assignment Problem in Radio Networks on the Plane},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {651--660},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_54},
doi = {10.1007/3-540-46541-3\_54},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ClementiPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DeshmukhSDR00,
author = {Kaustubh Deshmukh and
Priti Shankar and
Amitava Dasgupta and
B. Sundar Rajan},
editor = {Horst Reichel and
Sophie Tison},
title = {On the Many Faces of Block Codes},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {53--64},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_4},
doi = {10.1007/3-540-46541-3\_4},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DeshmukhSDR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Dima00,
author = {Catalin Dima},
editor = {Horst Reichel and
Sophie Tison},
title = {Real-Time Automata and the Kleene Algebra of Sets of Real Numbers},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {279--289},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_23},
doi = {10.1007/3-540-46541-3\_23},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Dima00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EdelkampW00,
author = {Stefan Edelkamp and
Ingo Wegener},
editor = {Horst Reichel and
Sophie Tison},
title = {On the Performance of {WEAK-HEAPSORT}},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {254--266},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_21},
doi = {10.1007/3-540-46541-3\_21},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EdelkampW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ElkinP00,
author = {Michael Elkin and
David Peleg},
editor = {Horst Reichel and
Sophie Tison},
title = {The Hardness of Approximating Spanner Problems},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {370--381},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_31},
doi = {10.1007/3-540-46541-3\_31},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ElkinP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EngelfrietM00,
author = {Joost Engelfriet and
Sebastian Maneth},
editor = {Horst Reichel and
Sophie Tison},
title = {Characterizing and Deciding MSO-Definability of Macro Tree Transductions},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {542--554},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_45},
doi = {10.1007/3-540-46541-3\_45},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EngelfrietM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FinkelS00,
author = {Alain Finkel and
Gr{\'{e}}goire Sutre},
editor = {Horst Reichel and
Sophie Tison},
title = {Decidability of Reachability Problems for Classes of Two Counters
Automata},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {346--357},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_29},
doi = {10.1007/3-540-46541-3\_29},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FinkelS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FongS00,
author = {Jessica H. Fong and
Martin Strauss},
editor = {Horst Reichel and
Sophie Tison},
title = {An Approximate L\({}^{\mbox{p}}\)-Difference Algorithm for Massive
Data Streams},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {193--204},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_16},
doi = {10.1007/3-540-46541-3\_16},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FongS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GlasserS00,
author = {Christian Gla{\ss}er and
Heinz Schmitz},
editor = {Horst Reichel and
Sophie Tison},
title = {Languages of Dot-Depth 3/2},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {555--566},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_46},
doi = {10.1007/3-540-46541-3\_46},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GlasserS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GoldmannR00,
author = {Mikael Goldmann and
Alexander Russell},
editor = {Horst Reichel and
Sophie Tison},
title = {Spectral Bounds on General Hard Core Predicates},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {614--625},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_51},
doi = {10.1007/3-540-46541-3\_51},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GoldmannR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Han00,
author = {Yijie Han},
editor = {Horst Reichel and
Sophie Tison},
title = {Fast Integer Sorting in Linear Space},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {242--253},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_20},
doi = {10.1007/3-540-46541-3\_20},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Han00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hemaspaandra00,
author = {Edith Hemaspaandra},
editor = {Horst Reichel and
Sophie Tison},
title = {The Complexity of Poor Man's Logic},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {230--242},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_19},
doi = {10.1007/3-540-46541-3\_19},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hemaspaandra00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HenzingerM00,
author = {Thomas A. Henzinger and
Rupak Majumdar},
editor = {Horst Reichel and
Sophie Tison},
title = {A Classification of Symbolic Transition Systems},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {13--34},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_2},
doi = {10.1007/3-540-46541-3\_2},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HenzingerM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hirsch00,
author = {Edward A. Hirsch},
editor = {Horst Reichel and
Sophie Tison},
title = {A New Algorithm for {MAX-2-SAT}},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {65--73},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_5},
doi = {10.1007/3-540-46541-3\_5},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hirsch00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HromkovicS00,
author = {Juraj Hromkovic and
Martin Sauerhoff},
editor = {Horst Reichel and
Sophie Tison},
title = {Tradeoffs between Nondeterminism and Complexity for Communication
Protocols and Branching Programs},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {145--156},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_12},
doi = {10.1007/3-540-46541-3\_12},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HromkovicS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/IlieP00,
author = {Lucian Ilie and
Wojciech Plandowski},
editor = {Horst Reichel and
Sophie Tison},
title = {Two-Variable Word Equations},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {122--132},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_10},
doi = {10.1007/3-540-46541-3\_10},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/IlieP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JancarKM00,
author = {Petr Jancar and
Anton{\'{\i}}n Kucera and
Faron Moller},
editor = {Horst Reichel and
Sophie Tison},
title = {Simulation and Bisimulation over One-Counter Processes},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {334--345},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_28},
doi = {10.1007/3-540-46541-3\_28},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JancarKM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenS00,
author = {Klaus Jansen and
Maxim Sviridenko},
editor = {Horst Reichel and
Sophie Tison},
title = {Polynomial Time Approximation Schemes for the Multiprocessor Open
and Flow Shop Scheduling Problem},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {455--465},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_38},
doi = {10.1007/3-540-46541-3\_38},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JansenS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jurdzinski00,
author = {Marcin Jurdzinski},
editor = {Horst Reichel and
Sophie Tison},
title = {Small Progress Measures for Solving Parity Games},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {290--301},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_24},
doi = {10.1007/3-540-46541-3\_24},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jurdzinski00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JurdzinskiN00,
author = {Marcin Jurdzinski and
Mogens Nielsen},
editor = {Horst Reichel and
Sophie Tison},
title = {Hereditary History Preserving Bisimilarity Is Undecidable},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {358--369},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_30},
doi = {10.1007/3-540-46541-3\_30},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JurdzinskiN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kari00,
author = {Jarkko Kari},
editor = {Horst Reichel and
Sophie Tison},
title = {Linear Cellular Automata with Multiple State Variables},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {110--121},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_9},
doi = {10.1007/3-540-46541-3\_9},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kari00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KatzKP00,
author = {Michal Katz and
Nir A. Katz and
David Peleg},
editor = {Horst Reichel and
Sophie Tison},
title = {Distance Labeling Schemes for Well-Separated Graph Classes},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {516--528},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_43},
doi = {10.1007/3-540-46541-3\_43},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KatzKP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Koiran00,
author = {Pascal Koiran},
editor = {Horst Reichel and
Sophie Tison},
title = {Circuits versus Trees in Algebraic Complexity},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {35--52},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_3},
doi = {10.1007/3-540-46541-3\_3},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Koiran00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KosubW00,
author = {Sven Kosub and
Klaus W. Wagner},
editor = {Horst Reichel and
Sophie Tison},
title = {The Boolean Hierarchy of NP-Partitions},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {157--168},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_13},
doi = {10.1007/3-540-46541-3\_13},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KosubW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KoutsoupiasT00,
author = {Elias Koutsoupias and
David Scot Taylor},
editor = {Horst Reichel and
Sophie Tison},
title = {The {CNN} Problem and Other k-Server Variants},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {581--592},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_48},
doi = {10.1007/3-540-46541-3\_48},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KoutsoupiasT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LanlignelRT00,
author = {Jean{-}Marc Lanlignel and
Olivier Raynaud and
Eric Thierry},
editor = {Horst Reichel and
Sophie Tison},
title = {Pruning Graphs with Digital Search Trees. Application to Distance
Hereditary Graphs},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {529--541},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_44},
doi = {10.1007/3-540-46541-3\_44},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LanlignelRT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Libkin00,
author = {Leonid Libkin},
editor = {Horst Reichel and
Sophie Tison},
title = {Logics Capturing Local Properties},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {217--229},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_18},
doi = {10.1007/3-540-46541-3\_18},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Libkin00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lorenz00,
author = {Ulf Lorenz},
editor = {Horst Reichel and
Sophie Tison},
title = {Controlled Conspiracy-2 Search},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {466--478},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_39},
doi = {10.1007/3-540-46541-3\_39},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Lorenz00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LutzMS00,
author = {Jack H. Lutz and
Vikram Mhetre and
Sridhar Srinivasan},
editor = {Horst Reichel and
Sophie Tison},
title = {Hard Instances of Hard Problems},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {324--333},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_27},
doi = {10.1007/3-540-46541-3\_27},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LutzMS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LutzS00,
author = {Jack H. Lutz and
Martin Strauss},
editor = {Horst Reichel and
Sophie Tison},
title = {Bias Invariance of Small Upper Spans},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {74--86},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_6},
doi = {10.1007/3-540-46541-3\_6},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/LutzS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Magniez00,
author = {Fr{\'{e}}d{\'{e}}ric Magniez},
editor = {Horst Reichel and
Sophie Tison},
title = {Multi-linearity Self-Testing with Relative Error},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {302--313},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_25},
doi = {10.1007/3-540-46541-3\_25},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Magniez00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Penna00,
author = {Paolo Penna},
editor = {Horst Reichel and
Sophie Tison},
title = {Succinct Representations of Model Based Belief Revision},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {205--216},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_17},
doi = {10.1007/3-540-46541-3\_17},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Penna00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RichommeW00,
author = {Gw{\'{e}}na{\"{e}}l Richomme and
Francis Wlazinski},
editor = {Horst Reichel and
Sophie Tison},
title = {About Cube-Free Morphisms},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {99--109},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_8},
doi = {10.1007/3-540-46541-3\_8},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/RichommeW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schabanel00,
author = {Nicolas Schabanel},
editor = {Horst Reichel and
Sophie Tison},
title = {The Data Broadcast Problem with Preemption},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {181--192},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_15},
doi = {10.1007/3-540-46541-3\_15},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Schabanel00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Shokrollahi00,
author = {Mohammad Amin Shokrollahi},
editor = {Horst Reichel and
Sophie Tison},
title = {Codes and Graphs},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {1--12},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_1},
doi = {10.1007/3-540-46541-3\_1},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Shokrollahi00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2000,
editor = {Horst Reichel and
Sophie Tison},
title = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3},
doi = {10.1007/3-540-46541-3},
isbn = {3-540-67141-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/2000.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.
retrieved on 2024-09-20 23:06 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:
