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/mfcs/mfcs2001.bht:"
download as .bib file
@inproceedings{DBLP:conf/mfcs/AlberFFFNRS01,
author = {Jochen Alber and
Hongbing Fan and
Michael R. Fellows and
Henning Fernau and
Rolf Niedermeier and
Frances A. Rosamond and
Ulrike Stege},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Refined Search Tree Technique for {DOMINATING} {SET} on Planar Graphs},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {111--122},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_11},
doi = {10.1007/3-540-44683-4\_11},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/AlberFFFNRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AmanoHWM01,
author = {Kazuyuki Amano and
Tsukuru Hirosawa and
Yusuke Watanabe and
Akira Maruoka},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {The Computational Power of a Family of Decision Forests},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {123--134},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_12},
doi = {10.1007/3-540-44683-4\_12},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AmanoHWM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AmbainisK01,
author = {Andris Ambainis and
Arnolds Kikusts},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Exact Results for Accepting Probabilities of Quantum Automata},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {135--147},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_13},
doi = {10.1007/3-540-44683-4\_13},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AmbainisK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Atserias01,
author = {Albert Atserias},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many
Primes from Weaker Axioms},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {148--158},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_14},
doi = {10.1007/3-540-44683-4\_14},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Atserias01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BarrettHMRRS01,
author = {Christopher L. Barrett and
Harry B. Hunt III and
Madhav V. Marathe and
S. S. Ravi and
Daniel J. Rosenkrantz and
Richard Edwin Stearns},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Analysis Problems for Sequential Dynamical Systems and Communicating
State Machines},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {159--172},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_15},
doi = {10.1007/3-540-44683-4\_15},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BarrettHMRRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeaudryH01,
author = {Martin Beaudry and
Markus Holzer},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {The Complexity of Tensor Circuit Evaluation},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {173--185},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_16},
doi = {10.1007/3-540-44683-4\_16},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeaudryH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Blaser01,
author = {Markus Bl{\"{a}}ser},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Computing Reciprocals of Bivariate Power Series},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {186--197},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_17},
doi = {10.1007/3-540-44683-4\_17},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Blaser01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BouajjaniHM01,
author = {Ahmed Bouajjani and
Peter Habermehl and
Richard Mayr},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Automatic Verification of Recursive Procedures with One Integer Parameter},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {198--211},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_18},
doi = {10.1007/3-540-44683-4\_18},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BouajjaniHM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Brattka01,
author = {Vasco Brattka},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Computable Versions of Baire's Category Theorem},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {224--235},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_20},
doi = {10.1007/3-540-44683-4\_20},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Brattka01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BrosenneHW01,
author = {Henrik Brosenne and
Matthias Homeister and
Stephan Waack},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {212--223},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_19},
doi = {10.1007/3-540-44683-4\_19},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BrosenneHW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BruyereC01,
author = {V{\'{e}}ronique Bruy{\`{e}}re and
Olivier Carton},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Automata on Linear Orderings},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {236--247},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_21},
doi = {10.1007/3-540-44683-4\_21},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BruyereC01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Burgisser01,
author = {Peter B{\"{u}}rgisser},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On Implications between P-NP-Hypotheses: Decision versus Computation
in Algebraic Complexity},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {3--17},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_2},
doi = {10.1007/3-540-44683-4\_2},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Burgisser01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CervelleDF01,
author = {Julien Cervelle and
Bruno Durand and
Enrico Formenti},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Algorithmic Information Theory and Cellular Automata Dynamics},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {248--259},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_22},
doi = {10.1007/3-540-44683-4\_22},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CervelleDF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChrobakLR01,
author = {Marek Chrobak and
Lawrence L. Larmore and
Wojciech Rytter},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {The k-Median Problem for Directed Trees},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {260--271},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_23},
doi = {10.1007/3-540-44683-4\_23},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChrobakLR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Crescenzo01,
author = {Giovanni Di Crescenzo},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Sharing One Secret vs. Sharing Many Secrets: Tight Bounds for the
Max Improvement Ratio},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {292--303},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_26},
doi = {10.1007/3-540-44683-4\_26},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Crescenzo01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CryanM01,
author = {Mary Cryan and
Peter Bro Miltersen},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On Pseudorandom Generators in {NC}},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {272--284},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_24},
doi = {10.1007/3-540-44683-4\_24},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CryanM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CuckerG01,
author = {Felipe Cucker and
Dima Grigoriev},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {There Are No Sparse NP\({}_{\mbox{W}}\)-Hard Sets},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {285--291},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_25},
doi = {10.1007/3-540-44683-4\_25},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CuckerG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Demaine01,
author = {Erik D. Demaine},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Playing Games with Algorithms: Algorithmic Combinatorial Game Theory},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {18--32},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_3},
doi = {10.1007/3-540-44683-4\_3},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Demaine01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DiazST01,
author = {Josep D{\'{\i}}az and
Maria J. Serna and
Dimitrios M. Thilikos},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {(H, C, K)-Coloring: Fast, Easy, and Hard Cases},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {304--315},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_27},
doi = {10.1007/3-540-44683-4\_27},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DiazST01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DowneyHL01,
author = {Rodney G. Downey and
Denis R. Hirschfeldt and
Geoffrey LaForte},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Randomness and Reducibility},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {316--327},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_28},
doi = {10.1007/3-540-44683-4\_28},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DowneyHL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DurisM01,
author = {Pavol Duris and
J{\'{a}}n Manuch},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On the Computational Complexity of Infinite Words},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {328--337},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_29},
doi = {10.1007/3-540-44683-4\_29},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DurisM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EpsteinS01,
author = {Leah Epstein and
Rob van Stee},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Lower Bounds for On-Line Single-Machine Scheduling},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {338--350},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_30},
doi = {10.1007/3-540-44683-4\_30},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EpsteinS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Erlebach01,
author = {Thomas Erlebach},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Approximation Algorithms and Complexity Results for Path Problems
in Trees of Rings},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {351--362},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_31},
doi = {10.1007/3-540-44683-4\_31},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Erlebach01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EspelageW01,
author = {Wolfgang Espelage and
Egon Wanke},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {A 3-Approximation Algorithm for Movement Minimization in Conveyor
Flow Shop Processing},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {363--374},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_32},
doi = {10.1007/3-540-44683-4\_32},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EspelageW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Fiat01,
author = {Amos Fiat},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Some Recent Results on Data Mining and Search},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {33--36},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_4},
doi = {10.1007/3-540-44683-4\_4},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Fiat01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Fournier01,
author = {Herv{\'{e}} Fournier},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Quantifier Rank for Parity of Embedded Finite Models},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {375--386},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_33},
doi = {10.1007/3-540-44683-4\_33},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Fournier01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Geffert01,
author = {Viliam Geffert},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Space Hierarchy Theorem Revised},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {387--397},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_34},
doi = {10.1007/3-540-44683-4\_34},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Geffert01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GeffertMP01,
author = {Viliam Geffert and
Carlo Mereghetti and
Giovanni Pighizzini},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Converting Two-Way Nondeterministic Unary Automata into Simpler Automata},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {398--407},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_35},
doi = {10.1007/3-540-44683-4\_35},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GeffertMP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GottlobLS01,
author = {Georg Gottlob and
Nicola Leone and
Francesco Scarcello},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Hypertree Decompositions: {A} Survey},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {37--57},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_5},
doi = {10.1007/3-540-44683-4\_5},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GottlobLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HoangT01,
author = {Thanh Minh Hoang and
Thomas Thierauf},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {The Complexity of the Minimal Polynomial},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {408--420},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_36},
doi = {10.1007/3-540-44683-4\_36},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HoangT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Hofmann01,
author = {Martin Hofmann},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {The Strength of Non-size-increasing Computation (Introduction and
Summary)},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {58--61},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_6},
doi = {10.1007/3-540-44683-4\_6},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Hofmann01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Hoyer01,
author = {Peter H{\o}yer},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Introduction to Recent Quantum Algorithms},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {62--73},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_7},
doi = {10.1007/3-540-44683-4\_7},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Hoyer01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Jiraskova01,
author = {Galina Jir{\'{a}}skov{\'{a}}},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Note on Minimal Finite Automata},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {421--431},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_37},
doi = {10.1007/3-540-44683-4\_37},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Jiraskova01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Kari01,
author = {Jarkko Kari},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Synchronizing Finite Automata on Eulerian Digraphs},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {432--438},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_38},
doi = {10.1007/3-540-44683-4\_38},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Kari01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KleinK01,
author = {Andreas Klein and
Martin Kutrib},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {A Time Hierarchy for Bounded One-Way Cellular Automata},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {439--450},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_39},
doi = {10.1007/3-540-44683-4\_39},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KleinK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KlinHTSM01,
author = {Bartek Klin and
Piotr Hoffman and
Andrzej Tarlecki and
Lutz Schr{\"{o}}der and
Till Mossakowski},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Checking Amalgamability Conditions for {C} {ASL} Architectural Specifications},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {451--463},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_40},
doi = {10.1007/3-540-44683-4\_40},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KlinHTSM01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KooLNT01,
author = {Chiu{-}Yuen Koo and
Tak Wah Lam and
Tsuen{-}Wan Ngan and
Kar{-}Keung To},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On-Line Scheduling with Tight Deadlines},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {464--473},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_41},
doi = {10.1007/3-540-44683-4\_41},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KooLNT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KralKV01,
author = {Daniel Kr{\'{a}}l and
Jan Kratochv{\'{\i}}l and
Heinz{-}J{\"{u}}rgen Voss},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Complexity Note on Mixed Hypergraphs},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {474--486},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_42},
doi = {10.1007/3-540-44683-4\_42},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KralKV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KrumkePPS01,
author = {Sven Oliver Krumke and
Willem de Paepe and
Diana Poensgen and
Leen Stougie},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {News from the Online Traveling Repairman},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {487--499},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_43},
doi = {10.1007/3-540-44683-4\_43},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KrumkePPS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Lohrey01,
author = {Markus Lohrey},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Word Problems for 2-Homogeneous Monoids and Symmetric Logspace},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {500--511},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_44},
doi = {10.1007/3-540-44683-4\_44},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Lohrey01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MignosiSW01,
author = {Filippo Mignosi and
Jeffrey O. Shallit and
Ming{-}wei Wang},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Variations on a Theorem of Fine {\&} Wilf},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {512--523},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_45},
doi = {10.1007/3-540-44683-4\_45},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/MignosiSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MonienP01,
author = {Burkhard Monien and
Robert Preis},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {524--536},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_46},
doi = {10.1007/3-540-44683-4\_46},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MonienP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MooreTT01,
author = {Cristopher Moore and
Pascal Tesson and
Denis Th{\'{e}}rien},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Satisfiability of Systems of Equations over Finite Monoids},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {537--547},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_47},
doi = {10.1007/3-540-44683-4\_47},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/MooreTT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MorvanS01,
author = {Christophe Morvan and
Colin Stirling},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Rational Graphs Trace Context-Sensitive Languages},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {548--559},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_48},
doi = {10.1007/3-540-44683-4\_48},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MorvanS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/NevenSV01,
author = {Frank Neven and
Thomas Schwentick and
Victor Vianu},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Towards Regular Languages over Infinite Alphabets},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {560--572},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_49},
doi = {10.1007/3-540-44683-4\_49},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/NevenSV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Nickelsen01,
author = {Arfst Nickelsen},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Partial Information and Special Case Algorithms},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {573--584},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_50},
doi = {10.1007/3-540-44683-4\_50},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Nickelsen01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/OgiharaT01,
author = {Mitsunori Ogihara and
Seinosuke Toda},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {The Complexity of Computing the Number of Self-Avoiding Walks in Two-Dimensional
Grid Graphs and in Hypercube Graphs},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {585--597},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_51},
doi = {10.1007/3-540-44683-4\_51},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/OgiharaT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/PitermanV01,
author = {Nir Piterman and
Moshe Y. Vardi},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {From Bidirectionality to Alternation},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {598--610},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_52},
doi = {10.1007/3-540-44683-4\_52},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/PitermanV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Polak01,
author = {Libor Pol{\'{a}}k},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Syntactic Semiring of a Language},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {611--620},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_53},
doi = {10.1007/3-540-44683-4\_53},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Polak01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Pudlak01,
author = {Pavel Pudl{\'{a}}k},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On Reducibility and Symmetry of Disjoint NP-Pairs},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {621--632},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_54},
doi = {10.1007/3-540-44683-4\_54},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Pudlak01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Randall01,
author = {Dana Randall},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Decomposition Methods and Sampling Circuits in the Cartesian Lattice},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {74--86},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_8},
doi = {10.1007/3-540-44683-4\_8},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Randall01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RettingerZ01,
author = {Robert Rettinger and
Xizhong Zheng},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Hierarchy of Monotonically Computable Real Numbers},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {633--644},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_55},
doi = {10.1007/3-540-44683-4\_55},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/RettingerZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Santocanale01,
author = {Luigi Santocanale},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On the Equational Definition of the Least Prefixed Point},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {645--656},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_56},
doi = {10.1007/3-540-44683-4\_56},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Santocanale01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Schoning01,
author = {Uwe Sch{\"{o}}ning},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {New Algorithms for k -SAT Based on the Local Search Principle},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {87--95},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_9},
doi = {10.1007/3-540-44683-4\_9},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Schoning01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Scott01,
author = {Dana S. Scott},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {A New Category for Semantics},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {1--2},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_1},
doi = {10.1007/3-540-44683-4\_1},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Scott01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ShurK01,
author = {Arseny M. Shur and
Yulia V. Konovalova},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On the Periods of Partial Words},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {657--665},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_57},
doi = {10.1007/3-540-44683-4\_57},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ShurK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Sutner01,
author = {Klaus Sutner},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {The Size of Power Automata},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {666--677},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_58},
doi = {10.1007/3-540-44683-4\_58},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Sutner01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Thimm01,
author = {Martin Thimm},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {On the Approximability of the Steiner Tree Problem},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {678--689},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_59},
doi = {10.1007/3-540-44683-4\_59},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Thimm01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/WangZ01,
author = {Zhuozhi Wang and
Kaizhong Zhang},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Alignment between Two {RNA} Structures},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {690--702},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_60},
doi = {10.1007/3-540-44683-4\_60},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/WangZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Wich01,
author = {Klaus Wich},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Characterization of Context-Free Languages with Polynomially Bounded
Ambiguity},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {703--714},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_61},
doi = {10.1007/3-540-44683-4\_61},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Wich01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Wilke01,
author = {Thomas Wilke},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Linear Temporal Logic and Finite Semigroups},
booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {96--110},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_10},
doi = {10.1007/3-540-44683-4\_10},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Wilke01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2001,
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Mathematical Foundations of Computer Science 2001, 26th International
Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2136},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4},
doi = {10.1007/3-540-44683-4},
isbn = {3-540-42496-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2001.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-04-25 03:57 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:
