research
∙
09/24/2022
When you come at the kings you best not miss
A tournament is an orientation of a complete graph. We say that a vert...
share
research
∙
07/14/2022
Dynamic Spanning Trees for Connectivity Queries on Fully-dynamic Undirected Graphs (Extended version)
Answering connectivity queries is fundamental to fully dynamic graphs wh...
research
∙
10/10/2020
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy
We prove a general structural theorem for a wide family of local algorit...
research
∙
04/17/2019
A Lower Bound for Relaxed Locally Decodable Codes
A locally decodable code (LDC) C:0,1^k -> 0,1^n is an error correcting c...
research
∙
03/06/2019
Longest paths in 2-edge-connected cubic graphs
We prove almost tight bounds on the length of paths in 2-edge-connected ...
research
∙
11/21/2017