Raghav Kulkarni

According to our database, Raghav Kulkarni authored at least 46 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Minwise-Independent Permutations with Insertion and Deletion of Features.

Rameshwar Pratap, Raghav Kulkarni

Proceedings of the Similarity Search and Applications - 16th International Conference, 2023

2022

Improving \textit{Tug-of-War} sketch using Control-Variates method.

Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni

CoRR, 2022

2021

Variance reduction in frequency estimators via control variates method.

Rameshwar Pratap, Raghav Kulkarni

Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Feature Hashing with Insertion and Deletion of Features.

Rameshwar Pratap, Suryakant Bhardwaj, Hrushikesh Sudam Sarode, Raghav Kulkarni

Proceedings of the 2021 IEEE International Conference on Big Data (Big Data), 2021

Improving <i>Tug-of-War</i> sketch using Control-Variates method.

Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni

Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020

Efficient Compression Algorithm for Multimedia Data.

Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni

Proceedings of the 6th IEEE International Conference on Multimedia Big Data, 2020

Randomness Efficient Feature Hashing for Sparse Binary Data.

Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni

Proceedings of The 12th Asian Conference on Machine Learning, 2020

2019

CrystalBall: Gazing in the Black Box of SAT Solving.

Mate Soos, Raghav Kulkarni, Kuldeep S. Meel

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

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

Reachability Is in DynFO.

Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume

J. ACM, 2018

Efficient Compression Technique for Sparse Sets.

Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2018

Planar Maximum Matching: Towards a Parallel Algorithm.

Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

Shortest k-Disjoint Paths via Determinants.

Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee

Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2018

Efficient Dimensionality Reduction for Sparse Binary Data.

Rameshwar Pratap, Raghav Kulkarni, Ishan Sohony

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2017

On the Spectral Properties of Symmetric Functions.

Anil Ada, Omar Fawzi, Raghav Kulkarni

CoRR, 2017

2016

Upper bounds on Fourier entropy.

Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh

Theor. Comput. Sci., 2016

Similarity preserving compressions of high dimensional sparse data.

Raghav Kulkarni, Rameshwar Pratap

CoRR, 2016

On Fractional Block Sensitivity.

Raghav Kulkarni, Avishay Tal

Chic. J. Theor. Comput. Sci., 2016

Quantum Query Complexity of Subgraph Isomorphism and Homomorphism.

Raghav Kulkarni, Supartha Podder

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs.

Samir Datta, Raghav Kulkarni, Anish Mukherjee

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Graph Properties in Node-Query Setting: Effect of Breaking Symmetry.

Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Any monotone property of 3-uniform hypergraphs is weakly evasive.

Raghav Kulkarni, Youming Qiao, Xiaoming Sun

Theor. Comput. Sci., 2015

Demystifying incentives in the consensus computer.

Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena

IACR Cryptol. ePrint Arch., 2015

On the Power of Parity Queries in Boolean Decision Trees.

Raghav Kulkarni, Youming Qiao, Xiaoming Sun

Proceedings of the Theory and Applications of Models of Computation, 2015

2014

Space Complexity of Optimization Problems in Planar Graphs.

Samir Datta, Raghav Kulkarni

Proceedings of the Theory and Applications of Models of Computation, 2014

An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group.

Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Dynamic Complexity of Directed Reachability and Other Problems.

Samir Datta, William Hesse, Raghav Kulkarni

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Gems in decision tree complexity revisited.

Raghav Kulkarni

SIGACT News, 2013

Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees.

Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni

Electron. Colloquium Comput. Complex., 2013

Space complexity: what makes planar graphs special?

Samir Datta, Raghav Kulkarni

Bull. EATCS, 2013

Evasiveness through a circuit lens.

Raghav Kulkarni

Proceedings of the Innovations in Theoretical Computer Science, 2013

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

Query complexity of matroids.

Raghav Kulkarni, Miklos Santha

Electron. Colloquium Comput. Complex., 2012

Improved Bounds for Bipartite Matching on Surfaces.

Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

On the Power of Isolation in Planar Graphs.

Raghav Kulkarni

ACM Trans. Comput. Theory, 2011

Variations on the Sensitivity Conjecture.

Pooya Hatami, Raghav Kulkarni, Denis Pankratov

Theory Comput., 2011

2010

Planarity, Determinants, Permanents, and (Unique) Matchings.

Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan

ACM Trans. Comput. Theory, 2010

Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.

Samir Datta, Raghav Kulkarni, Sambuddha Roy

Theory Comput. Syst., 2010

Perfect Matching in Bipartite Planar Graphs is in UL.

Samir Datta, Raghav Kulkarni, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2010

Evasiveness and the Distribution of Prime Numbers.

László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik

Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

2009

On the Power of Isolation in Planar Structures.

Raghav Kulkarni

Electron. Colloquium Comput. Complex., 2009

Space-Efficient Counting in Graphs on Surfaces.

Mark Braverman, Raghav Kulkarni, Sambuddha Roy

Comput. Complex., 2009

2008

Some perfect matchings and perfect half-integral matchings in NC.

Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan

Chic. J. Theor. Comput. Sci., 2008

2007

Parity Problems in Planar Graphs.

Mark Braverman, Raghav Kulkarni, Sambuddha Roy

Electron. Colloquium Comput. Complex., 2007

2006

A New NC-Algorithm for Finding a Perfect Matching in <i>d</i>-Regular Bipartite Graphs When <i>d</i> Is Small.

Raghav Kulkarni

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2004

Seeking a Vertex of the Planar Matching Polytope in NC.

Raghav Kulkarni, Meena Mahajan

Proceedings of the Algorithms, 2004