Search dblp for Publications

export results for "toc:db/journals/tcs/tcs233.bht:"

 download as .bib file

@article{DBLP:journals/tcs/AkutsuH00,
  author       = {Tatsuya Akutsu and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {On the approximation of largest common subtrees and largest common
                  point sets},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {33--50},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00278-8},
  doi          = {10.1016/S0304-3975(97)00278-8},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/AkutsuH00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AumannBF00,
  author       = {Yonatan Aumann and
                  Judit Bar{-}Ilan and
                  Uriel Feige},
  title        = {On the cost of recomputing: Tight bounds on pebbling with faults},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {247--261},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00085-1},
  doi          = {10.1016/S0304-3975(98)00085-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AumannBF00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BermondGPRV00,
  author       = {Jean{-}Claude Bermond and
                  Luisa Gargano and
                  Stephane Perennes and
                  Adele A. Rescigno and
                  Ugo Vaccaro},
  title        = {Efficient collective communication in optical networks},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {165--189},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00018-8},
  doi          = {10.1016/S0304-3975(98)00018-8},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BermondGPRV00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CaronZ00,
  author       = {Pascal Caron and
                  Djelloul Ziadi},
  title        = {Characterization of Glushkov automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {75--90},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00296-X},
  doi          = {10.1016/S0304-3975(97)00296-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CaronZ00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CattaneoFMM00,
  author       = {Gianpiero Cattaneo and
                  Enrico Formenti and
                  Giovanni Manzini and
                  Luciano Margara},
  title        = {Ergodicity, transitivity, and regularity for linear cellular automata
                  over Z\({}_{\mbox{m}}\)},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {147--164},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00005-X},
  doi          = {10.1016/S0304-3975(98)00005-X},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/CattaneoFMM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/CattellDDFL00,
  author       = {Kevin Cattell and
                  Michael J. Dinneen and
                  Rodney G. Downey and
                  Michael R. Fellows and
                  Michael A. Langston},
  title        = {On computing graph minor obstruction sets},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {107--127},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00300-9},
  doi          = {10.1016/S0304-3975(97)00300-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/CattellDDFL00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChP00,
  author       = {Eric Goles Ch. and
                  Erich Prisner},
  title        = {Source reversal and chip firing on graphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {287--295},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00122-X},
  doi          = {10.1016/S0304-3975(99)00122-X},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/ChP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Evfimievski00,
  author       = {Alexandre V. Evfimievski},
  title        = {A probabilistic algorithm for updating files over a communication
                  link},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {191--199},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00019-X},
  doi          = {10.1016/S0304-3975(98)00019-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Evfimievski00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/FederMP00,
  author       = {Tom{\'{a}}s Feder and
                  Nimrod Megiddo and
                  Serge A. Plotkin},
  title        = {A sublinear parallel algorithm for stable matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {297--308},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00125-5},
  doi          = {10.1016/S0304-3975(99)00125-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/FederMP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GardnerGP00,
  author       = {R. J. Gardner and
                  Peter Gritzmann and
                  Dieter Prangenberg},
  title        = {On the computational complexity of determining polyatomic structures
                  by X-rays},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {91--106},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00298-3},
  doi          = {10.1016/S0304-3975(97)00298-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GardnerGP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GermainP00,
  author       = {Christian Germain and
                  Jean Marcel Pallo},
  title        = {Langages rationnels d{\'{e}}finis avec une concat{\'{e}}nation
                  non-associative},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {217--231},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00043-7},
  doi          = {10.1016/S0304-3975(98)00043-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GermainP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Hashiguchi00,
  author       = {Kosaburo Hashiguchi},
  title        = {New upper bounds to the limitedness of distance automata},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {19--32},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00260-0},
  doi          = {10.1016/S0304-3975(97)00260-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Hashiguchi00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KalyanasundaramP00,
  author       = {Bala Kalyanasundaram and
                  Kirk Pruhs},
  title        = {An optimal deterministic algorithm for online b-matching},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {319--325},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00140-1},
  doi          = {10.1016/S0304-3975(99)00140-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KalyanasundaramP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KarpinskiPS00,
  author       = {Marek Karpinski and
                  Alfred J. van der Poorten and
                  Igor E. Shparlinski},
  title        = {Zero testing of p-adic and modular polynomials},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {309--317},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00133-4},
  doi          = {10.1016/S0304-3975(99)00133-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KarpinskiPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KawaharaM00,
  author       = {Yasuo Kawahara and
                  Masao Mori},
  title        = {A small final coalgebra theorem},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {129--145},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00302-2},
  doi          = {10.1016/S0304-3975(97)00302-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KawaharaM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LungoRP00,
  author       = {Alberto Del Lungo and
                  Francesco Del Ristoro and
                  Jean{-}Guy Penaud},
  title        = {Left ternary trees and non-separable rooted planar maps},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {201--215},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00025-5},
  doi          = {10.1016/S0304-3975(98)00025-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LungoRP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MontiP00,
  author       = {Angelo Monti and
                  Adriano Peron},
  title        = {Systolic tree omega-Languages: the operational and the logical view},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {1--18},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00257-0},
  doi          = {10.1016/S0304-3975(97)00257-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MontiP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/NishidaS00,
  author       = {Taishin Y. Nishida and
                  Arto Salomaa},
  title        = {On slender 0L languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {279--286},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00111-5},
  doi          = {10.1016/S0304-3975(99)00111-5},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/NishidaS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Propp00,
  author       = {James Gary Propp},
  title        = {Three-player impartial games},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {263--278},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00128-0},
  doi          = {10.1016/S0304-3975(99)00128-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Propp00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Rabinovich00,
  author       = {Alexander Moshe Rabinovich},
  title        = {Star free expressions over the reals},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {233--245},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(98)00050-4},
  doi          = {10.1016/S0304-3975(98)00050-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Rabinovich00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RobilliardS00,
  author       = {Denis Robilliard and
                  David Simplot},
  title        = {Undecidability of existential properties in picture languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {233},
  number       = {1-2},
  pages        = {51--74},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(97)00279-X},
  doi          = {10.1016/S0304-3975(97)00279-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RobilliardS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.