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/mfcs2002.bht:"
download as .bib file
@inproceedings{DBLP:conf/mfcs/AndreouFNPS02,
author = {Maria I. Andreou and
Dimitris Fotakis and
Sotiris E. Nikoletseas and
Vicky G. Papadopoulou and
Paul G. Spirakis},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On Radiocoloring Hierarchically Specified Planar Graphs: PSPACE-Completeness
and Approximations},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {81--92},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_6},
doi = {10.1007/3-540-45687-2\_6},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/AndreouFNPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AngelsmarkDJ02,
author = {Ola Angelsmark and
Vilhelm Dahll{\"{o}}f and
Peter Jonsson},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Finite Domain Constraint Satisfaction Using Quantum Computation},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {93--103},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_7},
doi = {10.1007/3-540-45687-2\_7},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AngelsmarkDJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeinBLP02,
author = {Wolfgang W. Bein and
Peter Brucker and
Lawrence L. Larmore and
James K. Park},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Fast Algorithms with Algebraic Monge Properties},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {104--117},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_8},
doi = {10.1007/3-540-45687-2\_8},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeinBLP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeisDZ02,
author = {Mihalis Beis and
William Duckworth and
Michele Zito},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Packing Edges in Random Regular Graphs},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {118--130},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_9},
doi = {10.1007/3-540-45687-2\_9},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeisDZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BidoitST02,
author = {Michel Bidoit and
Donald Sannella and
Andrzej Tarlecki},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Global Development via Local Observational Construction Steps},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {1--24},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_1},
doi = {10.1007/3-540-45687-2\_1},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BidoitST02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BolligW02,
author = {Beate Bollig and
Philipp Woelfel},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching
Programs and Its Applications},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {131--142},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_10},
doi = {10.1007/3-540-45687-2\_10},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BolligW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BorosEGK02,
author = {Endre Boros and
Khaled M. Elbassioni and
Vladimir Gurvich and
Leonid Khachiyan},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Matroid Intersections, Polymatroid Inequalities, and Related Problems},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {143--154},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_11},
doi = {10.1007/3-540-45687-2\_11},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BorosEGK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Carton02,
author = {Olivier Carton},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Accessibility in Automata on Scattered Linear Orderings},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {155--164},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_12},
doi = {10.1007/3-540-45687-2\_12},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Carton02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Caucal02,
author = {Didier Caucal},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On Infinite Terms Having a Decidable Monadic Theory},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {165--176},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_13},
doi = {10.1007/3-540-45687-2\_13},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Caucal02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CaucalK02,
author = {Didier Caucal and
Teodor Knapik},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {A Chomsky-Like Hierarchy of Infinite Graphs},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {177--187},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_14},
doi = {10.1007/3-540-45687-2\_14},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CaucalK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ChanLTW02,
author = {Wun{-}Tat Chan and
Tak Wah Lam and
Hing{-}Fung Ting and
Prudence W. H. Wong},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Competitive Analysis of On-line Stream Merging Algorithms},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {188--200},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_15},
doi = {10.1007/3-540-45687-2\_15},
timestamp = {Sun, 04 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ChanLTW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Coja-Oghlan02,
author = {Amin Coja{-}Oghlan},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time
via Semidefinite Programming},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {201--211},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_16},
doi = {10.1007/3-540-45687-2\_16},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Coja-Oghlan02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DabrowskiP02,
author = {Robert Dabrowski and
Wojciech Plandowski},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On Word Equations in One Variable},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {212--220},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_17},
doi = {10.1007/3-540-45687-2\_17},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DabrowskiP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EbertM02,
author = {Todd Ebert and
Wolfgang Merkle},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Autoreducibility of Random Sets: {A} Sharp Bound on the Density of
Guessed Bits},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {221--233},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_18},
doi = {10.1007/3-540-45687-2\_18},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EbertM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EngelfrietM02,
author = {Joost Engelfriet and
Sebastian Maneth},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Two-Way Finite State Transducers with Nested Pebbles},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {234--244},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_19},
doi = {10.1007/3-540-45687-2\_19},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EngelfrietM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EpsteinF02,
author = {Leah Epstein and
Lene M. Favrholdt},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Optimal Non-preemptive Semi-online Scheduling on Two Related Machines},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {245--256},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_20},
doi = {10.1007/3-540-45687-2\_20},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EpsteinF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EpsteinIS02,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Rob van Stee},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {More on Weighted Servers or {FIFO} is Better than {LRU}},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {257--268},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_21},
doi = {10.1007/3-540-45687-2\_21},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EpsteinIS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/FishkinZ02,
author = {Aleksei V. Fishkin and
Guochuan Zhang},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On Maximizing the Throughput of Multiprocessor Tasks},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {269--279},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_22},
doi = {10.1007/3-540-45687-2\_22},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/FishkinZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GibbonsS02,
author = {Alan Gibbons and
Paul Sant},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Edge-Colouring Pairs of Binary Trees: Towards a Concise Proof of the
Four-Colour Theorem of Planar Maps},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {25--39},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_2},
doi = {10.1007/3-540-45687-2\_2},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GibbonsS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GoerdtJ02,
author = {Andreas Goerdt and
Tomasz Jurdzinski},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Some Results on Random Unsatisfiable k-Sat Instances and Approximation
Algorithms Applied to Random Structures},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {280--291},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_23},
doi = {10.1007/3-540-45687-2\_23},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GoerdtJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GroultLM02,
author = {Richard Groult and
Martine L{\'{e}}onard and
Laurent Mouchard},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Evolutive Tandem Repeats Using Hamming Distance},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {292--304},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_24},
doi = {10.1007/3-540-45687-2\_24},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GroultLM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HajiaghayiN02,
author = {Mohammad Taghi Hajiaghayi and
Naomi Nishimura},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally)
Bounded Treewidth},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {305--318},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_25},
doi = {10.1007/3-540-45687-2\_25},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HajiaghayiN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HirvensaloK02,
author = {Mika Hirvensalo and
Juhani Karhum{\"{a}}ki},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Computing Partial Information out of Intractable One - The First Digit
of 2\({}^{\mbox{ n }}\) at Base 3 as an Example},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {319--327},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_26},
doi = {10.1007/3-540-45687-2\_26},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HirvensaloK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/IlieY02,
author = {Lucian Ilie and
Sheng Yu},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Algorithms for Computing Small NFAs},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {328--340},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_27},
doi = {10.1007/3-540-45687-2\_27},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/IlieY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/InenagaSTBA02,
author = {Shunsuke Inenaga and
Ayumi Shinohara and
Masayuki Takeda and
Hideo Bannai and
Setsuo Arikawa},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Space-Economical Construction of Index Structures for All Suffixes
of a String},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {341--352},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_28},
doi = {10.1007/3-540-45687-2\_28},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/InenagaSTBA02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/IwamaM02,
author = {Kazuo Iwama and
Hiroki Morizumi},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {An Explicit Lower Bound of 5n - o(n) for Boolean Circuits},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {353--364},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_29},
doi = {10.1007/3-540-45687-2\_29},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/IwamaM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/IwamotoAMI02,
author = {Chuzo Iwamoto and
Takeshi Andou and
Kenichi Morita and
Katsunobu Imai},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Computational Complexity in the Hyperbolic Plane},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {365--374},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_30},
doi = {10.1007/3-540-45687-2\_30},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/IwamotoAMI02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Janicki02,
author = {Ryszard Janicki},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On a Mereological System for Relational Software Specifications},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {375--386},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_31},
doi = {10.1007/3-540-45687-2\_31},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Janicki02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/JohannsenN02,
author = {Jan Johannsen and
N. S. Narayanaswamy},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {An Optimal Lower Bound for Resolution with 2-Conjunctions},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {387--398},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_32},
doi = {10.1007/3-540-45687-2\_32},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/JohannsenN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KanjP02,
author = {Iyad A. Kanj and
Ljubomir Perkovic},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Improved Parameterized Algorithms for Planar Dominating Set},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {399--410},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_33},
doi = {10.1007/3-540-45687-2\_33},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KanjP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KaraK02,
author = {Jan K{\'{a}}ra and
Daniel Kr{\'{a}}l},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Optimal Free Binary Decision Diagrams for Computation of EAR\({}_{\mbox{n}}\)},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {411--422},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_34},
doi = {10.1007/3-540-45687-2\_34},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KaraK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Karhumaki02,
author = {Juhani Karhum{\"{a}}ki},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Applications of Finite Automata},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {40--58},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_3},
doi = {10.1007/3-540-45687-2\_3},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Karhumaki02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Karpinski02,
author = {Marek Karpinski},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Approximability of the Minimum Bisection Problem: An Algorithmic Challenge},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {59--67},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_4},
doi = {10.1007/3-540-45687-2\_4},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Karpinski02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Klima02,
author = {Ondrej Kl{\'{\i}}ma},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Unification Modulo Associativity and Idempotency Is NP-complete},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {423--432},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_35},
doi = {10.1007/3-540-45687-2\_35},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Klima02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KuceraM02,
author = {Anton{\'{\i}}n Kucera and
Richard Mayr},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On the Complexity of Semantic Equivalences for Pushdown Automata and
{BPA}},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {433--445},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_36},
doi = {10.1007/3-540-45687-2\_36},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KuceraM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/KupfermanZ02,
author = {Orna Kupferman and
Sharon Zuhovitzky},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {An Improved Algorithm for the Membership Problem for Extended Regular
Expressions},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {446--458},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_37},
doi = {10.1007/3-540-45687-2\_37},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/KupfermanZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LinJC02,
author = {Yaw{-}Ling Lin and
Tao Jiang and
Kun{-}Mao Chao},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Efficient Algorithms for Locating the Length-Constrained Heaviest
Segments, with Applications to Biomolecular Sequence Analysis},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {459--470},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_38},
doi = {10.1007/3-540-45687-2\_38},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LinJC02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LombardyS02,
author = {Sylvain Lombardy and
Jacques Sakarovitch},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Derivation of Rational Expressions with Multiplicity},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {471--482},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_39},
doi = {10.1007/3-540-45687-2\_39},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LombardyS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LoyerS02,
author = {Yann Loyer and
Nicolas Spyratos},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Hypothesis-Founded Semantics for Datalog Programs with Negation},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {483--494},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_40},
doi = {10.1007/3-540-45687-2\_40},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LoyerS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/LuckingMR02,
author = {Thomas L{\"{u}}cking and
Burkhard Monien and
Manuel Rode},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On the Problem of Scheduling Flows on Distributed Networks},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {495--505},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_41},
doi = {10.1007/3-540-45687-2\_41},
timestamp = {Tue, 26 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/LuckingMR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MachadoS02,
author = {Patr{\'{\i}}cia D. L. Machado and
Donald Sannella},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Unit Testing for {CASL} Architectural Specifications},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {506--518},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_42},
doi = {10.1007/3-540-45687-2\_42},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MachadoS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Martinelli02,
author = {Fabio Martinelli},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic
Inference Systems},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {519--531},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_43},
doi = {10.1007/3-540-45687-2\_43},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Martinelli02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Marx02,
author = {D{\'{a}}niel Marx},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {The Complexity of Tree Multicolorings},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {532--542},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_44},
doi = {10.1007/3-540-45687-2\_44},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Marx02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MassonS02,
author = {Beno{\^{\i}}t Masson and
Philippe Schnoebelen},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On Verifying Fair Lossy Channel Systems},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {543--555},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_45},
doi = {10.1007/3-540-45687-2\_45},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MassonS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/McCartin02,
author = {Catherine McCartin},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Parameterized Counting Problems},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {556--567},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_46},
doi = {10.1007/3-540-45687-2\_46},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/McCartin02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MerkleM02,
author = {Wolfgang Merkle and
Nenad Mihailovic},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On the Construction of Effective Random Sets},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {568--580},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_47},
doi = {10.1007/3-540-45687-2\_47},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MerkleM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Messner02,
author = {Jochen Messner},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {On the Structure of the Simulation Order of Proof Systems},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {581--592},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_48},
doi = {10.1007/3-540-45687-2\_48},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Messner02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Mossakowski02,
author = {Till Mossakowski},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Comorphism-Based Grothendieck Logics},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {593--604},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_49},
doi = {10.1007/3-540-45687-2\_49},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Mossakowski02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Peleg02,
author = {David Peleg},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Low Stretch Spanning Trees},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {68--80},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_5},
doi = {10.1007/3-540-45687-2\_5},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Peleg02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/RichommeW02,
author = {Gw{\'{e}}na{\"{e}}l Richomme and
Francis Wlazinski},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Finite Test-Sets for Overlap-Free Morphisms},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {605--614},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_50},
doi = {10.1007/3-540-45687-2\_50},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/RichommeW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Rigo02,
author = {Michel Rigo},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Characterizing Simpler Recognizable Sets of Integers},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {615--624},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_51},
doi = {10.1007/3-540-45687-2\_51},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Rigo02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Tantau02,
author = {Till Tantau},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Towards a Cardinality Theorem for Finite Automata},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {625--636},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_52},
doi = {10.1007/3-540-45687-2\_52},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Tantau02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Villemaire02,
author = {Roger Villemaire},
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {An Approximation Semantics for the Propositional Mu-Calculus},
booktitle = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
pages = {637--650},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2\_53},
doi = {10.1007/3-540-45687-2\_53},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Villemaire02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2002,
editor = {Krzysztof Diks and
Wojciech Rytter},
title = {Mathematical Foundations of Computer Science 2002, 27th International
Symposium, {MFCS} 2002, Warsaw, Poland, August 26-30, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2420},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45687-2},
doi = {10.1007/3-540-45687-2},
isbn = {3-540-44040-2},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2002.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-20 00:16 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:
