BibTeX record conf/caap/BachmairCRR96

download as .bib file

@inproceedings{DBLP:conf/caap/BachmairCRR96,
  author       = {Leo Bachmair and
                  Ta Chen and
                  C. R. Ramakrishnan and
                  I. V. Ramakrishnan},
  editor       = {H{\'{e}}l{\`{e}}ne Kirchner},
  title        = {Subsumption Algorithms Based on Search Trees},
  booktitle    = {Trees in Algebra and Programming - CAAP'96, 21st International Colloquium,
                  Link{\"{o}}ping, Sweden, April, 22-24, 1996, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1059},
  pages        = {135--148},
  publisher    = {Springer},
  year         = {1996},
  url          = {https://doi.org/10.1007/3-540-61064-2\_34},
  doi          = {10.1007/3-540-61064-2\_34},
  timestamp    = {Mon, 03 Apr 2023 17:23:33 +0200},
  biburl       = {https://dblp.org/rec/conf/caap/BachmairCRR96.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.