More on balanced diets
Lists
Only you see this
Abstract
Discrete Interval Encoding Trees are data structures for the representation of fat, i.e. densely populated sets over a discrete linear order. In this paper, we introduce algorithms for set-theoretic operations like intersection, union, etc. on sets represented as balanced diets. We empirically analyse their performance and show that these algorithms can outperform previously known algorithms on sets, such as the ones implemented in OCaml's standard library.
BibTeX
@article{friedmann2011more,
author = {Oliver Friedmann and Martin Lange},
title = {{More on balanced diets}},
journal = {J. Funct. Program.},
year = {2011},
doi = {10.1017/s0956796810000328},
}| Fast evaluation of union-intersection expressions | arXiv · 2007 |
| Fast Set Intersection in Memory | arXiv · 2011 |
| A New Method to Index and Query Sets | IJCAI · 1999 |
| The Trie Measure, Revisited | Cpm · 2025 |
| Fast Collection Operations from Indexed Stream Fusion | arXiv · 2025 |
| Experimental Comparison of Set Intersection Algorithms for Inverted Indexing | Itat · 2013 |