中山大学计算机学院导师教师师资介绍简介-农革本站小编 Free考研考试/2021-05-19

所属研究所、院系:

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

职称:

教授

E-mail:

issng@mail.sysu.edu.cn

教师简介:

中山大学数据科学与计算机学院教授、博士生导师，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, Fast In-place Suffix Sorting on a Multicore Computer, IEEE Transactions on Computers, Vol. 67, No. 12, 2018.

B. Lao, G. Nong, W. H. Chan and Y. Pan, Fast Induced Sorting Suffixes on a Multicore Machine, The Journal of Supercomputing, Vol. 74, No. 7, 2018.

Y. Wu, G. Nong, W. H. Chan and L. B. Han, Checking Big Suffix and LCP Arrays by Probabilistic Methods, IEEE Transactions on Computers, Vol. 66, No. 10, pp. 1667-1675, Oct. 2017.

Y. Wu, G. Nong and M. Hamdi, Scalable Pipelined IP Lookup with Prefix Tries, Computer Networks, Vol. 120, pp. 1-11, Jun. 2017.

W. J. Liu, G. Nong, W. H. Chan and Y. Wu, Improving a Lightweight LZ77 Computation Algorithm for Running Faster, Software: Practice and Experience, Vol. 46, No. 9, 2016.

G. Nong, W. H. Chan, S. Q. Hu and Y. Wu, Induced Sorting Suffixes in External Memory, ACM Transactions on Information Systems, Vol. 33, No. 3, Mar. 2015.

W. J. Liu, G. Nong, W. H. Chan and Y. Wu, Induced Sorting Suffixes in External Memory with Better Design and Less Space, Proceedings of 22nd International Symposium, SPIRE 2015, London, UK, September 1-4, 2015, pp. 83-94.

W. H. Chan, S. J. Xu, and G. Nong, A Linear-Time Algorithm for Computing the Complete Forcing Number and the Clar Number of Catacondensed Hexagonal Systems, MATCH Commun Math Comput Chem, Vol. 74, No. 1, 2015, pp. 201-216.

W. H. Chan and G. Nong, The Game Chromatic Index of Some Trees of Maximum Degree 4, Discrete Applied Mathematics, Vol. 170, No. 19, Jun. 2014.

G. Nong, W. H. Chan, S. Zhang and X. F. Guan, Suffix Array Construction in External Memory Using D-Critical Substrings, ACM Transactions on Information Systems, Vol. 32, No. 1, Jan. 2014.

G. Nong, Practical Linear-Time O(1)-Workspace Suffix Sorting for Constant Alphabets, ACM Transactions on Information Systems, Vol. 31, No. 3, Jul. 2013.

G. Nong, S. Zhang and W. H. Chan, Two Efficient Algorithms for Linear Time Suffix Array Construction, IEEE Transactions on Computers, Vol. 60, No. 10, Oct. 2011.

G. Nong, S. Zhang and W. H. Chan, Computing the Inverse Sort Transform in Linear Time, ACM Transactions on Algorithms, Vol. 7, No. 2, Mar. 2011.

G. Nong and S. Zhang, Efficient Algorithms for the Inverse Sort Transform, IEEE Transactions on Computers, Vol. 56, No. 11, Nov. 2007.

K. D. Nguyen, Y. Pan and G. Nong, Parallel Progressive Multiple Sequence Alignment on Reconfigurable Mesh, BMC Genomics, Vol. 12, 2011.

G. Nong, S. Zhang and W. H. Chan, Linear Time Suffix Array Construction Using D-Critical Substrings, Proceedings of 20th Combinatorial Pattern Matching (CPM), Jun. 2009, Lille, France.

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

G. Nong and S. Zhang, Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets, Proceedings of 10th Workshop on Algorithms and Data Structures (WADS), Aug. 2007, LNCS 4619.

G. Nong, S. Zhang and W. H. Chan, Computing Inverse ST in Linear Complexity, Proceedings of 19th Combinatorial Pattern Matching (CPM), Jun. 2008, Pisa, Italy.

G. Nong, S. Zhang and X. L. Lin, An Efficient MAC Protocol for Optical WDM Networks with Simulation Evaluation, Proceedings of 31st IEEE Conference on Local Computer Networks (IEEE LCN), 2006.

S. Q. Hu, Y. Wu and G. Nong, A Load-Balanced Pipeline Architecture for IP Route Lookup, Proceedings of IEEE ComCompAp, Apr. 2013, Hong Kong.

Y. Wu and G. Nong, A Scalable Pipeline Architecture for IPv4/IPv6 Route Lookup, Proceedings of 18th IEEE ICON, Dec. 2012, Singapore.

Y. Wu and G. Nong, A Pipeline IP Lookup Architecture with Random Duplicate Allocation, Proceedings of 21st IEEE ICCCN, Jul. 2012, Munich, Germany.

Y. Wu and G. Nong, A Scalable Routing Architecture for Prefix Tries, Proceedings of 17th IEEE ICON, Dec. 2011, Singapore.