| On minimal odd rankings for Büchi complementation H Karmarkar, S Chakraborty International Symposium on Automated Technology for Verification and …, 2009 | 18 | 2009 |
| Improved upper and lower bounds for Büchi disambiguation H Karmarkar, M Joglekar, S Chakraborty Automated Technology for Verification and Analysis: 11th International …, 2013 | 7 | 2013 |
| VeriFuzz 1.4: Checking for (non-) termination (competition contribution) R Metta, P Yeduru, H Karmarkar, RK Medicherla International Conference on Tools and Algorithms for the Construction and …, 2023 | 5 | 2023 |
| Determinization of -automata unified H Karmarkar, S Chakraborty arXiv preprint arXiv:1101.1841, 2011 | 3 | 2011 |
| Fuzznt: Checking for program non-termination H Karmarkar, RK Medicherla, R Metta, P Yeduru 2022 IEEE International Conference on Software Maintenance and Evolution …, 2022 | 2 | 2022 |
| VeriFuzz: Good Seeds for Fuzzing (Competition Contribution). R Metta, RK Medicherla, H Karmarkar FASE, 341-346, 2022 | 2 | 2022 |
| PROTON: PRObes for Termination Or Not (Competition Contribution) R Metta, H Karmarkar, K Madhukar, R Venkatesh, S Chakraborty International Conference on Tools and Algorithms for the Construction and …, 2024 | 1 | 2024 |
| Efficiently Finding Adversarial Examples with DNN Preprocessing A Chauhan, M Afzal, H Karmarkar, Y Elboher, K Madhukar, G Katz arXiv preprint arXiv:2211.08706, 2022 | | 2022 |
| Fast Implementations Of Modified Discrete Cosine Transform H Karmarkar, VM Gadre, P Rao | | |
Supratik ChakrabortyDept. of Computer Science and Engineering, IIT BombayVerified email at iitb.ac.in
