Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Raghav Kulkarni
@inproceedings{DBLP:conf/sisap/PratapK23,
author = {Rameshwar Pratap and
Raghav Kulkarni},
editor = {Oscar Pedreira and
Vladimir Estivill{-}Castro},
title = {Minwise-Independent Permutations with Insertion and Deletion of Features},
booktitle = {Similarity Search and Applications - 16th International Conference,
{SISAP} 2023, {A} Coru{\~{n}}a, Spain, October 9-11, 2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {14289},
pages = {171--184},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-46994-7\_15},
doi = {10.1007/978-3-031-46994-7\_15},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sisap/PratapK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-11240,
author = {Rameshwar Pratap and
Raghav Kulkarni},
title = {Minwise-Independent Permutations with Insertion and Deletion of Features},
journal = {CoRR},
volume = {abs/2308.11240},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.11240},
doi = {10.48550/ARXIV.2308.11240},
eprinttype = {arXiv},
eprint = {2308.11240},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-11240.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-02432,
author = {Rameshwar Pratap and
Bhisham Dev Verma and
Raghav Kulkarni},
title = {Improving {\textbackslash}textit\{Tug-of-War\} sketch using Control-Variates
method},
journal = {CoRR},
volume = {abs/2203.02432},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.02432},
doi = {10.48550/ARXIV.2203.02432},
eprinttype = {arXiv},
eprint = {2203.02432},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-02432.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acda/PratapVK21,
author = {Rameshwar Pratap and
Bhisham Dev Verma and
Raghav Kulkarni},
editor = {Michael Bender and
John Gilbert and
Bruce Hendrickson and
Blair D. Sullivan},
title = {Improving \emph{Tug-of-War} sketch using Control-Variates method},
booktitle = {Proceedings of the 2021 {SIAM} Conference on Applied and Computational
Discrete Algorithms, {ACDA} 2021, Virtual Conference, July 19-21,
2021},
pages = {66--76},
publisher = {{SIAM}},
year = {2021},
url = {https://doi.org/10.1137/1.9781611976830.7},
doi = {10.1137/1.9781611976830.7},
timestamp = {Wed, 03 Nov 2021 11:57:03 +0100},
biburl = {https://dblp.org/rec/conf/acda/PratapVK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/PratapBSK21,
author = {Rameshwar Pratap and
Suryakant Bhardwaj and
Hrushikesh Sudam Sarode and
Raghav Kulkarni},
editor = {Yixin Chen and
Heiko Ludwig and
Yicheng Tu and
Usama M. Fayyad and
Xingquan Zhu and
Xiaohua Hu and
Suren Byna and
Xiong Liu and
Jianping Zhang and
Shirui Pan and
Vagelis Papalexakis and
Jianwu Wang and
Alfredo Cuzzocrea and
Carlos Ordonez},
title = {Feature Hashing with Insertion and Deletion of Features},
booktitle = {2021 {IEEE} International Conference on Big Data (Big Data), Orlando,
FL, USA, December 15-18, 2021},
pages = {888--898},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/BigData52589.2021.9672011},
doi = {10.1109/BIGDATA52589.2021.9672011},
timestamp = {Fri, 13 Jan 2023 17:06:49 +0100},
biburl = {https://dblp.org/rec/conf/bigdataconf/PratapBSK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/PratapK21,
author = {Rameshwar Pratap and
Raghav Kulkarni},
editor = {Cassio P. de Campos and
Marloes H. Maathuis and
Erik Quaeghebeur},
title = {Variance reduction in frequency estimators via control variates method},
booktitle = {Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial
Intelligence, {UAI} 2021, Virtual Event, 27-30 July 2021},
series = {Proceedings of Machine Learning Research},
volume = {161},
pages = {183--193},
publisher = {{AUAI} Press},
year = {2021},
url = {https://proceedings.mlr.press/v161/pratap21a.html},
timestamp = {Fri, 17 Dec 2021 17:06:27 +0100},
biburl = {https://dblp.org/rec/conf/uai/PratapK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acml/PratapRRK20,
author = {Rameshwar Pratap and
Karthik Revanuru and
Anirudh Ravi and
Raghav Kulkarni},
editor = {Sinno Jialin Pan and
Masashi Sugiyama},
title = {Randomness Efficient Feature Hashing for Sparse Binary Data},
booktitle = {Proceedings of The 12th Asian Conference on Machine Learning, {ACML}
2020, 18-20 November 2020, Bangkok, Thailand},
series = {Proceedings of Machine Learning Research},
volume = {129},
pages = {689--704},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v129/pratap20a.html},
timestamp = {Fri, 11 Dec 2020 11:11:05 +0100},
biburl = {https://dblp.org/rec/conf/acml/PratapRRK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigmm/PratapRAK20,
author = {Rameshwar Pratap and
Karthik Revanuru and
Anirudh Ravi and
Raghav Kulkarni},
title = {Efficient Compression Algorithm for Multimedia Data},
booktitle = {6th {IEEE} International Conference on Multimedia Big Data, BigMM
2020, New Delhi, India, September 24-26, 2020},
pages = {245--250},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/BigMM50055.2020.00042},
doi = {10.1109/BIGMM50055.2020.00042},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bigmm/PratapRAK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SoosKM19,
author = {Mate Soos and
Raghav Kulkarni and
Kuldeep S. Meel},
editor = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce},
title = {CrystalBall: Gazing in the Black Box of {SAT} Solving},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11628},
pages = {371--387},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24258-9\_26},
doi = {10.1007/978-3-030-24258-9\_26},
timestamp = {Wed, 10 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SoosKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DattaKMSZ18,
author = {Samir Datta and
Raghav Kulkarni and
Anish Mukherjee and
Thomas Schwentick and
Thomas Zeume},
title = {Reachability Is in DynFO},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {33:1--33:24},
year = {2018},
url = {https://doi.org/10.1145/3212685},
doi = {10.1145/3212685},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DattaKMSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/IvanyosKQSS18,
author = {G{\'{a}}bor Ivanyos and
Raghav Kulkarni and
Youming Qiao and
Miklos Santha and
Aarthi Sundaram},
title = {On the complexity of trial and error for constraint satisfaction problems},
journal = {J. Comput. Syst. Sci.},
volume = {92},
pages = {48--64},
year = {2018},
url = {https://doi.org/10.1016/j.jcss.2017.07.005},
doi = {10.1016/J.JCSS.2017.07.005},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/IvanyosKQSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/PratapKS18,
author = {Rameshwar Pratap and
Raghav Kulkarni and
Ishan Sohony},
editor = {Naoki Abe and
Huan Liu and
Calton Pu and
Xiaohua Hu and
Nesreen K. Ahmed and
Mu Qiao and
Yang Song and
Donald Kossmann and
Bing Liu and
Kisung Lee and
Jiliang Tang and
Jingrui He and
Jeffrey S. Saltz},
title = {Efficient Dimensionality Reduction for Sparse Binary Data},
booktitle = {{IEEE} International Conference on Big Data {(IEEE} BigData 2018),
Seattle, WA, USA, December 10-13, 2018},
pages = {152--157},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/BigData.2018.8622338},
doi = {10.1109/BIGDATA.2018.8622338},
timestamp = {Fri, 19 Nov 2021 16:08:20 +0100},
biburl = {https://dblp.org/rec/conf/bigdataconf/PratapKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DattaIK018,
author = {Samir Datta and
Siddharth Iyer and
Raghav Kulkarni and
Anish Mukherjee},
editor = {Sumit Ganguly and
Paritosh K. Pandya},
title = {Shortest k-Disjoint Paths via Determinants},
booktitle = {38th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2018, December 11-13, 2018,
Ahmedabad, India},
series = {LIPIcs},
volume = {122},
pages = {19:1--19:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.19},
doi = {10.4230/LIPICS.FSTTCS.2018.19},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DattaIK018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DattaKK018,
author = {Samir Datta and
Raghav Kulkarni and
Ashish Kumar and
Anish Mukherjee},
editor = {Wen{-}Lian Hsu and
Der{-}Tsai Lee and
Chung{-}Shou Liao},
title = {Planar Maximum Matching: Towards a Parallel Algorithm},
booktitle = {29th International Symposium on Algorithms and Computation, {ISAAC}
2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan},
series = {LIPIcs},
volume = {123},
pages = {21:1--21:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2018.21},
doi = {10.4230/LIPICS.ISAAC.2018.21},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DattaKK018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pakdd/PratapSK18,
author = {Rameshwar Pratap and
Ishan Sohony and
Raghav Kulkarni},
editor = {Dinh Q. Phung and
Vincent S. Tseng and
Geoffrey I. Webb and
Bao Ho and
Mohadeseh Ganji and
Lida Rashidi},
title = {Efficient Compression Technique for Sparse Sets},
booktitle = {Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia
Conference, {PAKDD} 2018, Melbourne, VIC, Australia, June 3-6, 2018,
Proceedings, Part {III}},
series = {Lecture Notes in Computer Science},
volume = {10939},
pages = {164--176},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-93040-4\_14},
doi = {10.1007/978-3-319-93040-4\_14},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pakdd/PratapSK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-01338,
author = {Samir Datta and
Siddharth Iyer and
Raghav Kulkarni and
Anish Mukherjee},
title = {Shortest k-Disjoint Paths via Determinants},
journal = {CoRR},
volume = {abs/1802.01338},
year = {2018},
url = {http://arxiv.org/abs/1802.01338},
eprinttype = {arXiv},
eprint = {1802.01338},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-01338.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AdaFK17,
author = {Anil Ada and
Omar Fawzi and
Raghav Kulkarni},
title = {On the Spectral Properties of Symmetric Functions},
journal = {CoRR},
volume = {abs/1704.03176},
year = {2017},
url = {http://arxiv.org/abs/1704.03176},
eprinttype = {arXiv},
eprint = {1704.03176},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AdaFK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-04799,
author = {Rameshwar Pratap and
Ishan Sohony and
Raghav Kulkarni},
title = {Efficient Compression Technique for Sparse Sets},
journal = {CoRR},
volume = {abs/1708.04799},
year = {2017},
url = {http://arxiv.org/abs/1708.04799},
eprinttype = {arXiv},
eprint = {1708.04799},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-04799.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/KulkarniT16,
author = {Raghav Kulkarni and
Avishay Tal},
title = {On Fractional Block Sensitivity},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2016},
year = {2016},
url = {http://cjtcs.cs.uchicago.edu/articles/2016/8/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/KulkarniT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ChakrabortyKLS16,
author = {Sourav Chakraborty and
Raghav Kulkarni and
Satyanarayana V. Lokam and
Nitin Saurabh},
title = {Upper bounds on Fourier entropy},
journal = {Theor. Comput. Sci.},
volume = {654},
pages = {92--112},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.05.006},
doi = {10.1016/J.TCS.2016.05.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ChakrabortyKLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BalajiDKP16,
author = {Nikhil Balaji and
Samir Datta and
Raghav Kulkarni and
Supartha Podder},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Graph Properties in Node-Query Setting: Effect of Breaking Symmetry},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {17:1--17:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.17},
doi = {10.4230/LIPICS.MFCS.2016.17},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BalajiDKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DattaK016,
author = {Samir Datta and
Raghav Kulkarni and
Anish Mukherjee},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Space-Efficient Approximation Scheme for Maximum Matching in Sparse
Graphs},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {28:1--28:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.28},
doi = {10.4230/LIPICS.MFCS.2016.28},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DattaK016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KulkarniP16,
author = {Raghav Kulkarni and
Supartha Podder},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Quantum Query Complexity of Subgraph Isomorphism and Homomorphism},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {48:1--48:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.48},
doi = {10.4230/LIPICS.STACS.2016.48},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KulkarniP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KulkarniP16,
author = {Raghav Kulkarni and
Rameshwar Pratap},
title = {Similarity preserving compressions of high dimensional sparse data},
journal = {CoRR},
volume = {abs/1612.06057},
year = {2016},
url = {http://arxiv.org/abs/1612.06057},
eprinttype = {arXiv},
eprint = {1612.06057},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KulkarniP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KulkarniQS15,
author = {Raghav Kulkarni and
Youming Qiao and
Xiaoming Sun},
title = {Any monotone property of 3-uniform hypergraphs is weakly evasive},
journal = {Theor. Comput. Sci.},
volume = {588},
pages = {16--23},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.11.012},
doi = {10.1016/J.TCS.2014.11.012},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/KulkarniQS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ccs/LuuTKS15,
author = {Loi Luu and
Jason Teutsch and
Raghav Kulkarni and
Prateek Saxena},
editor = {Indrajit Ray and
Ninghui Li and
Christopher Kruegel},
title = {Demystifying Incentives in the Consensus Computer},
booktitle = {Proceedings of the 22nd {ACM} {SIGSAC} Conference on Computer and
Communications Security, Denver, CO, USA, October 12-16, 2015},
pages = {706--719},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2810103.2813659},
doi = {10.1145/2810103.2813659},
timestamp = {Tue, 10 Nov 2020 19:58:09 +0100},
biburl = {https://dblp.org/rec/conf/ccs/LuuTKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/0001KLS15,
author = {Sourav Chakraborty and
Raghav Kulkarni and
Satyanarayana V. Lokam and
Nitin Saurabh},
editor = {Dachuan Xu and
Donglei Du and
Ding{-}Zhu Du},
title = {Upper Bounds on Fourier Entropy},
booktitle = {Computing and Combinatorics - 21st International Conference, {COCOON}
2015, Beijing, China, August 4-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9198},
pages = {771--782},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21398-9\_60},
doi = {10.1007/978-3-319-21398-9\_60},
timestamp = {Sun, 25 Oct 2020 22:58:52 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/0001KLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DattaKMSZ15,
author = {Samir Datta and
Raghav Kulkarni and
Anish Mukherjee and
Thomas Schwentick and
Thomas Zeume},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Reachability is in DynFO},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9135},
pages = {159--170},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47666-6\_13},
doi = {10.1007/978-3-662-47666-6\_13},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DattaKMSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/KulkarniQS15,
author = {Raghav Kulkarni and
Youming Qiao and
Xiaoming Sun},
editor = {Rahul Jain and
Sanjay Jain and
Frank Stephan},
title = {On the Power of Parity Queries in Boolean Decision Trees},
booktitle = {Theory and Applications of Models of Computation - 12th Annual Conference,
{TAMC} 2015, Singapore, May 18-20, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9076},
pages = {99--109},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-17142-5\_10},
doi = {10.1007/978-3-319-17142-5\_10},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/KulkarniQS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DattaKMSZ15,
author = {Samir Datta and
Raghav Kulkarni and
Anish Mukherjee and
Thomas Schwentick and
Thomas Zeume},
title = {Reachability is in DynFO},
journal = {CoRR},
volume = {abs/1502.07467},
year = {2015},
url = {http://arxiv.org/abs/1502.07467},
eprinttype = {arXiv},
eprint = {1502.07467},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DattaKMSZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KulkarniP15,
author = {Raghav Kulkarni and
Supartha Podder},
title = {Quantum Query Complexity of Subgraph Isomorphism and Homomorphism},
journal = {CoRR},
volume = {abs/1509.06361},
year = {2015},
url = {http://arxiv.org/abs/1509.06361},
eprinttype = {arXiv},
eprint = {1509.06361},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KulkarniP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalajiDKP15,
author = {Nikhil Balaji and
Samir Datta and
Raghav Kulkarni and
Supartha Podder},
title = {Graph properties in node-query setting: effect of breaking symmetry},
journal = {CoRR},
volume = {abs/1510.08267},
year = {2015},
url = {http://arxiv.org/abs/1510.08267},
eprinttype = {arXiv},
eprint = {1510.08267},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalajiDKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/LuuTKS15,
author = {Loi Luu and
Jason Teutsch and
Raghav Kulkarni and
Prateek Saxena},
title = {Demystifying incentives in the consensus computer},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {702},
year = {2015},
url = {http://eprint.iacr.org/2015/702},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/LuuTKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BhrushundiCK14,
author = {Abhishek Bhrushundi and
Sourav Chakraborty and
Raghav Kulkarni},
editor = {Edward A. Hirsch and
Sergei O. Kuznetsov and
Jean{-}{\'{E}}ric Pin and
Nikolay K. Vereshchagin},
title = {Property Testing Bounds for Linear and Quadratic Functions via Parity
Decision Trees},
booktitle = {Computer Science - Theory and Applications - 9th International Computer
Science Symposium in Russia, {CSR} 2014, Moscow, Russia, June 7-11,
2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8476},
pages = {97--110},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06686-8\_8},
doi = {10.1007/978-3-319-06686-8\_8},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/BhrushundiCK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DattaHK14,
author = {Samir Datta and
William Hesse and
Raghav Kulkarni},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {Dynamic Complexity of Directed Reachability and Other Problems},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {356--367},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_30},
doi = {10.1007/978-3-662-43948-7\_30},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DattaHK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/IvanyosKQSS14,
author = {G{\'{a}}bor Ivanyos and
Raghav Kulkarni and
Youming Qiao and
Miklos Santha and
Aarthi Sundaram},
editor = {Javier Esparza and
Pierre Fraigniaud and
Thore Husfeldt and
Elias Koutsoupias},
title = {On the Complexity of Trial and Error for Constraint Satisfaction Problems},
booktitle = {Automata, Languages, and Programming - 41st International Colloquium,
{ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {8572},
pages = {663--675},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-43948-7\_55},
doi = {10.1007/978-3-662-43948-7\_55},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/IvanyosKQSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DeckerIKQS14,
author = {Thomas Decker and
G{\'{a}}bor Ivanyos and
Raghav Kulkarni and
Youming Qiao and
Miklos Santha},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups
in the General Linear Group},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {226--238},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_20},
doi = {10.1007/978-3-662-44465-8\_20},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DeckerIKQS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/DattaK14,
author = {Samir Datta and
Raghav Kulkarni},
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {Space Complexity of Optimization Problems in Planar Graphs},
booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
pages = {300--311},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7\_21},
doi = {10.1007/978-3-319-06089-7\_21},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/DattaK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/IvanyosKQSS14,
author = {G{\'{a}}bor Ivanyos and
Raghav Kulkarni and
Youming Qiao and
Miklos Santha and
Aarthi Sundaram},
title = {On the Complexity of Trial and Error for Constraint Satisfaction Problems},
journal = {CoRR},
volume = {abs/1406.5336},
year = {2014},
url = {http://arxiv.org/abs/1406.5336},
eprinttype = {arXiv},
eprint = {1406.5336},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/IvanyosKQSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/IvanyosKQSS14,
author = {G{\'{a}}bor Ivanyos and
Raghav Kulkarni and
Youming Qiao and
Miklos Santha and
Aarthi Sundaram},
title = {On the complexity of trial and error for constraint satisfaction problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-034}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/034},
eprinttype = {ECCC},
eprint = {TR14-034},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/IvanyosKQSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KulkarniQS14,
author = {Raghav Kulkarni and
Youming Qiao and
Xiaoming Sun},
title = {Any Monotone Property of 3-uniform Hypergraphs is Weakly Evasive},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-061}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/061},
eprinttype = {ECCC},
eprint = {TR14-061},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KulkarniQS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/DattaK13,
author = {Samir Datta and
Raghav Kulkarni},
title = {Space complexity: what makes planar graphs special?},
journal = {Bull. {EATCS}},
volume = {109},
pages = {35--53},
year = {2013},
url = {http://eatcs.org/beatcs/index.php/beatcs/article/view/26},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/DattaK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Kulkarni13,
author = {Raghav Kulkarni},
title = {Gems in decision tree complexity revisited},
journal = {{SIGACT} News},
volume = {44},
number = {3},
pages = {42--55},
year = {2013},
url = {https://doi.org/10.1145/2527748.2527763},
doi = {10.1145/2527748.2527763},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Kulkarni13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/KulkarniS13,
author = {Raghav Kulkarni and
Miklos Santha},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Query Complexity of Matroids},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {300--311},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_25},
doi = {10.1007/978-3-642-38233-8\_25},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/KulkarniS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Kulkarni13,
author = {Raghav Kulkarni},
editor = {Robert D. Kleinberg},
title = {Evasiveness through a circuit lens},
booktitle = {Innovations in Theoretical Computer Science, {ITCS} '13, Berkeley,
CA, USA, January 9-12, 2013},
pages = {139--144},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2422436.2422454},
doi = {10.1145/2422436.2422454},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Kulkarni13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/KulkarniQS13,
author = {Raghav Kulkarni and
Youming Qiao and
Xiaoming Sun},
editor = {T.{-}H. Hubert Chan and
Lap Chi Lau and
Luca Trevisan},
title = {Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive},
booktitle = {Theory and Applications of Models of Computation, 10th International
Conference, {TAMC} 2013, Hong Kong, China, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7876},
pages = {224--235},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38236-9\_21},
doi = {10.1007/978-3-642-38236-9\_21},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/KulkarniQS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BhrushundiCK13,
author = {Abhishek Bhrushundi and
Sourav Chakraborty and
Raghav Kulkarni},
title = {Property Testing Bounds for Linear and Quadratic Functions via Parity
Decision Trees},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-142}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/142},
eprinttype = {ECCC},
eprint = {TR13-142},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BhrushundiCK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabortyKLS13,
author = {Sourav Chakraborty and
Raghav Kulkarni and
Satyanarayana V. Lokam and
Nitin Saurabh},
title = {Upper Bounds on Fourier Entropy},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-052}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/052},
eprinttype = {ECCC},
eprint = {TR13-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabortyKLS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KulkarniT13,
author = {Raghav Kulkarni and
Avishay Tal},
title = {On Fractional Block Sensitivity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-168}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/168},
eprinttype = {ECCC},
eprint = {TR13-168},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KulkarniT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DattaKTV12,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Space complexity of perfect matching in bounded genus bipartite graphs},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {3},
pages = {765--779},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.11.002},
doi = {10.1016/J.JCSS.2011.11.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DattaKTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DattaGKT12,
author = {Samir Datta and
Arjun Gopalan and
Raghav Kulkarni and
Raghunath Tewari},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Improved Bounds for Bipartite Matching on Surfaces},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {254--265},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.254},
doi = {10.4230/LIPICS.STACS.2012.254},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DattaGKT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KulkarniS12,
author = {Raghav Kulkarni and
Miklos Santha},
title = {Query complexity of matroids},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-063}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/063},
eprinttype = {ECCC},
eprint = {TR12-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KulkarniS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/HatamiKP11,
author = {Pooya Hatami and
Raghav Kulkarni and
Denis Pankratov},
title = {Variations on the Sensitivity Conjecture},
journal = {Theory Comput.},
volume = {4},
pages = {1--27},
year = {2011},
url = {https://doi.org/10.4086/toc.gs.2011.004},
doi = {10.4086/TOC.GS.2011.004},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/HatamiKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/Kulkarni11,
author = {Raghav Kulkarni},
title = {On the Power of Isolation in Planar Graphs},
journal = {{ACM} Trans. Comput. Theory},
volume = {3},
number = {1},
pages = {2:1--2:12},
year = {2011},
url = {https://doi.org/10.1145/2003685.2003687},
doi = {10.1145/2003685.2003687},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/Kulkarni11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DattaKTV11,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. Variyam Vinodchandran},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {579--590},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.579},
doi = {10.4230/LIPICS.STACS.2011.579},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DattaKTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DattaKR10,
author = {Samir Datta and
Raghav Kulkarni and
Sambuddha Roy},
title = {Deterministically Isolating a Perfect Matching in Bipartite Planar
Graphs},
journal = {Theory Comput. Syst.},
volume = {47},
number = {3},
pages = {737--757},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9204-8},
doi = {10.1007/S00224-009-9204-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DattaKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DattaKLM10,
author = {Samir Datta and
Raghav Kulkarni and
Nutan Limaye and
Meena Mahajan},
title = {Planarity, Determinants, Permanents, and (Unique) Matchings},
journal = {{ACM} Trans. Comput. Theory},
volume = {1},
number = {3},
pages = {10:1--10:20},
year = {2010},
url = {https://doi.org/10.1145/1714450.1714453},
doi = {10.1145/1714450.1714453},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/DattaKLM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BabaiBKN10,
author = {L{\'{a}}szl{\'{o}} Babai and
Anandam Banerjee and
Raghav Kulkarni and
Vipul Naik},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Evasiveness and the Distribution of Prime Numbers},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {71--82},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2445},
doi = {10.4230/LIPICS.STACS.2010.2445},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BabaiBKN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-4829,
author = {L{\'{a}}szl{\'{o}} Babai and
Anandam Banerjee and
Raghav Kulkarni and
Vipul Naik},
title = {Evasiveness and the Distribution of Prime Numbers},
journal = {CoRR},
volume = {abs/1001.4829},
year = {2010},
url = {http://arxiv.org/abs/1001.4829},
eprinttype = {arXiv},
eprint = {1001.4829},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-4829.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-5080,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs},
journal = {CoRR},
volume = {abs/1004.5080},
year = {2010},
url = {http://arxiv.org/abs/1004.5080},
eprinttype = {arXiv},
eprint = {1004.5080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-5080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-0354,
author = {Pooya Hatami and
Raghav Kulkarni and
Denis Pankratov},
title = {Variations on the Sensitivity Conjecture},
journal = {CoRR},
volume = {abs/1011.0354},
year = {2010},
url = {http://arxiv.org/abs/1011.0354},
eprinttype = {arXiv},
eprint = {1011.0354},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-0354.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DattaKT10,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari},
title = {Perfect Matching in Bipartite Planar Graphs is in {UL}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-201}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/201},
eprinttype = {ECCC},
eprint = {TR10-201},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaKT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DattaKTV10,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-079}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/079},
eprinttype = {ECCC},
eprint = {TR10-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaKTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BravermanKR09,
author = {Mark Braverman and
Raghav Kulkarni and
Sambuddha Roy},
title = {Space-Efficient Counting in Graphs on Surfaces},
journal = {Comput. Complex.},
volume = {18},
number = {4},
pages = {601--649},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0266-4},
doi = {10.1007/S00037-009-0266-4},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BravermanKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Kulkarni09,
author = {Raghav Kulkarni},
title = {On the Power of Isolation in Planar Structures},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-024}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/024},
eprinttype = {ECCC},
eprint = {TR09-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Kulkarni09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/KulkarniMV08,
author = {Raghav Kulkarni and
Meena Mahajan and
Kasturi R. Varadarajan},
title = {Some perfect matchings and perfect half-integral matchings in {NC}},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2008},
year = {2008},
url = {http://cjtcs.cs.uchicago.edu/articles/2008/4/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/KulkarniMV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DattaKR08,
author = {Samir Datta and
Raghav Kulkarni and
Sambuddha Roy},
editor = {Susanne Albers and
Pascal Weil},
title = {Deterministically Isolating a Perfect Matching in Bipartite Planar
Graphs},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {229--240},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1346},
doi = {10.4230/LIPICS.STACS.2008.1346},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DattaKR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2850,
author = {Samir Datta and
Raghav Kulkarni and
Sambuddha Roy},
title = {Deterministically Isolating a Perfect Matching in Bipartite Planar
Graphs},
journal = {CoRR},
volume = {abs/0802.2850},
year = {2008},
url = {http://arxiv.org/abs/0802.2850},
eprinttype = {arXiv},
eprint = {0802.2850},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2850.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BravermanKR07,
author = {Mark Braverman and
Raghav Kulkarni and
Sambuddha Roy},
title = {Parity Problems in Planar Graphs},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {222--235},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.23},
doi = {10.1109/CCC.2007.23},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BravermanKR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/DattaKLM07,
author = {Samir Datta and
Raghav Kulkarni and
Nutan Limaye and
Meena Mahajan},
editor = {Volker Diekert and
Mikhail V. Volkov and
Andrei Voronkov},
title = {Planarity, Determinants, Permanents, and (Unique) Matchings},
booktitle = {Computer Science - Theory and Applications, Second International Symposium
on Computer Science in Russia, {CSR} 2007, Ekaterinburg, Russia, September
3-7, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4649},
pages = {115--126},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74510-5\_14},
doi = {10.1007/978-3-540-74510-5\_14},
timestamp = {Thu, 09 Nov 2023 20:20:35 +0100},
biburl = {https://dblp.org/rec/conf/csr/DattaKLM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BravermanKR07,
author = {Mark Braverman and
Raghav Kulkarni and
Sambuddha Roy},
title = {Parity Problems in Planar Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-035}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-035/index.html},
eprinttype = {ECCC},
eprint = {TR07-035},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BravermanKR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Kulkarni06,
author = {Raghav Kulkarni},
editor = {Tiziana Calamoneri and
Irene Finocchi and
Giuseppe F. Italiano},
title = {A New NC-Algorithm for Finding a Perfect Matching in \emph{d}-Regular
Bipartite Graphs When \emph{d} Is Small},
booktitle = {Algorithms and Complexity, 6th Italian Conference, {CIAC} 2006, Rome,
Italy, May 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3998},
pages = {308--319},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11758471\_30},
doi = {10.1007/11758471\_30},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Kulkarni06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KulkarniM04,
author = {Raghav Kulkarni and
Meena Mahajan},
editor = {Susanne Albers and
Tomasz Radzik},
title = {Seeking a Vertex of the Planar Matching Polytope in {NC}},
booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3221},
pages = {472--483},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30140-0\_43},
doi = {10.1007/978-3-540-30140-0\_43},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/KulkarniM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-11-10 23:58 CET 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:
