Dongyang Long

According to our database1, Dongyang Long authored at least 34 papers between 1996 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
PCLNC: A low-cost intra-generation network coding strategy for P2P content distribution.
Peer-to-Peer Netw. Appl., 2019

2015
Efficient ID-based Non-Malleable Trapdoor Commitments Based on RSA and Factoring.
J. Commun., 2015

Topological dynamics for groups definable in real closed field.
Ann. Pure Appl. Log., 2015

2013
Network Coding in Multicast Routing for Wireless Link Breakage Problem.
Wirel. Pers. Commun., 2013

Improvements on "multiparty quantum key agreement with single particles".
Quantum Inf. Process., 2013

Efficient arbitrated quantum signature and its proof of security.
Quantum Inf. Process., 2013

2012
On the impossibility of non-static quantum bit commitment between two parties.
Quantum Inf. Process., 2012

Efficient ID-based non-malleable trapdoor commitment.
Comput. Electr. Eng., 2012

2011
Sharing a quantum secret without a trusted party.
Quantum Inf. Process., 2011

2009
An Efficient Certificateless Signature from Pairings.
Int. J. Netw. Secur., 2009

A Load-Balanced Route Selection for Network Coding in Wireless Mesh Networks.
Proceedings of IEEE International Conference on Communications, 2009

An O(N) Algorithm of Separability for Two-Partite Arbitrarily Dimensional Pure States.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

Network Coding for Creating Replica in Grid Environments.
Proceedings of the High Performance Computing and Applications, 2009

2008
Secure Relativistic Bit Commitment with Fixed Channel Capacity.
Proceedings of the 9th International Conference for Young Computer Scientists, 2008

2007
Some Novel Results of <i>p</i>-Adic Component of Primitive Sequences over Z/(p<sup>d</sup>).
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

An Improved Ant-based Classifier for Intrusion Detection.
Proceedings of the Third International Conference on Natural Computation, 2007

2005
Modeling and Analysis of Worm and Killer-Worm Propagation Using the Divide-and-Conquer Strategy.
Proceedings of the Distributed and Parallel Computing, 2005

2004
Optimal synchronous coding.
Int. J. Comput. Math., 2004

Probability Principle of a Reliable Approach to Detect Signs of DDOS Flood Attacks.
Proceedings of the Parallel and Distributed Computing: Applications and Technologies, 2004

An Empirical Autocorrelation Form for Modeling LRD Traffic Series.
Proceedings of the Network and Parallel Computing, IFIP International Conference, 2004

Fractional Gaussian Noise: A Tool of Characterizing Traffic for Detection Purpose.
Proceedings of the Content Computing, Advanced Workshop on Content Computing, 2004

2003
Decision Analysis of Statistically Detecting Distributed Denial-of-Service Flooding Attacks.
Int. J. Inf. Technol. Decis. Mak., 2003

Optimal Prefix Codes and Huffman Codes.
Int. J. Comput. Math., 2003

2002
Improving Chinese Storing Text Retrieval Systems' Security via a Novel Maximal Prefix Coding.
Int. J. Comput. Process. Orient. Lang., 2002

Product of Finite Maximal P-Codes.
Int. J. Comput. Math., 2002

On Synchronous Coding.
Proceedings of the 2002 International Symposium on Information Technology (ITCC 2002), 2002

Optimal maximal and maximal prefix codes equivalent to Huffman codes.
Proceedings of the IEEE International Conference on Acoustics, 2002

Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme.
Proceedings of the EurAsia-ICT 2002: Information and Communication Technology, 2002

2001
k-p-Infix codes and semaphore codes.
Discret. Appl. Math., 2001

On the Optimal Coding.
Proceedings of the Advances in Multimedia Information Processing, 2001

Optimal Maximal Encoding Different from Huffman Encoding.
Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

2000
The Most Efficient Uniquely Decipherable Encoding Schemes.
Proceedings of the WISE 2000, 2000

1997
Structure of 3-Infix-Outfix Maximal Codes.
Theor. Comput. Sci., 1997

1996
On Group Codes.
Theor. Comput. Sci., 1996


  Loading...