| On the complexity of hazard-free circuits C Ikenmeyer, B Komarath, C Lenzen, V Lysikov, A Mokhov, ... Journal of the ACM (JACM) 66 (4), 1-20, 2019 | 15 | 2019 |
| Graph pattern polynomials M Bläser, B Komarath, K Sreenivasaiah arXiv preprint arXiv:1809.08858, 2018 | 13 | 2018 |
| Pebbling meets coloring: Reversible pebble game on trees B Komarath, J Sarma, S Sawlani Journal of Computer and System Sciences 91, 33-41, 2018 | 7 | 2018 |
| Reversible pebble game on trees B Komarath, J Sarma, S Sawlani Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015 | 6 | 2015 |
| Monotone arithmetic complexity of graph homomorphism polynomials B Komarath, A Pandey, CS Rahul Algorithmica 85 (9), 2554-2579, 2023 | 5 | 2023 |
| Graph homomorphism polynomials: Algorithms and complexity B Komarath, A Pandey, CS Rahul arXiv preprint arXiv:2011.04778, 2020 | 5 | 2020 |
| Pebbling, entropy, and branching program size lower bounds B Komarath, J Sarma ACM Transactions on Computation Theory (TOCT) 7 (2), 1-21, 2015 | 5 | 2015 |
| On the Complexity of L-reachability B Komarath, J Sarma, KS Sunil Fundamenta Informaticae 145 (4), 471-483, 2016 | 4 | 2016 |
| Circuit complexity of properties of graphs with constant planar cutwidth KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard Mathematical Foundations of Computer Science 2014: 39th International …, 2014 | 4 | 2014 |
| Karchmer-Wigderson games for hazard-free computation C Ikenmeyer, B Komarath, N Saurabh arXiv preprint arXiv:2107.05128, 2021 | 3 | 2021 |
| On the complexity of detecting hazards B Komarath, N Saurabh Information Processing Letters 162, 105980, 2020 | 3 | 2020 |
| Comparator circuits over finite bounded posets B Komarath, J Sarma, KS Sunil Information and Computation 261, 160-174, 2018 | 2 | 2018 |
| Hazard-free Decision Trees D Benson, B Komarath, J Sarma, NS Soumya arXiv preprint arXiv:2501.00831, 2025 | | 2025 |
| On the power of border width-2 ABPs over fields of characteristic 2 P Dutta, C Ikenmeyer, B Komarath, H Mittal, S Nanoti, D Thakkar Leibniz International Proceedings in Informatics (LIPIcs), 2024 | | 2024 |
| Finding and counting patterns in sparse graphs B Komarath, A Kumar, S Mishra, A Sethia arXiv preprint arXiv:2301.02569, 2023 | | 2023 |
| Rabbits approximate, cows compute exactly! B Komarath, A Pandey, N Saurabh 47th International Symposium on Mathematical Foundations of Computer Science …, 2022 | | 2022 |
| 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018) R Majumdar, AP Sistla, O Svensson, S Vempala, S Bhandari, P Harsha, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | | 2018 |
| Graph Pattern Polynomials M Blaser, B Komarath, K Sreenivasaiah | | 2018 |
| Circuit Complexity Bounds using Monoid Structure for Graph Problems KA Hansen, B Komarath, J Sarma, S Skyum, N Talebanfard | | 2014 |
| Finding and Counting Patterns in Sparse Graphs S MISHRA, B Komarath, A Kumar, A Sethia Available at SSRN 4689711, 0 | | |
Jayalal SarmaIndian Institute of Technology Madras, Chennai, IndiaVerified email at cse.iitm.ac.in
