research
∙
06/22/2023
Unitary Complexity and the Uhlmann Transformation Problem
State transformation problems such as compressing quantum information or...
share
research
∙
08/04/2022
Nearly Optimal Communication and Query Complexity of Bipartite Matching
We settle the complexities of the maximum-cardinality bipartite matching...
research
∙
01/14/2022
Cut query algorithms with star contraction
We study the complexity of determining the edge connectivity of a simple...
research
∙
11/10/2020
Distributed Distance Approximation
Diameter, radius and eccentricities are fundamental graph parameters, wh...
research
∙
04/20/2020
Distributed Weighted Min-Cut in Nearly-Optimal Time
Minimum-weight cut (min-cut) is a basic measure of a network's connectiv...
research
∙
03/16/2020
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST
By far the most fruitful technique for showing lower bounds for the CONG...
research
∙
11/29/2019
Classification of distributed binary labeling problems
We present a complete classification of the deterministic distributed ti...
research
∙
05/24/2019
Hardness of Distributed Optimization
This paper studies lower bounds for fundamental optimization problems in...
research
∙
12/02/2018
Double and Triple Node-Erasure-Correcting Codes over Graphs
In this paper we study array-based codes over graphs for correcting mult...
research
∙
12/02/2018
