default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYihan Zhang 0001
Person information
- unicode name: 张艺瀚
- affiliation: Institute of Science and Technology Austria (ISTA), Klosterneuburg, Austria
- affiliation: Technion - Israel Institute of Technology, Faculty of Computer Science, Haifa, Israel
- affiliation (PhD 2020): Chinese University of Hong Kong, Department of Information Engineering, Shatin, Hong Kong
Other persons with the same name
- Yihan Zhang (aka: YiHan Zhang) — disambiguation page
- Yihan Zhang 0002
![[0000-0002-1513-3784]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-1513-3784")
— Peking University, School of Integrated Circuit, Beijing, China (and 1 more) - Yihan Zhang 0003 — University of Nottingham Ningbo China (UNNC), School of Computer Science, Ningbo, China
- Yihan Zhang 0004 (aka: YiHan Zhang 0004) — Wuhan University of Technology, Department of Computer Science,, Wuhan, China
- Yihan Zhang 0005 — National University of Singapore, School of Computing, Singapore
- Yihan Zhang 0006 — Guangdong University of Finance and Economics, School of Geography and Tourism, Guangzhou, China
- Yihan Zhang 0007 — Jilin University, State Key Laboratory of Automotive Simulation and Control, Changchun, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower Bounds via Error Exponents. IEEE Trans. Inf. Theory 70(2): 1008-1039 (2024)- [j7]Nicolas Resch, Chen Yuan, Yihan Zhang:
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. IEEE Trans. Inf. Theory 70(9): 6211-6238 (2024) - [c21]Yihan Zhang, Hong Chang Ji, Ramji Venkataramanan, Marco Mondelli:
Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing (Extended Abstract). COLT 2024: 5224-5230 - [i20]Yihan Zhang, Marco Mondelli:
Matrix Denoising with Doubly Heteroscedastic Noise: Fundamental Limits and Optimal Spectral Methods. CoRR abs/2405.13912 (2024) - 2023
- [j6]Yihan Zhang:
Zero-Error Communication Over Adversarial MACs. IEEE Trans. Inf. Theory 69(7): 4093-4127 (2023) - [j5]Yihan Zhang, Shashank Vatedka:
Multiple Packing:Lower Bounds via Infinite Constellations. IEEE Trans. Inf. Theory 69(7): 4513-4527 (2023) - [j4]Nikita Polyanskii, Yihan Zhang:
Codes for the Z-Channel. IEEE Trans. Inf. Theory 69(10): 6340-6357 (2023) - [c20]Nicolas Resch, Chen Yuan, Yihan Zhang:
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. ICALP 2023: 99:1-99:18 - [i19]Yihan Zhang, Hong Chang Ji, Ramji Venkataramanan, Marco Mondelli:
Spectral Estimators for Structured Generalized Linear Models via Approximate Message Passing. CoRR abs/2308.14507 (2023) - [i18]Nicolas Resch, Chen Yuan, Yihan Zhang:
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. CoRR abs/2309.01800 (2023) - 2022
- [j3]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. IEEE Trans. Inf. Theory 68(8): 4901-4948 (2022) - [j2]Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. IEEE Trans. Inf. Theory 68(12): 7753-7786 (2022) - [c19]Pranav Joshi, Amritakshya Purkayastha, Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi:
On the Capacity of Additive AVCs with Feedback. ISIT 2022: 504-509 - [c18]Yihan Zhang, Shashank Vatedka:
Lower Bounds on List Decoding Capacity using Error Exponents. ISIT 2022: 1324-1329 - [c17]Yihan Zhang, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
The Capacity of Causal Adversarial Channels. ISIT 2022: 2523-2528 - [c16]Anuj Kumar Yadav, Mohammadreza Alimohammadi, Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi:
New Results on AVCs with Omniscient and Myopic Adversaries. ISIT 2022: 2535-2540 - [c15]Nikita Polyanskii, Yihan Zhang:
List-Decodable Zero-Rate Codes for the Z-Channel. ISIT 2022: 2553-2558 - [c14]Yihan Zhang, Shashank Vatedka:
List-Decodability of Poisson Point Processes. ISIT 2022: 2559-2564 - [c13]Yihan Zhang, Shashank Vatedka:
Lower bounds for Multiple Packing. ISIT 2022: 3085-3090 - [c12]Yihan Zhang, Nir Weinberger:
Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models. NeurIPS 2022 - [i17]Yihan Zhang, Sidharth Jaggi, Michael Langberg, Anand D. Sarwate:
The Capacity of Causal Adversarial Channels. CoRR abs/2205.06708 (2022) - [i16]Yihan Zhang, Nir Weinberger:
Mean Estimation in High-Dimensional Binary Markov Gaussian Mixture Models. CoRR abs/2206.02455 (2022) - [i15]Nicolas Resch, Chen Yuan, Yihan Zhang:
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. CoRR abs/2210.07754 (2022) - [i14]Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower and Upper Bounds. CoRR abs/2211.04406 (2022) - [i13]Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower Bounds via Infinite Constellations. CoRR abs/2211.04407 (2022) - [i12]Yihan Zhang, Shashank Vatedka:
Multiple Packing: Lower Bounds via Error Exponents. CoRR abs/2211.04408 (2022) - [i11]Yihan Zhang, Marco Mondelli, Ramji Venkataramanan:
Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models. CoRR abs/2211.11368 (2022) - 2021
- [j1]Sijie Li, Rawad Bitar, Sidharth Jaggi, Yihan Zhang:
Network Coding With Myopic Adversaries. IEEE J. Sel. Areas Inf. Theory 2(4): 1108-1119 (2021) - [c11]Sijie Li, Rawad Bitar, Sidharth Jaggi, Yihan Zhang:
Network Coding with Myopic Adversaries. ISIT 2021: 72-77 - [c10]Yihan Zhang, Sidharth Jaggi, Amitalok J. Budkuley:
Tight List-Sizes for Oblivious AVCs under Constraints. ISIT 2021: 1439-1444 - [c9]Yihan Zhang:
Zero-Error Communication over Adversarial MACs. ISIT 2021: 2072-2077 - [i10]Yihan Zhang:
Zero-Error Communication over Adversarial MACs. CoRR abs/2101.12426 (2021) - [i9]Sijie Li, Rawad Bitar, Sidharth Jaggi, Yihan Zhang:
Network Coding with Myopic Adversaries. CoRR abs/2102.09885 (2021) - [i8]Nikita Polyanskii, Yihan Zhang:
Codes for the Z-channel. CoRR abs/2105.01427 (2021) - 2020
- [c8]Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi:
Generalized List Decoding. ITCS 2020: 51:1-51:83 - [c7]Aditya Potukuchi, Yihan Zhang:
Improved efficiency for covering codes matching the sphere-covering bound. ISIT 2020: 102-107 - [c6]Yihan Zhang:
List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian. ISIT 2020: 373-378 - [c5]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi:
Quadratically Constrained Two-way Adversarial Channels. ISIT 2020: 1587-1592 - [c4]Qinghua Devon Ding, Sidharth Jaggi, Shashank Vatedka, Yihan Zhang:
Empirical Properties of Good Channel Codes. ISIT 2020: 2337-2342 - [c3]Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi:
Generalized List Decoding. ITA 2020: 51 - [i7]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi:
Quadratically Constrained Two-way Adversarial Channels. CoRR abs/2001.02575 (2020) - [i6]Yihan Zhang:
List Decoding for Oblivious Arbitrarily Varying MACs: Constrained and Gaussian. CoRR abs/2001.03049 (2020) - [i5]Yihan Zhang, Sidharth Jaggi, Amitalok J. Budkuley:
Tight List-Sizes for Oblivious AVCs under Constraints. CoRR abs/2009.03788 (2020)
2010 – 2019
- 2019
- [c2]Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. ISIT 2019: 1627-1631 - [i4]Yihan Zhang, Shashank Vatedka:
List Decoding Random Euclidean Codes and Infinite Constellations. CoRR abs/1901.03790 (2019) - [i3]Aditya Potukuchi, Yihan Zhang:
Improved efficiency for explicit covering codes matching the sphere-covering bound. CoRR abs/1902.07408 (2019) - [i2]Yihan Zhang, Amitalok J. Budkuley, Sidharth Jaggi:
Generalized List Decoding. CoRR abs/1909.04264 (2019) - 2018
- [c1]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. ISIT 2018: 611-615 - [i1]Yihan Zhang, Shashank Vatedka, Sidharth Jaggi, Anand D. Sarwate:
Quadratically Constrained Myopic Adversarial Channels. CoRR abs/1801.05951 (2018)
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-23 21:27 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:
