research
∙
11/08/2022
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition
Greedy BST (or simply Greedy) is an online self-adjusting binary search ...
share
research
∙
06/30/2022
Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem
In a graph G with a source s, we design a distance oracle that can answe...
research
∙
05/19/2020
Multiple Source Replacement Path Problem
One of the classical line of work in graph algorithms has been the Repla...
research
∙
10/16/2018
Nearly Optimal Space Efficient Algorithm for Depth First Search
We design a space-efficient algorithm for performing depth-first search ...
research
∙
05/01/2018
Generic Single Edge Fault Tolerant Exact Distance Oracle
Given an undirected unweighted graph G and a source set S of |S| = σ so...
research
∙
04/05/2018
