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/tcs249.bht:"
download as .bib file
@article{DBLP:journals/tcs/Berline00,
author = {Chantal Berline},
title = {From computation to foundations via functions and application: The
-calculus and its webbed models},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {1},
pages = {81--161},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00057-8},
doi = {10.1016/S0304-3975(00)00057-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Berline00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DunneGZ00,
author = {Paul E. Dunne and
Alan Gibbons and
Michele Zito},
title = {Complexity-theoretic models of phase transitions in search problems},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {243--263},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00061-X},
doi = {10.1016/S0304-3975(00)00061-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DunneGZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fraenkel00,
author = {Aviezri S. Fraenkel},
title = {Recent results and questions in combinatorial game complexities},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {265--288},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00062-1},
doi = {10.1016/S0304-3975(00)00062-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fraenkel00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FrankKS00,
author = {Frantisek Franek and
Ayse Karaman and
W. F. Smyth},
title = {Repetitions in Sturmian strings},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {289--303},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00063-3},
doi = {10.1016/S0304-3975(00)00063-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FrankKS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HolubM00,
author = {Jan Holub and
Borivoj Melichar},
title = {Approximate string matching using factor automata},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {305--311},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00064-5},
doi = {10.1016/S0304-3975(00)00064-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HolubM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Iliopoulos00,
author = {Costas S. Iliopoulos},
title = {Combinatorial Algorithms - Preface},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {241},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00060-8},
doi = {10.1016/S0304-3975(00)00060-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Iliopoulos00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KeimelMT00,
author = {Klaus Keimel and
Michael W. Mislove and
Constantine Tsinakis},
title = {Modern Algebra - Foreword},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {1},
pages = {1},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00055-4},
doi = {10.1016/S0304-3975(00)00055-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KeimelMT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Mouchard00,
author = {Laurent Mouchard},
title = {Normal forms of quasiperiodic strings},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {313--324},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00065-7},
doi = {10.1016/S0304-3975(00)00065-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Mouchard00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Oles00,
author = {Frank J. Oles},
title = {An application of lattice theory to knowledge representation},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {1},
pages = {163--196},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00058-X},
doi = {10.1016/S0304-3975(00)00058-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Oles00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RavindranGP00,
author = {Somasundaram Ravindran and
Alan Gibbons and
Mike Paterson},
title = {Dense edge-disjoint embedding of complete binary trees in interconnection
networks},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {325--342},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00066-9},
doi = {10.1016/S0304-3975(00)00066-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RavindranGP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Rutten00,
author = {Jan J. M. M. Rutten},
title = {Universal coalgebra: a theory of systems},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {1},
pages = {3--80},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00056-6},
doi = {10.1016/S0304-3975(00)00056-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Rutten00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Salibra00,
author = {Antonino Salibra},
title = {On the algebraic models of lambda calculus},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {1},
pages = {197--240},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00059-1},
doi = {10.1016/S0304-3975(00)00059-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Salibra00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Smyth00,
author = {W. F. Smyth},
title = {Repetitive perhaps, but certainly not boring},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {343--355},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00067-0},
doi = {10.1016/S0304-3975(00)00067-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Smyth00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Zhou00a,
author = {Sanming Zhou},
title = {Bounding the bandwidths for graphs},
journal = {Theor. Comput. Sci.},
volume = {249},
number = {2},
pages = {357--368},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(00)00068-2},
doi = {10.1016/S0304-3975(00)00068-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Zhou00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-25 06: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:
