Introduces random bit recycling for linear-time uniform generation of fixed-Hamming-weight binary words with near-Shannon-entropy random bit consumption.
Mihir Durve
2 Pith papers cite this work, alongside 453 external citations. Polarity classification is still indexing.
2
Pith papers citing it
453
external citations · external index
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Monte Carlo tournament of 10^6 Briscola games finds that briscola-hoarding and public-information counter strategies outperform greedy play after controlling for trump-count imbalance.
citing papers explorer
-
Entropic Generation of Binary Words
Introduces random bit recycling for linear-time uniform generation of fixed-Hamming-weight binary words with near-Shannon-entropy random bit consumption.
-
Beyond the briscola advantage: a Monte Carlo dominance test for deterministic strategies in two-player Briscola Game
Monte Carlo tournament of 10^6 Briscola games finds that briscola-hoarding and public-information counter strategies outperform greedy play after controlling for trump-count imbalance.