@article{DBLP:journals/corr/ChalermsookG0MS15a,
  author    = {Parinya Chalermsook and
               Mayank Goswami and
               L{\'{a}}szl{\'{o}} Kozma and
               Kurt Mehlhorn and
               Thatchaphol Saranurak},
  title     = {Greedy Is an Almost Optimal Deque},
  journal   = {CoRR},
  volume    = {abs/1506.08319},
  year      = {2015},
  url       = {http://arxiv.org/abs/1506.08319},
  archivePrefix = {arXiv},
  eprint    = {1506.08319},
  timestamp = {Mon, 28 Sep 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"PdPTRzJjQuur9GKBS","bibbaseid":"chalermsook-goswami-kozma-mehlhorn-saranurak-greedyisanalmostoptimaldeque-2015","author_short":["Chalermsook, P.","Goswami, M.","Kozma, L.","Mehlhorn, K.","Saranurak, T."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Parinya"],"propositions":[],"lastnames":["Chalermsook"],"suffixes":[]},{"firstnames":["Mayank"],"propositions":[],"lastnames":["Goswami"],"suffixes":[]},{"firstnames":["László"],"propositions":[],"lastnames":["Kozma"],"suffixes":[]},{"firstnames":["Kurt"],"propositions":[],"lastnames":["Mehlhorn"],"suffixes":[]},{"firstnames":["Thatchaphol"],"propositions":[],"lastnames":["Saranurak"],"suffixes":[]}],"title":"Greedy Is an Almost Optimal Deque","journal":"CoRR","volume":"abs/1506.08319","year":"2015","url":"http://arxiv.org/abs/1506.08319","archiveprefix":"arXiv","eprint":"1506.08319","timestamp":"Mon, 28 Sep 2020 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/ChalermsookG0MS15a.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/ChalermsookG0MS15a,\n author = {Parinya Chalermsook and\n Mayank Goswami and\n L{\\'{a}}szl{\\'{o}} Kozma and\n Kurt Mehlhorn and\n Thatchaphol Saranurak},\n title = {Greedy Is an Almost Optimal Deque},\n journal = {CoRR},\n volume = {abs/1506.08319},\n year = {2015},\n url = {http://arxiv.org/abs/1506.08319},\n archivePrefix = {arXiv},\n eprint = {1506.08319},\n timestamp = {Mon, 28 Sep 2020 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/ChalermsookG0MS15a.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Chalermsook, P.","Goswami, M.","Kozma, L.","Mehlhorn, K.","Saranurak, T."],"key":"DBLP:journals/corr/ChalermsookG0MS15a","id":"DBLP:journals/corr/ChalermsookG0MS15a","bibbaseid":"chalermsook-goswami-kozma-mehlhorn-saranurak-greedyisanalmostoptimaldeque-2015","role":"author","urls":{"Paper":"http://arxiv.org/abs/1506.08319"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://dblp.org/pid/123/4694.bib","dataSources":["aRHngFmcNsyNxZ9Rj"],"keywords":[],"search_terms":["greedy","optimal","deque","chalermsook","goswami","kozma","mehlhorn","saranurak"],"title":"Greedy Is an Almost Optimal Deque","year":2015}