Communications in Computer Algebra48(4), 166–186 (2014)

Monagan, M · 2014 · ACM communications in computer algebra · DOI 10.1145/2733693.2733720 · arXiv 3693.273372

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

1 Pith paper citing it

10 external citations · external index

open at publisher browse 1 citing papers arXiv PDF

representative citing papers

cs.PL · 2026-06-03 · unverdicted · novelty 3.0

Updated microbenchmarks on modern CPUs show low-bit tagging fastest for symbolic workloads while NaN-boxing avoids allocation overhead for floats.

Showing 1 of 1 citing paper.

Look Before You Leap: Checking In on Type Tag Checking cs.PL · 2026-06-03 · unverdicted · none · ref 13
Updated microbenchmarks on modern CPUs show low-bit tagging fastest for symbolic workloads while NaN-boxing avoids allocation overhead for floats.