| 2023 | SISAP | Minwise-Independent Permutations with Insertion and Deletion of Features. | Rameshwar Pratap, Raghav Kulkarni |
| 2021 | UAI | Variance reduction in frequency estimators via control variates method. | Rameshwar Pratap, Raghav Kulkarni |
| 2020 | ACML | Randomness Efficient Feature Hashing for Sparse Binary Data. | Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni |
| 2019 | SAT | CrystalBall: Gazing in the Black Box of SAT Solving. | Mate Soos, Raghav Kulkarni, Kuldeep S. Meel |
| 2018 | ISAAC | Planar Maximum Matching: Towards a Parallel Algorithm. | Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee |
| 2018 | PAKDD | Efficient Compression Technique for Sparse Sets. | Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni |
| 2016 | MFCS | Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. | Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder |
| 2016 | MFCS | Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. | Samir Datta, Raghav Kulkarni, Anish Mukherjee |
| 2016 | STACS | Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. | Raghav Kulkarni, Supartha Podder |
| 2015 | CCS | Demystifying Incentives in the Consensus Computer. | Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena |
| 2015 | COCOON | Upper Bounds on Fourier Entropy. | Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh |
| 2015 | ICALP | Reachability is in DynFO. | Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume |
| 2015 | TAMC | On the Power of Parity Queries in Boolean Decision Trees. | Raghav Kulkarni, Youming Qiao, Xiaoming Sun |
| 2014 | CSR | Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. | Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni |
| 2014 | ICALP | Dynamic Complexity of Directed Reachability and Other Problems. | Samir Datta, William Hesse, Raghav Kulkarni |
| 2014 | ICALP | On the Complexity of Trial and Error for Constraint Satisfaction Problems. | Gbor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram |
| 2014 | MFCS | An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. | Thomas Decker, Gbor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha |
| 2014 | TAMC | Space Complexity of Optimization Problems in Planar Graphs. | Samir Datta, Raghav Kulkarni |
| 2013 | CIAC | Query Complexity of Matroids. | Raghav Kulkarni, Miklos Santha |
| 2013 | TAMC | Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. | Raghav Kulkarni, Youming Qiao, Xiaoming Sun |
| 2012 | STACS | Improved Bounds for Bipartite Matching on Surfaces. | Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari |
| 2011 | STACS | Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. | Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran |
| 2010 | STACS | Evasiveness and the Distribution of Prime Numbers. | Lszl Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik |
| 2008 | STACS | Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. | Samir Datta, Raghav Kulkarni, Sambuddha Roy |
| 2007 | CSR | Planarity, Determinants, Permanents, and (Unique) Matchings. | Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan |
| 2006 | CIAC | A New NC-Algorithm for Finding a Perfect Matching in | Raghav Kulkarni |
| 2004 | ESA | Seeking a Vertex of the Planar Matching Polytope in NC. | Raghav Kulkarni, Meena Mahajan |