24 citations · 85 across the 17 of their papers we have counts for
19 papers
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
Vignesh Manoharan, Vijaya Ramachandran
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in a graph . This is a fundamental graph problem with classical sequential algorithms…
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
Vignesh Manoharan, Vijaya Ramachandran
We present several results in the CONGEST model on round complexity for Replacement Paths (RPaths), Minimum Weight Cycle (MWC), and All Nodes Shortest Cycles (ANSC). We study these…
Data Oblivious Algorithms for Multicores
Vijaya Ramachandran, Elaine Shi
As secure processors such as Intel SGX (with hyperthreading) become widely adopted, there is a growing appetite for private analytics on big data. Most prior works on data-obliviou…
Faster Deterministic All Pairs Shortest Paths in Congest Model
Udit Agarwal, Vijaya Ramachandran
We present a new deterministic algorithm for distributed weighted all pairs shortest paths (APSP) in both undirected and directed graphs. Our algorithm runs in …
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths
Udit Agarwal, Vijaya Ramachandran
We consider the problem of computing all pairs shortest paths (APSP) and shortest paths for k sources in a weighted graph in the distributed CONGEST model. For graphs with non-nega…
A Deterministic Distributed Algorithm for Weighted All Pairs Shortest Paths Through Pipelining
Udit Agarwal, Vijaya Ramachandran
We present a new pipelined approach to compute all pairs shortest paths (APSP) in a directed graph with nonnegative integer edge weights (including zero weights) in the CONGEST mod…