I am a KIAC Postdoc at IISc working with Prof. Arindam Khan. Previously, I was a PhD. student at IIT Gandhinagar, advised by Prof. Manoj Gupta.
I am broadly interested in Theoretical Computer Science with emphasis on Data structure, Algorithm, Online Algorithm and Algorithms with predictions.
Manuscripts
Greedy on Preorder is Linear for Preorder Initial Tree
A. Pareek
We show that for every preorder (traversal) sequence there is an initial tree called preorder initial tree for which the cost of the sequence is O(n).
[PDF]
Publications
The Group Access Bounds for Binary Search Trees
P. Chalermsook, M. Gupta, W. Jiamjitrak, A. Pareek and S. Yingchareonthawornchai .
ICALP 2024
We introduce the Group Access bound, a generalization of the access lemma. As application of the Group access bound we are able to show results that cannot be shown via the access lemma such as : √ log n- competitiveness, k-finger bound, Unified bound, Unified bound with a time window, all with some additive term. We also show that there is a BST algorithm named GGreedy (very similar to Greedy) that achieves this bound.
[PDF]
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
P. Chalermsook, M. Gupta, W. Jiamjitrak, N. Obscura Acosta, A. Pareek and S. Yingchareonthawornchai .
SODA'23, HALG'23
There is a class of Binary search trees (Greedy BST) that is nearly optimal for sequences such as Deque, Sequential, Preorder, Postorder, k-increasing/k-decreasing, and Split.
[PDF]
Contact
Address: 323, CSA Building, IISc Bangalore.
Email: pareek_akash@iitgn.ac.in
