Jingxun Liang

Orcid: 0009-0001-1000-5900

According to our database1, Jingxun Liang authored at least 11 papers between 2023 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Optimal Static Dictionary with Worst-Case Constant Query Time.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Low Rank Matrix Rigidity: Tight Lower Bounds and Hardness Amplification.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Maximum Circuit Lower Bounds for Exponential-Time Arthur Merlin.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Optimal Static Fully Indexable Dictionaries.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Fingerprint Filters Are Optimal.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

Static Retrieval Revisited: To Optimality and Beyond.
Proceedings of the 66th IEEE Annual Symposium on Foundations of Computer Science, 2025

2024
Dynamic Dictionary with Subconstant Wasted Bits per Key.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Dynamic "Succincter".
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

On the Perturbation Function of Ranking and Balance for Weighted Online Bipartite Matching.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023


  Loading...