Feras A. Saad

works on

random sampling 2 entropy coding 1 entropy lower bounds 1 information theory 1 online algorithms 1 probability 1 probability distributions 1 space complexity 1 space-efficient computation 1

From the 2 of 9 linked papers with an AI index.

activity

20242026

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2026

Online Random Sampling with Real Probabilities

Thomas L. Draper, David G. Harris, Feras A. Saad

The paper presents an online algorithm that samples from a sequence of discrete distributions using only fair coin flips, achieving near‑optimal entropy usage while using only loga…

cs.DS2026

Efficient Online Random Sampling via Randomness Recycling

Thomas L. Draper, Feras A. Saad

This article studies the fundamental problem of using i.i.d. coin tosses from an entropy source to efficiently generate random variables $X_{i} \sim P_{i}$ $(i \geq 1)$ , where $(P_1, P_…

cs.DS2026

Efficient Rejection Sampling in the Entropy-Optimal Range

Thomas L. Draper, Feras A. Saad

We study the problem of generating a random variate $X$ from a finite discrete probability distribution $P$ using an entropy source of independent fair coin flips. A classic result…