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/stacs99.bht:"
download as .bib file
@inproceedings{DBLP:conf/stacs/Ahrendt99,
author = {Timm Ahrendt},
editor = {Christoph Meinel and
Sophie Tison},
title = {Fast Computations of the Exponential Function},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {302--312},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_28},
doi = {10.1007/3-540-49116-3\_28},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ahrendt99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AielloBHMST99,
author = {William Aiello and
Costas Busch and
Maurice Herlihy and
Marios Mavronicolas and
Nir Shavit and
Dan Touitou},
editor = {Christoph Meinel and
Sophie Tison},
title = {Supporting Increment and Decrement Operations in Balancing Networks},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {393--403},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_37},
doi = {10.1007/3-540-49116-3\_37},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AielloBHMST99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Andersson99,
author = {Gunnar Andersson},
editor = {Christoph Meinel and
Sophie Tison},
title = {An Approximation Algorithm for Max p-Section},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {237--247},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_22},
doi = {10.1007/3-540-49116-3\_22},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Andersson99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AndreevCPR99,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Paolo Penna and
Jos{\'{e}} D. P. Rolim},
editor = {Christoph Meinel and
Sophie Tison},
title = {Memory Organization Schemes for Large Shared Data: {A} Randomized
Solution for Distributed Memory Machines},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {68--77},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_6},
doi = {10.1007/3-540-49116-3\_6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AndreevCPR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindT99,
author = {Vikraman Arvind and
Jacobo Tor{\'{a}}n},
editor = {Christoph Meinel and
Sophie Tison},
title = {Sparse Sets, Approximable Sets, and Parallel Queries to {NP}},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {281--290},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_26},
doi = {10.1007/3-540-49116-3\_26},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArvindT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BaruaRC99,
author = {Rana Barua and
Suman Roy and
Zhou Chaochen},
editor = {Christoph Meinel and
Sophie Tison},
title = {Completeness of Neighbourhood Logic},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {521--530},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_49},
doi = {10.1007/3-540-49116-3\_49},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BaruaRC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BergmanS99,
author = {Clifford Bergman and
Giora Slutzki},
editor = {Christoph Meinel and
Sophie Tison},
title = {Complexity of Some Problems in Universal Algebra},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {163--172},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_15},
doi = {10.1007/3-540-49116-3\_15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BergmanS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BernasconiS99,
author = {Anna Bernasconi and
Igor E. Shparlinski},
editor = {Christoph Meinel and
Sophie Tison},
title = {Circuit Complexity of Testing Square-Free Numbers},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {47--56},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_4},
doi = {10.1007/3-540-49116-3\_4},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BernasconiS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BouajjaniM99,
author = {Ahmed Bouajjani and
Richard Mayr},
editor = {Christoph Meinel and
Sophie Tison},
title = {Model Checking Lossy Vector Addition Systems},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {323--333},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_30},
doi = {10.1007/3-540-49116-3\_30},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BouajjaniM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BouchitteT99,
author = {Vincent Bouchitt{\'{e}} and
Ioan Todinca},
editor = {Christoph Meinel and
Sophie Tison},
title = {Treewidth and Minimum Fill-in of Weakly Triangulated Graphs},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {197--206},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_18},
doi = {10.1007/3-540-49116-3\_18},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BouchitteT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanF99,
author = {Harry Buhrman and
Lance Fortnow},
editor = {Christoph Meinel and
Sophie Tison},
title = {One-sided Versus Two-sided Error in Probabilistic Computation},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {100--109},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_9},
doi = {10.1007/3-540-49116-3\_9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaiPS99,
author = {Jin{-}yi Cai and
Aduri Pavan and
D. Sivakumar},
editor = {Christoph Meinel and
Sophie Tison},
title = {On the Hardness of Permanent},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {90--99},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_8},
doi = {10.1007/3-540-49116-3\_8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaiPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaseCJ99,
author = {John Case and
Keh{-}Jiann Chen and
Sanjay Jain},
editor = {Christoph Meinel and
Sophie Tison},
title = {Costs of General Purpose Learning},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {424--433},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_40},
doi = {10.1007/3-540-49116-3\_40},
timestamp = {Wed, 16 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaseCJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CrescenzoFIJ99,
author = {Giovanni Di Crescenzo and
Niels Ferguson and
Russell Impagliazzo and
Markus Jakobsson},
editor = {Christoph Meinel and
Sophie Tison},
title = {How to Forget a Secret},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {500--509},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_47},
doi = {10.1007/3-540-49116-3\_47},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CrescenzoFIJ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DurandSV99,
author = {Bruno Durand and
Alexander Shen and
Nikolai K. Vereshchagin},
editor = {Christoph Meinel and
Sophie Tison},
title = {Descriptive Complexity of Computable Sequences},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {153--162},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_14},
doi = {10.1007/3-540-49116-3\_14},
timestamp = {Wed, 19 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DurandSV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EiterIM99,
author = {Thomas Eiter and
Toshihide Ibaraki and
Kazuhisa Makino},
editor = {Christoph Meinel and
Sophie Tison},
title = {On the Difference of Horn Theories},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {467--477},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_44},
doi = {10.1007/3-540-49116-3\_44},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EiterIM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Engebretsen99,
author = {Lars Engebretsen},
editor = {Christoph Meinel and
Sophie Tison},
title = {An Explicit Lower Bound for {TSP} with Distances One and Two},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {373--382},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_35},
doi = {10.1007/3-540-49116-3\_35},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Engebretsen99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EstebanT99,
author = {Juan Luis Esteban and
Jacobo Tor{\'{a}}n},
editor = {Christoph Meinel and
Sophie Tison},
title = {Space Bounds for Resolution},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {551--560},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_52},
doi = {10.1007/3-540-49116-3\_52},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EstebanT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EttingerH99,
author = {Mark Ettinger and
Peter H{\o}yer},
editor = {Christoph Meinel and
Sophie Tison},
title = {On Quantum Algorithms for Noncommutative Hidden Subgroups},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {478--487},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_45},
doi = {10.1007/3-540-49116-3\_45},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EttingerH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FrandsenHM99,
author = {Gudmund Skovbjerg Frandsen and
Johan P. Hansen and
Peter Bro Miltersen},
editor = {Christoph Meinel and
Sophie Tison},
title = {Lower Bounds for Dynamic Algebraic Problems},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {362--372},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_34},
doi = {10.1007/3-540-49116-3\_34},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FrandsenHM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HammarNS99,
author = {Mikael Hammar and
Bengt J. Nilsson and
Sven Schuierer},
editor = {Christoph Meinel and
Sophie Tison},
title = {Parallel Searching on m Rays},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {132--142},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_12},
doi = {10.1007/3-540-49116-3\_12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HammarNS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HemaspaandraHH99,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {Christoph Meinel and
Sophie Tison},
title = {Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1
Queries},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {269--280},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_25},
doi = {10.1007/3-540-49116-3\_25},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraHH99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HirvensaloHW99,
author = {Vesa Halava and
Mika Hirvensalo and
Ronald de Wolf},
editor = {Christoph Meinel and
Sophie Tison},
title = {Decidability and Undecidability of Marked {PCP}},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {207--216},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_19},
doi = {10.1007/3-540-49116-3\_19},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HirvensaloHW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/IckingKL99,
author = {Christian Icking and
Rolf Klein and
Elmar Langetepe},
editor = {Christoph Meinel and
Sophie Tison},
title = {An Optimal Competitive Strategy for Walking in Streets},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {110--120},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_10},
doi = {10.1007/3-540-49116-3\_10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/IckingKL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jakoby99,
author = {Andreas Jakoby},
editor = {Christoph Meinel and
Sophie Tison},
title = {The Average Time Complexity to Compute Prefix Functions in Processor
Networks},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {78--89},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_7},
doi = {10.1007/3-540-49116-3\_7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jakoby99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JakobyLR99,
author = {Andreas Jakoby and
Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
editor = {Christoph Meinel and
Sophie Tison},
title = {Scheduling Dynamic Graphs},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {383--392},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_36},
doi = {10.1007/3-540-49116-3\_36},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JakobyLR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KaoLO99,
author = {Ming{-}Yang Kao and
Andrzej Lingas and
Anna {\"{O}}stlin},
editor = {Christoph Meinel and
Sophie Tison},
title = {Balanced Randomized Tree Splitting with Applications to Evolutionary
Tree Constructions},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {184--196},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_17},
doi = {10.1007/3-540-49116-3\_17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KaoLO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kirsten99,
author = {Daniel Kirsten},
editor = {Christoph Meinel and
Sophie Tison},
title = {Some Undecidability Results Related to the Star Problem in Trace Monoids},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {227--236},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_21},
doi = {10.1007/3-540-49116-3\_21},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kirsten99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KloksKM99,
author = {Ton Kloks and
Jan Kratochv{\'{\i}}l and
Haiko M{\"{u}}ller},
editor = {Christoph Meinel and
Sophie Tison},
title = {New Branchwidth Territories},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {173--183},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_16},
doi = {10.1007/3-540-49116-3\_16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KloksKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KoutnyP99,
author = {Maciej Koutny and
Giuseppe Pappalardo},
editor = {Christoph Meinel and
Sophie Tison},
title = {A Model of Behaviour Abstraction for Communicating Processes},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {313--322},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_29},
doi = {10.1007/3-540-49116-3\_29},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KoutnyP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KoutsoupiasP99,
author = {Elias Koutsoupias and
Christos H. Papadimitriou},
editor = {Christoph Meinel and
Sophie Tison},
title = {Worst-case Equilibria},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {404--413},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_38},
doi = {10.1007/3-540-49116-3\_38},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KoutsoupiasP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KratschS99,
author = {Dieter Kratsch and
Lorna Stewart},
editor = {Christoph Meinel and
Sophie Tison},
title = {Approximating Bandwidth by Mixing Layouts of Interval Graphs},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {248--258},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_23},
doi = {10.1007/3-540-49116-3\_23},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KratschS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KupfermanV99,
author = {Orna Kupferman and
Moshe Y. Vardi},
editor = {Christoph Meinel and
Sophie Tison},
title = {The Weakness of Self-Complementation},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {455--466},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_43},
doi = {10.1007/3-540-49116-3\_43},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KupfermanV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LautemannMSV99,
author = {Clemens Lautemann and
Pierre McKenzie and
Thomas Schwentick and
Heribert Vollmer},
editor = {Christoph Meinel and
Sophie Tison},
title = {The Descriptive Complexity Approach to {LOGCFL}},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {444--454},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_42},
doi = {10.1007/3-540-49116-3\_42},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LautemannMSV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LautemannSS99,
author = {Clemens Lautemann and
Nicole Schweikardt and
Thomas Schwentick},
editor = {Christoph Meinel and
Sophie Tison},
title = {A Logical Characterisation of Linear Time on Nondeterministic Turing
Machines},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {143--152},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_13},
doi = {10.1007/3-540-49116-3\_13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LautemannSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Mendez99,
author = {Patrice Ossona de Mendez},
editor = {Christoph Meinel and
Sophie Tison},
title = {The Reduced Genus of a Multigraph},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {16--31},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_2},
doi = {10.1007/3-540-49116-3\_2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Mendez99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Messner99,
author = {Jochen Me{\ss}ner},
editor = {Christoph Meinel and
Sophie Tison},
title = {On Optimal Algorithms and Optimal Proof Systems},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {541--550},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_51},
doi = {10.1007/3-540-49116-3\_51},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Messner99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Muller-Olm99,
author = {Markus M{\"{u}}ller{-}Olm},
editor = {Christoph Meinel and
Sophie Tison},
title = {A Modal Fixpoint Logic with Chop},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {510--520},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_48},
doi = {10.1007/3-540-49116-3\_48},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Muller-Olm99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NiedermeierR99,
author = {Rolf Niedermeier and
Peter Rossmanith},
editor = {Christoph Meinel and
Sophie Tison},
title = {Upper Bounds for Vertex Cover Further Improved},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {561--570},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_53},
doi = {10.1007/3-540-49116-3\_53},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/NiedermeierR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Nisan99,
author = {Noam Nisan},
editor = {Christoph Meinel and
Sophie Tison},
title = {Algorithms for Selfish Agents},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {1--15},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_1},
doi = {10.1007/3-540-49116-3\_1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Nisan99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NykanenU99,
author = {Matti Nyk{\"{a}}nen and
Esko Ukkonen},
editor = {Christoph Meinel and
Sophie Tison},
title = {Finding Paths with the Right Cost},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {345--355},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_32},
doi = {10.1007/3-540-49116-3\_32},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/NykanenU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Otto99,
author = {Martin Otto},
editor = {Christoph Meinel and
Sophie Tison},
title = {Eliminating Recursion in the {\(\mathrm{\mu}\)}-Calculus},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {531--540},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_50},
doi = {10.1007/3-540-49116-3\_50},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Otto99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Preis99,
author = {Robert Preis},
editor = {Christoph Meinel and
Sophie Tison},
title = {Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching
in General Graphs},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {259--269},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_24},
doi = {10.1007/3-540-49116-3\_24},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Preis99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ReischukZ99,
author = {R{\"{u}}diger Reischuk and
Thomas Zeugmann},
editor = {Christoph Meinel and
Sophie Tison},
title = {A Complete and Tight Average-Case Analysis of Learning Monomials},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {414--423},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_39},
doi = {10.1007/3-540-49116-3\_39},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ReischukZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Riedel99,
author = {Marco Riedel},
editor = {Christoph Meinel and
Sophie Tison},
title = {Online Matching for Scheduling Problems},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {571--580},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_54},
doi = {10.1007/3-540-49116-3\_54},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Riedel99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RobsonD99,
author = {John Michael Robson and
Volker Diekert},
editor = {Christoph Meinel and
Sophie Tison},
title = {On Quadratic Word Equations},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {217--226},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_20},
doi = {10.1007/3-540-49116-3\_20},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/RobsonD99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Sauerhoff99,
author = {Martin Sauerhoff},
editor = {Christoph Meinel and
Sophie Tison},
title = {On the Size of Randomized OBDDs and Read-Once Branching Programs for
k-Stable Functions},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {488--499},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_46},
doi = {10.1007/3-540-49116-3\_46},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Sauerhoff99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SauerhoffWW99,
author = {Martin Sauerhoff and
Ingo Wegener and
Ralph Werchner},
editor = {Christoph Meinel and
Sophie Tison},
title = {Relating Branching Program Size and Formula Size over the Full Binary
Basis},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {57--67},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_5},
doi = {10.1007/3-540-49116-3\_5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SauerhoffWW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SchuiererS99,
author = {Sven Schuierer and
Ines Semrau},
editor = {Christoph Meinel and
Sophie Tison},
title = {An Optimal Strategy for Searching in Unknown Streets},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {121--131},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_11},
doi = {10.1007/3-540-49116-3\_11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SchuiererS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schuler99,
author = {Rainer Schuler},
editor = {Christoph Meinel and
Sophie Tison},
title = {Universal Distributions and Time-Bounded Kolmogorov Complexity},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {434--443},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_41},
doi = {10.1007/3-540-49116-3\_41},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Schuler99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Sibeyn99,
author = {Jop F. Sibeyn},
editor = {Christoph Meinel and
Sophie Tison},
title = {External Selection},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {291--301},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_27},
doi = {10.1007/3-540-49116-3\_27},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Sibeyn99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Szegedy99,
author = {Mario Szegedy},
editor = {Christoph Meinel and
Sophie Tison},
title = {In How Many Steps the k Peg Version of the Towers of Hanoi Game Can
Be Solved?},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {356--361},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_33},
doi = {10.1007/3-540-49116-3\_33},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Szegedy99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Wilke99,
author = {Thomas Wilke},
editor = {Christoph Meinel and
Sophie Tison},
title = {Classifying Discrete Temporal Properties},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {32--46},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_3},
doi = {10.1007/3-540-49116-3\_3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Wilke99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/WuCT99,
author = {Bang Ye Wu and
Kun{-}Mao Chao and
Chuan Yi Tang},
editor = {Christoph Meinel and
Sophie Tison},
title = {Constructing Light Spanning Trees with Small Routing Cost},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {334--344},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_31},
doi = {10.1007/3-540-49116-3\_31},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/WuCT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1999,
editor = {Christoph Meinel and
Sophie Tison},
title = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3},
doi = {10.1007/3-540-49116-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/1999.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-14 03:36 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:
