Search dblp for Publications

export results for "toc:db/journals/iandc/iandc154.bht:"

 download as .bib file

@article{DBLP:journals/iandc/CleavelandDSY99,
  author       = {Rance Cleaveland and
                  Zeynep Dayar and
                  Scott A. Smolka and
                  Shoji Yuen},
  title        = {Testing Preorders for Probabilistic Processes},
  journal      = {Inf. Comput.},
  volume       = {154},
  number       = {2},
  pages        = {93--148},
  year         = {1999},
  url          = {https://doi.org/10.1006/inco.1999.2808},
  doi          = {10.1006/INCO.1999.2808},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/CleavelandDSY99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/EngelfrietM99,
  author       = {Joost Engelfriet and
                  Sebastian Maneth},
  title        = {Macro Tree Transducers, Attribute Grammars, and {MSO} Definable Tree
                  Translations},
  journal      = {Inf. Comput.},
  volume       = {154},
  number       = {1},
  pages        = {34--91},
  year         = {1999},
  url          = {https://doi.org/10.1006/inco.1999.2807},
  doi          = {10.1006/INCO.1999.2807},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/EngelfrietM99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GrossiI99,
  author       = {Roberto Grossi and
                  Giuseppe F. Italiano},
  title        = {Efficient Splitting and Merging Algorithms for Order Decomposable
                  Problems},
  journal      = {Inf. Comput.},
  volume       = {154},
  number       = {1},
  pages        = {1--33},
  year         = {1999},
  url          = {https://doi.org/10.1006/inco.1999.2811},
  doi          = {10.1006/INCO.1999.2811},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/GrossiI99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/StephanT99,
  author       = {Frank Stephan and
                  Sebastiaan Terwijn},
  title        = {The Complexity of Universal Text-Learners},
  journal      = {Inf. Comput.},
  volume       = {154},
  number       = {2},
  pages        = {149--166},
  year         = {1999},
  url          = {https://doi.org/10.1006/inco.1999.2804},
  doi          = {10.1006/INCO.1999.2804},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/StephanT99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics