Balagopal Komarath

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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 Algorithmica	2023-09-27	Paper
scientific article; zbMATH DE number 7561323 (Why is no real title available?) (available as arXiv preprint)	2022-07-21	Paper
On the complexity of detecting hazards Information Processing Letters	2020-10-07	Paper
On the complexity of hazard-free circuits Journal of the ACM	2020-02-11	Paper
On the complexity of hazard-free circuits Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper
Comparator circuits over finite bounded posets Information and Computation	2018-06-14	Paper
Pebbling meets coloring: reversible pebble game on trees Journal of Computer and System Sciences	2017-10-11	Paper
On the complexity of L-reachability Fundamenta Informaticae	2017-07-28	Paper
Pebbling, entropy and branching program size lower bounds	2017-01-30	Paper
Pebbling, entropy, and branching program size lower bounds ACM Transactions on Computation Theory	2016-10-24	Paper
Reversible pebble game on trees Lecture Notes in Computer Science	2015-10-29	Paper
Comparator circuits over finite bounded posets Lecture Notes in Computer Science	2015-10-27	Paper
Circuit complexity of properties of graphs with constant planar cutwidth Mathematical Foundations of Computer Science 2014	2014-10-14	Paper
On the complexity of L-reachability Descriptional Complexity of Formal Systems	2014-08-07	Paper

Research outcomes over time

This page was built for person: Balagopal Komarath