Publications

• Nikhil Balaji, Samir Datta, R. Kulkarni, S. Podder. (2016). Graph properties in node-query setting: effect of breaking symmetry. International Symposium MFCS
• Chakraborty, Sourav, R. Kulkarni, Lokam, Satyanarayana V., Saurabh, Nitin. (2015). Upper Bounds on Fourier Entropy. Computing and Combinatorics 9198
• R. Kulkarni, Y. Qiao, Sun, Xiaoming. (2015). On the Power of Parity Queries in Boolean Decision Trees. Theory and Applications of Models of Computation 9076
• T. Decker, G. Ivanyos, R. Kulkarni, Y. Qiao, M. Santha. (2014). An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group. International Symposium MFCS 226-238
• G. Ivanyos, R. Kulkarni, Y. Qiao, M. Santha, A. Sundaram. (2014). On the complexity of trial and error for constraint satisfaction problems. Proceedings of ICALP 663-675
• R. Kulkarni, M. Santha. (2013). Query complexity of matroids. CIAC 300-311
• R. Kulkarni, Y. Qiao, Xiaoming Sun. (2013). Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. Theory and Applications of Models of Computation 224-235