Se Yong Park

Ph.D. Candidate at UC Berkeley

Advisor : Anant Sahai

Email: separk at eecs.berkeley.edu

Publications

Journals

[J1] “Approximately-optimal solutions to the finite-dimensional Witsenhausen counterexample” Pulkit  Grover, Se Yong Park and Anant Sahai, To appear in IEEE Trans. on Automatic Control, 2013.

[J2] “An approximate solution to the decentralized two-controller infinite-horizon scalar LQG problem — Part I. Fast Dynamics” Se Yong Park and Anant Sahai, Extended Journal Version in Preparation.

[J3] “An approximate solution to the decentralized two-controller infinite-horizon scalar LQG problem — Part II. Slow Dynamics” Se Yong Park and Anant Sahai, Extended Journal Version in Preparation.

[J4] “Intermittent Kalman Filtering: Eigenvalue Cycles and Nonuniform Sampling” Se Yong Park and Anant Sahai, Extended Journal Version in Preparation.

[J5] “Network Coding Meets Decentralized Control: Capacity-Stabilizabililty Equivalence” Se Yong Park and Anant Sahai, Extended Journal Version in Preparation.

[J6] “Linear Function Computation in Networks: Duality and Constant Gap Results” Jiening Zhan, Se Yong Park, Michael Gastpar and Anant Sahai, To appear in IEEE Journal on Selected Areas in Communications(JSAC), 2013.

Conferences

[C1] “A constant factor approximately optimal solution to the Witsenhausen counterexample” Se Yong Park, Pulkit Grover and Anant Sahai. IEEE Conference on Decision and Control, 2009.

[C2] “The Finite Dimensional Witsenhausen Counterexample” Pulkit Grover, Anant Sahai and Se Yong Park, Control over Communication channels (ConCom), 2009.

[C3] “A  Generalized Witsenhausen Counterexample” Pulkit Grover, Se Yong Park and Anant Sahai, Annual Allerton Conference on Communication, Control, and Computing, 2009.

[C4] “It may be “easier to approximate” decentralized infinite-horizon LQG problems” Se Yong Park and Anant Sahai, IEEE Conference on Decision and Control, 2012.

[C5] “Intermittent Kalman Filtering: Eigenvalue Cycles and Nonuniform Sampling” Se Yong Park and Anant Sahai, American Control Conference, San Francisco, 2011

[C6] “Network Coding Meets Decentralized Control: Capacity-Stabilizabililty Equivalence” Se Yong Park and Anant Sahai, IEEE Conference on Decision and Control, 2011

[C7] “An Algebraic Mincut-Maxflow Theorem” Se Yong Park and Anant Sahai, IEEE International Symposium on Information Theory, 2011

[C8] “Function Computation in Networks: Duality and Constant Gap Results” Jiening Zhan, Se Yong Park, Michael Gastpar and Anant Sahai, Annual Allerton Conference on Communication, Control, and Computing, 2011.

[C9] “Carry-free models and beyond” Se Yong Park, Gireeja Ranade and Anant Sahai, IEEE International Symposium on Information Theory, 2012.

[C10] “Queue Length as an Implicit Communication Channel” Se Yong Park and Anant Sahai, IEEE International Symposium on Information Theory, 2013. Submitted

[C11] “Intermittent Kalman Filtering with Adversarial Erasures: Eigenvalue Cycles again” Se Yong Park and Anant Sahai, IEEE Conference on Decision and Control, 2013. Submitted

[C12] “A Geometric Slicing Lower Bound for Average-Cost Dynamic Programming” Se Yong Park and Anant Sahai, IEEE Conference on Decision and Control, 2013. Submitted

1