Skip header Section
Skip Bibliometrics Section
Design of Dynamic Data StructuresNovember 1987
- Author:
- Mark H. Overmars
Abstract
No abstract available.
Cited By
Agarwal P, Hu X, Sintos S and Yang J (2024). On Reporting Durable Patterns in Temporal Proximity Graphs, Proceedings of the ACM on Management of Data, 2:2, (1-26), Online publication date: 10-May-2024.- Mathieu C, Rajaraman R, Young N and Yousefi A Competitive data-structure dynamization Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (2269-2287)
- Elmasry A, Kahla M, Ahdy F and Hashem M (2019). Red---black trees with constant update time, Acta Informatica, 56:5, (391-404), Online publication date: 1-Jul-2019.
- Aronov B, Bose P, Demaine E, Gudmundsson J, Iacono J, Langerman S and Smid M (2018). Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams, Algorithmica, 80:11, (3316-3334), Online publication date: 1-Nov-2018.
- Dexter P, Liu Y and Chiu K (2016). Lazy graph processing in Haskell, ACM SIGPLAN Notices, 51:12, (182-192), Online publication date: 19-Jul-2018.
- Demertzis I, Papadopoulos S, Papapetrou O, Deligiannakis A, Garofalakis M and Papamanthou C (2018). Practical Private Range Search in Depth, ACM Transactions on Database Systems, 43:1, (1-52), Online publication date: 11-Apr-2018.
- Allen S, Barba L, Iacono J and Langerman S (2017). Incremental Voronoi Diagrams, Discrete & Computational Geometry, 58:4, (822-848), Online publication date: 1-Dec-2017.
- Edelkamp S, Elmasry A and Katajainen J (2017). Optimizing Binary Heaps, Theory of Computing Systems, 61:2, (606-636), Online publication date: 1-Aug-2017.
- Acar U, Aksenov V and Westrick S Brief Announcement Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, (275-277)
- El-Zein H, Lewenstein M, Munro J, Raman V and Chan T (2017). On the Succinct Representation of Equivalence Classes, Algorithmica, 78:3, (1020-1040), Online publication date: 1-Jul-2017.
- Dexter P, Liu Y and Chiu K Lazy graph processing in Haskell Proceedings of the 9th International Symposium on Haskell, (182-192)
- Ferragina P, Piccinno F and Venturini R Compressed Indexes for String Searching in Labeled Graphs Proceedings of the 24th International Conference on World Wide Web, (322-332)
- Jansson J, Sadakane K and Sung W (2015). Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space, Algorithmica, 71:4, (969-988), Online publication date: 1-Apr-2015.
- Chung C, Tao Y and Wang W I/O-Efficient Dictionary Search with One Edit Error Proceedings of the 21st International Symposium on String Processing and Information Retrieval - Volume 8799, (191-202)
- Hu X, Qiao M and Tao Y Independent range sampling Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (246-255)
- Arya S and Chan T Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels Proceedings of the thirtieth annual symposium on Computational geometry, (416-425)
- Grossi R and Ottaviano G The wavelet trie Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, (203-214)
- Tao Y Indexability of 2D range search revisited Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems, (131-142)
- Driemel A and Har-Peled S Jaywalking your dog Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithms, (318-337)
- Chan T Three problems about dynamic convex hulls Proceedings of the twenty-seventh annual symposium on Computational geometry, (27-36)
- Streppel M and Yi K (2011). Approximate Range Searching in External Memory, Algorithmica, 59:2, (115-128), Online publication date: 1-Feb-2011.
- Kane D, Nelson J and Woodruff D An optimal algorithm for the distinct elements problem Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (41-52)
- Arge L and Zeh N External-memory algorithms and data structures Algorithms and theory of computation handbook, (10-10)
- Tamassia R and Cantrill B Basic data structures Algorithms and theory of computation handbook, (4-4)
- Hon W, Lam T, Shah R, Tam S and Vitter J Succinct Index for Dynamic Dictionary Matching Proceedings of the 20th International Symposium on Algorithms and Computation, (1034-1043)
- Chan T (2009). Dynamic Coresets, Discrete & Computational Geometry, 42:3, (469-488), Online publication date: 1-Oct-2009.
- Frandsen G and Frandsen P (2009). Dynamic matrix rank, Theoretical Computer Science, 410:41, (4085-4093), Online publication date: 1-Sep-2009.
- Giora Y and Kaplan H (2009). Optimal dynamic vertical ray shooting in rectilinear planar subdivisions, ACM Transactions on Algorithms, 5:3, (1-51), Online publication date: 1-Jul-2009.
- Chan T Dynamic coresets Proceedings of the twenty-fourth annual symposium on Computational geometry, (1-9)
- Blelloch G Space-efficient dynamic orthogonal point location, segment intersection, and range reporting Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (894-903)
- Vitter J (2008). Algorithms and data structures for external memory, Foundations and Trends® in Theoretical Computer Science, 2:4, (305-474), Online publication date: 1-Jan-2008.
- Streppel M and Yi K Approximate range searching in external memory Proceedings of the 18th international conference on Algorithms and computation, (536-548)
- Bender M, Farach-Colton M, Fineman J, Fogel Y, Kuszmaul B and Nelson J Cache-oblivious streaming B-trees Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, (81-92)
- Nekrich Y A data structure for multi-dimensional range reporting Proceedings of the twenty-third annual symposium on Computational geometry, (344-353)
- Chan H, Hon W, Lam T and Sadakane K (2007). Compressed indexes for dynamic text collections, ACM Transactions on Algorithms, 3:2, (21-es), Online publication date: 1-May-2007.
- El Oraiby W and Schmitt D k-sets of convex inclusion chains of planar point sets Proceedings of the 31st international conference on Mathematical Foundations of Computer Science, (339-350)
- Arge L and Zeh N Simple and semi-dynamic structures for cache-oblivious planar orthogonal range searching Proceedings of the twenty-second annual symposium on Computational geometry, (158-166)
- Aronov B, Bose P, Demaine E, Gudmundsson J, Iacono J, Langerman S and Smid M Data structures for halfplane proximity queries and incremental voronoi diagrams Proceedings of the 7th Latin American conference on Theoretical Informatics, (80-92)
- Acar U, Blelloch G, Blume M, Harper R and Tangwongsan K (2006). A Library for Self-Adjusting Computation, Electronic Notes in Theoretical Computer Science (ENTCS), 148:2, (127-154), Online publication date: 1-Mar-2006.
- Agarwal P, Xie J, Yang J and Yu H Monitoring continuous band-join queries over dynamic data Proceedings of the 16th international conference on Algorithms and Computation, (349-359)
- Seidel R Developments in data structure research during the first 25 years of FSTTCS Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science, (48-59)
- Bialynicka-Birula I and Grossi R Rank-Sensitive data structures Proceedings of the 12th international conference on String Processing and Information Retrieval, (79-90)
- Nekrich Y Space efficient dynamic orthogonal range reporting Proceedings of the twenty-first annual symposium on Computational geometry, (306-313)
- Kollios G, Papadopoulos D, Gunopulos D and Tsotras J (2005). Indexing mobile objects using dual transformations, The VLDB Journal — The International Journal on Very Large Data Bases, 14:2, (238-256), Online publication date: 1-Apr-2005.
- Shi Q and JaJa J Techniques for indexing and querying temporal observations for a collection of objects Proceedings of the 15th international conference on Algorithms and Computation, (822-834)
- Chandrasekaran S and Franklin M Remembrance of streams past Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (348-359)
- Acar U, Blelloch G, Harper R, Vittes J and Woo S Dynamizing static algorithms, with applications to dynamic trees and history independence Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (531-540)
- Agarwal P, Arge L and Erickson J (2003). Indexing moving points, Journal of Computer and System Sciences, 66:1, (207-243), Online publication date: 1-Feb-2003.
- Mortensen C Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (618-627)
- Blelloch G, Maggs B and Woo S Space-efficient finger search on degree-balanced search trees Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, (374-383)
- Zhang D, Tsotras V and Gunopulos D Efficient aggregation over objects with extent Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (121-132)
- Chan T Semi-online maintenance of geometric optima and measures Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, (474-483)
- Arge L External memory data structures Handbook of massive data sets, (313-357)
- Liberatore V (2001). Caching and Scheduling for Broadcast Disk Systems, ACM Journal of Experimental Algorithmics, 6, (5-es), Online publication date: 31-Dec-2002.
- Vitter J (2001). External memory algorithms and data structures, ACM Computing Surveys, 33:2, (209-271), Online publication date: 1-Jun-2001.
- Chan T (2001). Dynamic planar convex hull operations in near-logarithmic amortized time, Journal of the ACM, 48:1, (1-12), Online publication date: 1-Jan-2001.
- Pagh R (2000). A trade-off for worst-case efficient dictionaries, Nordic Journal of Computing, 7:3, (151-163), Online publication date: 1-Sep-2000.
- Arge L and Vahrenhold J I/O-efficient dynamic planar point location (extended abstract) Proceedings of the sixteenth annual symposium on Computational geometry, (191-200)
- Agarwal P, Arge L and Erickson J Indexing moving points (extended abstract) Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (175-186)
- Goodrich M Competitive tree-structured dictionaries Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, (494-495)
- Arge L, Samoladas V and Vitter J On two-dimensional indexability and optimal range search indexing Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (346-357)
- Kollios G, Gunopulos D and Tsotras V On indexing mobile objects Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (261-272)
- Agarwal P, Arge L, Brodal G and Vitter J I/O-efficient dynamic point location in monotone planar subdivisions Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (11-20)
- Arge L, Procopiuc O, Ramaswamy S, Suel T and Vitter J Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (685-694)
- Brodal G Finger search trees with constant insertion time Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, (540-549)
- Garmann R Maintaining dynamic geometric objects on parallel processors Proceedings of the IEEE symposium on Parallel rendering, (31-38)
- Basch J, Guibas L and Zhang L Proximity problems on moving points Proceedings of the thirteenth annual symposium on Computational geometry, (344-351)
- Tsotras V, Gopinath B and Hart G (1995). Efficient Management of Time-Evolving Databases, IEEE Transactions on Knowledge and Data Engineering, 7:4, (591-608), Online publication date: 1-Aug-1995.
- Deo N, Jain A and Medidi M (1994). Parallel Construction of (a, b)-Trees, Journal of Parallel and Distributed Computing, 23:3, (442-448), Online publication date: 1-Dec-1994.
- Atallah M, Goodrich M and Ramaiyer K Biased finger trees and three-dimensional layers of maxima Proceedings of the tenth annual symposium on Computational geometry, (150-159)
- La Poutré J Alpha-algorithms for incremental planarity testing (preliminary version) Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing, (706-715)
- Muthukrishnan S and Palem K Highly efficient dictionary matching in parallel Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures, (69-78)
- Goodrich M and Tamassia R Dynamic ray shooting and shortest paths via balanced geodesic triangulations Proceedings of the ninth annual symposium on Computational geometry, (318-327)
- Dubé T Dominance range-query: the one-reporting case Proceedings of the ninth annual symposium on Computational geometry, (208-217)
- Idury R and Schäffer A Multiple matching of rectangular patterns Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (81-90)
- Ramalingam G and Reps T A categorized bibliography on incremental computation Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (502-510)
- Buchsbaum A and Tarjan R Confluently persistent deques via data structuaral bootstrapping Proceedings of the fourth annual ACM-SIAM symposium on Discrete algorithms, (155-164)
- Matoušek J (1992). Efficient partition trees, Discrete & Computational Geometry, 8:3, (315-334), Online publication date: 1-Sep-1992.
- Schwarz C, Smid M and Snoeyink J An optimal algorithm for the on-line closest-pair problem Proceedings of the eighth annual symposium on Computational geometry, (330-336)
- Mulmuley K and Sen S Dynamic point location in arrangements of hyperplanes Proceedings of the seventh annual symposium on Computational geometry, (132-141)
- Mulmuley K Randomized multidimensional search trees (extended abstract) Proceedings of the seventh annual symposium on Computational geometry, (121-131)
- Chiang Y and Tamassia R Dynamization of the trapezoid method for planar point location (extended abstract) Proceedings of the seventh annual symposium on Computational geometry, (61-70)
- Matoušek J Efficient partition trees Proceedings of the seventh annual symposium on Computational geometry, (1-9)
- Cheng S and Janardan R Space-efficient ray-shooting and intersection searching Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, (7-16)
- Goodrich M and Tamassia R Dynamic trees and dynamic point location Proceedings of the twenty-third annual ACM symposium on Theory of Computing, (523-533)
- Chazelle B and Rosenberg B Computing partial sums in multidimensional arrays Proceedings of the fifth annual symposium on Computational geometry, (131-139)
- Levinson R, Helman D and Oswalt E Intelligent signal analysis and recognition using a self-organizing database Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2, (1116-1130)
- Willard D and Wee Y Quasi-Valid range querying and its implications for nearest neighbor problems Proceedings of the fourth annual symposium on Computational geometry, (34-43)
- Klein R, Nurmi O, Ottmann T and Wood D Optimal dynamic solutions for fixed windowing problems Proceedings of the second annual symposium on Computational geometry, (109-115)
- Overmars M Range searching in a set of line segments Proceedings of the first annual symposium on Computational geometry, (177-185)
- Goldberg A and Paige R Stream processing Proceedings of the 1984 ACM Symposium on LISP and functional programming, (53-62)
Recommendations
Language support for dynamic, hierarchical data partitioning
OOPSLA '13Applications written for distributed-memory parallel architectures must partition their data to enable parallel execution. As memory hierarchies become deeper, it is increasingly necessary that the data partitioning also be hierarchical to match. ...
Run-time data analysis in dynamic runtimes
SPLASH Companion 2021: Companion Proceedings of the 2021 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for HumanityDatabases are typically faster in processing huge amounts of data than applications with hand-coded data access. Even though modern dynamic runtimes optimize applications intensively, they cannot perform certain optimizations that are traditionally used ...
Design patterns for the data structures and algorithms course
SIGCSE '99: The proceedings of the thirtieth SIGCSE technical symposium on Computer science educationDesign patterns have recently emerged as a vehicle for describing and documenting recurring object-oriented designs. More significantly, they offer up a long-awaited framework for teaching good software design. This paper espouses the use of object-...