Author of the publication

Rabbits Approximate, Cows Compute Exactly!

, , and . MFCS, volume 241 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Komarath, Balagopal
add a person with the name Komarath, Balagopal
 

Other publications of authors with the same name

Rabbits Approximate, Cows Compute Exactly!, , and . MFCS, volume 241 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Pebbling, Entropy and Branching Program Size Lower Bounds., and . Electron. Colloquium Comput. Complex., (2013)On the complexity of detecting hazards., and . Inf. Process. Lett., (2020)On the Complexity of L-reachability., , and . CoRR, (2017)Pebbling Meets Coloring: Reversible Pebble Game On Trees., , and . CoRR, (2016)Karchmer-Wigderson Games for Hazard-Free Computation., , and . ITCS, volume 251 of LIPIcs, page 74:1-74:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Monotone Arithmetic Complexity of Graph Homomorphism Polynomials., , and . ICALP, volume 229 of LIPIcs, page 83:1-83:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)On the Complexity of L-reachability., , and . DCFS, volume 8614 of Lecture Notes in Computer Science, page 258-269. Springer, (2014)Finding and Counting Patterns in Sparse Graphs., , , and . STACS, volume 254 of LIPIcs, page 40:1-40:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Power of Border Width-2 ABPs over Fields of Characteristic 2., , , , , and . STACS, volume 289 of LIPIcs, page 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)