Demystifying incentives in the consensus computer L Luu, J Teutsch, R Kulkarni, P Saxena
Proceedings of the 22Nd acm sigsac conference on computer and communications …, 2015
320 2015 Variations on the sensitivity conjecture P Hatami, R Kulkarni, D Pankratov
arXiv preprint arXiv:1011.0354, 2010
96 2010 Deterministically isolating a perfect matching in bipartite planar graphs S Datta, R Kulkarni, S Roy
Theory of Computing Systems 47 (3), 737-757, 2010
57 2010 Reachability is in DynFO S Datta, R Kulkarni, A Mukherjee, T Schwentick, T Zeume
Journal of the ACM (JACM) 65 (5), 1-24, 2018
50 2018 On fractional block sensitivity R Kulkarni, A Tal
Chicago J. Theor. Comput. Sci 8, 1-16, 2016
40 2016 Space complexity of perfect matching in bounded genus bipartite graphs S Datta, R Kulkarni, R Tewari, NV Vinodchandran
Journal of Computer and System Sciences 78 (3), 765-779, 2012
26 2012 : gazing in the black box of SAT solving M Soos, R Kulkarni, KS Meel
International Conference on Theory and Applications of Satisfiability …, 2019
23 2019 Upper bounds on Fourier entropy S Chakraborty, R Kulkarni, SV Lokam, N Saurabh
Theoretical Computer Science 654, 92-112, 2016
22 2016 Query complexity of matroids R Kulkarni, M Santha
International Conference on Algorithms and Complexity, 300-311, 2013
22 2013 Planarity, determinants, permanents, and (unique) matchings S Datta, R Kulkarni, N Limaye, M Mahajan
ACM Transactions on Computation Theory (TOCT) 1 (3), 1-20, 2010
22 2010 Improved bounds for bipartite matching on surfaces S Datta, A Gopalan, R Kulkarni, R Tewari
29th International Symposium on Theoretical Aspects of Computer Science …, 2012
18 2012 Evasiveness and the distribution of prime numbers L Babai, A Banerjee, R Kulkarni, V Naik
arXiv preprint arXiv:1001.4829, 2010
17 2010 Shortest S Datta, S Iyer, R Kulkarni, A Mukherjee
arXiv preprint arXiv:1802.01338, 2018
15 2018 Dynamic complexity of directed reachability and other problems S Datta, W Hesse, R Kulkarni
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
15 2014 Some perfect matchings and perfect half-integral matchings in NC R Kulkarni, M Mahajan, KR Varadarajan
Chicago Journal of Theoretical Computer Science 4, 2008, 2008
15 2008 Property testing bounds for linear and quadratic functions via parity decision trees A Bhrushundi, S Chakraborty, R Kulkarni
Computer Science-Theory and Applications: 9th International Computer Science …, 2014
14 2014 Planarity, determinants, permanents, and (unique) matchings S Datta, R Kulkarni, N Limaye, M Mahajan
International Computer Science Symposium in Russia, 115-126, 2007
14 2007 On the power of isolation in planar graphs R Kulkarni
ACM Transactions on Computation Theory (TOCT) 3 (1), 1-12, 2011
12 2011 Space-efficient counting in graphs on surfaces M Braverman, R Kulkarni, S Roy
computational complexity 18, 601-649, 2009
12 2009 Evasiveness through a circuit lens R Kulkarni
Proceedings of the 4th conference on Innovations in Theoretical Computer …, 2013
11 2013 