DOI,IST REx ID,Research Group,Title of publication
10.1109/ISIT63088.2025.11195426,20667,MaMo,Mean estimation in high-dimensional binary timeinhomogeneous Markov Gaussian mixture models
10.1109/ISIT57864.2024.10619367,17893,MaMo,Properties of the strong data processing constant for Rényi divergence
10.1109/ISIT57864.2024.10619378,17894,MaMo,Variational characterizations of Sibson's α-mutual information
10.1109/ISIT57864.2024.10619362,17895,MaMo,Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs
10.1109/ISIT50566.2022.9834709,12011,MaMo,The capacity of causal adversarial channels
10.1109/ISIT50566.2022.9834711,12012,MaMo,Heterogeneous differential privacy via graphs
10.1109/ISIT50566.2022.9834850,12013,MaMo,On the capacity of additive AVCs with feedback
10.1109/ISIT50566.2022.9834512,12014,MaMo,List-decodability of Poisson Point Processes
10.1109/ISIT50566.2022.9834443,12015,MaMo,Lower bounds for multiple packing
10.1109/ISIT50566.2022.9834712,12016,MaMo,Polar coded computing: The role of the scaling exponent
10.1109/ISIT50566.2022.9834632,12017,MaMo,New results on AVCs with omniscient and myopic adversaries
10.1109/ISIT50566.2022.9834815,12018,MaMo,Lower bounds on list decoding capacity using error exponents
10.1109/ISIT50566.2022.9834829,12019,MaMo,List-decodable zero-rate codes for the Z-channel
10.1109/ISIT45174.2021.9518153,10053,MaMo,Parallelism versus latency in simplified successive-cancellation decoding of polar codes
10.1109/ISIT44484.2020.9174141,8536,MaMo,Simplified successive cancellation decoding of polar codes has sublinear latency