default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSen Zhang 0007
Person information
- affiliation: State University of New York, College at Oneonta, NY, USA
Other persons with the same name
- Sen Zhang — disambiguation page
- Sen Zhang 0001
![[0000-0002-8010-6045]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8010-6045")
— University of Science and Technology Beijing, School of Automation & Electrical Engineering, China (and 1 more) - Sen Zhang 0002 — Southeast University, Key Laboratory of Computer Network and Information Integration, Nanjing, China
- Sen Zhang 0003 — Chinese Academy of Sciences, Chengdu Institute of Computer Application, Chengdu, China (and 1 more)
- Sen Zhang 0004 — Henan University of Science and Technology, School of Information Engineering, Luoyang, China
- Sen Zhang 0005 — Tsinghua University, Department of Computer Science and Technology, Beijing, China
- Sen Zhang 0006 — University of Sydney, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Ge Nong, Sen Zhang:
Efficient Sorting Suffixes of Big Alphabets. DCC 2024: 273-282- 2023
- [j10]Zhihui Du, Sen Zhang, David A. Bader:
Tunnel: Parallel-inducing sort for large string analytics. Future Gener. Comput. Syst. 149: 650-663 (2023) - 2022
- [c18]Zhihui Du, Sen Zhang, David A. Bader:
Parallel Suffix Sorting for Large String Analytics. PPAM (1) 2022: 71-82 - 2020
- [c17]Zhihui Du, Sen Zhang, David A. Bader, Jingkun Hu:
An Efficient LP Rounding Scheme for Replica Placement. HPEC 2020: 1-7 - [c16]Jingkun Hu, Zhihui Du, Sen Zhang, David A. Bader:
QoS-Aware and Fault-Tolerant Replica Placement. ICA3PP (2) 2020: 157-172
2010 – 2019
- 2018
- [j9]Sen Zhang, Zhihui Du, Jason T. L. Wang, Haodi Jiang:
Discovering frequent induced subgraphs from directed networks. Intell. Data Anal. 22(6): 1279-1296 (2018) - [c15]Haodi Jiang, Turki Turki, Sen Zhang, Jason T. L. Wang:
Reverse Engineering Gene Regulatory Networks Using Graph Mining. MLDM (1) 2018: 335-349 - 2015
- [j8]Sen Zhang, Zhihui Du, Jason Tsong-Li Wang:
New Techniques for Mining Frequent Patterns in Unordered Trees. IEEE Trans. Cybern. 45(6): 1113-1125 (2015) - 2014
- [j7]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
- [j6]Sen Zhang, James Ryder:
Pedagogical practices and benefits of using auto-generation approach to facilitate teaching data structures and algorithms. J. Comput. Sci. Coll. 28(6): 203-204 (2013) - 2011
- [j5]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) - [j4]Ge Nong, Sen Zhang, Wai Hong Chan:
Two Efficient Algorithms for Linear Time Suffix Array Construction. IEEE Trans. Computers 60(10): 1471-1484 (2011) - 2010
- [c14]James Ryder, Sen Zhang:
Preliminary Results of Ranking Political Figures Using Naive Bayes Text Classification. DMIN 2010: 85-91
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
- [j3]Sen Zhang, Jason Tsong-Li Wang:
Discovering Frequent Agreement Subtrees from Phylogenetic Data. IEEE Trans. Knowl. Data Eng. 20(1): 68-82 (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 - [c9]Robert Barton, Sen Zhang, Katherine G. Herbert:
Algorithms and Software for Calculating and Visualizing the Cardinality of the Grand Bounding Ball by Means of Intersection Trees. DMIN 2008: 529-535 - 2007
- [j2]Ge Nong, Sen Zhang:
Efficient Algorithms for the Inverse Sort Transform. IEEE Trans. Computers 56(11): 1564-1574 (2007) - [c8]Ge Nong, Sen Zhang:
An Efficient Algorithm For The Inverse ST Problem. DCC 2007: 397 - [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 - [c4]Sen Zhang, Jason Tsong-Li Wang:
Mining Frequent Agreement Subtrees in Phylogenetic Databases. SDM 2006: 222-233 - [c3]Sen Zhang, Katherine G. Herbert, Jason T. L. Wang, William H. Piel, David R. B. Stockwell:
PhyloMiner: A Tool for Evolutionary Data Analysis. SSDBM 2006: 129-132 - 2004
- [c2]Dennis E. Shasha, Jason Tsong-Li Wang, Sen Zhang:
Unordered Tree Mining with Applications to Phylogeny. ICDE 2004: 708-719 - 2002
- [j1]Sen Zhang, Jason Tsong-Li Wang, Katherine G. Herbert:
XML Query by Example. Int. J. Comput. Intell. Appl. 2(3): 329-337 (2002) - [c1]Sen Zhang, Li Liao, Jean-François Tomb, Jason Tsong-Li Wang:
Clustering and Classifying Enzymes in Metabolic Pathways: Some Preliminary Results. BIOKDD 2002: 19-24
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 2026-03-15 00:06 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:
