default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXianmin Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Shuai Han
, Xianmin Liu, Jianzhong Li:
MulRF: A Multi-Dimensional Range Filter for Sublinear Time Range Query Processing. IEEE Trans. Knowl. Data Eng. 36(11): 6600-6613 (2024)- [i4]Sixing Tan, Xianmin Liu:
Personalized Federated Learning on Flowing Data Heterogeneity under Restricted Storage. CoRR abs/2410.01502 (2024) - 2023
- [j17]Faming Li, Zhaonian Zou, Xianmin Liu, Jianzhong Li, Xiaochun Yang, Bin Wang:
Detecting maximum k-durable structures on temporal graphs. Knowl. Based Syst. 271: 110561 (2023) - [j16]Shuai Han, Xianmin Liu, Jianzhong Li:
Chunk-oriented dimension ordering for efficient range query processing on sparse multidimensional data. World Wide Web (WWW) 26(4): 1395-1433 (2023) - 2022
- [c15]Dan Cheng, Chaoqun Zhang, Xianmin Liu:
Research on the Reform of Online and Offline Blended Teaching Mode for Analog Circuit Course. ICDEL 2022: 97-101 - [c14]Guang Zhao, Xianmin Liu, Hui Xie, Yuhang Xu, Salah Aldeen Abdo Alghurbani:
The design of the tablet hardness tester. ICMIP 2022: 211-216 - 2021
- [j15]Xixian Han, Xianmin Liu, Jianzhong Li, Hong Gao:
Efficient top-k high utility itemset mining on massive data. Inf. Sci. 557: 382-406 (2021) - [j14]Xianmin Liu, Yingshu Li, Jianzhong Li, Yuqiang Feng:
On the complexity and approximability of repair position selection problem. J. Comb. Optim. 42(3): 354-372 (2021) - [j13]Xianmin Liu, Jianzhong Li, Yingshu Li, Yuqiang Feng:
Parameterized complexity of completeness reasoning for conjunctive queries. Theor. Comput. Sci. 864: 34-49 (2021) - 2020
- [j12]Dongjing Miao, Zhipeng Cai, Jianzhong Li, Xiangyu Gao, Xianmin Liu:
The Computation of Optimal Subset Repairs. Proc. VLDB Endow. 13(11): 2061-2074 (2020) - [j11]Dongjing Miao, Zhipeng Cai, Xianmin Liu, Jianzhong Li:
Functional dependency restricted insertion propagation. Theor. Comput. Sci. 819: 1-8 (2020) - [j10]Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Recognizing the tractability in big data computing. Theor. Comput. Sci. 838: 195-207 (2020) - [c13]Xianmin Liu, Jianzhong Li, Yingshu Li:
How Hard Is Completeness Reasoning for Conjunctive Queries? COCOON 2020: 149-161 - [i3]Dongjing Miao, Zhipeng Cai, Jianzhong Li, Xiangyu Gao, Xianmin Liu:
Complexity and Efficient Algorithms for Data Inconsistency Evaluating and Repairing. CoRR abs/2001.00315 (2020) - [i2]Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Dynamic Near Maximum Independent Set with Time Independent of Graph Size. CoRR abs/2009.11435 (2020)
2010 – 2019
- 2019
- [j9]Xixian Han, Xianmin Liu, Jian Chen, Guojun Lai, Hong Gao, Jianzhong Li:
Efficiently Mining Frequent Itemsets on Massive Data. IEEE Access 7: 31409-31421 (2019) - [j8]Dongjing Miao, Xianmin Liu, Yingshu Li, Jianzhong Li:
Vertex cover in conflict graphs. Theor. Comput. Sci. 774: 103-112 (2019) - [c12]Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Recognizing the Tractability in Big Data Computing. COCOA 2019: 223-234 - [i1]Xiangyu Gao, Jianzhong Li, Dongjing Miao, Xianmin Liu:
Recognizing the Tractability in Big Data Computing. CoRR abs/1910.01357 (2019) - 2018
- [j7]Xianmin Liu, Zhipeng Cai, Dongjing Miao, Jianzhong Li:
Tree size reduction with keeping distinguishability. Theor. Comput. Sci. 749: 26-35 (2018) - 2017
- [c11]Xianmin Liu, Yingshu Li, Jianzhong Li:
Repair Position Selection for Inconsistent Data. COCOA (1) 2017: 426-438 - 2016
- [j6]Xixian Han, Xianmin Liu, Jianzhong Li, Hong Gao:
TKAP: Efficiently processing top-k query on massive data by adaptive pruning. Knowl. Inf. Syst. 47(2): 301-328 (2016) - [j5]Xianmin Liu, Jianzhong Li, Hong Gao:
On the hardness of labeled correlation clustering problem: A parameterized complexity view. Theor. Comput. Sci. 609: 583-593 (2016) - [j4]Dongjing Miao, Xianmin Liu, Jianzhong Li:
On the complexity of sampling query feedback restricted database repair of functional dependency violations. Theor. Comput. Sci. 609: 594-605 (2016) - [c10]Xianmin Liu, Zhipeng Cai, Dongjing Miao, Jianzhong Li:
On the Complexity of Extracting Subtree with Keeping Distinguishability. COCOA 2016: 230-240 - [c9]Dongjing Miao, Yingshu Li, Xianmin Liu, Jianzhong Li:
On the Complexity of Bounded Deletion Propagation. COCOA 2016: 453-462 - [c8]Dongjing Miao, Zhipeng Cai, Xianmin Liu, Jianzhong Li:
On the Complexity of Insertion Propagation with Functional Dependency Constraints. COCOON 2016: 623-632 - 2015
- [j3]Xianmin Liu, Jianzhong Li:
Algorithms and complexity results for labeled correlation clustering problem. J. Comb. Optim. 29(2): 488-501 (2015) - [j2]Xianmin Liu, Jianzhong Li:
On the hardness of learning queries from tree structured data. J. Comb. Optim. 29(3): 670-684 (2015) - [c7]Dongjing Miao, Jianzhong Li, Xianmin Liu, Hong Gao:
Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation. COCOA 2015: 395-408 - [c6]Dan Yin, Hong Gao, Zhaonian Zou, Xianmin Liu, Jianzhong Li:
Flexible Aggregation on Heterogeneous Information Networks. DASFAA Workshops 2015: 217-222 - [c5]Jizhou Sun, Jianzhong Li, Hong Gao, Xianmin Liu:
Discovery of Field Functional Dependencies. ISKE 2015: 448-455 - 2014
- [c4]Dongjing Miao, Xianmin Liu, Jianzhong Li:
Sampling Query Feedback Restricted Repairs of Functional Dependency Violations: Complexity and Algorithm. COCOON 2014: 37-48 - [c3]Xianmin Liu, Jianzhong Li, Hong Gao:
On the Parameterized Complexity of Labelled Correlation Clustering Problem. COCOON 2014: 276-287 - 2012
- [j1]Gao Cong, Wenfei Fan, Anastasios Kementsietsidis, Jianzhong Li, Xianmin Liu:
Partial Evaluation for Distributed XPath Query Processing and Beyond. ACM Trans. Database Syst. 37(4): 32:1-32:43 (2012)
2000 – 2009
- 2009
- [c2]Hongzhi Wang, Jianzhong Li, Xianmin Liu, Jizhou Luo:
Query Optimization for Complex Path Queries on XML Data. DASFAA 2009: 389-404 - 2007
- [c1]Xianmin Liu, Jianzhong Li, Hongzhi Wang:
SAM: An Efficient Algorithm for F&B-Index Construction. APWeb/WAIM 2007: 697-708
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 2024-11-11 22:25 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:
