Pith. sign in

Broder, Anna R

Yossi Azar, Andrei Z · 1999 · SIAM Journal on Computing · DOI 10.1137/s0097539795288490

1 Pith paper cite this work, alongside 754 external citations. Polarity classification is still indexing.

1 Pith paper citing it
754 external citations · OpenAlex
open at publisher browse 1 citing papers

fields

cs.DS 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Succinct and Fast Tiny Pointer Hash Tables

cs.DS · 2026-07-30 · conditional · novelty 7.0

Two practical hash-table designs—Chained-TPHT and Flattened-TPHT—use byte-sized pointers and key quotienting to reach 105.4% and 83.4% space efficiency with constant-time operations and high throughput.

citing papers explorer

Showing 1 of 1 citing paper.

  • Succinct and Fast Tiny Pointer Hash Tables cs.DS · 2026-07-30 · conditional · none · ref 7

    Two practical hash-table designs—Chained-TPHT and Flattened-TPHT—use byte-sized pointers and key quotienting to reach 105.4% and 83.4% space efficiency with constant-time operations and high throughput.