research
∙
04/13/2023
Universally Optimal Deterministic Broadcasting in the HYBRID Distributed Model
In theoretical computer science, it is a common practice to show existen...
share
research
∙
06/09/2022
AritPIM: High-Throughput In-Memory Arithmetic
Digital processing-in-memory (PIM) architectures are rapidly emerging to...
research
∙
05/18/2022
Deterministic Near-Optimal Distributed Listing of Cliques
The importance of classifying connections in large graphs has been the m...
research
∙
01/09/2022
Quantum Distributed Algorithms for Detection of Cliques
The possibilities offered by quantum computing have drawn attention in t...
research
∙
05/13/2021
On Sparsity Awareness in Distributed Computations
We extract a core principle underlying seemingly different fundamental d...
research
∙
01/19/2021
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
In this paper we give fast distributed graph algorithms for detecting an...
research
∙
11/14/2020
Tight Distributed Listing of Cliques
Much progress has recently been made in understanding the complexity lan...
research
∙
10/26/2020
Distance Computations in the Hybrid Network Model via Oracle Simulations
The Hybrid network model was introduced in [Augustine et al., SODA '20] ...
research
∙
07/10/2020
On Distributed Listing of Cliques
We show an Õ(n^p/(p+2))-round algorithm in the model for listing of K_p ...
research
∙
05/24/2019
Hardness of Distributed Optimization
This paper studies lower bounds for fundamental optimization problems in...
research
∙
03/14/2019
Fast Approximate Shortest Paths in the Congested Clique
We design fast deterministic algorithms for distance computation in the ...
research
∙
02/13/2018
