default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaghav Kulkarni
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c34]Rameshwar Pratap
, Raghav Kulkarni:
Minwise-Independent Permutations with Insertion and Deletion of Features. SISAP 2023: 171-184- [i25]Rameshwar Pratap, Raghav Kulkarni:
Minwise-Independent Permutations with Insertion and Deletion of Features. CoRR abs/2308.11240 (2023) - 2022
- [i24]Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni:
Improving \textit{Tug-of-War} sketch using Control-Variates method. CoRR abs/2203.02432 (2022) - 2021
- [c33]Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni:
Improving Tug-of-War sketch using Control-Variates method. ACDA 2021: 66-76 - [c32]Rameshwar Pratap, Suryakant Bhardwaj, Hrushikesh Sudam Sarode, Raghav Kulkarni:
Feature Hashing with Insertion and Deletion of Features. IEEE BigData 2021: 888-898 - [c31]Rameshwar Pratap, Raghav Kulkarni:
Variance reduction in frequency estimators via control variates method. UAI 2021: 183-193 - 2020
- [c30]Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni:
Randomness Efficient Feature Hashing for Sparse Binary Data. ACML 2020: 689-704 - [c29]Rameshwar Pratap, Karthik Revanuru, Anirudh Ravi, Raghav Kulkarni:
Efficient Compression Algorithm for Multimedia Data. BigMM 2020: 245-250
2010 – 2019
- 2019
- [c28]Mate Soos, Raghav Kulkarni, Kuldeep S. Meel:
CrystalBall: Gazing in the Black Box of SAT Solving. SAT 2019: 371-387 - 2018
- [j14]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability Is in DynFO. J. ACM 65(5): 33:1-33:24 (2018) - [j13]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the complexity of trial and error for constraint satisfaction problems. J. Comput. Syst. Sci. 92: 48-64 (2018) - [c27]Rameshwar Pratap, Raghav Kulkarni, Ishan Sohony:
Efficient Dimensionality Reduction for Sparse Binary Data. IEEE BigData 2018: 152-157 - [c26]Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee:
Shortest k-Disjoint Paths via Determinants. FSTTCS 2018: 19:1-19:21 - [c25]Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee:
Planar Maximum Matching: Towards a Parallel Algorithm. ISAAC 2018: 21:1-21:13 - [c24]Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni:
Efficient Compression Technique for Sparse Sets. PAKDD (3) 2018: 164-176 - [i23]Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee:
Shortest k-Disjoint Paths via Determinants. CoRR abs/1802.01338 (2018) - 2017
- [i22]Anil Ada, Omar Fawzi, Raghav Kulkarni:
On the Spectral Properties of Symmetric Functions. CoRR abs/1704.03176 (2017) - [i21]Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni:
Efficient Compression Technique for Sparse Sets. CoRR abs/1708.04799 (2017) - 2016
- [j12]Raghav Kulkarni, Avishay Tal:
On Fractional Block Sensitivity. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j11]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper bounds on Fourier entropy. Theor. Comput. Sci. 654: 92-112 (2016) - [c23]Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder:
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. MFCS 2016: 17:1-17:14 - [c22]Samir Datta, Raghav Kulkarni, Anish Mukherjee:
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. MFCS 2016: 28:1-28:12 - [c21]Raghav Kulkarni, Supartha Podder:
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. STACS 2016: 48:1-48:13 - [i20]Raghav Kulkarni, Rameshwar Pratap:
Similarity preserving compressions of high dimensional sparse data. CoRR abs/1612.06057 (2016) - 2015
- [j10]Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
Any monotone property of 3-uniform hypergraphs is weakly evasive. Theor. Comput. Sci. 588: 16-23 (2015) - [c20]Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena:
Demystifying Incentives in the Consensus Computer. CCS 2015: 706-719 - [c19]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. COCOON 2015: 771-782 - [c18]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. ICALP (2) 2015: 159-170 - [c17]Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
On the Power of Parity Queries in Boolean Decision Trees. TAMC 2015: 99-109 - [i19]Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume:
Reachability is in DynFO. CoRR abs/1502.07467 (2015) - [i18]Raghav Kulkarni, Supartha Podder:
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism. CoRR abs/1509.06361 (2015) - [i17]Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder:
Graph properties in node-query setting: effect of breaking symmetry. CoRR abs/1510.08267 (2015) - [i16]Loi Luu, Jason Teutsch, Raghav Kulkarni, Prateek Saxena:
Demystifying incentives in the consensus computer. IACR Cryptol. ePrint Arch. 2015: 702 (2015) - 2014
- [c16]Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni:
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. CSR 2014: 97-110 - [c15]Samir Datta, William Hesse, Raghav Kulkarni:
Dynamic Complexity of Directed Reachability and Other Problems. ICALP (1) 2014: 356-367 - [c14]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the Complexity of Trial and Error for Constraint Satisfaction Problems. ICALP (1) 2014: 663-675 - [c13]Thomas Decker, Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha:
An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group. MFCS (2) 2014: 226-238 - [c12]Samir Datta, Raghav Kulkarni:
Space Complexity of Optimization Problems in Planar Graphs. TAMC 2014: 300-311 - [i15]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the Complexity of Trial and Error for Constraint Satisfaction Problems. CoRR abs/1406.5336 (2014) - [i14]Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram:
On the complexity of trial and error for constraint satisfaction problems. Electron. Colloquium Comput. Complex. TR14 (2014) - [i13]Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j9]Samir Datta, Raghav Kulkarni:
Space complexity: what makes planar graphs special? Bull. EATCS 109: 35-53 (2013) - [j8]Raghav Kulkarni:
Gems in decision tree complexity revisited. SIGACT News 44(3): 42-55 (2013) - [c11]Raghav Kulkarni, Miklos Santha:
Query Complexity of Matroids. CIAC 2013: 300-311 - [c10]Raghav Kulkarni:
Evasiveness through a circuit lens. ITCS 2013: 139-144 - [c9]Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive. TAMC 2013: 224-235 - [i12]Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni:
Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. Electron. Colloquium Comput. Complex. TR13 (2013) - [i11]Sourav Chakraborty, Raghav Kulkarni, Satyanarayana V. Lokam, Nitin Saurabh:
Upper Bounds on Fourier Entropy. Electron. Colloquium Comput. Complex. TR13 (2013) - [i10]Raghav Kulkarni, Avishay Tal:
On Fractional Block Sensitivity. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [j7]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78(3): 765-779 (2012) - [c8]Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari:
Improved Bounds for Bipartite Matching on Surfaces. STACS 2012: 254-265 - [i9]Raghav Kulkarni, Miklos Santha:
Query complexity of matroids. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j6]Pooya Hatami, Raghav Kulkarni, Denis Pankratov:
Variations on the Sensitivity Conjecture. Theory Comput. 4: 1-27 (2011) - [j5]Raghav Kulkarni:
On the Power of Isolation in Planar Graphs. ACM Trans. Comput. Theory 3(1): 2:1-2:12 (2011) - [c7]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590 - 2010
- [j4]Samir Datta, Raghav Kulkarni, Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47(3): 737-757 (2010) - [j3]Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings. ACM Trans. Comput. Theory 1(3): 10:1-10:20 (2010) - [c6]László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik:
Evasiveness and the Distribution of Prime Numbers. STACS 2010: 71-82 - [i8]László Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik:
Evasiveness and the Distribution of Prime Numbers. CoRR abs/1001.4829 (2010) - [i7]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. CoRR abs/1004.5080 (2010) - [i6]Pooya Hatami, Raghav Kulkarni, Denis Pankratov:
Variations on the Sensitivity Conjecture. CoRR abs/1011.0354 (2010) - [i5]Samir Datta, Raghav Kulkarni, Raghunath Tewari:
Perfect Matching in Bipartite Planar Graphs is in UL. Electron. Colloquium Comput. Complex. TR10 (2010) - [i4]Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran:
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j2]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Space-Efficient Counting in Graphs on Surfaces. Comput. Complex. 18(4): 601-649 (2009) - [i3]Raghav Kulkarni:
On the Power of Isolation in Planar Structures. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j1]Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan:
Some perfect matchings and perfect half-integral matchings in NC. Chic. J. Theor. Comput. Sci. 2008 (2008) - [c5]Samir Datta, Raghav Kulkarni, Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240 - [i2]Samir Datta, Raghav Kulkarni, Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. CoRR abs/0802.2850 (2008) - 2007
- [c4]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Parity Problems in Planar Graphs. CCC 2007: 222-235 - [c3]Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126 - [i1]Mark Braverman, Raghav Kulkarni, Sambuddha Roy:
Parity Problems in Planar Graphs. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c2]Raghav Kulkarni:
A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. CIAC 2006: 308-319 - 2004
- [c1]Raghav Kulkarni, Meena Mahajan:
Seeking a Vertex of the Planar Matching Polytope in NC. ESA 2004: 472-483
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
