Balagopal Komarath

Available identifiers

zbMath Open komarath.balagopalMaRDI QIDQ1640989

List of research outcomes

Publication	Date of Publication	Type
Finding and counting patterns in sparse graphs	2024-10-08	Paper
Karchmer-Wigderson games for hazard-free computation	2024-09-25	Paper
Rabbits approximate, cows compute Exactly!	2024-08-06	Paper
Monotone arithmetic complexity of graph homomorphism polynomials	2024-06-24	Paper
Monotone arithmetic complexity of graph homomorphism polynomials	2023-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q5090953	2022-07-21	Paper
On the complexity of detecting hazards	2020-10-07	Paper
On the Complexity of Hazard-free Circuits	2020-02-11	Paper
On the complexity of hazard-free circuits	2019-08-22	Paper
Comparator circuits over finite bounded posets	2018-06-14	Paper
Pebbling meets coloring: reversible pebble game on trees	2017-10-11	Paper
On the complexity of L-reachability	2017-07-28	Paper
Pebbling, entropy and branching program size lower bounds	2017-01-30	Paper
Pebbling, entropy, and branching program size lower bounds	2016-10-24	Paper
Reversible pebble game on trees	2015-10-29	Paper
Comparator circuits over finite bounded posets	2015-10-27	Paper
Circuit complexity of properties of graphs with constant planar cutwidth	2014-10-14	Paper
On the complexity of L-reachability	2014-08-07	Paper

Research outcomes over time

This page was built for person: Balagopal Komarath