@inproceedings{conf/cade/VermaR88,
  added-at = {2018-11-30T00:00:00.000+0100},
  author = {Verma, Rakesh M. and Ramakrishnan, I. V.},
  biburl = {https://www.bibsonomy.org/bibtex/2ed0ef01ebf3b664f0fbd66008a2d9f95/dblp},
  booktitle = {CADE},
  crossref = {conf/cade/1988},
  editor = {Lusk, Ewing L. and Overbeek, Ross A.},
  ee = {https://doi.org/10.1007/BFb0012867},
  interhash = {48eb7f408ba355f9f7a068c6bb588a03},
  intrahash = {ed0ef01ebf3b664f0fbd66008a2d9f95},
  isbn = {3-540-19343-X},
  keywords = {dblp},
  pages = {694-703},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2019-05-15T18:55:05.000+0200},
  title = {Optimal Time Bounds for Parallel Term Matching.},
  url = {http://dblp.uni-trier.de/db/conf/cade/cade88.html#VermaR88},
  volume = 310,
  year = 1988
}

{"_id":"JybLavAA8TviT5o9h","bibbaseid":"verma-ramakrishnan-optimaltimeboundsforparalleltermmatching-1988","author_short":["Verma, R. M.","Ramakrishnan, I. V."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2018-11-30T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Verma"],"firstnames":["Rakesh","M."],"suffixes":[]},{"propositions":[],"lastnames":["Ramakrishnan"],"firstnames":["I.","V."],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2ed0ef01ebf3b664f0fbd66008a2d9f95/dblp","booktitle":"CADE","crossref":"conf/cade/1988","editor":[{"propositions":[],"lastnames":["Lusk"],"firstnames":["Ewing","L."],"suffixes":[]},{"propositions":[],"lastnames":["Overbeek"],"firstnames":["Ross","A."],"suffixes":[]}],"ee":"https://doi.org/10.1007/BFb0012867","interhash":"48eb7f408ba355f9f7a068c6bb588a03","intrahash":"ed0ef01ebf3b664f0fbd66008a2d9f95","isbn":"3-540-19343-X","keywords":"dblp","pages":"694-703","publisher":"Springer","series":"Lecture Notes in Computer Science","timestamp":"2019-05-15T18:55:05.000+0200","title":"Optimal Time Bounds for Parallel Term Matching.","url":"http://dblp.uni-trier.de/db/conf/cade/cade88.html#VermaR88","volume":"310","year":"1988","bibtex":"@inproceedings{conf/cade/VermaR88,\n added-at = {2018-11-30T00:00:00.000+0100},\n author = {Verma, Rakesh M. and Ramakrishnan, I. V.},\n biburl = {https://www.bibsonomy.org/bibtex/2ed0ef01ebf3b664f0fbd66008a2d9f95/dblp},\n booktitle = {CADE},\n crossref = {conf/cade/1988},\n editor = {Lusk, Ewing L. and Overbeek, Ross A.},\n ee = {https://doi.org/10.1007/BFb0012867},\n interhash = {48eb7f408ba355f9f7a068c6bb588a03},\n intrahash = {ed0ef01ebf3b664f0fbd66008a2d9f95},\n isbn = {3-540-19343-X},\n keywords = {dblp},\n pages = {694-703},\n publisher = {Springer},\n series = {Lecture Notes in Computer Science},\n timestamp = {2019-05-15T18:55:05.000+0200},\n title = {Optimal Time Bounds for Parallel Term Matching.},\n url = {http://dblp.uni-trier.de/db/conf/cade/cade88.html#VermaR88},\n volume = 310,\n year = 1988\n}\n\n","author_short":["Verma, R. M.","Ramakrishnan, I. V."],"editor_short":["Lusk, E. L.","Overbeek, R. A."],"key":"conf/cade/VermaR88","id":"conf/cade/VermaR88","bibbaseid":"verma-ramakrishnan-optimaltimeboundsforparalleltermmatching-1988","role":"author","urls":{"Link":"https://doi.org/10.1007/BFb0012867","Paper":"http://dblp.uni-trier.de/db/conf/cade/cade88.html#VermaR88"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/rakesh verma?items=1000","dataSources":["seGkXRkGoHfA3ej9n"],"keywords":["dblp"],"search_terms":["optimal","time","bounds","parallel","term","matching","verma","ramakrishnan"],"title":"Optimal Time Bounds for Parallel Term Matching.","year":1988}