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/journals/tcs/tcs242.bht:"
download as .bib file
@article{DBLP:journals/tcs/ArvindV00a,
author = {Vikraman Arvind and
N. V. Vinodchandran},
title = {The counting complexity of group-definable languages},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {199--218},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00218-7},
doi = {10.1016/S0304-3975(98)00218-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArvindV00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BirgetMMW00,
author = {Jean{-}Camille Birget and
Stuart W. Margolis and
John C. Meakin and
Pascal Weil},
title = {PSPACE-complete problems for subgroups of free groups and inverse
finite automata},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {247--281},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00225-4},
doi = {10.1016/S0304-3975(98)00225-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BirgetMMW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CaludeCK00,
author = {Cristian Calude and
Elena Calude and
Bakhadyr Khoussainov},
title = {Finite nondeterministic automata: Simulation and minimality},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {219--235},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00221-7},
doi = {10.1016/S0304-3975(98)00221-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CaludeCK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Caron00a,
author = {Pascal Caron},
title = {Families of locally testable languages},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {361--376},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00332-6},
doi = {10.1016/S0304-3975(98)00332-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Caron00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Escobar-MolanoG00,
author = {Martha Escobar{-}Molano and
Shahram Ghandeharizadeh},
title = {On the complexity of coordinated display of multimedia objects},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {169--197},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00217-5},
doi = {10.1016/S0304-3975(98)00217-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Escobar-MolanoG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GyenizseV00,
author = {P{\'{a}}l Gyenizse and
S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
title = {A property of left-linear rewrite systems preserving recognizability},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {477--498},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00039-6},
doi = {10.1016/S0304-3975(00)00039-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GyenizseV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hubalek00,
author = {Friedrich Hubalek},
title = {On the variance of the internal path length of generalized digital
trees - The Mellin convolution approach},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {143--168},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00213-8},
doi = {10.1016/S0304-3975(98)00213-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hubalek00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hubert00,
author = {Pascal Hubert},
title = {Suites {\'{e}}quilibr{\'{e}}es},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {91--108},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00202-3},
doi = {10.1016/S0304-3975(98)00202-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hubert00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HwangYY00,
author = {Hsien{-}Kuei Hwang and
Bo{-}Yin Yang and
Yeong{-}Nan Yeh},
title = {Presorting algorithms: An average-case point of view},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {29--40},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00181-9},
doi = {10.1016/S0304-3975(98)00181-9},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HwangYY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Ilie00,
author = {Lucian Ilie},
title = {On lengths of words in context-free languages},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {327--359},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00266-7},
doi = {10.1016/S0304-3975(98)00266-7},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/Ilie00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KhullerPS00,
author = {Samir Khuller and
Robert Pless and
Yoram J. Sussmann},
title = {Fault tolerant K-center problems},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {237--245},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00222-9},
doi = {10.1016/S0304-3975(98)00222-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KhullerPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KrausP00,
author = {Sarit Kraus and
Tatjana L. Plotkin},
title = {Algorithms of distributed task allocation for cooperative agents},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {1--27},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00175-3},
doi = {10.1016/S0304-3975(98)00175-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KrausP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kucera00,
author = {Anton{\'{\i}}n Kucera},
title = {Effective decomposability of sequential behaviours},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {71--89},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00201-1},
doi = {10.1016/S0304-3975(98)00201-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kucera00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LeungW00,
author = {Hing Leung and
Detlef Wotschke},
title = {On the size of parsers and LR(k)-grammars},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {59--69},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00199-6},
doi = {10.1016/S0304-3975(98)00199-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LeungW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MakaninM00,
author = {G. S. Makanin and
Tatiana A. Makanina},
title = {Parametrisation of solutions of parametric equation in free monoid},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {403--475},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00004-9},
doi = {10.1016/S0304-3975(00)00004-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MakaninM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MartinezR00,
author = {Conrado Mart{\'{\i}}nez and
Salvador Roura},
title = {On the competitiveness of the move-to-front rule},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {313--325},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00264-3},
doi = {10.1016/S0304-3975(98)00264-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MartinezR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Meer00,
author = {Klaus Meer},
title = {Counting problems over the reals},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {41--58},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00190-X},
doi = {10.1016/S0304-3975(98)00190-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Meer00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MerliniSV00,
author = {Donatella Merlini and
Renzo Sprugnoli and
M. Cecilia Verri},
title = {Strip tiling and regular grammars},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {109--124},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00204-7},
doi = {10.1016/S0304-3975(98)00204-7},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/MerliniSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mundhenk00,
author = {Martin Mundhenk},
title = {On hard instances},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {301--311},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00262-X},
doi = {10.1016/S0304-3975(98)00262-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mundhenk00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShankarGYM00,
author = {Priti Shankar and
Amitranjan Gantait and
A. R. Yuvaraj and
Maya Madhavan},
title = {A new algorithm for linear regular tree pattern matching},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {125--142},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00205-9},
doi = {10.1016/S0304-3975(98)00205-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShankarGYM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Vandeth00,
author = {Drew Vandeth},
title = {Sturmian words and words with a critical exponent},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {283--300},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00227-8},
doi = {10.1016/S0304-3975(98)00227-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Vandeth00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Wang00a,
author = {Biing{-}Feng Wang},
title = {Tight bounds on the solutions of multidimensional divide-and-conquer
maximin recurrences},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {377--401},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00334-X},
doi = {10.1016/S0304-3975(98)00334-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Wang00a.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-06-05 19:34 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:
