default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQiaoqiao Zhou
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Qi Cao
, Qiaoqiao Zhou:
Zero-Error Capacity of the Chemical Residual Channel. IEEE Trans. Inf. Theory 70(2): 854-864 (2024)- [c24]Chao Zhao, Zimeng Wang, Qiaoqiao Zhou, Chee-Wei Tan, Chung Chan:
Infodemic Source Detection: Enhanced Formulations with Information Flow. ISIT 2024: 3291-3296 - 2023
- [j16]Hoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou, Lily M. L. Yung, Ka Hei Ng:
BAR: Blockwise Adaptive Recoding for Batched Network Coding. Entropy 25(7): 1054 (2023) - [j15]Xiwei Cheng, Sidharth Jaggi, Qiaoqiao Zhou:
Generalized Group Testing. IEEE Trans. Inf. Theory 69(3): 1413-1451 (2023) - [j14]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement via Secure Omniscience. IEEE Trans. Inf. Theory 69(12): 8029-8053 (2023) - 2022
- [j13]Jie Han, Tao Guo, Qiaoqiao Zhou, Wei Han, Bo Bai, Gong Zhang:
Structural Entropy of the Stochastic Block Models. Entropy 24(1): 81 (2022) - [c23]Xiwei Cheng, Sidharth Jaggi, Qiaoqiao Zhou:
Generalized Group Testing. AISTATS 2022: 10777-10835 - [c22]Qi Cao, Qiaoqiao Zhou:
On the Zero-Error Capacity of the Chemical Residual Channel. ITW 2022: 291-296 - [c21]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Positivity of Secret Key Capacity for Hypergraphical Sources with a Linear Wiretapper. ITW 2022: 726-731 - 2021
- [j12]Hoover H. F. Yin, Bin Tang, Ka Hei Ng, Shenghao Yang, Xishi Wang, Qiaoqiao Zhou:
A Unified Adaptive Recoding Framework for Batched Network Coding. IEEE J. Sel. Areas Inf. Theory 2(4): 1150-1164 (2021) - [j11]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering: Maximizing Normalized Total Correlation. IEEE Trans. Inf. Theory 67(3): 2001-2011 (2021) - [c20]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. ISIT 2021: 1624-1629 - [i22]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement and Secure Omniscience of Tree-PIN Source with Linear Wiretapper. CoRR abs/2102.01771 (2021) - [i21]Xiwei Cheng, Sidharth Jaggi, Qiaoqiao Zhou:
Generalized Non-adaptive Group Testing. CoRR abs/2102.10256 (2021) - [i20]Hoover H. F. Yin, Bin Tang, Ka Hei Ng, Shenghao Yang, Xishi Wang, Qiaoqiao Zhou:
A Unified Adaptive Recoding Framework for Batched Network Coding. CoRR abs/2105.07614 (2021) - [i19]Hoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou, Lily M. L. Yung, Ka Hei Ng:
BAR: Blockwise Adaptive Recoding for Batched Network Coding. CoRR abs/2105.07617 (2021) - [i18]Jie Han, Tao Guo, Qiaoqiao Zhou, Wei Han, Bo Bai, Gong Zhang:
Structural Entropy of the Stochastic Block Models. CoRR abs/2111.12871 (2021) - [i17]Praneeth Kumar Vippathalla, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Wiretap Secret Key Agreement Via Secure Omniscience. CoRR abs/2112.00394 (2021) - 2020
- [j10]Qiaoqiao Zhou, Chung Chan:
Secret Key Generation for Minimally Connected Hypergraphical Sources. IEEE Trans. Inf. Theory 66(7): 4226-4244 (2020) - [c19]Qiaoqiao Zhou, Chung Chan, Raymond W. Yeung:
On the Discussion Rate Region for the PIN Model. ISIT 2020: 955-959 - [c18]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Secure Information Exchange for Omniscience. ISIT 2020: 966-971
2010 – 2019
- 2019
- [j9]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. IEEE Trans. Inf. Theory 65(8): 5080-5093 (2019) - [c17]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. ISIT 2019: 947-951 - [c16]Hoover H. F. Yin, Bin Tang, Ka Hei Ng, Shenghao Yang, Xishi Wang, Qiaoqiao Zhou:
A Unified Adaptive Recoding Framework for Batched Network Coding. ISIT 2019: 1962-1966 - [i16]Chung Chan, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
One-Shot Perfect Secret Key Agreement for Finite Linear Sources. CoRR abs/1901.05817 (2019) - [i15]Chung Chan, Manuj Mukherjee, Praneeth Kumar Vippathalla, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement with Nearly No Discussion. CoRR abs/1904.11383 (2019) - 2018
- [j8]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Change of Multivariate Mutual Information: From Local to Global. IEEE Trans. Inf. Theory 64(1): 57-76 (2018) - [j7]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Determining Optimal Rates for Communication for Omniscience. IEEE Trans. Inf. Theory 64(3): 1919-1944 (2018) - [j6]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. IEEE Trans. Inf. Theory 64(4): 2371-2389 (2018) - [c15]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering. ISIT 2018: 1725-1729 - [c14]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. ISIT 2018: 2654-2658 - [c13]Qiaoqiao Zhou, Chung Chan:
Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical Sources. ISIT 2018: 2664-2668 - [i14]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. CoRR abs/1802.04955 (2018) - [i13]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources. CoRR abs/1805.01115 (2018) - [i12]Qiaoqiao Zhou, Chung Chan:
Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical Sources. CoRR abs/1805.03110 (2018) - 2017
- [j5]Qiaoqiao Zhou, Shenghao Yang, Hoover H. F. Yin, Bin Tang:
On BATS Codes With Variable Batch Sizes. IEEE Commun. Lett. 21(9): 1917-1920 (2017) - [c12]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret key agreement under discussion rate constraints. ISIT 2017: 1519-1523 - [c11]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Info-clustering: An efficient algorithm by network information flow. ITA 2017: 1-10 - [i11]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Agglomerative Info-Clustering. CoRR abs/1701.04926 (2017) - [i10]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
Secret Key Agreement under Discussion Rate Constraints. CoRR abs/1701.05008 (2017) - [i9]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Info-Clustering: An Efficient Algorithm by Network Information Flow. CoRR abs/1702.00109 (2017) - [i8]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
On the Optimality of Secret Key Agreement via Omniscience. CoRR abs/1702.07429 (2017) - 2016
- [j4]Shenghao Yang, Qiaoqiao Zhou:
Tree Analysis of BATS Codes. IEEE Commun. Lett. 20(1): 37-40 (2016) - [j3]Binyue Liu, Yong Cheng, Qiaoqiao Zhou:
Robust rank-two beamforming for multicell multigroup multicast. IET Commun. 10(3): 283-291 (2016) - [j2]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Ni Ding, Tie Liu, Alex Sprintson:
Successive Omniscience. IEEE Trans. Inf. Theory 62(6): 3270-3289 (2016) - [j1]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tarik Kaced, Tie Liu:
Info-Clustering: A Mathematical Theory for Data Clustering. IEEE Trans. Mol. Biol. Multi Scale Commun. 2(1): 64-91 (2016) - [c10]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tie Liu:
Duality between feature selection and data clustering. Allerton 2016: 142-147 - [c9]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
A Faster Algorithm for Asymptotic Communication for Omniscience. GLOBECOM Workshops 2016: 1-6 - [c8]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Fairness in communication for omniscience. ISIT 2016: 2314-2318 - [c7]Hoover H. F. Yin, Shenghao Yang, Qiaoqiao Zhou, Lily M. L. Yung:
Adaptive recoding for BATS codes. ISIT 2016: 2349-2353 - [c6]Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. ISIT 2016: 2504-2508 - [c5]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Incremental and decremental secret key agreement. ISIT 2016: 2514-2518 - [c4]Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou:
When is omniscience a rate-optimal strategy for achieving secret key capacity? ITW 2016: 354-358 - [i7]Manuj Mukherjee, Chung Chan, Navin Kashyap, Qiaoqiao Zhou:
Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. CoRR abs/1601.05377 (2016) - [i6]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Fairness in Communication for Omniscience. CoRR abs/1601.07285 (2016) - [i5]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tarik Kaced, Tie Liu:
Info-Clustering: A Mathematical Theory for Data Clustering. CoRR abs/1605.01233 (2016) - [i4]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou:
Incremental and Decremental Secret Key Agreement. CoRR abs/1605.01861 (2016) - [i3]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
A Faster Algorithm for Asymptotic Communication for Omniscience. CoRR abs/1607.04819 (2016) - [i2]Chung Chan, Ali Al-Bashabsheh, Qiaoqiao Zhou, Tie Liu:
Duality between Feature Selection and Data Clustering. CoRR abs/1609.08312 (2016) - [i1]Ni Ding, Chung Chan, Qiaoqiao Zhou, Rodney A. Kennedy, Parastoo Sadeghi:
Communication for Omniscience. CoRR abs/1611.08367 (2016) - 2015
- [c3]Chung Chan, Ali Al-Bashabsheh, Javad B. Ebrahimi, Tarik Kaced, Swanand Kadhe, Tie Liu, Alex Sprintson, Muxi Yan, Qiaoqiao Zhou:
Successive omniscience. NetCod 2015: 21-25 - [c2]Binyue Liu, Yong Cheng, Qiaoqiao Zhou:
Robust rank-two beamforming for multicell multigroup multicast. PIMRC 2015: 381-386 - 2014
- [c1]Qiaoqiao Zhou, Zhong Chen, Feifei Gao, James C. F. Li, Ming Lei:
Pricing and power allocation in sensing-based cognitive femtocell networks. ICC 2014: 5342-5347
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:28 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:
