Raghav Kulkarni

73 papers A* 1A 10B 4C 6Misc 3Journal 39Unranked 10

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