default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Cliff Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2021
[b1]Sixue Liu:
Sublinear Time Algorithms for Graph Problems. Princeton University, USA, 2021
Journal Articles
- 2024
- [j3]Jie Zou
, Jiashu Lou, Baohua Wang, Sixue Liu:
A novel Deep Reinforcement Learning based automated stock trading system using cascaded LSTM networks. Expert Syst. Appl. 242: 122801 (2024) - 2022
- [j2]Sixue Cliff Liu, Robert Endre Tarjan:
Simple Concurrent Connected Components Algorithms. ACM Trans. Parallel Comput. 9(2): 9:1-9:26 (2022) - 2019
- [j1]Sixue Liu, Zuyu Yang, Guanghao Li, Chunyan Li, Yanting Luo, Qiang Gong, Xin Wu, Tao Li, Zhiqian Zhang, Baocai Xing, Xiaolan Xu, Xuemei Lu:
Multi-omics Analysis of Primary Cell Culture Models Reveals Genetic and Epigenetic Basis of Intratumoral Phenotypic Diversity. Genom. Proteom. Bioinform. 17(6): 576-589 (2019)
Conference and Workshop Papers
- 2024
- [c10]Alireza Farhadi, Sixue Cliff Liu, Elaine Shi:
Connected Components in Linear Work and Near-Optimal Time. SPAA 2024: 395-402 - 2023
- [c9]S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, Tianyi Zhou:
Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching. ICALP 2023: 88:1-88:14 - 2021
- [c8]Sepehr Assadi, S. Cliff Liu, Robert E. Tarjan:
An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models. SOSA 2021: 165-171 - 2020
- [c7]Sixue Cliff Liu, Robert E. Tarjan, Peilin Zhong:
Connected Components on a PRAM in Log Diameter Time. SPAA 2020: 359-369 - 2019
- [c6]S. Cliff Liu:
Lower Bounds for Small Ramsey Numbers on Hypergraphs. COCOON 2019: 412-424 - [c5]Sixue Liu, Robert E. Tarjan:
Simple Concurrent Labeling Algorithms for Connected Components. SOSA 2019: 3:1-3:20 - 2018
- [c4]Sixue Liu:
Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. ICALP 2018: 88:1-88:13 - 2017
- [c3]Sixue Liu, Gerard de Melo:
Should Algorithms for Random SAT and Max-SAT Be Different? AAAI 2017: 3915-3921 - 2016
- [c2]Sixue Liu, Periklis A. Papakonstantinou:
Local Search for Hard SAT Formulas: The Strength of the Polynomial Law. AAAI 2016: 732-738 - 2012
- [c1]Sixue Liu, Wenhao He:
Network analyses of Beijing subways. INDIN 2012: 1022-1024
Informal and Other Publications
- 2023
- [i10]Alireza Farhadi, S. Cliff Liu, Elaine Shi:
Connected Components in Linear Work and Near-Optimal Time. CoRR abs/2312.02332 (2023) - 2022
- [i9]Jie Zou, Jiashu Lou, Baohua Wang, Sixue Liu:
A Novel Deep Reinforcement Learning Based Automated Stock Trading System Using Cascaded LSTM Networks. CoRR abs/2212.02721 (2022) - 2020
- [i8]S. Cliff Liu:
Simpler Partial Derandomization of PPSZ for $k$-SAT. CoRR abs/2001.06536 (2020) - [i7]S. Cliff Liu, Robert E. Tarjan, Peilin Zhong:
Connected Components on a PRAM in Log Diameter Time. CoRR abs/2003.00614 (2020) - [i6]S. Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, Tianyi Zhou:
Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching. CoRR abs/2009.06106 (2020) - 2019
- [i5]S. Cliff Liu:
Lower Bounds for Small Ramsey Numbers on Hypergraphs. CoRR abs/1906.00132 (2019) - 2018
- [i4]Sixue Liu:
Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT. CoRR abs/1804.07901 (2018) - [i3]Sixue Liu, Robert E. Tarjan:
Simple Concurrent Labeling Algorithms for Connected Components. CoRR abs/1812.06177 (2018) - 2016
- [i2]Sixue Liu, Yulong Ceng, Gerard de Melo:
A Probability Distribution Strategy with Efficient Clause Selection for Hard Max-SAT Formulas. CoRR abs/1610.00442 (2016) - 2015
- [i1]Sixue Liu:
An Efficient Implementation for WalkSAT. CoRR abs/1510.07217 (2015)
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-09 13:23 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:
