BibTeX record conf/cpm/Zhang98

download as .bib file

@inproceedings{DBLP:conf/cpm/Zhang98,
  author       = {Kaizhong Zhang},
  editor       = {Martin Farach{-}Colton},
  title        = {Efficient Parallel Algorithm for the Editing Distance between Ordered
                  Trees},
  booktitle    = {Combinatorial Pattern Matching, 9th Annual Symposium, {CPM} 98, Piscataway,
                  New Jersey, USA, July 20-22, 1998, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1448},
  pages        = {80--90},
  publisher    = {Springer},
  year         = {1998},
  url          = {https://doi.org/10.1007/BFb0030782},
  doi          = {10.1007/BFB0030782},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/cpm/Zhang98.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.