default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDongyang Long
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j18]Junjie Su
, Qian Deng, Dongyang Long:
PCLNC: A low-cost intra-generation network coding strategy for P2P content distribution. Peer-to-Peer Netw. Appl. 12(1): 177-188 (2019)- 2015
- [j17]Ningyuan Yao, Dongyang Long:
Topological dynamics for groups definable in real closed field. Ann. Pure Appl. Log. 166(3): 261-273 (2015) - [j16]Chun-Hui Wu, Qin Li, Dongyang Long:
Efficient ID-based Non-Malleable Trapdoor Commitments Based on RSA and Factoring. J. Commun. 10(5): 330-338 (2015) - 2013
- [j15]Qin Li, Chengqing Li, Dongyang Long, Wai Hong Chan, Changji Wang:
Efficient arbitrated quantum signature and its proof of security. Quantum Inf. Process. 12(7): 2427-2439 (2013) - [j14]Zhiwei Sun, Cai Zhang, Banghai Wang, Qin Li, Dongyang Long:
Improvements on "multiparty quantum key agreement with single particles". Quantum Inf. Process. 12(11): 3411-3420 (2013) - [j13]Su-Kit Tang, Dongyang Long:
Network Coding in Multicast Routing for Wireless Link Breakage Problem. Wirel. Pers. Commun. 69(2): 665-672 (2013) - 2012
- [j12]Chun-Hui Wu, Xiaofeng Chen, Qin Li, Dongyang Long:
Efficient ID-based non-malleable trapdoor commitment. Comput. Electr. Eng. 38(6): 1647-1657 (2012) - [j11]Qin Li, Chengqing Li, Dongyang Long, Wai Hong Chan, Chun-Hui Wu:
On the impossibility of non-static quantum bit commitment between two parties. Quantum Inf. Process. 11(2): 519-527 (2012) - 2011
- [j10]Qin Li, Dongyang Long, Wai Hong Chan, Daowen Qiu:
Sharing a quantum secret without a trusted party. Quantum Inf. Process. 10(1): 97-106 (2011) - [i1]Qin Li, Chengqing Li, Dongyang Long, Wai Hong Chan, Chun-Hui Wu:
On the impossibility of non-static quantum bit commitment between two parties. CoRR abs/1101.5684 (2011)
2000 – 2009
- 2009
- [j9]Changji Wang, Dongyang Long, Yong Tang:
An Efficient Certificateless Signature from Pairings. Int. J. Netw. Secur. 8(1): 96-100 (2009) - [c16]Banghai Wang, Jiangshou Hong, Lingxiong Li, Dongyang Long:
Network Coding for Creating Replica in Grid Environments. HPCA (China) 2009: 398-403 - [c15]Yinxiang Long, Daowen Qiu, Dongyang Long:
An O(N) Algorithm of Separability for Two-Partite Arbitrarily Dimensional Pure States. CSO (1) 2009: 570-573 - [c14]Kai Fan, Xi Wei, Dongyang Long:
A Load-Balanced Route Selection for Network Coding in Wireless Mesh Networks. ICC 2009: 1-6 - 2008
- [c13]Qin Li, Dongyang Long, Changji Wang:
Secure Relativistic Bit Commitment with Fixed Channel Capacity. ICYCS 2008: 1522-1526 - 2007
- [c12]Junbing He, Dongyang Long, Chuan Chen:
An Improved Ant-based Classifier for Intrusion Detection. ICNC (4) 2007: 819-823 - [c11]Yuewen Tang, Dongyang Long:
Some Novel Results of p-Adic Component of Primitive Sequences over Z/(pd). WAIFI 2007: 346-353 - 2005
- [c10]Dan Wu, Dongyang Long, Changji Wang, Zhanpeng Guan:
Modeling and Analysis of Worm and Killer-Worm Propagation Using the Divide-and-Conquer Strategy. ICA3PP 2005: 370-375 - 2004
- [j8]Dongyang Long, Weijia Jia, Ming Li:
Optimal synchronous coding. Int. J. Comput. Math. 81(8): 931-941 (2004) - [c9]Ming Li, Chi-Hung Chi, Dongyang Long:
Fractional Gaussian Noise: A Tool of Characterizing Traffic for Detection Purpose. AWCC 2004: 94-103 - [c8]Ming Li, Jingao Liu, Dongyang Long:
An Empirical Autocorrelation Form for Modeling LRD Traffic Series. NPC 2004: 399-402 - [c7]Ming Li, Jingao Liu, Dongyang Long:
Probability Principle of a Reliable Approach to Detect Signs of DDOS Flood Attacks. PDCAT 2004: 596-599 - 2003
- [j7]Dongyang Long, Weijia Jia, Ming Li:
Optimal Prefix Codes and Huffman Codes. Int. J. Comput. Math. 80(6): 727-742 (2003) - [j6]Ming Li, Chi-Hung Chi, Weijia Jia, Wei Zhao, Wanlei Zhou, Jiannong Cao, Dongyang Long, Qiang Meng:
Decision Analysis of Statistically Detecting Distributed Denial-of-Service Flooding Attacks. Int. J. Inf. Technol. Decis. Mak. 2(3): 397-405 (2003) - 2002
- [j5]Dongyang Long, Weijia Jia, Liang Zhang:
Product of Finite Maximal P-Codes. Int. J. Comput. Math. 79(8): 889-899 (2002) - [j4]Dongyang Long, Weijia Jia, Pui-on Au, Ming Li:
Improving Chinese Storing Text Retrieval Systems' Security via a Novel Maximal Prefix Coding. Int. J. Comput. Process. Orient. Lang. 15(4): 379-393 (2002) - [c6]Dongyang Long:
Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme. EurAsia-ICT 2002: 127-134 - [c5]Dongyang Long, Weijia Jia:
Optimal maximal and maximal prefix codes equivalent to Huffman codes. ICASSP 2002: 2525-2528 - [c4]Dongyang Long, Weijia Jia, Ming Li:
On Synchronous Coding. ITCC 2002: 390-395 - 2001
- [j3]Dongyang Long, Weijia Jia, Jian Ma, Duanning Zhou:
k-p-Infix codes and semaphore codes. Discret. Appl. Math. 109(3): 237-252 (2001) - [c3]Dongyang Long, Weijia Jia:
Optimal Maximal Encoding Different from Huffman Encoding. ITCC 2001: 493- - [c2]Dongyang Long, Weijia Jia:
On the Optimal Coding. IEEE Pacific Rim Conference on Multimedia 2001: 94-101 - 2000
- [c1]Dongyang Long, Weijia Jia:
The Most Efficient Uniquely Decipherable Encoding Schemes. WISE 2000: 159-165
1990 – 1999
- 1997
- [j2]Dongyang Long, Jian Ma, Duanning Zhou:
Structure of 3-Infix-Outfix Maximal Codes. Theor. Comput. Sci. 188(1-2): 231-240 (1997) - 1996
- [j1]Dongyang Long:
On Group Codes. Theor. Comput. Sci. 163(1&2): 259-267 (1996)
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-03-04 21:24 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:
