research
∙
08/16/2023
Improved Approximation Bounds for Minimum Weight Cycle in the CONGEST Model
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of m...
share
research
∙
05/30/2022
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model
We present several results in the CONGEST model on round complexity for ...
research
∙
08/01/2020
Data Oblivious Algorithms for Multicores
As secure processors such as Intel SGX (with hyperthreading) become wide...
research
∙
05/19/2020
Faster Deterministic All Pairs Shortest Paths in Congest Model
We present a new deterministic algorithm for distributed weighted all pa...
research
∙
10/18/2018
New and Simplified Distributed Algorithms for Weighted All Pairs Shortest Paths
We consider the problem of computing all pairs shortest paths (APSP) and...
research
∙
07/23/2018
A Faster Deterministic Distributed Algorithm for Weighted APSP Through Pipelining
We present a new approach to computing all pairs shortest paths (APSP) i...
research
∙
05/21/2018
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths
The betweenness centrality (BC) of a node in a network (or graph) is a m...
research
∙
04/15/2018