Note to "An efficient Data Structure for Lattice Operation"
Maurizio Talamo, Paola Vocca
TL;DR
This paper responds to a recent critique of previous work on a data structure for lattice operations, clarifying implementation details and addressing performance concerns.
Contribution
It provides a detailed explanation of the data structure and space complexity, defending the original design against recent criticisms.
Findings
Clarifies implementation of the data structure
Addresses performance issues raised in critique
Reinforces the efficiency of the original data structure
Abstract
This note is to publicly answer to a paper recently accepted to SWAT 2020 [1] that claims to have solved an error in our papers [3,2] by proposing a solution with worst performances. In the following section we describe in detail sections 4.2 (Cluster collection) and 5 (Data Structure and Space Complexity) in [3] to show the implementation of the data structure.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Rough Sets and Fuzzy Logic · semigroups and automata theory