Representing sets with constant time equality testing

DOI10.1016/0196-6774(92)90044-DMaRDI QIDQ4020350zbMATH OpenFDO

Authors Daniel Yellin

Publication date 16 January 1993

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(92)90044-D

zbMATH Keywords

deleteequalinsertmembersets

Mathematics Subject Classification ID

Data structures (68P05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An improved scheme for set equality testing and updating
• Maintaining dynamic sequences under equality tests in polylogarithmic time
• Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
• scientific article; zbMATH DE number 742985
• scientific article; zbMATH DE number 88939

Cited in

(11)

• An improved scheme for set equality testing and updating
• Stable set and multiset operations in optimal time and space
• Finding extremal sets in less than quadratic time
• \texttt{FASTSET}: a fast data structure for the representation of sets of integers
• Fast sequential and parallel algorithms for finding extremal sets
• On Sets with Efficient Implicit Membership Tests
• scientific article; zbMATH DE number 88939 (Why is no real title available?)
• Equality testing for complex objects based on hashing
• Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗
• Unique Binary-Search-Tree Representations and Equality Testing of Sets and Sequences
• Maintaining dynamic sequences under equality tests in polylogarithmic time

This page was built for publication: Representing sets with constant time equality testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020350)