Akash Pareek

Orcid: 0000-0002-3570-5882

According to our database1, Akash Pareek authored at least 3 papers between 2023 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Greedy on Preorder is Linear for Preorder Initial Tree.
CoRR, 2024

The Group Access Bounds for Binary Search Trees.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023


  Loading...