default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChangkun Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Changkun Li
, Wei Chen, Khaled B. Letaief:
Meeting Hard Delay Constraint in Massive Access: A Mean-Field Approach. IEEE Trans. Wirel. Commun. 23(4): 2961-2977 (2024)- 2023
- [j6]Changkun Li, Wei Chen, H. Vincent Poor:
Diversity Enabled Low-Latency Wireless Communications With Hard Delay Constraints. IEEE J. Sel. Areas Commun. 41(7): 2107-2122 (2023) - [j5]Changkun Li, Yalei Wang, Wei Chen, H. Vincent Poor:
Ultra-Reliable and Low-Latency Multiple-Antenna Communications in the High SNR Regime. IEEE Wirel. Commun. Lett. 12(3): 461-465 (2023) - [c7]Shuqi Wei, Lintao Li, Changkun Li, Wei Chen:
Massive Mobile Computation Offloading: Operating Data Centers as Virtual Power Plants in Smart Grids. GLOBECOM 2023: 5574-5579 - [c6]Changkun Li, Wei Chen, Khaled B. Letaief:
Energy-Efficient Real-Time Wireless Communications: A Matching Diversity Approach. GLOBECOM 2023: 5907-5912 - 2022
- [j4]Changkun Li, Wei Chen, Khaled B. Letaief:
Achieving Low Latency in Massive Access: A Mean-Field Approach. IEEE J. Sel. Areas Commun. 40(5): 1473-1488 (2022) - [c5]Changkun Li, Wei Chen, H. Vincent Poor:
Hard Delay Constrained Communications over Parallel Fading Channels. GLOBECOM 2022: 2480-2485 - [c4]Changkun Li, Wei Chen, Khaled B. Letaief:
Time Sensitive Data Access for Massive Users: A Mean-Field Approximation Approach. GLOBECOM 2022: 2825-2830 - 2021
- [j3]Yawei Lu, Changkun Li, Wei Chen, H. Vincent Poor:
On the Effective Throughput of Coded Caching With Heterogeneous User Preferences: A Game Theoretic Perspective. IEEE Trans. Commun. 69(3): 1387-1402 (2021) - [j2]Changkun Li, Wei Chen, Khaled B. Letaief:
Joint Scheduling of Proactive Caching and On-Demand Transmission Traffics Over Shared Spectrum. IEEE Trans. Commun. 69(12): 8319-8334 (2021) - [j1]Changkun Li, Wei Chen:
Content Pushing Over Idle Timeslots: Performance Analysis and Caching Gains. IEEE Trans. Wirel. Commun. 20(9): 5586-5598 (2021) - [c3]Changkun Li, Wei Chen:
Adaptive Power and Rate Control for Mixed Proactive Pushing and On-demand Traffic: A CMDP Approach. GLOBECOM 2021: 1-6 - [c2]Changkun Li, Wei Chen, Khaled B. Letaief:
Mean-Field Approximation based Scheduling for Broadcast Channels with Massive Receivers. GLOBECOM 2021: 1-6 - [i1]Changkun Li, Wei Chen, Khaled B. Letaief:
Mean-Field Approximation based Scheduling for Broadcast Channels with Massive Receivers. CoRR abs/2111.03229 (2021) - 2020
- [c1]Changkun Li, Wei Chen:
Energy Efficient Joint Pushing and On-demand Transmission over Shared Spectrum. GLOBECOM 2020: 1-6
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 2025-01-09 13:05 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:
