Get started
Author

Balagopal Komarath

Observed name: Komarath, Balagopal
ORCID: 0009-0008-3007-6280
Observed ORCID: 0009-0008-3007-6280
OpenAlex ID: A5030291460
Graph Pattern Polynomials
2018 · Bläser, Markus, Komarath, Balagopal, et al. · arXiv (Cornell University) · 9
PDF
On the complexity of hazard-free circuits
2018 · Christian Ikenmeyer, Balagopal Komarath, et al. · ACM Symposium on Theory of Computing (STOC) · 7
Pebbling meets coloring: Reversible pebble game on trees
2017 · Balagopal Komarath, Jayalal Sarma, et al. · Journal of Computer and System Sciences · 6
PDF
Reversible Pebble Game on Trees
2015 · Balagopal Komarath, Jayalal Sarma, et al. · Lecture notes in computer science · 6
On the Complexity of L-reachability
2014 · Balagopal Komarath, Jayalal Sarma, et al. · Lecture notes in computer science · 4
Graph Homomorphism Polynomials: Algorithms and Complexity
2020 · Komarath, Balagopal, Pandey, Anurag, et al. · arXiv (Cornell University) · 3
PDF
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
2023 · Balagopal Komarath, Anurag Pandey, et al. · Algorithmica · 2
On the complexity of detecting hazards
2020 · Balagopal Komarath, Nitin Saurabh · Information Processing Letters · 2
Comparator Circuits over Finite Bounded Posets
2018 · Balagopal Komarath, Jayalal Sarma, et al. · Information and Computation · 2
PDF
On the Complexity of L-reachability
2016 · Balagopal Komarath, Jayalal Sarma, et al. · Fundamenta Informaticae · 2
PDF
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
2014 · Kristoffer Arnsfelt Hansen, Balagopal Komarath, et al. · Lecture notes in computer science · 2
Finding and counting patterns in sparse graphs
2025 · Balagopal Komarath, Anant Kumar, et al. · Journal of Computer and System Sciences · 1
Pebbling, Entropy, and Branching Program Size Lower Bounds
2015 · Balagopal Komarath, Jayalal Sarma · ACM Transactions on Computation Theory · 1
Comparator Circuits over Finite Bounded Posets
2015 · Komarath, Balagopal, Sarma, Jayalal, et al. · arXiv (Cornell University) · 1
PDF
Faster Algorithms for Finding Small Induced Patterns in Sparse Host Graphs
2026 · Agrawal, Priyanshi, Komarath, Balagopal · arXiv (Cornell University)
PDF
VP, VNP and Algebraic Branching Programs over Min-Plus Semirings
2026 · Komarath, Balagopal, Mittal, Harshil, et al. · arXiv (Cornell University)
PDF
VP, VNP and Algebraic Branching Programs over Min-Plus Semirings
2026 · Komarath, Balagopal, Mittal, Harshil, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Counting Patterns in Degenerate Graphs in Constant Space
2025 · Komarath, Balagopal, Kumar, Anant, et al. · arXiv (Cornell University)
PDF
Hazard-free Decision Trees
2025 · Benson, Deepu, Komarath, Balagopal, et al. · arXiv (Cornell University)
PDF
Finding and Counting Patterns in Sparse Graphs
2024 · SUCHISMITA MISHRA, Balagopal Komarath, et al. · SSRN Electronic Journal
Finding and Counting Patterns in Sparse Graphs
2023 · Komarath, Balagopal, Kumar, Anant, et al. · arXiv (Cornell University)
PDF
Finding and Counting Patterns in Sparse Graphs
2023 · Komarath, Balagopal, Kumar, Anant, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Karchmer-Wigderson Games for Hazard-Free Computation
2021 · Ikenmeyer, Christian, Komarath, Balagopal, et al. · Warwick Research Archive Portal (University of Warwick)
PDF
On the complexity of detecting hazards
2020 · Komarath, Balagopal, Saurabh, Nitin · arXiv (Cornell University)
PDF
Comparator Circuits over Finite Bounded Posets
2015 · Balagopal Komarath, Jayalal Sarma, et al. · Lecture notes in computer science
Works count: 32
Citation count: 49
H-index: 4
I10-index:
Year
Topic
Type