The paper gives new complexity bounds for list-, sharing-tree-, and k-d-tree-based antichain operations and shows empirically that current verification benchmarks do not favor k-d trees.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
The paper gives new complexity bounds for list-, sharing-tree-, and k-d-tree-based antichain operations and shows empirically that current verification benchmarks do not favor k-d trees.