%0 Journal Article %1 journals/ijfcs/Lagogiannis17 %A Lagogiannis, George %D 2017 %J Int. J. Found. Comput. Sci. %K dblp %N 2 %P 141-170 %T Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time. %U http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs28.html#Lagogiannis17 %V 28

@article{journals/ijfcs/Lagogiannis17, added-at = {2017-05-05T00:00:00.000+0200}, author = {Lagogiannis, George}, biburl = {https://www.bibsonomy.org/bibtex/21a2afb045fbfbf38b565955751d7dbee/dblp}, ee = {https://doi.org/10.1142/S0129054117500101}, interhash = {72cb8192db476ba19ccc27040c9d8a2b}, intrahash = {1a2afb045fbfbf38b565955751d7dbee}, journal = {Int. J. Found. Comput. Sci.}, keywords = {dblp}, number = 2, pages = {141-170}, timestamp = {2017-05-06T11:36:10.000+0200}, title = {Query-Optimal Partially Persistent B-Trees with Constant Worst-Case Update Time.}, url = {http://dblp.uni-trier.de/db/journals/ijfcs/ijfcs28.html#Lagogiannis17}, volume = 28, year = 2017 }