中山大学计算机学院师资,中山大学计算机学院导师教师师资介绍简介-农革

中山大学·计算机学院教师队伍简要介绍：本院师资力量丰富，在多个专业领域均有布局与深耕。农革站点小编整理了相关资料供考生参考学习

所属研究所、院系:

量子计算与计算机理论研究所

职称:

教授

E-mail:

issng@mail.sysu.edu.cn

教师简介:

中山大学数据科学与计算机学院的李XX教授（具有博士研究生导师资格）及高级会员（IEEE），邮箱地址为issng@mail.sysu.edu.cn

研究领域:

数据处理，网络信息系统。

当前研究：海量异构数据全文搜索技术及系统，包括算法设计与系统研发。

硕士及博士研究生招生常年热忱欢迎报名。在博士研究生入学前，请考生务必提供个人简历、详细的研究规划书以及学术推荐信。

教育背景:

1996/2-1999/8，香港科技大学，计算机科学及工程学系，博士。

1992/9-1995/7，华南理工大学，计算机科学与工程系，硕士。

1988/9-1992/7，南京航空航天大学，计算机科学与工程系，本科。

代表性论著:

B Lao G Nong W H Chan and J Y Xie developed an efficient in-situ suffix sorting technique for multicore architectures IEEE Transactions on Computers Vol 67 Issue 12 Year 2018

B. Lao et al., Efficient Induced Sorted Suffix Arrays on a Multicore Machine published in The Journal of Supercomputing, Vol. 74, No. 7 in the year 2018

Y Wu G Nong W H Chan and L B Han Evaluating Big Suffix and LCP Arrays Employing Probabilistic Techniques IEEE Transactions on Computers Volume 66 Issue 10 Pages 1667–1675 October 2017

Wu et al., G. Nong and M. Hamdi propose a scalable pipelined IP lookups utilizing prefix tries in their research on efficient network routing algorithms (Wu et al., 2017).

Wang et al., Enhancing an Efficient LZ77 Compression Algorithm to Accelerate Performance in Software Practice and Experience, vol. 46, no. 9, 2016

Gong Zhi Min Quan Ji Xue Xing He Ke Ji Sheng Quan He Ke 等人（Gong Zhi Min Quan Ji Xue Xing He Ke Ji Sheng Quan He Ke）的研究表明，在外部存储环境中对...

Wen-Jing Liu et al., "Induced sorting suffixes in external memory: A paper featuring enhanced design and reduced space requirements," Proceedings of the 22nd International SPIRE Workshop (SPIRE), held in London, United Kingdom from September 1–4, 2015; pp.\xspace83–94

W.H.Chan,S.J.Xu,andG.Nong,"Anefficientalgorithmhasbeen developedtocompute theCompleteForcingNumberandtheClarNumberofCatacondensedHexagonalSystems",MATCHCommunicationsinMathematicalandComputerChemistry,Volumes74,No.1(2015),pp.201-216

W.H.Chan和G.Nong合著的文章《Some Trees of Maximum Degree 4》探讨了其在《Discrete Applied Mathematics》期刊上发表的研究成果

Gang Nong and Weixing H. Chan proposed a method for constructing suffix arrays in external memory based on the concept of D-critical substrings in their paper "Efficient Suffix Array Construction in External Memory" published in the ACM Transactions on Information Systems journal in January 2014 volume 32 issue number 1

该研究者提出了一种基于O(1)-workspace的线性时间后缀排序算法，并将其应用于常数字母表的情形下。

Gong Nong, Zhang Sheng, and Chan Wai-Hing, which are highly efficient in developing two algorithms for the construction of linear-time suffix arrays, have published their work in the IEEE Transactions on Computers journal in October 2011, volume 60, issue 10.

G Nong S Zhang and W H Chan Calculating the Inverse Sort Transform within Linear Time Acm Transactions on Algorithms The journal's Volume 7 Issue 2 in March 2011

G. Nong and S. Zhang have developed efficient algorithms for the inverse sort transform, which is published in IEEE Transactions on Computers, Vol. 56, No. 11, November 2007

注

Gong Wenyuan et al., a Linear-Time approach for constructing suffix arrays using D-critical substrings was presented at the 20th CPM conference held in Lille, France in June 2009.

G.Nong,S.Zhang and W.H.Chan.Linear Suffix Array Construction by Almost Pure Induced-Sorting.Proc.of the 19th IEEE Data Compression Conference (IEEE DCC),Mar.2009,Snowbird,Saltlake City,U.S.]

Guanming Nong and Sheng Zhang, Optimal Minimal Weight Construction of Sufffix Arrays for Constant Alphabets, Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS), August 2007, LNCS 4619

G. Nong, S. Zhang and W. H. Chan proposed a method for Calculating the Inverse ST with Linear-Time Complexity at the proceedings of the 19th International Conference on Combinatorial Pattern Matching (CPM) held in June 2008 in Pisa, Italy.

G. Nong, S. Zhang and X. L. Lin, An Efficient MAC Protocol for Optical WDM Networks accompanied by simulation evaluations, Proceedings of the 31st annual IEEE Conference on Local Computer Networks (IEEE LCN), held in 2006.

三位作者分别为S.Q.Hu、Y.Wu和G.Nong，在《IEEE通信与计算应用国际会议》2013年4月在香港举办的会议上发表了题为《一种基于负载均衡的管道架构设计用于IP路由查询》的论文

该论文由Y. Wu和G. Nong合著，在第18届IEEEICON会议上提出了基于ScalablePipeline架构的 IPv4/IPv6 路由查找方法

Wu and Nong提出了一种名为"Pipeline IP Lookup"的新架构，在计算机网络领域采用了"Random Duplicate Allocation"策略以提高效率

Wu and Nong developed an efficient routing architecture designed for scalable prefix tries at the 17th IEEE International Conference on Networking in December 2011, held in The city-state of Singapore.