70 citations · 190 across the 15 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
Stefan Hermann, Hans-Peter Lehmann, Giulio Ermanno Pibiri +2
A minimal perfect hash function (MPHF) maps a set of n keys to {1, ..., n} without collisions. Such functions find widespread application e.g. in bioinformatics and databases. In t…
cs.LG2024
Verifiable Boosted Tree Ensembles
Stefano Calzavara, Lorenzo Cazzaro, Claudio Lucchese +1
Verifiable learning advocates for training machine learning models amenable to efficient security verification. Prior research demonstrated that specific classes of decision tree e…