Manipulating downward-closed sets of vectors forms the basis of so-called antichain-based algorithms in verification. In that context, the dimension of the vectors is intimately tied to the size of the input structure to be verified. In this work, we formally analyze the complexity of classical list-based algorithms to manipulate antichains as well as that of Zampunieris’s sharing trees and traditional and novel k-d-tree-based antichain algorithms. In contrast to the existing literature, and to better address the needs of formal verification, our analysis of k-d-tree algorithms does not assume that the dimension of the vectors is fixed. Our theoretical results show that k-d-trees are asymptotically better than both list- and sharing-tree-based algorithms, as an antichain data structure, when the antichains become exponentially larger than the dimension of the vectors. We evaluate this on applications in the synthesis of reactive systems from linear-temporal logic and parity-objective specifications, and establish empirically that current benchmarks for these computational tasks do not lead to a favorable situation for current implementations of k-d-trees.