Qizheng He

Orcid: 0009-0009-1002-9556

According to our database1, Qizheng He authored at least 19 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Exploring Bitter and Sweet: The Application of Large Language Models in Molecular Taste Prediction.
J. Chem. Inf. Model., 2024

Exploring the anti-gout potential of sunflower receptacles alkaloids: A computational and pharmacological analysis.
Comput. Biol. Medicine, 2024

Simple and Faster Algorithms for Knapsack.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Improved Algorithms for Integer Complexity.
Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

Enclosing Points with Geometric Objects.
Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023
Logical Entity Representation in Knowledge-Graphs for Differentiable Rule Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

On the FPT Status of Monotone Convex Chain Cover.
Proceedings of the 35th Canadian Conference on Computational Geometry, 2023

2022
More on change-making and related problems.
J. Comput. Syst. Sci., 2022

Dynamic Geometric Set Cover, Revisited.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021
More Dynamic Data Structures for Geometric Set Cover with Sublinear Update Time.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma.
ACM Trans. Algorithms, 2020

On the Change-Making Problem.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Reducing 3SUM to Convolution-3SUM.
Proceedings of the 3rd Symposium on Simplicity in Algorithms, 2020

Further Results on Colored Range Searching.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Faster Approximation Algorithms for Geometric Set Cover.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2018
The Complexity of Distributed Edge Coloring with Small Palettes.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

The Energy Complexity of Broadcast.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

2017
SOT for MOT.
CoRR, 2017


  Loading...