default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSe Yong Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i3]Mingliang Chen, Aria Shahverdi, Sarah Anderson, Se Yong Park, Justin Zhang, Dana Dachman-Soled, Kristin E. Lauter, Min Wu:
Transparency Tools for Fairness in AI (Luskin). CoRR abs/2007.04484 (2020)
2010 – 2019
- 2014
- [c12]Se Yong Park, Tara Javidi
, Andrea J. Goldsmith:
Optimal strategies for dynamic joint source-channel coding with feedback. ISIT 2014: 1524-1528 - 2013
- [b1]Se Yong Park:
Information Flow in Linear Systems. University of California, Berkeley, USA, 2013 - [j2]Jiening Zhan, Se Yong Park, Michael Gastpar, Anant Sahai:
Linear Function Computation in Networks: Duality and Constant Gap Results. IEEE J. Sel. Areas Commun. 31(4): 620-638 (2013) - [j1]Pulkit Grover, Se Yong Park, Anant Sahai:
Approximately Optimal Solutions to the Finite-Dimensional Witsenhausen Counterexample. IEEE Trans. Autom. Control. 58(9): 2189-2204 (2013) - [c11]Se Yong Park, Anant Sahai:
Queue length as an implicit communication channel. Allerton 2013: 940-947 - [c10]Se Yong Park, Anant Sahai:
A geometric slicing lower bound for average-cost dynamic programming. CDC 2013: 5216-5221 - [c9]Se Yong Park, Anant Sahai:
Intermittent Kalman filtering with adversarial erasures: Eigenvalue cycles again. CDC 2013: 6073-6078 - [i2]Se Yong Park, Anant Sahai:
Network Coding meets Decentralized Control: Network Linearization and Capacity-Stabilizablilty Equivalence. CoRR abs/1308.5045 (2013) - 2012
- [c8]Se Yong Park, Anant Sahai:
It may be "easier to approximate" decentralized infinite-horizon LQG problems. CDC 2012: 2250-2255 - [c7]Se Yong Park, Gireeja Ranade, Anant Sahai:
Carry-free models and beyond. ISIT 2012: 1927-1931 - 2011
- [c6]Jiening Zhan, Se Yong Park, Michael Gastpar, Anant Sahai:
Function computation in networks: Duality and constant gap results. Allerton 2011: 1470-1477 - [c5]Se Yong Park, Anant Sahai:
Intermittent Kalman filtering: Eigenvalue cycles and nonuniform sampling. ACC 2011: 3692-3697 - [c4]Se Yong Park, Anant Sahai:
Network coding meets decentralized control: Capacity-stabilizabililty equivalence. CDC/ECC 2011: 4817-4822 - [c3]Se Yong Park, Anant Sahai:
An algebraic mincut-maxflow theorem. ISIT 2011: 608-612 - 2010
- [i1]Pulkit Grover, Se Yong Park, Anant Sahai:
The finite-dimensional Witsenhausen counterexample. CoRR abs/1003.0514 (2010)
2000 – 2009
- 2009
- [c2]Se Yong Park, Pulkit Grover, Anant Sahai:
A constant-factor approximately optimal solution to the Witsenhausen counterexample. CDC 2009: 2881-2886 - [c1]Pulkit Grover, Anant Sahai, Se Yong Park:
The finite-dimensional Witsenhausen counterexample. WiOpt 2009: 1-10
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
