default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGe Nong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Wenbo Wu
, Ge Nong:
Algorithm design and performance evaluation of sparse induced suffix sorting. Inf. Process. Manag. 61(5): 103777 (2024)- [j26]Qianqiu Wang, Ge Nong, Wenbo Wu:
Linear structure index for network-constrained moving objects. J. Supercomput. 80(5): 6192-6220 (2024) - [c23]Ge Nong, Sen Zhang:
Efficient Sorting Suffixes of Big Alphabets. DCC 2024: 273-282 - 2022
- [j25]Wentao Xu, Haoyu Chen, Yidong Huan, Xuedong Hu, Ge Nong:
Full-text search engine with suffix index for massive heterogeneous data. Inf. Syst. 104: 101893 (2022) - [j24]Wentao Xu, Ge Nong:
A study for extracting keywords from data with deep learning and suffix array. Multim. Tools Appl. 81(5): 7419-7437 (2022) - [j23]Bin Lao, Yi Wu, Ge Nong, Wai Hong Chan:
Building and Checking Suffix Array Simultaneously by Induced Sorting Method. IEEE Trans. Computers 71(4): 756-765 (2022) - [j22]Ling Bo Han, Bin Lao, Ge Nong:
Succinct parallel Lempel-Ziv factorization on a multicore computer. J. Supercomput. 78(5): 7278-7303 (2022) - 2021
- [j21]Ling Bo Han, Yi Wu, Ge Nong:
Succinct suffix sorting in external memory. Inf. Process. Manag. 58(1): 102378 (2021) - [j20]Wentao Xu, Xin Zhao, Bin Lao, Ge Nong:
Enhancing HDFS with a full-text search system for massive small files. J. Supercomput. 77(7): 7149-7170 (2021) - 2020
- [j19]Jing Yi Xie, Ge Nong, Bin Lao, Wentao Xu:
Scalable Suffix Sorting on a Multicore Machine. IEEE Trans. Computers 69(9): 1364-1375 (2020)
2010 – 2019
- 2019
- [c22]Yi Wu, Bin Lao, Xinghui Ma, Ge Nong:
An Improved Algorithm for Building Suffix Array in External Memory. PAAP 2019: 320-330 - [c21]Jing Yi Xie, Bin Lao, Ge Nong:
In-Place Suffix Sorting on a Multicore Computer with Better Design. PAAP 2019: 331-342 - 2018
- [j18]Wai Lam Fong, Wai Hong Chan, Ge Nong:
The game chromatic index of some trees with maximum degree four and adjacent degree-four vertices. J. Comb. Optim. 36(1): 1-12 (2018) - [j17]Bin Lao, Ge Nong, Wai Hong Chan, Jing Yi Xie:
Fast In-Place Suffix Sorting on a Multicore Computer. IEEE Trans. Computers 67(12): 1737-1749 (2018) - [j16]Bin Lao, Ge Nong, Wai Hong Chan, Yi Pan:
Fast induced sorting suffixes on a multicore machine. J. Supercomput. 74(7): 3468-3485 (2018) - 2017
- [j15]Yi Wu, Ge Nong, Mounir Hamdi:
Scalable pipelined IP lookup with prefix tries. Comput. Networks 120: 1-11 (2017) - [j14]Yi Wu, Ge Nong, Wai Hong Chan, Ling Bo Han:
Checking Big Suffix and LCP Arrays by Probabilistic Methods. IEEE Trans. Computers 66(10): 1667-1675 (2017) - [c20]Jing Yi Xie, Bin Lao, Ge Nong:
A Lightweight Algorithm for Computing BWT from Suffix Array in Disk. PAAP 2017: 279-289 - [c19]Yi Wu, Ling Bo Han, Wai Hong Chan, Ge Nong:
Scalable K-Order LCP Array Construction for Massive Data. PAAP 2017: 579-593 - 2016
- [j13]Weijun Liu, Ge Nong, Wai Hong Chan, Yi Wu:
Improving a lightweight LZ77 computation algorithm for running faster. Softw. Pract. Exp. 46(9): 1201-1217 (2016) - 2015
- [j12]Ge Nong, Wai Hong Chan, Sheng Qing Hu, Yi Wu:
Induced Sorting Suffixes in External Memory. ACM Trans. Inf. Syst. 33(3): 12:1-12:15 (2015) - [c18]Weijun Liu, Ge Nong, Wai Hong Chan, Yi Wu:
Induced Sorting Suffixes in External Memory with Better Design and Less Space. SPIRE 2015: 83-94 - 2014
- [j11]Wai Hong Chan, Ge Nong:
The game chromatic index of some trees of maximum degree 4. Discret. Appl. Math. 170: 1-6 (2014) - [j10]Ge Nong, Wai Hong Chan, Sen Zhang, Xiao Feng Guan:
Suffix Array Construction in External Memory Using D-Critical Substrings. ACM Trans. Inf. Syst. 32(1): 1:1-1:15 (2014) - 2013
- [j9]Ge Nong:
Practical linear-time O(1)-workspace suffix sorting for constant alphabets. ACM Trans. Inf. Syst. 31(3): 15 (2013) - 2012
- [c17]Yi Wu, Ge Nong:
A Pipeline IP Lookup Architecture with Random Duplicate Allocation. ICCCN 2012: 1-7 - [c16]Yi Wu, Ge Nong:
A scalable pipeline architecture for IPv4/IPv6 route lookup. ICON 2012: 416-421 - 2011
- [j8]Ge Nong, Sen Zhang, Wai Hong Chan:
Computing the inverse sort transform in linear time. ACM Trans. Algorithms 7(2): 27:1-27:16 (2011) - [j7]Ge Nong, Sen Zhang, Wai Hong Chan:
Two Efficient Algorithms for Linear Time Suffix Array Construction. IEEE Trans. Computers 60(10): 1471-1484 (2011) - [c15]Le Yu, Ge Nong, Mounir Hamdi:
A Framed Packet Switch Without Control Loop. ICCCN 2011: 1-5 - [c14]Yi Wu, Ge Nong:
A scalable routing architecture for prefix tries. ICON 2011: 264-269
2000 – 2009
- 2009
- [c13]Ge Nong, Sen Zhang, Wai Hong Chan:
Linear Time Suffix Array Construction Using D-Critical Substrings. CPM 2009: 54-67 - [c12]Ge Nong, Sen Zhang, Wai Hong Chan:
Linear Suffix Array Construction by Almost Pure Induced-Sorting. DCC 2009: 193-202 - 2008
- [c11]Ge Nong, Sen Zhang, Wai Hong Chan:
Computing Inverse ST in Linear Complexity. CPM 2008: 178-190 - [c10]Sen Zhang, Ge Nong:
Fast and Space Efficient Linear Suffix Array Construction. DCC 2008: 553 - 2007
- [j6]Ge Nong, Sen Zhang:
Efficient Algorithms for the Inverse Sort Transform. IEEE Trans. Computers 56(11): 1564-1574 (2007) - [c9]Ge Nong, Sen Zhang:
An Efficient Algorithm For The Inverse ST Problem. DCC 2007: 397 - [c8]Ge Nong, Ning Situ, Mounir Hamdi:
Delay Analysis of Combined Input-Crosspoint Queueing Switches. ICCCN 2007: 912-917 - [c7]Ge Nong, Sen Zhang:
Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets. WADS 2007: 613-624 - 2006
- [c6]Ge Nong, Sen Zhang:
Unifying The Burrows-Wheeler and The Schindler Transforms. DCC 2006: 464 - [c5]Ge Nong, Sen Zhang, Xiaola Lin:
An Efficient MAC Protocol For Optical WDM Networks with Simulation Evaluation. LCN 2006: 459-464 - 2001
- [j5]Ge Nong, Mounir Hamdi, Jogesh K. Muppala:
Performance evaluation of multiple input-queued ATM switches with PIM scheduling under bursty traffic. IEEE Trans. Commun. 49(8): 1329-1333 (2001) - [c4]Ge Nong, Mounir Hamdi:
Providing QoS Guarantees for Unicast/Multicast Traffic with Fixed/Variable-Length Packets in Multiple Input-Queued Switches. ISCC 2001: 166-171 - 2000
- [j4]Ge Nong, Mounir Hamdi:
On the provision of quality-of-service guarantees for input queued switches. IEEE Commun. Mag. 38(12): 62-69 (2000) - [j3]Ge Nong, Mounir Hamdi:
Burst-based scheduling algorithms for non-blocking ATM switches with multiple input queues. IEEE Commun. Lett. 4(6): 202-204 (2000)
1990 – 1999
- 1999
- [j2]Ge Nong, Mounir Hamdi, Jogesh K. Muppala:
Performance Evaluation of a Scheduling Algorithm for Multiple Input-Queued ATM Switches. Informatica (Slovenia) 23(3) (1999) - [j1]Ge Nong, Jogesh K. Muppala, Mounir Hamdi:
Analysis of nonblocking ATM switches with multiple input queues. IEEE/ACM Trans. Netw. 7(1): 60-74 (1999) - 1997
- [c3]Ge Nong, Jogesh K. Muppala, Mounir Hamdi:
Performance Analysis of Input Queueing ATM Switches with Parallel Iterative Matching Scheduling. Modelling and Evaluation of ATM Networks 1997: 189-207 - [c2]Ge Nong, Jogesh K. Muppala, Mounir Hamdi:
A Performance Model for ATM Switches with Multiple Input Queues. ICCCN 1997: 222-227 - 1995
- [c1]Joseph Kee-Yin Ng, Ge Nong:
Multimedia applications on FDDI networks connected by an ATM switch. IEEE Real Time Technology and Applications Symposium 1995: 60-63
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-01-21 00:03 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:
