A sphere decoding approach for the vector Viterbi algorithm. - Peter Kairouz; Aolin Xu 001; Naresh R. Shanbhag; Andrew C. Singer (ACSCC, 2012)

A fully automated technique for constructing FSM abstractions of non-ideal latches in communication systems. - Aadithya V. Karthik; Yingyan Lin; Chenjie Gu; Aolin Xu 001; Jaijeet S. Roychowdhury; Naresh R. Shanbhag (ICASSP, 2012)

A new information-theoretic lower bound for distributed function computation. - Aolin Xu 001; Maxim Raginsky (ISIT, 2014)

Converses for distributed estimation via strong data processing inequalities. - Aolin Xu 001; Maxim Raginsky (ISIT, 2015)

Information-theoretic analysis of stability and bias of learning algorithms. - Maxim Raginsky; Alexander Rakhlin; Matthew Tsao; Yihong Wu; Aolin Xu 001 (ITW, 2016)

A Study of BER-Optimal ADC-Based Receiver for Serial Links. - Yingyan Lin; Min-Sun Keel; Adam C. Faust; Aolin Xu 001; Naresh R. Shanbhag; Elyse Rosenbaum; Andrew C. Singer (IEEE Trans. Circuits Syst. I Regul. Pap., 2016)

Information-theoretic analysis of generalization capability of learning algorithms. - Aolin Xu 001; Maxim Raginsky (NIPS, 2017)

Information-Theoretic Lower Bounds on Bayes Risk in Decentralized Estimation. - Aolin Xu 001; Maxim Raginsky (IEEE Trans. Inf. Theory, 2017)

Information-Theoretic Lower Bounds for Distributed Function Computation. - Aolin Xu 001; Maxim Raginsky (IEEE Trans. Inf. Theory, 2017)

Minimax Lower Bounds for Circular Source Localization. - Aolin Xu 001; Todd Coleman (ISIT, 2020)

Minimum Excess Risk in Bayesian Learning. - Aolin Xu 001; Maxim Raginsky (IEEE Trans. Inf. Theory, 2022)

Bayesian Learning for Dynamic Inference. - Aolin Xu 001; Peng Guan (CoRR, 2023)