Learned static functions combine per-key ML-predicted prefix codes with classic static function storage to compress static key-value mappings beyond zero-order entropy limits.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Minimizing pigeons for 2-hop and multihop demands is NP-hard, but a polynomial-time demand-aggregation algorithm achieves a 2-approximation.
citing papers explorer
-
Learned Static Function Data Structures
Learned static functions combine per-key ML-predicted prefix codes with classic static function storage to compress static key-value mappings beyond zero-order entropy limits.
-
The Carrier Pigeon Internet Protocol: An Algorithmic (and Lighthearted) Perspective
Minimizing pigeons for 2-hop and multihop demands is NP-hard, but a polynomial-time demand-aggregation algorithm achieves a 2-approximation.