@inproceedings{conf/esa/GolinILMN18,
  added-at = {2021-07-25T00:00:00.000+0200},
  author = {Golin, Mordecai J. and Iacono, John and Langerman, Stefan and Munro, J. Ian and Nekrich, Yakov},
  biburl = {https://www.bibsonomy.org/bibtex/2a51b5e2412f77177bdbfd28c508e8de7/dblp},
  booktitle = {ESA},
  crossref = {conf/esa/2018},
  editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},
  ee = {https://doi.org/10.4230/LIPIcs.ESA.2018.38},
  interhash = {ec4555ad517a511504f5c9e0f5d21626},
  intrahash = {a51b5e2412f77177bdbfd28c508e8de7},
  isbn = {978-3-95977-081-1},
  keywords = {dblp},
  pages = {38:1-38:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  series = {LIPIcs},
  timestamp = {2024-04-10T14:31:25.000+0200},
  title = {Dynamic Trees with Almost-Optimal Access Cost.},
  url = {http://dblp.uni-trier.de/db/conf/esa/esa2018.html#GolinILMN18},
  volume = 112,
  year = 2018
}

{"_id":"G2WBNH37qYToE3k8k","bibbaseid":"golin-iacono-langerman-munro-nekrich-dynamictreeswithalmostoptimalaccesscost-2018","authorIDs":[],"author_short":["Golin, M. J.","Iacono, J.","Langerman, S.","Munro, J. I.","Nekrich, Y."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2021-07-25T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Golin"],"firstnames":["Mordecai","J."],"suffixes":[]},{"propositions":[],"lastnames":["Iacono"],"firstnames":["John"],"suffixes":[]},{"propositions":[],"lastnames":["Langerman"],"firstnames":["Stefan"],"suffixes":[]},{"propositions":[],"lastnames":["Munro"],"firstnames":["J.","Ian"],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/2a51b5e2412f77177bdbfd28c508e8de7/dblp","booktitle":"ESA","crossref":"conf/esa/2018","editor":[{"propositions":[],"lastnames":["Azar"],"firstnames":["Yossi"],"suffixes":[]},{"propositions":[],"lastnames":["Bast"],"firstnames":["Hannah"],"suffixes":[]},{"propositions":[],"lastnames":["Herman"],"firstnames":["Grzegorz"],"suffixes":[]}],"ee":"https://doi.org/10.4230/LIPIcs.ESA.2018.38","interhash":"ec4555ad517a511504f5c9e0f5d21626","intrahash":"a51b5e2412f77177bdbfd28c508e8de7","isbn":"978-3-95977-081-1","keywords":"dblp","pages":"38:1-38:14","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","series":"LIPIcs","timestamp":"2024-04-10T14:31:25.000+0200","title":"Dynamic Trees with Almost-Optimal Access Cost.","url":"http://dblp.uni-trier.de/db/conf/esa/esa2018.html#GolinILMN18","volume":"112","year":"2018","bibtex":"@inproceedings{conf/esa/GolinILMN18,\n added-at = {2021-07-25T00:00:00.000+0200},\n author = {Golin, Mordecai J. and Iacono, John and Langerman, Stefan and Munro, J. Ian and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/2a51b5e2412f77177bdbfd28c508e8de7/dblp},\n booktitle = {ESA},\n crossref = {conf/esa/2018},\n editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz},\n ee = {https://doi.org/10.4230/LIPIcs.ESA.2018.38},\n interhash = {ec4555ad517a511504f5c9e0f5d21626},\n intrahash = {a51b5e2412f77177bdbfd28c508e8de7},\n isbn = {978-3-95977-081-1},\n keywords = {dblp},\n pages = {38:1-38:14},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},\n series = {LIPIcs},\n timestamp = {2024-04-10T14:31:25.000+0200},\n title = {Dynamic Trees with Almost-Optimal Access Cost.},\n url = {http://dblp.uni-trier.de/db/conf/esa/esa2018.html#GolinILMN18},\n volume = 112,\n year = 2018\n}\n\n","author_short":["Golin, M. J.","Iacono, J.","Langerman, S.","Munro, J. I.","Nekrich, Y."],"editor_short":["Azar, Y.","Bast, H.","Herman, G."],"key":"conf/esa/GolinILMN18","id":"conf/esa/GolinILMN18","bibbaseid":"golin-iacono-langerman-munro-nekrich-dynamictreeswithalmostoptimalaccesscost-2018","role":"author","urls":{"Link":"https://doi.org/10.4230/LIPIcs.ESA.2018.38","Paper":"http://dblp.uni-trier.de/db/conf/esa/esa2018.html#GolinILMN18"},"keyword":["dblp"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:01.099Z","downloads":0,"keywords":["dblp"],"search_terms":["dynamic","trees","optimal","access","cost","golin","iacono","langerman","munro","nekrich"],"title":"Dynamic Trees with Almost-Optimal Access Cost.","year":2018,"dataSources":["f7XsgZohqQ3Rphbct"]}