Search dblp for Publications

• > Home > Search

@article{DBLP:journals/tcs/ArtsG00,
  author       = {Thomas Arts and
                  J{\"{u}}rgen Giesl},
  title        = {Termination of term rewriting using dependency pairs},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {133--178},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00207-8},
  doi          = {10.1016/S0304-3975(99)00207-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ArtsG00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AstesianoR00,
  author       = {Egidio Astesiano and
                  Gianna Reggio},
  title        = {Formalism and method},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {3--34},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00205-4},
  doi          = {10.1016/S0304-3975(99)00205-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AstesianoR00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BouhoulaJM00,
  author       = {Adel Bouhoula and
                  Jean{-}Pierre Jouannaud and
                  Jos{\'{e}} Meseguer},
  title        = {Specification and proof in membership equational logic},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {35--132},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00206-6},
  doi          = {10.1016/S0304-3975(99)00206-6},
  timestamp    = {Wed, 20 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/BouhoulaJM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Dauchet00,
  author       = {Max Dauchet},
  title        = {Trees in Algebra and Programming (Editorial)},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {1},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00204-2},
  doi          = {10.1016/S0304-3975(99)00204-2},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/Dauchet00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/DessmarkLP00,
  author       = {Anders Dessmark and
                  Andrzej Lingas and
                  Andrzej Proskurowski},
  title        = {Maximum packing for k-connected partial k-trees in polynomial time},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {179--191},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00208-X},
  doi          = {10.1016/S0304-3975(99)00208-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/DessmarkLP00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LeivantM00,
  author       = {Daniel Leivant and
                  Jean{-}Yves Marion},
  title        = {A characterization of alternating log time by ramified recurrence},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {193--208},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00209-1},
  doi          = {10.1016/S0304-3975(99)00209-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LeivantM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/YamadaALM00,
  author       = {Toshiyuki Yamada and
                  J{\"{u}}rgen Avenhaus and
                  Carlos Lor{\'{\i}}a{-}S{\'{a}}enz and
                  Aart Middeldorp},
  title        = {Logicality of conditional rewrite systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {236},
  number       = {1-2},
  pages        = {209--232},
  year         = {2000},
  url          = {https://doi.org/10.1016/S0304-3975(99)00210-8},
  doi          = {10.1016/S0304-3975(99)00210-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/YamadaALM00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}