Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "Abhranil Chatterjee"
download as .bib file
@inproceedings{DBLP:conf/innovations/00010V24,
author = {Abhranil Chatterjee and
Mrinal Kumar and
Ben Lee Volk},
editor = {Venkatesan Guruswami},
title = {Determinants vs. Algebraic Branching Programs},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {27:1--27:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.27},
doi = {10.4230/LIPICS.ITCS.2024.27},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/00010V24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Arvind0M24,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
editor = {Bojan Mohar and
Igor Shinkar and
Ryan O'Donnell},
title = {Black-Box Identity Testing of Noncommutative Rational Formulas in
Deterministic Quasipolynomial Time},
booktitle = {Proceedings of the 56th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2024, Vancouver, BC, Canada, June 24-28, 2024},
pages = {106--117},
publisher = {{ACM}},
year = {2024},
url = {https://doi.org/10.1145/3618260.3649693},
doi = {10.1145/3618260.3649693},
timestamp = {Tue, 18 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Arvind0M24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2404-07986,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
title = {Trading Determinism for Noncommutativity in Edmonds' Problem},
journal = {CoRR},
volume = {abs/2404.07986},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.07986},
doi = {10.48550/ARXIV.2404.07986},
eprinttype = {arXiv},
eprint = {2404.07986},
timestamp = {Thu, 16 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-07986.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Arvind0M24,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
title = {Trading Determinism for Noncommutativity in Edmonds' Problem},
journal = {Electron. Colloquium Comput. Complex.},
pages = {TR24--073},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/073},
timestamp = {Wed, 05 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Arvind0M24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001GGR23,
author = {Abhranil Chatterjee and
Sumanta Ghosh and
Rohit Gurjar and
Roshan Raj},
editor = {Amnon Ta{-}Shma},
title = {Border Complexity of Symbolic Determinant Under Rank One Restriction},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {2:1--2:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.2},
doi = {10.4230/LIPICS.CCC.2023.2},
timestamp = {Mon, 10 Jul 2023 17:09:42 +0200},
biburl = {https://dblp.org/rec/conf/coco/0001GGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Arvind0GMR23,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Utsab Ghosal and
Partha Mukhopadhyay and
C. Ramya},
editor = {Yael Tauman Kalai},
title = {On Identity Testing and Noncommutative Rank Computation over the Free
Skew Field},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {6:1--6:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.6},
doi = {10.4230/LIPICS.ITCS.2023.6},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Arvind0GMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-09973,
author = {Abhranil Chatterjee and
Sumanta Ghosh and
Rohit Gurjar and
Roshan Raj},
title = {Border Complexity of Symbolic Determinant under Rank One Restriction},
journal = {CoRR},
volume = {abs/2305.09973},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.09973},
doi = {10.48550/ARXIV.2305.09973},
eprinttype = {arXiv},
eprint = {2305.09973},
timestamp = {Fri, 26 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-09973.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-09984,
author = {Abhranil Chatterjee and
Partha Mukhopadhyay},
title = {The Noncommutative Edmonds' Problem Re-visited},
journal = {CoRR},
volume = {abs/2305.09984},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.09984},
doi = {10.48550/ARXIV.2305.09984},
eprinttype = {arXiv},
eprint = {2305.09984},
timestamp = {Wed, 24 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-09984.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-04599,
author = {Abhranil Chatterjee and
Mrinal Kumar and
Ben Lee Volk},
title = {Determinants vs. Algebraic Branching Programs},
journal = {CoRR},
volume = {abs/2308.04599},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.04599},
doi = {10.48550/ARXIV.2308.04599},
eprinttype = {arXiv},
eprint = {2308.04599},
timestamp = {Tue, 29 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-04599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-04854,
author = {Vikraman Arvind and
Abhranil Chatterjee},
title = {On Lifting Lower Bounds for Noncommutative Circuits using Automata},
journal = {CoRR},
volume = {abs/2308.04854},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.04854},
doi = {10.48550/ARXIV.2308.04854},
eprinttype = {arXiv},
eprint = {2308.04854},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-04854.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-15647,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
title = {Black-Box Identity Testing of Noncommutative Rational Formulas in
Deterministic Quasipolynomial Time},
journal = {CoRR},
volume = {abs/2309.15647},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.15647},
doi = {10.48550/ARXIV.2309.15647},
eprinttype = {arXiv},
eprint = {2309.15647},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-15647.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/00010V23,
author = {Abhranil Chatterjee and
Mrinal Kumar and
Ben Lee Volk},
title = {Determinants vs. Algebraic Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-115}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/115},
eprinttype = {ECCC},
eprint = {TR23-115},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/00010V23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001GGR23,
author = {Abhranil Chatterjee and
Sumanta Ghosh and
Rohit Gurjar and
Roshan Raj},
title = {Border Complexity of Symbolic Determinant under Rank One Restriction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-075}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/075},
eprinttype = {ECCC},
eprint = {TR23-075},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001GGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Arvind023,
author = {Vikraman Arvind and
Abhranil Chatterjee},
title = {On Lifting Lower Bounds for Noncommutative Circuits using Automata},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-122}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/122},
eprinttype = {ECCC},
eprint = {TR23-122},
timestamp = {Wed, 30 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Arvind023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Arvind0M23,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
title = {Black-Box Identity Testing of Noncommutative Rational Formulas in
Deterministic Quasipolynomial Time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-147}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/147},
eprinttype = {ECCC},
eprint = {TR23-147},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Arvind0M23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ArvindCDM22,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Fast Exact Algorithms Using Hadamard Product of Polynomials},
journal = {Algorithmica},
volume = {84},
number = {2},
pages = {436--463},
year = {2022},
url = {https://doi.org/10.1007/s00453-021-00900-0},
doi = {10.1007/S00453-021-00900-0},
timestamp = {Wed, 23 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/ArvindCDM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ArvindCDM22,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Univariate Ideal Membership Parameterized by Rank, Degree, and Number
of Generators},
journal = {Theory Comput. Syst.},
volume = {66},
number = {1},
pages = {56--88},
year = {2022},
url = {https://doi.org/10.1007/s00224-021-10053-w},
doi = {10.1007/S00224-021-10053-W},
timestamp = {Tue, 01 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ArvindCDM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ArvindCM22,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
editor = {Amit Chakrabarti and
Chaitanya Swamy},
title = {Black-Box Identity Testing of Noncommutative Rational Formulas of
Inversion Height Two in Deterministic Quasipolynomial Time},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University
of Illinois, Urbana-Champaign, {USA} (Virtual Conference)},
series = {LIPIcs},
volume = {245},
pages = {23:1--23:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.23},
doi = {10.4230/LIPICS.APPROX/RANDOM.2022.23},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/approx/ArvindCM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-05693,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
title = {Black-box Identity Testing of Noncommutative Rational Formulas of
Inversion Height Two in Deterministic Quasipolynomial-time},
journal = {CoRR},
volume = {abs/2202.05693},
year = {2022},
url = {https://arxiv.org/abs/2202.05693},
eprinttype = {arXiv},
eprint = {2202.05693},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-05693.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-04797,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Utsab Ghosal and
Partha Mukhopadhyay and
C. Ramya},
title = {On Identity Testing and Noncommutative Rank Computation over the Free
Skew Field},
journal = {CoRR},
volume = {abs/2209.04797},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.04797},
doi = {10.48550/ARXIV.2209.04797},
eprinttype = {arXiv},
eprint = {2209.04797},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-04797.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Arvind0M22,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Partha Mukhopadhyay},
title = {Black-box Identity Testing of Noncommutative Rational Formulas of
Inversion Height Two in Deterministic Quasipolynomial-time},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-067}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/067},
eprinttype = {ECCC},
eprint = {TR22-067},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Arvind0M22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Arvind0DM21,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Equivalence Testing of Weighted Automata over Partially Commutative
Monoids},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {10:1--10:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.10},
doi = {10.4230/LIPICS.MFCS.2021.10},
timestamp = {Wed, 25 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Arvind0DM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/ArvindCDM20,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {On Explicit Branching Programs for the Rectangular Determinant and
Permanent Polynomials},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2020},
year = {2020},
url = {http://cjtcs.cs.uchicago.edu/articles/2020/2/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/ArvindCDM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Arvind0DM20,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {A Special Case of Rational Identity Testing and the Bre{\v{s}}ar-Klep
Theorem},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {10:1--10:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.10},
doi = {10.4230/LIPICS.MFCS.2020.10},
timestamp = {Mon, 21 Dec 2020 13:23:22 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/Arvind0DM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-08633,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Multiplicity Equivalence Testing of Automata over Partially Commutative
Monoids},
journal = {CoRR},
volume = {abs/2002.08633},
year = {2020},
url = {https://arxiv.org/abs/2002.08633},
eprinttype = {arXiv},
eprint = {2002.08633},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-08633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Arvind0DM19,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
editor = {Dimitris Achlioptas and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Efficient Black-Box Identity Testing for Free Group Algebras},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts
Institute of Technology, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {145},
pages = {57:1--57:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.57},
doi = {10.4230/LIPICS.APPROX-RANDOM.2019.57},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Arvind0DM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Arvind0DM19,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
editor = {Arkadev Chattopadhyay and
Paul Gastin},
title = {Fast Exact Algorithms Using Hadamard Product of Polynomials},
booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
Bombay, India},
series = {LIPIcs},
volume = {150},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.9},
doi = {10.4230/LIPICS.FSTTCS.2019.9},
timestamp = {Thu, 05 Dec 2019 15:12:21 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Arvind0DM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Arvind0DM19,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
editor = {Pinyan Lu and
Guochuan Zhang},
title = {On Explicit Branching Programs for the Rectangular Determinant and
Permanent Polynomials},
booktitle = {30th International Symposium on Algorithms and Computation, {ISAAC}
2019, December 8-11, 2019, Shanghai University of Finance and Economics,
Shanghai, China},
series = {LIPIcs},
volume = {149},
pages = {38:1--38:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2019.38},
doi = {10.4230/LIPICS.ISAAC.2019.38},
timestamp = {Thu, 28 Nov 2019 15:51:42 +0100},
biburl = {https://dblp.org/rec/conf/isaac/Arvind0DM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-12337,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Efficient Black-Box Identity Testing over Free Group Algebra},
journal = {CoRR},
volume = {abs/1904.12337},
year = {2019},
url = {http://arxiv.org/abs/1904.12337},
eprinttype = {arXiv},
eprint = {1904.12337},
timestamp = {Thu, 02 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-12337.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1908-08347,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {On Explicit Branching Programs for the Rectangular Determinant and
Permanent Polynomials},
journal = {CoRR},
volume = {abs/1908.08347},
year = {2019},
url = {http://arxiv.org/abs/1908.08347},
eprinttype = {arXiv},
eprint = {1908.08347},
timestamp = {Mon, 26 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1908-08347.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArvindCDM19,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Efficient Black-Box Identity Testing for Free Group Algebra},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-063}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/063},
eprinttype = {ECCC},
eprint = {TR19-063},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArvindCDM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Arvind0DM18,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
editor = {Sumit Ganguly and
Paritosh K. Pandya},
title = {Univariate Ideal Membership Parameterized by Rank, Degree, and Number
of Generators},
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 = {7:1--7:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2018.7},
doi = {10.4230/LIPICS.FSTTCS.2018.7},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Arvind0DM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-06692,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {A Note on Polynomial Identity Testing for Depth-3 Circuits},
journal = {CoRR},
volume = {abs/1805.06692},
year = {2018},
url = {http://arxiv.org/abs/1805.06692},
eprinttype = {arXiv},
eprint = {1805.06692},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1805-06692.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-04496,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Fast Exact Algorithms Using Hadamard Product of Polynomials},
journal = {CoRR},
volume = {abs/1807.04496},
year = {2018},
url = {http://arxiv.org/abs/1807.04496},
eprinttype = {arXiv},
eprint = {1807.04496},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-04496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10787,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Univariate Ideal Membership Parameterized by Rank, Degree, and Number
of Generators},
journal = {CoRR},
volume = {abs/1808.10787},
year = {2018},
url = {http://arxiv.org/abs/1808.10787},
eprinttype = {arXiv},
eprint = {1808.10787},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10787.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ArvindCDM18,
author = {Vikraman Arvind and
Abhranil Chatterjee and
Rajit Datta and
Partha Mukhopadhyay},
title = {Beating Brute Force for Polynomial Identity Testing of General Depth-3
Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-111}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/111},
eprinttype = {ECCC},
eprint = {TR18-111},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ArvindCDM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gis/ChatterjeeARGS16,
author = {Abhranil Chatterjee and
Janit Anjaria and
Sourav Roy and
Arnab Ganguli and
Krishanu Seal},
editor = {Siva Ravada and
Mohammed Eunus Ali and
Shawn D. Newsam and
Matthias Renz and
Goce Trajcevski},
title = {{SAGEL:} smart address geocoding engine for supply-chain logistics},
booktitle = {Proceedings of the 24th {ACM} {SIGSPATIAL} International Conference
on Advances in Geographic Information Systems, {GIS} 2016, Burlingame,
California, USA, October 31 - November 3, 2016},
pages = {42:1--42:10},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2996913.2996917},
doi = {10.1145/2996913.2996917},
timestamp = {Tue, 06 Nov 2018 11:07:36 +0100},
biburl = {https://dblp.org/rec/conf/gis/ChatterjeeARGS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gir/BabuCKSG15,
author = {T. Ravindra Babu and
Abhranil Chatterjee and
Shivram Khandeparker and
A. Vamsi Subhash and
Sawan Gupta},
editor = {Ross S. Purves and
Christopher B. Jones},
title = {Geographical address classification without using geolocation coordinates},
booktitle = {Proceedings of the 9th Workshop on Geographic Information Retrieval,
{GIR} 2015, Paris, France, November 26-27, 2015},
pages = {8:1--8:10},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2837689.2837696},
doi = {10.1145/2837689.2837696},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/gir/BabuCKSG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/winet/ACB14,
author = {Prashanth L. A. and
Abhranil Chatterjee and
Shalabh Bhatnagar},
title = {Two timescale convergent Q-learning for sleep-scheduling in wireless
sensor networks},
journal = {Wirel. Networks},
volume = {20},
number = {8},
pages = {2589--2604},
year = {2014},
url = {https://doi.org/10.1007/s11276-014-0762-6},
doi = {10.1007/S11276-014-0762-6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/winet/ACB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/comsnets/ACB14,
author = {Prashanth L. A. and
Abhranil Chatterjee and
Shalabh Bhatnagar},
title = {Adaptive sleep-wake control using reinforcement learning in sensor
networks},
booktitle = {Sixth International Conference on Communication Systems and Networks,
{COMSNETS} 2014, Bangalore, India, January 6-10, 2014},
pages = {1--8},
publisher = {{IEEE}},
year = {2014},
url = {https://doi.org/10.1109/COMSNETS.2014.6734874},
doi = {10.1109/COMSNETS.2014.6734874},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/comsnets/ACB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ncvpripg/0003SCSA13,
author = {Abhranil Chatterjee and
Bijoy Sarkar and
Prateeksha Chandraghatgi and
Krishanu Seal and
Girish Ananthakrishnan},
editor = {Gaurav Harit and
Sukhendu Das},
title = {Search based Video Recommendations},
booktitle = {Fourth National Conference on Computer Vision, Pattern Recognition,
Image Processing and Graphics, {NCVPRIPG} 2013, Jodhpur, India, December
18-21, 2013},
pages = {1--5},
publisher = {{IEEE}},
year = {2013},
url = {https://doi.org/10.1109/NCVPRIPG.2013.6776190},
doi = {10.1109/NCVPRIPG.2013.6776190},
timestamp = {Mon, 09 Aug 2021 14:54:02 +0200},
biburl = {https://dblp.org/rec/conf/ncvpripg/0003SCSA13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AnanthapadmanabharaoCB13,
author = {Prashanth Lakshmanrao Ananthapadmanabharao and
Abhranil Chatterjee and
Shalabh Bhatnagar},
title = {Reinforcement Learning for Sleep-Wake Scheduling in Sensor Networks},
journal = {CoRR},
volume = {abs/1312.7292},
year = {2013},
url = {http://arxiv.org/abs/1312.7292},
eprinttype = {arXiv},
eprint = {1312.7292},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AnanthapadmanabharaoCB13.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.
retrieved on 2024-06-23 20:43 CEST from data curated 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:
