research
∙
02/02/2023
Explicit two-sided unique-neighbor expanders
We study the problem of constructing explicit sparse imbalanced bipartit...
share
research
∙
12/02/2021
Explicit Abelian Lifts and Quantum LDPC Codes
For an abelian group H acting on the set [â„“], an (H,â„“)-lift of a graph G...
research
∙
02/17/2020
Spectrum preserving short cycle removal on regular graphs
We describe a new method to remove short cycles on regular graphs while ...
research
∙
10/29/2019
A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets
Computing subgraph frequencies is a fundamental task that lies at the co...
research
∙
09/16/2019
Explicit near-Ramanujan graphs of every degree
For every constant d ≥ 3 and ϵ > 0, we give a deterministic poly(n)-time...
research
∙
06/16/2019
