Raghav Kulkarni

Publication Activity (10 Years)

Years Active: 2004-2023
Publications (10 Years): 33

Top Topics

Query Complexity

Maximum Matching

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Rameshwar Pratap, Raghav Kulkarni
Minwise-Independent Permutations with Insertion and Deletion of Features. CoRR (2023)
Rameshwar Pratap, Raghav Kulkarni
Minwise-Independent Permutations with Insertion and Deletion of Features. SISAP (2023)
Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni
Improving \textit{Tug-of-War} sketch using Control-Variates method. CoRR (2022)
Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni
sketch using Control-Variates method. ACDA (2021)
Rameshwar Pratap, Raghav Kulkarni
Variance reduction in frequency estimators via control variates method. UAI (2021)
Rameshwar Pratap, Suryakant Bhardwaj, Hrushikesh Sudam Sarode, Raghav Kulkarni
Feature Hashing with Insertion and Deletion of Features. IEEE BigData (2021)
Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni
Efficient Compression Algorithm for Multimedia Data. BigMM (2020)
Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni
Randomness Efficient Feature Hashing for Sparse Binary Data. ACML (2020)
Mate Soos, Raghav Kulkarni, Kuldeep S. Meel
CrystalBall: Gazing in the Black Box of SAT Solving. SAT (2019)
Rameshwar Pratap, Raghav Kulkarni, Ishan Sohony
Efficient Dimensionality Reduction for Sparse Binary Data. IEEE BigData (2018)
Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee
Planar Maximum Matching: Towards a Parallel Algorithm. ISAAC (2018)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability Is in DynFO. J. ACM 65 (5) (2018)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. 92 (2018)
Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni
Efficient Compression Technique for Sparse Sets. PAKDD (3) (2018)
Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee
Shortest k-Disjoint Paths via Determinants. FSTTCS (2018)
Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee
Shortest k-Disjoint Paths via Determinants. CoRR (2018)
Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni
Efficient Compression Technique for Sparse Sets. CoRR (2017)
Anil Ada, Omar Fawzi, Raghav Kulkarni
On the Spectral Properties of Symmetric Functions. CoRR (2017)
Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh
Upper bounds on Fourier entropy. Theor. Comput. Sci. 654 (2016)
Samir Datta, Raghav Kulkarni, Anish Mukherjee
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. MFCS (2016)
Raghav Kulkarni, Supartha Podder
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. STACS (2016)
Raghav Kulkarni, Rameshwar Pratap
Similarity preserving compressions of high dimensional sparse data. CoRR (2016)
Raghav Kulkarni, Avishay Tal
On Fractional Block Sensitivity. Chic. J. Theor. Comput. Sci. 2016 (2016)
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. MFCS (2016)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. CoRR (2015)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
Any monotone property of 3-uniform hypergraphs is weakly evasive. Theor. Comput. Sci. 588 (2015)
Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh
Upper Bounds on Fourier Entropy. COCOON (2015)
Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena
Demystifying incentives in the consensus computer. IACR Cryptol. ePrint Arch. 2015 (2015)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
On the Power of Parity Queries in Boolean Decision Trees. TAMC (2015)
Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena
Demystifying Incentives in the Consensus Computer. CCS (2015)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. ICALP (2) (2015)
Raghav Kulkarni, Supartha Podder
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. CoRR (2015)
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
Graph properties in node-query setting: effect of breaking symmetry. CoRR (2015)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) (2014)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive. Electron. Colloquium Comput. Complex. 21 (2014)
Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. MFCS (2) (2014)
Samir Datta, William Hesse, Raghav Kulkarni
Dynamic Complexity of Directed Reachability and Other Problems. ICALP (1) (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the complexity of trial and error for constraint satisfaction problems. Electron. Colloquium Comput. Complex. 21 (2014)
Samir Datta, Raghav Kulkarni
Space Complexity of Optimization Problems in Planar Graphs. TAMC (2014)
Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR (2014)
Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. CSR (2014)
Raghav Kulkarni, Avishay Tal
On Fractional Block Sensitivity. Electron. Colloquium Comput. Complex. 20 (2013)
Raghav Kulkarni
Gems in decision tree complexity revisited. SIGACT News 44 (3) (2013)
Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh
Upper Bounds on Fourier Entropy. Electron. Colloquium Comput. Complex. 20 (2013)
Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. Electron. Colloquium Comput. Complex. 20 (2013)
Samir Datta, Raghav Kulkarni
Space complexity: what makes planar graphs special? Bull. EATCS 109 (2013)
Raghav Kulkarni, Miklos Santha
Query Complexity of Matroids. CIAC (2013)
Raghav Kulkarni, Youming Qiao, Xiaoming Sun
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. TAMC (2013)
Raghav Kulkarni
Evasiveness through a circuit lens. ITCS (2013)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78 (3) (2012)
Raghav Kulkarni, Miklos Santha
Query complexity of matroids. Electron. Colloquium Comput. Complex. 19 (2012)
Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari
Improved Bounds for Bipartite Matching on Surfaces. STACS (2012)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS (2011)
Pooya Hatami, Raghav Kulkarni, Denis Pankratov
Variations on the Sensitivity Conjecture. Theory Comput. 4 (2011)
Raghav Kulkarni
On the Power of Isolation in Planar Graphs. ACM Trans. Comput. Theory 3 (1) (2011)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. 17 (2010)
László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik
Evasiveness and the Distribution of Prime Numbers CoRR (2010)
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
Planarity, Determinants, Permanents, and (Unique) Matchings. ACM Trans. Comput. Theory 1 (3) (2010)
Pooya Hatami, Raghav Kulkarni, Denis Pankratov
Variations on the Sensitivity Conjecture CoRR (2010)
László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik
Evasiveness and the Distribution of Prime Numbers. STACS (2010)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47 (3) (2010)
Samir Datta, Raghav Kulkarni, Raghunath Tewari
Perfect Matching in Bipartite Planar Graphs is in UL. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR (2010)
Raghav Kulkarni
On the Power of Isolation in Planar Structures. Electron. Colloquium Comput. Complex. 16 (2009)
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
Space-Efficient Counting in Graphs on Surfaces. Comput. Complex. 18 (4) (2009)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS (2008)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR (2008)
Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan
Some perfect matchings and perfect half-integral matchings in NC. Chic. J. Theor. Comput. Sci. 2008 (2008)
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
Planarity, Determinants, Permanents, and (Unique) Matchings. CSR (2007)
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
Parity Problems in Planar Graphs. Computational Complexity Conference (2007)
Mark Braverman, Raghav Kulkarni, Sambuddha Roy
Parity Problems in Planar Graphs. Electron. Colloquium Comput. Complex. 14 (035) (2007)
Raghav Kulkarni
Is Small. CIAC (2006)
Raghav Kulkarni, Meena Mahajan
Seeking a Vertex of the Planar Matching Polytope in NC. ESA (2004)