@article{journals/algorithmica/DemaineLW14,
  added-at = {2018-11-30T00:00:00.000+0100},
  author = {Demaine, Erik D. and Landau, Gad M. and Weimann, Oren},
  biburl = {https://www.bibsonomy.org/bibtex/23782819d8f92ac0a894ab44adb25608d/dblp},
  ee = {https://doi.org/10.1007/s00453-012-9683-x},
  interhash = {b7f3ade5edf09e5660e7ebc5f1963a52},
  intrahash = {3782819d8f92ac0a894ab44adb25608d},
  journal = {Algorithmica},
  keywords = {dblp},
  number = 3,
  pages = {610-625},
  timestamp = {2018-12-01T11:39:36.000+0100},
  title = {On Cartesian Trees and Range Minimum Queries.},
  url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica68.html#DemaineLW14},
  volume = 68,
  year = 2014
}

{"_id":"Y78dnBrSRXdJdXN3G","bibbaseid":"demaine-landau-weimann-oncartesiantreesandrangeminimumqueries-2014","downloads":0,"creationDate":"2015-06-13T03:01:21.492Z","title":"On Cartesian Trees and Range Minimum Queries.","author_short":["Demaine, E. D.","Landau, G. M.","Weimann, O."],"year":2014,"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/Landau?items=1000","bibdata":{"bibtype":"article","type":"article","added-at":"2018-11-30T00:00:00.000+0100","author":[{"propositions":[],"lastnames":["Demaine"],"firstnames":["Erik","D."],"suffixes":[]},{"propositions":[],"lastnames":["Landau"],"firstnames":["Gad","M."],"suffixes":[]},{"propositions":[],"lastnames":["Weimann"],"firstnames":["Oren"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/23782819d8f92ac0a894ab44adb25608d/dblp","ee":"https://doi.org/10.1007/s00453-012-9683-x","interhash":"b7f3ade5edf09e5660e7ebc5f1963a52","intrahash":"3782819d8f92ac0a894ab44adb25608d","journal":"Algorithmica","keywords":"dblp","number":"3","pages":"610-625","timestamp":"2018-12-01T11:39:36.000+0100","title":"On Cartesian Trees and Range Minimum Queries.","url":"http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica68.html#DemaineLW14","volume":"68","year":"2014","bibtex":"@article{journals/algorithmica/DemaineLW14,\n added-at = {2018-11-30T00:00:00.000+0100},\n author = {Demaine, Erik D. and Landau, Gad M. and Weimann, Oren},\n biburl = {https://www.bibsonomy.org/bibtex/23782819d8f92ac0a894ab44adb25608d/dblp},\n ee = {https://doi.org/10.1007/s00453-012-9683-x},\n interhash = {b7f3ade5edf09e5660e7ebc5f1963a52},\n intrahash = {3782819d8f92ac0a894ab44adb25608d},\n journal = {Algorithmica},\n keywords = {dblp},\n number = 3,\n pages = {610-625},\n timestamp = {2018-12-01T11:39:36.000+0100},\n title = {On Cartesian Trees and Range Minimum Queries.},\n url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica68.html#DemaineLW14},\n volume = 68,\n year = 2014\n}\n\n","author_short":["Demaine, E. D.","Landau, G. M.","Weimann, O."],"key":"journals/algorithmica/DemaineLW14","id":"journals/algorithmica/DemaineLW14","bibbaseid":"demaine-landau-weimann-oncartesiantreesandrangeminimumqueries-2014","role":"author","urls":{"Link":"https://doi.org/10.1007/s00453-012-9683-x","Paper":"http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica68.html#DemaineLW14"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"html":""},"search_terms":["cartesian","trees","range","minimum","queries","demaine","landau","weimann"],"keywords":["dblp"],"authorIDs":["557ac9564e99777d36000593"],"dataSources":["7x2ydRSPDuX2rhr8r","gzaiqt38X7DKLvHXK","2Mbw2PT5CoNiwZHYd"]}