18 citations · 45 across the 11 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak +3
Greedy BST (or simply Greedy) is an online self-adjusting binary search tree defined in the geometric view ([Lucas, 1988; Munro, 2000; Demaine, Harmon, Iacono, Kane, Patrascu, SODA…
cs.DS2022
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
Dipan Dey, Manoj Gupta
In a graph with a source , we design a distance oracle that can answer the following query: Query -- find the length of shortest path from a fixed source to any…