@article{journals/ipl/BannaiGIILL12,
  added-at = {2012-09-05T00:00:00.000+0200},
  author = {Bannai, Hideo and Gagie, Travis and I, Tomohiro and Inenaga, Shunsuke and Landau, Gad M. and Lewenstein, Moshe},
  biburl = {https://www.bibsonomy.org/bibtex/27e083345d2b034807e5c16b363e0ec2e/dblp},
  ee = {http://dx.doi.org/10.1016/j.ipl.2012.06.017},
  interhash = {f7a48243d7a4f896ac28bdc823f81770},
  intrahash = {7e083345d2b034807e5c16b363e0ec2e},
  journal = {Inf. Process. Lett.},
  keywords = {dblp},
  number = 19,
  pages = {711-714},
  timestamp = {2012-09-06T11:32:56.000+0200},
  title = {An efficient algorithm to test square-freeness of strings compressed by straight-line programs.},
  url = {http://dblp.uni-trier.de/db/journals/ipl/ipl112.html#BannaiGIILL12},
  volume = 112,
  year = 2012
}

{"_id":"TEXspPrjFRL72zgCT","bibbaseid":"bannai-gagie-i-inenaga-landau-lewenstein-anefficientalgorithmtotestsquarefreenessofstringscompressedbystraightlineprograms-2012","author_short":["Bannai, H.","Gagie, T.","I, T.","Inenaga, S.","Landau, G. M.","Lewenstein, M."],"bibdata":{"bibtype":"article","type":"article","added-at":"2012-09-05T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Bannai"],"firstnames":["Hideo"],"suffixes":[]},{"propositions":[],"lastnames":["Gagie"],"firstnames":["Travis"],"suffixes":[]},{"propositions":[],"lastnames":["I"],"firstnames":["Tomohiro"],"suffixes":[]},{"propositions":[],"lastnames":["Inenaga"],"firstnames":["Shunsuke"],"suffixes":[]},{"propositions":[],"lastnames":["Landau"],"firstnames":["Gad","M."],"suffixes":[]},{"propositions":[],"lastnames":["Lewenstein"],"firstnames":["Moshe"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/27e083345d2b034807e5c16b363e0ec2e/dblp","ee":"http://dx.doi.org/10.1016/j.ipl.2012.06.017","interhash":"f7a48243d7a4f896ac28bdc823f81770","intrahash":"7e083345d2b034807e5c16b363e0ec2e","journal":"Inf. Process. Lett.","keywords":"dblp","number":"19","pages":"711-714","timestamp":"2012-09-06T11:32:56.000+0200","title":"An efficient algorithm to test square-freeness of strings compressed by straight-line programs.","url":"http://dblp.uni-trier.de/db/journals/ipl/ipl112.html#BannaiGIILL12","volume":"112","year":"2012","bibtex":"@article{journals/ipl/BannaiGIILL12,\n added-at = {2012-09-05T00:00:00.000+0200},\n author = {Bannai, Hideo and Gagie, Travis and I, Tomohiro and Inenaga, Shunsuke and Landau, Gad M. and Lewenstein, Moshe},\n biburl = {https://www.bibsonomy.org/bibtex/27e083345d2b034807e5c16b363e0ec2e/dblp},\n ee = {http://dx.doi.org/10.1016/j.ipl.2012.06.017},\n interhash = {f7a48243d7a4f896ac28bdc823f81770},\n intrahash = {7e083345d2b034807e5c16b363e0ec2e},\n journal = {Inf. Process. Lett.},\n keywords = {dblp},\n number = 19,\n pages = {711-714},\n timestamp = {2012-09-06T11:32:56.000+0200},\n title = {An efficient algorithm to test square-freeness of strings compressed by straight-line programs.},\n url = {http://dblp.uni-trier.de/db/journals/ipl/ipl112.html#BannaiGIILL12},\n volume = 112,\n year = 2012\n}\n\n","author_short":["Bannai, H.","Gagie, T.","I, T.","Inenaga, S.","Landau, G. M.","Lewenstein, M."],"key":"journals/ipl/BannaiGIILL12","id":"journals/ipl/BannaiGIILL12","bibbaseid":"bannai-gagie-i-inenaga-landau-lewenstein-anefficientalgorithmtotestsquarefreenessofstringscompressedbystraightlineprograms-2012","role":"author","urls":{"Link":"http://dx.doi.org/10.1016/j.ipl.2012.06.017","Paper":"http://dblp.uni-trier.de/db/journals/ipl/ipl112.html#BannaiGIILL12"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Landau?items=1000","dataSources":["2Mbw2PT5CoNiwZHYd"],"keywords":["dblp"],"search_terms":["efficient","algorithm","test","square","freeness","strings","compressed","straight","line","programs","bannai","gagie","i","inenaga","landau","lewenstein"],"title":"An efficient algorithm to test square-freeness of strings compressed by straight-line programs.","year":2012}