An algorithm for dynamic subset and intersection testing
- 1 July 1994
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 129 (2) , 397-406
- https://doi.org/10.1016/0304-3975(94)90036-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Lower bounds for set intersection queriesAlgorithmica, 1995
- Unique Binary-Search-Tree Representations and Equality Testing of Sets and SequencesSIAM Journal on Computing, 1994
- Representing sets with constant time equality testingJournal of Algorithms, 1992
- Making data structures persistentJournal of Computer and System Sciences, 1989
- Incremental computation via function cachingPublished by Association for Computing Machinery (ACM) ,1989
- New trie data structures which support very fast search operationsJournal of Computer and System Sciences, 1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- The Design of Dynamic Data StructuresPublished by Springer Nature ,1983
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979