Raghav Kulkarni

Available identifiers

zbMath Open kulkarni.raghavMaRDI QIDQ344774

List of research outcomes

Publication	Date of Publication	Type
Planar Maximum Matching: Towards a Parallel Algorithm	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5090955	2022-07-21	Paper
CrystalBall: gazing in the black box of SAT solving	2020-05-20	Paper
Reachability is in DynFO	2019-02-25	Paper
Space complexity: what makes planar graphs special?	2018-09-04	Paper
Space-efficient approximation scheme for maximum matching in sparse graphs	2018-03-21	Paper
Graph properties in node-query setting: effect of breaking symmetry	2018-03-21	Paper
Quantum query complexity of subgraph isomorphism and homomorphism	2018-01-24	Paper
On the complexity of trial and error for constraint satisfaction problems	2017-11-14	Paper
Evasiveness through a circuit lens (extended abstract)	2017-05-16	Paper
On the Spectral Properties of Symmetric Functions	2017-04-11	Paper
Upper bounds on Fourier entropy	2016-11-24	Paper
On fractional block sensitivity	2016-08-16	Paper
Reachability is in DynFO	2015-11-04	Paper
Upper bounds on Fourier entropy	2015-10-29	Paper
On the power of parity queries in Boolean decision trees	2015-09-30	Paper
Planarity, determinants, permanents, and (unique) matchings	2015-09-24	Paper
On the power of isolation in planar graphs	2015-09-24	Paper
Any monotone property of 3-uniform hypergraphs is weakly evasive	2015-06-11	Paper
An efficient quantum algorithm for finding hidden parabolic subgroups in the general linear group	2014-10-14	Paper
On the complexity of trial and error for constraint satisfaction problems	2014-07-01	Paper
Dynamic complexity of directed reachability and other problems	2014-07-01	Paper
Property testing bounds for linear and quadratic functions via parity decision trees	2014-06-24	Paper
Some perfect matchings and perfect half-integral matchings in NC	2014-05-06	Paper
Space complexity of optimization problems in planar graphs	2014-04-16	Paper
Query complexity of matroids	2013-06-07	Paper
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive	2013-05-28	Paper
Deterministically isolating a perfect matching in bipartite planar graphs	2013-03-19	Paper
Improved bounds for bipartite matching on surfaces	2012-08-23	Paper
Space complexity of perfect matching in bounded genus bipartite graphs	2012-08-17	Paper
Evasiveness and the distribution of prime numbers	2012-01-23	Paper
Space complexity of perfect matching in bounded genus bipartite graphs	2012-01-23	Paper
Space-efficient counting in graphs on surfaces	2011-02-18	Paper
Deterministically isolating a perfect matching in bipartite planar graphs	2010-10-06	Paper
Planarity, Determinants, Permanents, and (Unique) Matchings	2008-06-03	Paper
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small	2007-05-02	Paper
Algorithms – ESA 2004	2005-08-18	Paper

Research outcomes over time

This page was built for person: Raghav Kulkarni