5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.IT2014★ 5 cited
Optimal algorithms for universal random number generation from finite memory sources
Gadiel Seroussi, Marcelo J. Weinberger
We study random number generators (RNGs), both in the fixed to variable-length (FVR) and the variable to fixed-length (VFR) regimes, in a universal setting in which the input is a…
cs.IT2011
Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood
Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger
We study the problem of deinterleaving a set of finite-memory (Markov) processes over disjoint finite alphabets, which have been randomly interleaved by a finite-memory switch. The…