( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Finding and Counting Patterns in Sparse Graphs.

, , , и . STACS, том 254 из LIPIcs, стр. 40:1-40:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

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

Другие публикации лиц с тем же именем

On the complexity of detecting hazards., и . Inf. Process. Lett., (2020)Pebbling Meets Coloring: Reversible Pebble Game On Trees., , и . CoRR, (2016)On the Complexity of L-reachability., , и . CoRR, (2017)Pebbling, Entropy and Branching Program Size Lower Bounds., и . STACS, том 20 из LIPIcs, стр. 622-633. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Rabbits Approximate, Cows Compute Exactly!, , и . MFCS, том 241 из LIPIcs, стр. 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Hazard-free Decision Trees., , , и . CoRR, (января 2025)On the Complexity of L-reachability., , и . DCFS, том 8614 из Lecture Notes in Computer Science, стр. 258-269. Springer, (2014)Karchmer-Wigderson Games for Hazard-Free Computation., , и . ITCS, том 251 из LIPIcs, стр. 74:1-74:25. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Power of Border Width-2 ABPs over Fields of Characteristic 2., , , , , и . STACS, том 289 из LIPIcs, стр. 31:1-31:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Monotone Arithmetic Complexity of Graph Homomorphism Polynomials., , и . ICALP, том 229 из LIPIcs, стр. 83:1-83:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)