Raghav Kulkarni

Available identifiers

zbMath Open kulkarni.raghavMaRDI QIDQ344774

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5090955	2022-07-21	Paper
Planar Maximum Matching: Towards a Parallel Algorithm	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
https://portal.mardi4nfdi.de/entity/Q4584898	2018-09-04	Paper
Graph properties in node-query setting: effect of breaking symmetry	2018-03-21	Paper
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs	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	2017-05-16	Paper
On the Spectral Properties of Symmetric Functions	2017-04-11	Paper
Upper bounds on Fourier entropy	2016-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q3187177	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
On the Power of Isolation in Planar Graphs	2015-09-24	Paper
Planarity, Determinants, Permanents, and (Unique) Matchings	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
Dynamic Complexity of Directed Reachability and Other Problems	2014-07-01	Paper
On the Complexity of Trial and Error for Constraint Satisfaction Problems	2014-07-01	Paper
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees	2014-06-24	Paper
https://portal.mardi4nfdi.de/entity/Q5414566	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
https://portal.mardi4nfdi.de/entity/Q4910722	2013-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q2904767	2012-08-23	Paper
Space complexity of perfect matching in bounded genus bipartite graphs	2012-08-17	Paper
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.	2012-01-23	Paper
Evasiveness and the Distribution of Prime Numbers	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

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Raghav Kulkarni