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/tcs201.bht:"
download as .bib file
@article{DBLP:journals/tcs/CattaneoM98,
author = {Gianpiero Cattaneo and
Luciano Margara},
title = {Generalized Sub-Shifts in Elementary Cellular Automata: The "Strange
Case" of Chaotic Rule 180},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {171--187},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00210-7},
doi = {10.1016/S0304-3975(97)00210-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CattaneoM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Chung98,
author = {Kuo{-}Liang Chung},
title = {An Improved Algorithm for Solving the Banded Cyclic String-to-String
Correction Problem},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {275--279},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00280-6},
doi = {10.1016/S0304-3975(97)00280-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Chung98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CichonB98,
author = {E. A. Cichon and
Elias Tahhan{-}Bittar},
title = {Ordinal Recursive Bounds for Higman's Theorem},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {63--84},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00009-1},
doi = {10.1016/S0304-3975(97)00009-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/CichonB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiazSS98,
author = {Josep D{\'{\i}}az and
Maria J. Serna and
Paul G. Spirakis},
title = {On the Random Generation and Counting of Matchings in Dense Graphs},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {281--290},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00297-1},
doi = {10.1016/S0304-3975(97)00297-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiazSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FerraginaGM98,
author = {Paolo Ferragina and
Roberto Grossi and
Manuela Montangero},
title = {On Updating Suffix Tree Labels},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {249--262},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00243-0},
doi = {10.1016/S0304-3975(97)00243-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FerraginaGM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Flasinski98,
author = {Mariusz Flasinski},
title = {Power Properties of {NLC} Graph Grammars with a Polynomial Membership
Problem},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {189--231},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00212-0},
doi = {10.1016/S0304-3975(97)00212-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Flasinski98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JacquetS98,
author = {Philippe Jacquet and
Wojciech Szpankowski},
title = {Analytical Depoissonization and its Applications},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {1--62},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00167-9},
doi = {10.1016/S0304-3975(97)00167-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JacquetS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LamL98,
author = {Tak Wah Lam and
Ka Hing Lee},
title = {An Improved Scheme for Set Equality Testing and Updating},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {85--97},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00024-8},
doi = {10.1016/S0304-3975(97)00024-8},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LamL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Moore98,
author = {Cristopher Moore},
title = {Dynamical Recognizers: Real-Time Language Recognition by Analog Computers},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {99--136},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00028-5},
doi = {10.1016/S0304-3975(97)00028-5},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Moore98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Park98,
author = {Kunsoo Park},
title = {Analysis of Two-Dimensional Approximate Pattern Matching Algorithms},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {263--273},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00277-6},
doi = {10.1016/S0304-3975(97)00277-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Park98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Portier98,
author = {Natacha Portier},
title = {R{\'{e}}solutions universelles pour des probl{\`{e}}mes NP-complets},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {137--150},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00029-7},
doi = {10.1016/S0304-3975(97)00029-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Portier98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rosaz98,
author = {Laurent Rosaz},
title = {Inventories of Unavoidable Languages and the Word-Extension Conjecture},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {151--170},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00031-5},
doi = {10.1016/S0304-3975(97)00031-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rosaz98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/WadaTK98,
author = {Koichi Wada and
Akinari Takaki and
Kimio Kawaguchi},
title = {Efficient Algorithms for a Mixed \emph{k}-Partition Problem of Graphs
Without Specifying Bases},
journal = {Theor. Comput. Sci.},
volume = {201},
number = {1-2},
pages = {233--248},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00225-9},
doi = {10.1016/S0304-3975(97)00225-9},
timestamp = {Mon, 22 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/WadaTK98.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-09-06 18:15 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:
