default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYong Deng 0004
Person information
- affiliation (PhD 2021): Ontario Tech University, Deptartment of Electrical, Computer and Software Engineering, Oshawa, Canada
- affiliation (until 2016): Zhejiang Gongshang University, School of Computer Science and Information Engineering, Hangzhou, China
Other persons with the same name
- Yong Deng — disambiguation page
- Yong Deng 0001
![[0000-0001-9286-2123]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-9286-2123")
— University of Electronic Science and Technology of China, Institute of Fundamental and Frontier Science, Chengdu, China (and 3 more) - Yong Deng 0002 — Southwest Petroleum University, School of Mechatronic Engineering, Chengdu, China
- Yong Deng 0003 — Hunan University, School of Information Science and Engineering, Changsha, China
- Yong Deng 0005 — University of Science and Technology Beijing, State Key Laboratory for Advanced Metals and Materials, Beijing, China
- Yong Deng 0006 — National University of Singapore, Department of Electrical and Computer Engineering, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j2]Abdulrahman Alamer, Yong Deng, Guiyi Wei, Xiaodong Lin:
Collaborative Security in Vehicular Cloud Computing: A Game Theoretic View. IEEE Netw. 32(3): 72-77 (2018)- 2016
- [j1]Yong Deng, Guiyi Wei, Mande Xie, Jun Shao:
Cooperation Dynamics on Mobile Crowd Networks of Device-to-Device Communications. Mob. Inf. Syst. 2016: 8686945:1-8686945:10 (2016)
Conference and Workshop Papers
- 2021
- [c7]Yong Deng, Min Dong:
Memory-Rate Tradeoff for Decentralized Caching under Nonuniform File Popularity. WiOpt 2021: 208-215 - 2020
- [c6]Yong Deng, Min Dong:
Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity. ACSSC 2020: 336-340 - [c5]Yong Deng, Min Dong:
Optimal Uncoded Placement and File Grouping Structure for Improved Coded Caching under Nonuniform Popularity. WiOpt 2020: 25-32 - 2019
- [c4]Yong Deng, Min Dong:
Subpacketization Level in Optimal Placement for Coded Caching with Nonuniform File Popularities. ACSSC 2019: 1294-1298 - [c3]Yong Deng, Min Dong:
Optimal Cache Placement for Modified Coded Caching with Arbitrary Cache Size. SPAWC 2019: 1-5 - 2017
- [c2]Abdulrahman Alamer, Yong Deng, Xiaodong Lin:
A privacy-preserving and truthful tendering framework for vehicle cloud computing. ICC 2017: 1-7 - [c1]Abdulrahman Alamer, Yong Deng, Xiaodong Lin:
Secure and privacy-preserving task announcement in vehicular cloud. WCSP 2017: 1-6
Informal and Other Publications
- 2021
- [i4]Yong Deng, Min Dong:
Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform Random Demands. CoRR abs/2103.09925 (2021) - 2020
- [i3]Yong Deng, Min Dong:
Memory-Rate Tradeoff for Caching with Uncoded Placement under Nonuniform File Popularity. CoRR abs/2011.08122 (2020) - 2019
- [i2]Yong Deng, Min Dong:
Structure of Optimal Cache Placement for Coded Caching with Heterogeneous Demands. CoRR abs/1912.01082 (2019) - 2018
- [i1]Yong Deng, Min Dong:
Cache Placement Optimization for Coded Caching with Arbitrary Cache Size. CoRR abs/1812.09459 (2018)
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-12-02 22:25 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:
