Tight bounds for online stable sorting. Gagie, T. & Nekrich, Y. J. Discrete Algorithms, 9(2):176-181, 2011. Link Paper bibtex @article{journals/jda/GagieN11,
added-at = {2021-07-25T00:00:00.000+0200},
author = {Gagie, Travis and Nekrich, Yakov},
biburl = {https://www.bibsonomy.org/bibtex/28ec61aa3e843703128c29985423b4144/dblp},
ee = {https://doi.org/10.1016/j.jda.2011.01.003},
interhash = {fc61306db9b824639a71d969c4c015dd},
intrahash = {8ec61aa3e843703128c29985423b4144},
journal = {J. Discrete Algorithms},
keywords = {dblp},
number = 2,
pages = {176-181},
timestamp = {2024-04-08T20:30:20.000+0200},
title = {Tight bounds for online stable sorting.},
url = {http://dblp.uni-trier.de/db/journals/jda/jda9.html#GagieN11},
volume = 9,
year = 2011
}
Downloads: 0
{"_id":"RA9FsKebkCnSJgX6j","bibbaseid":"gagie-nekrich-tightboundsforonlinestablesorting-2011","authorIDs":["tMZWAHYFLsA3GH2EL"],"author_short":["Gagie, T.","Nekrich, Y."],"bibdata":{"bibtype":"article","type":"article","added-at":"2021-07-25T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Gagie"],"firstnames":["Travis"],"suffixes":[]},{"propositions":[],"lastnames":["Nekrich"],"firstnames":["Yakov"],"suffixes":[]}],"biburl":"https://www.bibsonomy.org/bibtex/28ec61aa3e843703128c29985423b4144/dblp","ee":"https://doi.org/10.1016/j.jda.2011.01.003","interhash":"fc61306db9b824639a71d969c4c015dd","intrahash":"8ec61aa3e843703128c29985423b4144","journal":"J. Discrete Algorithms","keywords":"dblp","number":"2","pages":"176-181","timestamp":"2024-04-08T20:30:20.000+0200","title":"Tight bounds for online stable sorting.","url":"http://dblp.uni-trier.de/db/journals/jda/jda9.html#GagieN11","volume":"9","year":"2011","bibtex":"@article{journals/jda/GagieN11,\n added-at = {2021-07-25T00:00:00.000+0200},\n author = {Gagie, Travis and Nekrich, Yakov},\n biburl = {https://www.bibsonomy.org/bibtex/28ec61aa3e843703128c29985423b4144/dblp},\n ee = {https://doi.org/10.1016/j.jda.2011.01.003},\n interhash = {fc61306db9b824639a71d969c4c015dd},\n intrahash = {8ec61aa3e843703128c29985423b4144},\n journal = {J. Discrete Algorithms},\n keywords = {dblp},\n number = 2,\n pages = {176-181},\n timestamp = {2024-04-08T20:30:20.000+0200},\n title = {Tight bounds for online stable sorting.},\n url = {http://dblp.uni-trier.de/db/journals/jda/jda9.html#GagieN11},\n volume = 9,\n year = 2011\n}\n\n","author_short":["Gagie, T.","Nekrich, Y."],"key":"journals/jda/GagieN11","id":"journals/jda/GagieN11","bibbaseid":"gagie-nekrich-tightboundsforonlinestablesorting-2011","role":"author","urls":{"Link":"https://doi.org/10.1016/j.jda.2011.01.003","Paper":"http://dblp.uni-trier.de/db/journals/jda/jda9.html#GagieN11"},"keyword":["dblp"],"metadata":{"authorlinks":{"nekrich, y":"https://bibbase.org/show?bib=http%3A%2F%2Fwww.bibsonomy.org%2Fbib%2Fauthor%2Fyakov%20nekrich%3Fitems=1000&msg=embed"}},"downloads":0},"bibtype":"article","biburl":"http://www.bibsonomy.org/bib/author/yakov nekrich?items=1000","creationDate":"2020-05-16T22:41:00.843Z","downloads":0,"keywords":["dblp"],"search_terms":["tight","bounds","online","stable","sorting","gagie","nekrich"],"title":"Tight bounds for online stable sorting.","year":2011,"dataSources":["f7XsgZohqQ3Rphbct"]}