Seeking a Vertex of the Planar Matching Polytope in NC. - Raghav Kulkarni; Meena Mahajan (ESA, 2004)

A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. - Raghav Kulkarni (CIAC, 2006)

Parity Problems in Planar Graphs. - Mark Braverman; Raghav Kulkarni; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2007)

Some perfect matchings and perfect half-integral matchings in NC. - Raghav Kulkarni; Meena Mahajan; Kasturi R. Varadarajan (Chic. J. Theor. Comput. Sci., 2008)

Space-Efficient Counting in Graphs on Surfaces. - Mark Braverman; Raghav Kulkarni; Sambuddha Roy (Comput. Complex., 2009)

On the Power of Isolation in Planar Structures. - Raghav Kulkarni (Electron. Colloquium Comput. Complex., 2009)

Evasiveness and the Distribution of Prime Numbers. - László Babai; Anandam Banerjee; Raghav Kulkarni; Vipul Naik (STACS, 2010)

Perfect Matching in Bipartite Planar Graphs is in UL. - Samir Datta; Raghav Kulkarni; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2010)

Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. - Samir Datta; Raghav Kulkarni; Sambuddha Roy (Theory Comput. Syst., 2010)

Planarity, Determinants, Permanents, and (Unique) Matchings. - Samir Datta; Raghav Kulkarni; Nutan Limaye; Meena Mahajan (ACM Trans. Comput. Theory, 2010)

Variations on the Sensitivity Conjecture. - Pooya Hatami; Raghav Kulkarni; Denis Pankratov (Theory Comput., 2011)

On the Power of Isolation in Planar Graphs. - Raghav Kulkarni (ACM Trans. Comput. Theory, 2011)

Improved Bounds for Bipartite Matching on Surfaces. - Samir Datta; Arjun Gopalan; Raghav Kulkarni; Raghunath Tewari (STACS, 2012)

Query complexity of matroids. - Raghav Kulkarni; Miklos Santha (Electron. Colloquium Comput. Complex., 2012)

Space complexity of perfect matching in bounded genus bipartite graphs. - Samir Datta; Raghav Kulkarni; Raghunath Tewari; N. V. Vinodchandran (J. Comput. Syst. Sci., 2012)

Evasiveness through a circuit lens. - Raghav Kulkarni (ITCS, 2013)

Space complexity: what makes planar graphs special? - Samir Datta; Raghav Kulkarni (Bull. EATCS, 2013)

Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. - Abhishek Bhrushundi; Sourav Chakraborty 001; Raghav Kulkarni (Electron. Colloquium Comput. Complex., 2013)

Gems in decision tree complexity revisited. - Raghav Kulkarni (SIGACT News, 2013)

Dynamic Complexity of Directed Reachability and Other Problems. - Samir Datta; William Hesse; Raghav Kulkarni (ICALP (1), 2014)

An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. - Thomas Decker 002; Gábor Ivanyos; Raghav Kulkarni; Youming Qiao; Miklos Santha (MFCS (2), 2014)

Space Complexity of Optimization Problems in Planar Graphs. - Samir Datta; Raghav Kulkarni (TAMC, 2014)

On the Power of Parity Queries in Boolean Decision Trees. - Raghav Kulkarni; Youming Qiao; Xiaoming Sun 001 (TAMC, 2015)

Demystifying incentives in the consensus computer. - Loi Luu; Jason Teutsch; Raghav Kulkarni; Prateek Saxena (IACR Cryptol. ePrint Arch., 2015)

Any monotone property of 3-uniform hypergraphs is weakly evasive. - Raghav Kulkarni; Youming Qiao; Xiaoming Sun 001 (Theor. Comput. Sci., 2015)

Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. - Nikhil Balaji; Samir Datta; Raghav Kulkarni; Supartha Podder (MFCS, 2016)

Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. - Samir Datta; Raghav Kulkarni; Anish Mukherjee 001 (MFCS, 2016)

Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. - Raghav Kulkarni; Supartha Podder (STACS, 2016)

On Fractional Block Sensitivity. - Raghav Kulkarni; Avishay Tal (Chic. J. Theor. Comput. Sci., 2016)

Similarity preserving compressions of high dimensional sparse data. - Raghav Kulkarni; Rameshwar Pratap (CoRR, 2016)

Upper bounds on Fourier entropy. - Sourav Chakraborty 001; Raghav Kulkarni; Satyanarayana V. Lokam; Nitin Saurabh (Theor. Comput. Sci., 2016)

On the Spectral Properties of Symmetric Functions. - Anil Ada; Omar Fawzi; Raghav Kulkarni (CoRR, 2017)

Efficient Dimensionality Reduction for Sparse Binary Data. - Rameshwar Pratap; Raghav Kulkarni; Ishan Sohony (IEEE BigData, 2018)

Shortest k-Disjoint Paths via Determinants. - Samir Datta; Siddharth Iyer; Raghav Kulkarni; Anish Mukherjee 001 (FSTTCS, 2018)

Planar Maximum Matching: Towards a Parallel Algorithm. - Samir Datta; Raghav Kulkarni; Ashish Kumar; Anish Mukherjee 001 (ISAAC, 2018)

Efficient Compression Technique for Sparse Sets. - Rameshwar Pratap; Ishan Sohony; Raghav Kulkarni (PAKDD (3), 2018)

Reachability Is in DynFO. - Samir Datta; Raghav Kulkarni; Anish Mukherjee 001; Thomas Schwentick; Thomas Zeume (J. ACM, 2018)

On the complexity of trial and error for constraint satisfaction problems. - Gábor Ivanyos; Raghav Kulkarni; Youming Qiao; Miklos Santha; Aarthi Sundaram (J. Comput. Syst. Sci., 2018)

CrystalBall: Gazing in the Black Box of SAT Solving. - Mate Soos; Raghav Kulkarni; Kuldeep S. Meel (SAT, 2019)

Randomness Efficient Feature Hashing for Sparse Binary Data. - Rameshwar Pratap; Karthik Revanuru; Anirudh Ravi; Raghav Kulkarni (ACML, 2020)

Efficient Compression Algorithm for Multimedia Data. - Rameshwar Pratap; Karthik Revanuru; Anirudh Ravi; Raghav Kulkarni (BigMM, 2020)

Improving Tug-of-War sketch using Control-Variates method. - Rameshwar Pratap; Bhisham Dev Verma; Raghav Kulkarni (ACDA, 2021)

Feature Hashing with Insertion and Deletion of Features. - Rameshwar Pratap; Suryakant Bhardwaj; Hrushikesh Sudam Sarode; Raghav Kulkarni (IEEE BigData, 2021)

Variance reduction in frequency estimators via control variates method. - Rameshwar Pratap; Raghav Kulkarni (UAI, 2021)

Improving textit{Tug-of-War} sketch using Control-Variates method. - Rameshwar Pratap; Bhisham Dev Verma; Raghav Kulkarni (CoRR, 2022)

Minwise-Independent Permutations with Insertion and Deletion of Features. - Rameshwar Pratap; Raghav Kulkarni (SISAP, 2023)