Research – Balagopal Komarath

The following list contains peer-reviewed publications that I have co-authored in reverse chronological order.

• On the power of border width-2 ABPs over fields of characteristic 2.
• Finding and counting patterns in sparse graphs.
• Rabbits approximate, cows compute exactly!.
• KW games for hazard-free computation.
• Monotone arithmetic complexity of graph homomorphism polynomials.
• On the complexity of detecting hazards.
• Graph pattern polynomials.
• On the complexity of hazard-free circuits.
• Comparator circuits over finite bounded posets.
• Pebbling meets coloring: Reversible pebble game on trees.
• On the complexity of L-reachability.
• Circuit complexity of properties of graphs with constant planar cutwidth.
• Pebbling, entropy, and branching program size lower bounds.