HashGraph uses sparse graph representations to construct hash tables that handle arbitrary collisions and load factors with claimed 2.5B keys/sec build rates on GPUs, outperforming cuDPP and cuDF.
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
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
The paper consolidates existing research on Mamba models, their architecture variants, adaptations to different data modalities, and applications across domains.
citing papers explorer
-
HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure
HashGraph uses sparse graph representations to construct hash tables that handle arbitrary collisions and load factors with claimed 2.5B keys/sec build rates on GPUs, outperforming cuDPP and cuDF.
-
A Survey of Mamba
The paper consolidates existing research on Mamba models, their architecture variants, adaptations to different data modalities, and applications across domains.