default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQian Yu 0001
Person information
- affiliation: University of Southern California, Los Angeles, USA
Other persons with the same name
- Qian Yu — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Qian Yu
, Yury Polyanskiy:
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations. IEEE Trans. Inf. Theory 70(3): 1913-1938 (2024)- 2022
- [c18]Jinhyun So, Corey J. Nolet, Chien-Sheng Yang, Songze Li, Qian Yu, Ramy E. Ali, Basak Guler, Salman Avestimehr:
LightSecAgg: a Lightweight and Versatile Design for Secure Aggregation in Federated Learning. MLSys 2022 - 2021
- [j6]Qian Yu, Amir Salman Avestimehr:
Coded Computing for Resilient, Secure, and Privacy-Preserving Distributed Matrix Multiplication. IEEE Trans. Commun. 69(1): 59-72 (2021) - [i14]Chien-Sheng Yang, Jinhyun So, Chaoyang He, Songze Li, Qian Yu, Salman Avestimehr:
LightSecAgg: Rethinking Secure Aggregation in Federated Learning. CoRR abs/2109.14236 (2021) - 2020
- [j5]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding. IEEE Trans. Inf. Theory 66(3): 1920-1933 (2020) - [c17]Qian Yu, Amir Salman Avestimehr:
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier. ISIT 2020: 245-250 - [c16]Lin Chen, Qian Yu, Hannah Lawrence, Amin Karbasi:
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition. NeurIPS 2020 - [i13]Qian Yu, Amir Salman Avestimehr:
Entangled Polynomial Codes for Secure, Private, and Batch Distributed Matrix Multiplication: Breaking the "Cubic" Barrier. CoRR abs/2001.05101 (2020)
2010 – 2019
- 2019
- [j4]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Characterizing the Rate-Memory Tradeoff in Cache Networks Within a Factor of 2. IEEE Trans. Inf. Theory 65(1): 647-663 (2019) - [c15]Qian Yu, Songze Li, Netanel Raviv, Seyed Mohammadreza Mousavi Kalan, Mahdi Soltanolkotabi, Amir Salman Avestimehr:
Lagrange Coded Computing: Optimal Design for Resiliency, Security, and Privacy. AISTATS 2019: 1215-1225 - [c14]Qian Yu, Amir Salman Avestimehr:
Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation. ISIT 2019: 1102-1106 - [c13]Netanel Raviv, Qian Yu, Jehoshua Bruck, Salman Avestimehr:
Download and Access Trade-offs in Lagrange Coded Computing. ISIT 2019: 1787-1791 - [i12]Qian Yu, Amir Salman Avestimehr:
Harmonic Coding: An Optimal Linear Code for Privacy-Preserving Gradient-Type Computation. CoRR abs/1904.13206 (2019) - [i11]Lin Chen, Qian Yu, Hannah Lawrence, Amin Karbasi:
Minimax Regret of Switching-Constrained Online Convex Optimization: No Phase Transition. CoRR abs/1910.10873 (2019) - 2018
- [j3]Songze Li, Mohammad Ali Maddah-Ali, Qian Yu, Amir Salman Avestimehr:
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing. IEEE Trans. Inf. Theory 64(1): 109-128 (2018) - [j2]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching. IEEE Trans. Inf. Theory 64(2): 1281-1296 (2018) - [c12]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding. ISIT 2018: 2022-2026 - [c11]Qian Yu, Netanel Raviv, Amir Salman Avestimehr:
Coding for Private and Secure Multiparty Computing. ITW 2018: 1-5 - [i10]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding. CoRR abs/1801.07487 (2018) - [i9]Songze Li, Seyed Mohammadreza Mousavi Kalan, Qian Yu, Mahdi Soltanolkotabi, Amir Salman Avestimehr:
Polynomially Coded Regression: Optimal Straggler Mitigation via Data Encoding. CoRR abs/1805.09934 (2018) - [i8]Qian Yu, Netanel Raviv, Jinhyun So, Amir Salman Avestimehr:
Lagrange Coded Computing: Optimal Design for Resiliency, Security and Privacy. CoRR abs/1806.00939 (2018) - 2017
- [j1]Songze Li, Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
A Scalable Framework for Wireless Distributed Computing. IEEE/ACM Trans. Netw. 25(5): 2643-2654 (2017) - [c10]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Coded fourier transform. Allerton 2017: 494-501 - [c9]Qian Yu, Songze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
How to optimally allocate resources for coded distributed computing? ICC 2017: 1-7 - [c8]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Characterizing the rate-memory tradeoff in cache networks within a factor of 2. ISIT 2017: 386-390 - [c7]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
The exact rate-memory tradeoff for caching with uncoded prefetching. ISIT 2017: 1613-1617 - [c6]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Communication-optimal coding designs for caching networks. ITW 2017: 6-10 - [c5]Qian Yu, Mohammad Ali Maddah-Ali, Salman Avestimehr:
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication. NIPS 2017: 4403-4413 - [i7]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Characterizing the Rate-Memory Tradeoff in Cache Networks within a Factor of 2. CoRR abs/1702.04563 (2017) - [i6]Qian Yu, Songze Li, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
How to Optimally Allocate Resources for Coded Distributed Computing? CoRR abs/1702.07297 (2017) - [i5]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Polynomial Codes: an Optimal Design for High-Dimensional Coded Matrix Multiplication. CoRR abs/1705.10464 (2017) - [i4]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Coded Fourier Transform. CoRR abs/1710.06471 (2017) - 2016
- [c4]Songze Li, Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Coded distributed computing: Fundamental limits and practical challenges. ACSSC 2016: 509-513 - [c3]Songze Li, Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Poster Abstract: A Scalable Coded Computing Framework for Edge-Facilitated Wireless Distributed Computing. SEC 2016: 79-80 - [c2]Songze Li, Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
Edge-Facilitated Wireless Distributed Computing. GLOBECOM 2016: 1-7 - [i3]Songze Li, Mohammad Ali Maddah-Ali, Qian Yu, Amir Salman Avestimehr:
A Fundamental Tradeoff between Computation and Communication in Distributed Computing. CoRR abs/1604.07086 (2016) - [i2]Songze Li, Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
A Scalable Framework for Wireless Distributed Computing. CoRR abs/1608.05743 (2016) - [i1]Qian Yu, Mohammad Ali Maddah-Ali, Amir Salman Avestimehr:
The Exact Rate-Memory Tradeoff for Caching with Uncoded Prefetching. CoRR abs/1609.07817 (2016) - 2015
- [c1]Qian Yu, Muriel Médard:
The Asymptotic Solutions of the Capacity Maximal Quantization Problem. VTC Fall 2015: 1-5
Coauthor Index
aka: Salman Avestimehr
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-11-15 19:35 CET 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:
