S. Cliff Liu

Orcid: 0009-0007-7376-1993

According to our database1, S. Cliff Liu authored at least 17 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A novel Deep Reinforcement Learning based automated stock trading system using cascaded LSTM networks.
Expert Syst. Appl., 2024

Connected Components in Linear Work and Near-Optimal Time.
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024

2023
Space-Efficient Interior Point Method, with Applications to Linear Programming and Maximum Weight Bipartite Matching.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Simple Concurrent Connected Components Algorithms.
ACM Trans. Parallel Comput., 2022

2021
Sublinear Time Algorithms for Graph Problems
PhD thesis, 2021

An Auction Algorithm for Bipartite Matching in Streaming and Massively Parallel Computation Models.
Proceedings of the 4th Symposium on Simplicity in Algorithms, 2021

2020
Simpler Partial Derandomization of PPSZ for $k$-SAT.
CoRR, 2020

Connected Components on a PRAM in Log Diameter Time.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

2019
Multi-omics Analysis of Primary Cell Culture Models Reveals Genetic and Epigenetic Basis of Intratumoral Phenotypic Diversity.
Genom. Proteom. Bioinform., 2019

Simple Concurrent Labeling Algorithms for Connected Components.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Lower Bounds for Small Ramsey Numbers on Hypergraphs.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Chain, Generalization of Covering Code, and Deterministic Algorithm for k-SAT.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Should Algorithms for Random SAT and Max-SAT Be Different?
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
A Probability Distribution Strategy with Efficient Clause Selection for Hard Max-SAT Formulas.
CoRR, 2016

Local Search for Hard SAT Formulas: The Strength of the Polynomial Law.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
An Efficient Implementation for WalkSAT.
CoRR, 2015

2012
Network analyses of Beijing subways.
Proceedings of the IEEE 10th International Conference on Industrial Informatics, 2012


  Loading...