Se Yong Park

According to our database1, Se Yong Park authored at least 17 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Transparency Tools for Fairness in AI (Luskin).
CoRR, 2020

2014
Optimal strategies for dynamic joint source-channel coding with feedback.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Information Flow in Linear Systems.
PhD thesis, 2013

Approximately Optimal Solutions to the Finite-Dimensional Witsenhausen Counterexample.
IEEE Trans. Autom. Control., 2013

Linear Function Computation in Networks: Duality and Constant Gap Results.
IEEE J. Sel. Areas Commun., 2013

Network Coding meets Decentralized Control: Network Linearization and Capacity-Stabilizablilty Equivalence.
CoRR, 2013

Intermittent Kalman filtering with adversarial erasures: Eigenvalue cycles again.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

A geometric slicing lower bound for average-cost dynamic programming.
Proceedings of the 52nd IEEE Conference on Decision and Control, 2013

Queue length as an implicit communication channel.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Carry-free models and beyond.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

It may be "easier to approximate" decentralized infinite-horizon LQG problems.
Proceedings of the 51th IEEE Conference on Decision and Control, 2012

2011
An algebraic mincut-maxflow theorem.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Network coding meets decentralized control: Capacity-stabilizabililty equivalence.
Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference, 2011

Intermittent Kalman filtering: Eigenvalue cycles and nonuniform sampling.
Proceedings of the American Control Conference, 2011

Function computation in networks: Duality and constant gap results.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2009
The finite-dimensional Witsenhausen counterexample.
Proceedings of the 7th International Symposium on Modeling and Optimization in Mobile, 2009

A constant-factor approximately optimal solution to the Witsenhausen counterexample.
Proceedings of the 48th IEEE Conference on Decision and Control, 2009


  Loading...