An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests

Giorgio Gambosi, Marco Protasi, Maurizio Talamo. An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests. In C. E. Veni Madhavan, editor, Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings. Volume 405 of Lecture Notes in Computer Science, pages 252-266, Springer, 1989.

@inproceedings{GambosiPT89,
  title = {An Efficient Implicit Data Structure for Path Testing and Searching in Rooted Trees and Forests},
  author = {Giorgio Gambosi and Marco Protasi and Maurizio Talamo},
  year = {1989},
  tags = {testing, data-flow},
  researchr = {https://researchr.org/publication/GambosiPT89},
  cites = {0},
  citedby = {0},
  pages = {252-266},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science, Ninth Conference, Bangalore, India, December 19-21, 1989, Proceedings},
  editor = {C. E. Veni Madhavan},
  volume = {405},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-52048-1},
}