@article{journals/iandc/VermaR92,
  added-at = {2021-02-12T00:00:00.000+0100},
  author = {Verma, Rakesh M. and Ramakrishnan, I. V.},
  biburl = {https://www.bibsonomy.org/bibtex/2b13c53f13ed87b67fe977e77dab49659/dblp},
  ee = {https://doi.org/10.1016/0890-5401(92)90075-Q},
  interhash = {ed3082c02d3c49fb1937fb7125b07513},
  intrahash = {b13c53f13ed87b67fe977e77dab49659},
  journal = {Inf. Comput.},
  keywords = {dblp},
  month = {11},
  number = 1,
  pages = {33-69},
  timestamp = {2024-04-09T06:10:29.000+0200},
  title = {Tight Complexity Bounds for Term Matching Problems},
  url = {http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92},
  volume = 101,
  year = 1992
}

{"_id":"uiHfv5ABffauizTY3","bibbaseid":"verma-ramakrishnan-tightcomplexityboundsfortermmatchingproblems-1992","author_short":["Verma, R. M.","Ramakrishnan, I. V."],"bibdata":{"bibtype":"article","type":"article","added-at":"2021-02-12T00: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/2b13c53f13ed87b67fe977e77dab49659/dblp","ee":"https://doi.org/10.1016/0890-5401(92)90075-Q","interhash":"ed3082c02d3c49fb1937fb7125b07513","intrahash":"b13c53f13ed87b67fe977e77dab49659","journal":"Inf. Comput.","keywords":"dblp","month":"11","number":"1","pages":"33-69","timestamp":"2024-04-09T06:10:29.000+0200","title":"Tight Complexity Bounds for Term Matching Problems","url":"http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92","volume":"101","year":"1992","bibtex":"@article{journals/iandc/VermaR92,\n added-at = {2021-02-12T00:00:00.000+0100},\n author = {Verma, Rakesh M. and Ramakrishnan, I. V.},\n biburl = {https://www.bibsonomy.org/bibtex/2b13c53f13ed87b67fe977e77dab49659/dblp},\n ee = {https://doi.org/10.1016/0890-5401(92)90075-Q},\n interhash = {ed3082c02d3c49fb1937fb7125b07513},\n intrahash = {b13c53f13ed87b67fe977e77dab49659},\n journal = {Inf. Comput.},\n keywords = {dblp},\n month = {11},\n number = 1,\n pages = {33-69},\n timestamp = {2024-04-09T06:10:29.000+0200},\n title = {Tight Complexity Bounds for Term Matching Problems},\n url = {http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92},\n volume = 101,\n year = 1992\n}\n\n","author_short":["Verma, R. M.","Ramakrishnan, I. V."],"key":"journals/iandc/VermaR92","id":"journals/iandc/VermaR92","bibbaseid":"verma-ramakrishnan-tightcomplexityboundsfortermmatchingproblems-1992","role":"author","urls":{"Link":"https://doi.org/10.1016/0890-5401(92)90075-Q","Paper":"http://dblp.uni-trier.de/db/journals/iandc/iandc101.html#VermaR92"},"keyword":["dblp"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/rakesh verma?items=1000","dataSources":["seGkXRkGoHfA3ej9n"],"keywords":["dblp"],"search_terms":["tight","complexity","bounds","term","matching","problems","verma","ramakrishnan"],"title":"Tight Complexity Bounds for Term Matching Problems","year":1992}