diff options
Diffstat (limited to 'references')
| -rw-r--r-- | references/references.bib | 57 |
1 files changed, 57 insertions, 0 deletions
diff --git a/references/references.bib b/references/references.bib index b29e8ec..7cec949 100644 --- a/references/references.bib +++ b/references/references.bib @@ -1028,6 +1028,23 @@ author = {Frank Olken and Doron Rotem} bibsource = {dblp computer science bibliography, https://dblp.org} } + +@article{merge-dsp, + author = {Mark H. Overmars and + Jan van Leeuwen}, + title = {Two general methods for dynamizing decomposable searching problems}, + journal = {Computing}, + volume = {26}, + number = {2}, + pages = {155--166}, + year = {1981}, + url = {https://doi.org/10.1007/BF02241781}, + doi = {10.1007/BF02241781}, + timestamp = {Thu, 06 Aug 2020 13:50:37 +0200}, + biburl = {https://dblp.org/rec/journals/computing/OvermarsL81.bib}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} + @inproceedings{vptree, author = {Peter N. Yianilos}, editor = {Vijaya Ramachandran}, @@ -1417,3 +1434,43 @@ pages = {671–680}, numpages = {10}, keywords = {analytic model, analysis of algorithms, overflow chaining, performance analysis, ISAM, overflow, overflow handling, indexed sequential access method, index sequential files, file organization, file structure} } + +@inproceedings{dynamize-succinct, + author = {Ankur Gupta and + Wing{-}Kai Hon and + Rahul Shah and + Jeffrey Scott Vitter}, + editor = {Lars Arge and + Christian Cachin and + Tomasz Jurdzinski and + Andrzej Tarlecki}, + title = {A Framework for Dynamizing Succinct Data Structures}, + booktitle = {Automata, Languages and Programming, 34th International Colloquium, + {ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings}, + series = {Lecture Notes in Computer Science}, + volume = {4596}, + pages = {521--532}, + publisher = {Springer}, + year = {2007}, + url = {https://doi.org/10.1007/978-3-540-73420-8\_46}, + doi = {10.1007/978-3-540-73420-8\_46}, + timestamp = {Wed, 28 Feb 2024 08:25:37 +0100}, + biburl = {https://dblp.org/rec/conf/icalp/GuptaHSV07.bib}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} + +@article{batched-decomposable, + author = {Herbert Edelsbrunner and + Mark H. Overmars}, + title = {Batched Dynamic Solutions to Decomposable Searching Problems}, + journal = {J. Algorithms}, + volume = {6}, + number = {4}, + pages = {515--542}, + year = {1985}, + url = {https://doi.org/10.1016/0196-6774(85)90030-6}, + doi = {10.1016/0196-6774(85)90030-6}, + timestamp = {Sun, 28 May 2017 13:24:58 +0200}, + biburl = {https://dblp.org/rec/journals/jal/EdelsbrunnerO85.bib}, + bibsource = {dblp computer science bibliography, https://dblp.org} +} |