research
∙
01/06/2023
Finding and Counting Patterns in Sparse Graphs
We consider algorithms for finding and counting small, fixed graphs in s...
share
research
∙
07/11/2021
Karchmer-Wigderson Games for Hazard-free Computation
We present a Karchmer-Wigderson game to study the complexity of hazard-f...
research
∙
11/09/2020
Graph Homomorphism Polynomials: Algorithms and Complexity
We study homomorphism polynomials, which are polynomials that enumerate ...
research
∙
06/18/2020
On the complexity of detecting hazards
Detecting and eliminating logic hazards in Boolean circuits is a fundame...
research
∙
09/24/2018
Graph Pattern Polynomials
We study the time complexity of induced subgraph isomorphism problems wh...
research
∙
11/06/2017