Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Samir Datta
@inproceedings{DBLP:conf/sosa/BalajiD24,
author = {Nikhil Balaji and
Samir Datta},
editor = {Merav Parter and
Seth Pettie},
title = {{USSR} is in P/poly},
booktitle = {2024 Symposium on Simplicity in Algorithms, {SOSA} 2024, Alexandria,
VA, USA, January 8-10, 2024},
pages = {151--159},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977936.15},
doi = {10.1137/1.9781611977936.15},
timestamp = {Wed, 10 Apr 2024 20:26:09 +0200},
biburl = {https://dblp.org/rec/conf/sosa/BalajiD24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/AllenderBDP23,
author = {Eric Allender and
Nikhil Balaji and
Samir Datta and
Rameshwar Pratap},
title = {On the complexity of algebraic numbers, and the bit-complexity of
straight-line programs},
journal = {Comput.},
volume = {12},
number = {2},
pages = {145--173},
year = {2023},
url = {https://doi.org/10.3233/COM-220407},
doi = {10.3233/COM-220407},
timestamp = {Mon, 17 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computability/AllenderBDP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DattaK023,
author = {Samir Datta and
Asif Khan and
Anish Mukherjee},
editor = {J{\'{e}}r{\^{o}}me Leroux and
Sylvain Lombardy and
David Peleg},
title = {Dynamic Planar Embedding Is in DynFO},
booktitle = {48th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2023, August 28 to September 1, 2023, Bordeaux, France},
series = {LIPIcs},
volume = {272},
pages = {39:1--39:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2023.39},
doi = {10.4230/LIPICS.MFCS.2023.39},
timestamp = {Mon, 28 Aug 2023 15:00:20 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DattaK023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-09473,
author = {Samir Datta and
Asif Khan and
Anish Mukherjee},
title = {Dynamic Planar Embedding is in DynFO},
journal = {CoRR},
volume = {abs/2307.09473},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2307.09473},
doi = {10.48550/ARXIV.2307.09473},
eprinttype = {arXiv},
eprint = {2307.09473},
timestamp = {Tue, 25 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2307-09473.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2308-10073,
author = {Vikraman Arvind and
Samir Datta and
Asif Khan and
Shivdutt Sharma and
Yadu Vasudev and
Shankar Ram Vasudevan},
title = {The Parallel Dynamic Complexity of the Abelian Cayley Group Membership
Problem},
journal = {CoRR},
volume = {abs/2308.10073},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2308.10073},
doi = {10.48550/ARXIV.2308.10073},
eprinttype = {arXiv},
eprint = {2308.10073},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2308-10073.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-19335,
author = {Nikhil Balaji and
Samir Datta},
title = {{USSR} is in P/poly},
journal = {CoRR},
volume = {abs/2310.19335},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.19335},
doi = {10.48550/ARXIV.2310.19335},
eprinttype = {arXiv},
eprint = {2310.19335},
timestamp = {Thu, 02 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-19335.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BalajiD23,
author = {Nikhil Balaji and
Samir Datta},
title = {{USSR} is in P/poly},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-163}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/163},
eprinttype = {ECCC},
eprint = {TR23-163},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/BalajiD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/AllenderCD22,
author = {Eric Allender and
Archit Chauhan and
Samir Datta},
title = {Depth-first search in directed planar graphs, revisited},
journal = {Acta Informatica},
volume = {59},
number = {4},
pages = {289--319},
year = {2022},
url = {https://doi.org/10.1007/s00236-022-00425-1},
doi = {10.1007/S00236-022-00425-1},
timestamp = {Sat, 10 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/AllenderCD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DattaLNTW22,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Planar Graph Isomorphism Is in Log-Space},
journal = {{ACM} Trans. Comput. Theory},
volume = {14},
number = {2},
pages = {8:1--8:33},
year = {2022},
url = {https://doi.org/10.1145/3543686},
doi = {10.1145/3543686},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/DattaLNTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Datta000ST22,
author = {Samir Datta and
Chetan Gupta and
Rahul Jain and
Anish Mukherjee and
Vimal Raj Sharma and
Raghunath Tewari},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Dynamic Meta-Theorems for Distance and Matching},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {118:1--118:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.118},
doi = {10.4230/LIPICS.ICALP.2022.118},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Datta000ST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderBDP22,
author = {Eric Allender and
Nikhil Balaji and
Samir Datta and
Rameshwar Pratap},
title = {On the Complexity of Algebraic Numbers, and the Bit-Complexity of
Straight-Line Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-053}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/053},
eprinttype = {ECCC},
eprint = {TR22-053},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderBDP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Datta022,
author = {Samir Datta and
Chetan Gupta},
title = {Evaluating Monotone Circuits on Surfaces},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-147}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/147},
eprinttype = {ECCC},
eprint = {TR22-147},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Datta022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/DattaTV21,
author = {Samir Datta and
Anuj Tawari and
Yadu Vasudev},
editor = {Rahul Santhanam and
Daniil Musatov},
title = {Dynamic Complexity of Expansion},
booktitle = {Computer Science - Theory and Applications - 16th International Computer
Science Symposium in Russia, {CSR} 2021, Sochi, Russia, June 28 -
July 2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12730},
pages = {56--77},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-79416-3\_4},
doi = {10.1007/978-3-030-79416-3\_4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/DattaTV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Datta000ST21,
author = {Samir Datta and
Chetan Gupta and
Rahul Jain and
Anish Mukherjee and
Vimal Raj Sharma and
Raghunath Tewari},
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {Reachability and Matching in Single Crossing Minor Free Graphs},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
pages = {16:1--16:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.16},
doi = {10.4230/LIPICS.FSTTCS.2021.16},
timestamp = {Tue, 30 Nov 2021 13:59:34 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/Datta000ST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AllenderCD21,
author = {Eric Allender and
Archit Chauhan and
Samir Datta},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Depth-First Search in Directed Planar Graphs, Revisited},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {7:1--7:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.7},
doi = {10.4230/LIPICS.MFCS.2021.7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AllenderCD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DattaJ21,
author = {Samir Datta and
Kishlaya Jaiswal},
editor = {Filippo Bonchi and
Simon J. Puglisi},
title = {Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint
Cycles},
booktitle = {46th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
series = {LIPIcs},
volume = {202},
pages = {36:1--36:22},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.36},
doi = {10.4230/LIPICS.MFCS.2021.36},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DattaJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-13940,
author = {Samir Datta and
Chetan Gupta and
Rahul Jain and
Anish Mukherjee and
Vimal Raj Sharma and
Raghunath Tewari},
title = {Reachability and Matching in Single Crossing Minor Free Graphs},
journal = {CoRR},
volume = {abs/2103.13940},
year = {2021},
url = {https://arxiv.org/abs/2103.13940},
eprinttype = {arXiv},
eprint = {2103.13940},
timestamp = {Wed, 07 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-13940.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-00714,
author = {Samir Datta and
Kishlaya Jaiswal},
title = {Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint
Cycles},
journal = {CoRR},
volume = {abs/2106.00714},
year = {2021},
url = {https://arxiv.org/abs/2106.00714},
eprinttype = {arXiv},
eprint = {2106.00714},
timestamp = {Wed, 09 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-00714.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-01875,
author = {Samir Datta and
Chetan Gupta and
Rahul Jain and
Anish Mukherjee and
Vimal Raj Sharma and
Raghunath Tewari},
title = {Dynamic Meta-theorems for Distance and Matching},
journal = {CoRR},
volume = {abs/2109.01875},
year = {2021},
url = {https://arxiv.org/abs/2109.01875},
eprinttype = {arXiv},
eprint = {2109.01875},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-01875.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Datta00ST20,
author = {Samir Datta and
Chetan Gupta and
Rahul Jain and
Vimal Raj Sharma and
Raghunath Tewari},
editor = {Henning Fernau},
title = {Randomized and Symmetric Catalytic Computation},
booktitle = {Computer Science - Theory and Applications - 15th International Computer
Science Symposium in Russia, {CSR} 2020, Yekaterinburg, Russia, June
29 - July 3, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12159},
pages = {211--223},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-50026-9\_15},
doi = {10.1007/978-3-030-50026-9\_15},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/Datta00ST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DattaK0TVZ20,
author = {Samir Datta and
Pankaj Kumar and
Anish Mukherjee and
Anuj Tawari and
Nils Vortmeier and
Thomas Zeume},
editor = {Artur Czumaj and
Anuj Dawar and
Emanuela Merelli},
title = {Dynamic Complexity of Reachability: How Many Changes Can We Handle?},
booktitle = {47th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2020, July 8-11, 2020, Saarbr{\"{u}}cken, Germany (Virtual
Conference)},
series = {LIPIcs},
volume = {168},
pages = {122:1--122:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2020.122},
doi = {10.4230/LIPICS.ICALP.2020.122},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DattaK0TVZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-12739,
author = {Samir Datta and
Pankaj Kumar and
Anish Mukherjee and
Anuj Tawari and
Nils Vortmeier and
Thomas Zeume},
title = {Dynamic complexity of Reachability: How many changes can we handle?},
journal = {CoRR},
volume = {abs/2004.12739},
year = {2020},
url = {https://arxiv.org/abs/2004.12739},
eprinttype = {arXiv},
eprint = {2004.12739},
timestamp = {Wed, 29 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-12739.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-05728,
author = {Samir Datta and
Anuj Tawari and
Yadu Vasudev},
title = {Dynamic Complexity of Expansion},
journal = {CoRR},
volume = {abs/2008.05728},
year = {2020},
url = {https://arxiv.org/abs/2008.05728},
eprinttype = {arXiv},
eprint = {2008.05728},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-05728.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderCD20,
author = {Eric Allender and
Archit Chauhan and
Samir Datta},
title = {Depth-First Search in Directed Graphs, Revisited},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-074}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/074},
eprinttype = {ECCC},
eprint = {TR20-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderCD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DattaGJST20,
author = {Samir Datta and
Chetan Gupta and
Rahul Jain and
Vimal Raj Sharma and
Raghunath Tewari},
title = {Randomized and Symmetric Catalytic Computation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-024}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/024},
eprinttype = {ECCC},
eprint = {TR20-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaGJST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/DattaMSVZ19,
author = {Samir Datta and
Anish Mukherjee and
Thomas Schwentick and
Nils Vortmeier and
Thomas Zeume},
title = {A Strategy for Dynamic Programs: Start over and Muddle through},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {2},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(2:12)2019},
doi = {10.23638/LMCS-15(2:12)2019},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/DattaMSVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderCDM19,
author = {Eric Allender and
Archit Chauhan and
Samir Datta and
Anish Mukherjee},
title = {Planarity, Exclusivity, and Unambiguity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-039}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/039},
eprinttype = {ECCC},
eprint = {TR19-039},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderCDM19.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}
}
@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/icalp/Datta0VZ18,
author = {Samir Datta and
Anish Mukherjee and
Nils Vortmeier and
Thomas Zeume},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Reachability and Distances under Multiple Changes},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {120:1--120:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.120},
doi = {10.4230/LIPICS.ICALP.2018.120},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Datta0VZ18.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}
}
@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/abs-1804-08555,
author = {Samir Datta and
Anish Mukherjee and
Nils Vortmeier and
Thomas Zeume},
title = {Reachability and Distances under Multiple Changes},
journal = {CoRR},
volume = {abs/1804.08555},
year = {2018},
url = {http://arxiv.org/abs/1804.08555},
eprinttype = {arXiv},
eprint = {1804.08555},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-08555.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Datta0SVZ17,
author = {Samir Datta and
Anish Mukherjee and
Thomas Schwentick and
Nils Vortmeier and
Thomas Zeume},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {A Strategy for Dynamic Programs: Start over and Muddle Through},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {98:1--98:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.98},
doi = {10.4230/LIPICS.ICALP.2017.98},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Datta0SVZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Datta0SVZ17,
author = {Samir Datta and
Anish Mukherjee and
Thomas Schwentick and
Nils Vortmeier and
Thomas Zeume},
title = {A Strategy for Dynamic Programs: Start over and Muddle through},
journal = {CoRR},
volume = {abs/1704.07998},
year = {2017},
url = {http://arxiv.org/abs/1704.07998},
eprinttype = {arXiv},
eprint = {1704.07998},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Datta0SVZ17.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/fsttcs/BalajiDG15,
author = {Nikhil Balaji and
Samir Datta and
Venkatesh Ganesan},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {Counting Euler Tours in Undirected Bounded Treewidth Graphs},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {246--260},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.246},
doi = {10.4230/LIPICS.FSTTCS.2015.246},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BalajiDG15.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/BalajiD15,
author = {Nikhil Balaji and
Samir Datta},
editor = {Rahul Jain and
Sanjay Jain and
Frank Stephan},
title = {Bounded Treewidth and Space-Efficient Linear Algebra},
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 = {297--308},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-17142-5\_26},
doi = {10.1007/978-3-319-17142-5\_26},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/BalajiD15.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/BalajiDG15,
author = {Nikhil Balaji and
Samir Datta and
Venkatesh Ganesan},
title = {Counting Euler Tours in Undirected Bounded Treewidth Graphs},
journal = {CoRR},
volume = {abs/1510.04035},
year = {2015},
url = {http://arxiv.org/abs/1510.04035},
eprinttype = {arXiv},
eprint = {1510.04035},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalajiDG15.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}
}
@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/mfcs/AllenderBD14,
author = {Eric Allender and
Nikhil Balaji and
Samir Datta},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight
Line Programs},
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 = {13--24},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_2},
doi = {10.1007/978-3-662-44465-8\_2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AllenderBD14.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}
}
@inproceedings{DBLP:conf/walcom/BalajiD14,
author = {Nikhil Balaji and
Samir Datta},
editor = {Sudebkumar Prasant Pal and
Kunihiko Sadakane},
title = {Collapsing Exact Arithmetic Hierarchies},
booktitle = {Algorithms and Computation - 8th International Workshop, {WALCOM}
2014, Chennai, India, February 13-15, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8344},
pages = {273--285},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04657-0\_26},
doi = {10.1007/978-3-319-04657-0\_26},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/BalajiD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalajiD14,
author = {Nikhil Balaji and
Samir Datta},
title = {Bounded Treewidth and Space-Efficient Linear Algebra},
journal = {CoRR},
volume = {abs/1412.2470},
year = {2014},
url = {http://arxiv.org/abs/1412.2470},
eprinttype = {arXiv},
eprint = {1412.2470},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalajiD14.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/mst/DasDN13,
author = {Bireswar Das and
Samir Datta and
Prajakta Nimbhorkar},
title = {Log-Space Algorithms for Paths and Matchings in k-Trees},
journal = {Theory Comput. Syst.},
volume = {53},
number = {4},
pages = {669--689},
year = {2013},
url = {https://doi.org/10.1007/s00224-013-9469-9},
doi = {10.1007/S00224-013-9469-9},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DasDN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeyersdorffDKMSSTV13,
author = {Olaf Beyersdorff and
Samir Datta and
Andreas Krebs and
Meena Mahajan and
Gido Scharfenberger{-}Fabian and
Karteek Sreenivasaiah and
Michael Thomas and
Heribert Vollmer},
title = {Verifying proofs in constant depth},
journal = {{ACM} Trans. Comput. Theory},
volume = {5},
number = {1},
pages = {2:1--2:23},
year = {2013},
url = {https://doi.org/10.1145/2462896.2462898},
doi = {10.1145/2462896.2462898},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BeyersdorffDKMSSTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BalajiD13,
author = {Nikhil Balaji and
Samir Datta},
title = {Tree-width and Logspace: Determinants and Counting Euler Tours},
journal = {CoRR},
volume = {abs/1312.7468},
year = {2013},
url = {http://arxiv.org/abs/1312.7468},
eprinttype = {arXiv},
eprint = {1312.7468},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BalajiD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderBD13,
author = {Eric Allender and
Nikhil Balaji and
Samir Datta},
title = {Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight
Line Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-177}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/177},
eprinttype = {ECCC},
eprint = {TR13-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AllenderBD13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BalajiD13,
author = {Nikhil Balaji and
Samir Datta},
title = {Collapsing Exact Arithmetic Hierarchies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-131}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/131},
eprinttype = {ECCC},
eprint = {TR13-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BalajiD13.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}
}
@article{DBLP:journals/tcs/DattaMRTV12,
author = {Samir Datta and
Meena Mahajan and
B. V. Raghavendra Rao and
Michael Thomas and
Heribert Vollmer},
title = {Counting classes and the fine structure between NC\({}^{\mbox{1}}\)
and {L}},
journal = {Theor. Comput. Sci.},
volume = {417},
pages = {36--49},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.05.050},
doi = {10.1016/J.TCS.2011.05.050},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DattaMRTV12.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}
}
@inproceedings{DBLP:conf/tamc/DattaP12,
author = {Samir Datta and
Rameshwar Pratap},
editor = {Manindra Agrawal and
S. Barry Cooper and
Angsheng Li},
title = {Computing Bits of Algebraic Numbers},
booktitle = {Theory and Applications of Models of Computation - 9th Annual Conference,
{TAMC} 2012, Beijing, China, May 16-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7287},
pages = {189--201},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29952-0\_22},
doi = {10.1007/978-3-642-29952-0\_22},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/DattaP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffDKMSSTV12,
author = {Olaf Beyersdorff and
Samir Datta and
Andreas Krebs and
Meena Mahajan and
Gido Scharfenberger{-}Fabian and
Karteek Sreenivasaiah and
Michael Thomas and
Heribert Vollmer},
title = {Verifying Proofs in Constant Depth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-079}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/079},
eprinttype = {ECCC},
eprint = {TR12-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffDKMSSTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeyersdorffDMSSTV11,
author = {Olaf Beyersdorff and
Samir Datta and
Meena Mahajan and
Gido Scharfenberger{-}Fabian and
Karteek Sreenivasaiah and
Michael Thomas and
Heribert Vollmer},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Verifying Proofs in Constant Depth},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {84--95},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_11},
doi = {10.1007/978-3-642-22993-0\_11},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeyersdorffDMSSTV11.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}
}
@inproceedings{DBLP:conf/tamc/DattaK11,
author = {Samir Datta and
Nagarajan Krishnamurthy},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {Some Tractable Win-Lose Games},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {365--376},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_36},
doi = {10.1007/978-3-642-20877-5\_36},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/DattaK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/DattaP11,
author = {Samir Datta and
Gautam Prakriya},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {Planarity Testing Revisited},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {540--551},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_52},
doi = {10.1007/978-3-642-20877-5\_52},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/DattaP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-2637,
author = {Samir Datta and
Gautam Prakriya},
title = {Planarity Testing Revisited},
journal = {CoRR},
volume = {abs/1101.2637},
year = {2011},
url = {http://arxiv.org/abs/1101.2637},
eprinttype = {arXiv},
eprint = {1101.2637},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1101-2637.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-4295,
author = {Samir Datta and
Rameshwar Pratap},
title = {Computing Bits of Algebraic Numbers},
journal = {CoRR},
volume = {abs/1112.4295},
year = {2011},
url = {http://arxiv.org/abs/1112.4295},
eprinttype = {arXiv},
eprint = {1112.4295},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1112-4295.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DattaP11,
author = {Samir Datta and
Gautam Prakriya},
title = {Planarity Testing Revisited},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-009}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/009},
eprinttype = {ECCC},
eprint = {TR11-009},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaP11.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/mfcs/DattaMRTV10,
author = {Samir Datta and
Meena Mahajan and
B. V. Raghavendra Rao and
Michael Thomas and
Heribert Vollmer},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Counting Classes and the Fine Structure between NC\({}^{\mbox{1}}\)
and {L}},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {306--317},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_28},
doi = {10.1007/978-3-642-15155-2\_28},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DattaMRTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DasDN10,
author = {Bireswar Das and
Samir Datta and
Prajakta Nimbhorkar},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Log-space Algorithms for Paths and Matchings in k-trees},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {215--226},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2456},
doi = {10.4230/LIPICS.STACS.2010.2456},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DasDN10.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-1010-5951,
author = {Samir Datta and
Nagarajan Krishnamurthy},
title = {Some Tractable Win-Lose Games},
journal = {CoRR},
volume = {abs/1010.5951},
year = {2010},
url = {http://arxiv.org/abs/1010.5951},
eprinttype = {arXiv},
eprint = {1010.5951},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-5951.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/eccc/DattaMRTV10,
author = {Samir Datta and
Meena Mahajan and
B. V. Raghavendra Rao and
Michael Thomas and
Heribert Vollmer},
title = {Counting Classes and the Fine Structure between NC\({}^{\mbox{1}}\)
and {L}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-101}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/101},
eprinttype = {ECCC},
eprint = {TR10-101},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaMRTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DattaNTW10,
author = {Samir Datta and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Graph Isomorphism for K\({}_{\mbox{3,3}}\)-free and K\({}_{\mbox{5}}\)-free
graphs is in Log-space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-050}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/050},
eprinttype = {ECCC},
eprint = {TR10-050},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaNTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AllenderBCDR09,
author = {Eric Allender and
David A. Mix Barrington and
Tanmoy Chakraborty and
Samir Datta and
Sambuddha Roy},
title = {Planar and Grid Graph Reachability Problems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {675--723},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9172-z},
doi = {10.1007/S00224-009-9172-Z},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AllenderBCDR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DattaLNTW09,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Planar Graph Isomorphism is in Log-Space},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {203--214},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.16},
doi = {10.1109/CCC.2009.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DattaLNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DattaNTW09,
author = {Samir Datta and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {Graph Isomorphism for K{\_}\{3, 3\}-free and K{\_}5-free graphs is
in Log-space},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},
series = {LIPIcs},
volume = {4},
pages = {145--156},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2314},
doi = {10.4230/LIPICS.FSTTCS.2009.2314},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DattaNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DattaLNTW09,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {Planar Graph Isomorphism is in Log-Space},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2416/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DattaLNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-4602,
author = {Bireswar Das and
Samir Datta and
Prajakta Nimbhorkar},
title = {Log-space Algorithms for Paths and Matchings in k-trees},
journal = {CoRR},
volume = {abs/0912.4602},
year = {2009},
url = {http://arxiv.org/abs/0912.4602},
eprinttype = {arXiv},
eprint = {0912.4602},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-4602.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WagnerDLNT09,
author = {Fabian Wagner and
Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf},
title = {Planar Graph Isomorphism is in Log-space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-052}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/052},
eprinttype = {ECCC},
eprint = {TR09-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WagnerDLNT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DattaLN08,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {3-connected Planar Graph Isomorphism is in Log-space},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2008, December 9-11, 2008,
Bangalore, India},
series = {LIPIcs},
volume = {2},
pages = {155--162},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2008.1749},
doi = {10.4230/LIPICS.FSTTCS.2008.1749},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/DattaLN08.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}
}
@article{DBLP:journals/corr/abs-0806-1041,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar},
title = {3-connected Planar Graph Isomorphism is in Log-space},
journal = {CoRR},
volume = {abs/0806.1041},
year = {2008},
url = {http://arxiv.org/abs/0806.1041},
eprinttype = {arXiv},
eprint = {0806.1041},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0806-1041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-2319,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {A Log-space Algorithm for Canonization of Planar Graphs},
journal = {CoRR},
volume = {abs/0809.2319},
year = {2008},
url = {http://arxiv.org/abs/0809.2319},
eprinttype = {arXiv},
eprint = {0809.2319},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-2319.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}
}
@inproceedings{DBLP:conf/coco/AllenderBCDR06,
author = {Eric Allender and
David A. Mix Barrington and
Tanmoy Chakraborty and
Samir Datta and
Sambuddha Roy},
title = {Grid Graph Reachability Problems},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {299--313},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.22},
doi = {10.1109/CCC.2006.22},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderBCDR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChakrabortyD06,
author = {Tanmoy Chakraborty and
Samir Datta},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {One-Input-Face {MPCVP} Is Hard for L, But in LogDCFL},
booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical
Computer Science, 26th International Conference, Kolkata, India, December
13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4337},
pages = {57--68},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_8},
doi = {10.1007/11944836\_8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ChakrabortyD06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabortyD06,
author = {Tanmoy Chakraborty and
Samir Datta},
title = {One-input-face {MPCVP} is Hard for L, but in LogDCFL},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-130}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-130/index.html},
eprinttype = {ECCC},
eprint = {TR06-130},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabortyD06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AllenderDR05,
author = {Eric Allender and
Samir Datta and
Sambuddha Roy},
title = {Topology Inside NC{\({^1}\)}},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {298--307},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.31},
doi = {10.1109/CCC.2005.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AllenderDR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AllenderDR05,
author = {Eric Allender and
Samir Datta and
Sambuddha Roy},
editor = {Ramaswamy Ramanujam and
Sandeep Sen},
title = {The Directed Planar Reachability Problem},
booktitle = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical
Computer Science, 25th International Conference, Hyderabad, India,
December 15-18, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3821},
pages = {238--249},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11590156\_19},
doi = {10.1007/11590156\_19},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AllenderDR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hicss/NaikBD05,
author = {Rohit Naik and
Subir K. Biswas and
Samir Datta},
title = {Distributed Sleep-Scheduling Protocols for Energy Conservation in
Wireless Networks},
booktitle = {38th Hawaii International Conference on System Sciences {(HICSS-38}
2005), {CD-ROM} / Abstracts Proceedings, 3-6 January 2005, Big Island,
HI, {USA}},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/HICSS.2005.207},
doi = {10.1109/HICSS.2005.207},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/hicss/NaikBD05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wowmom/DattaSDMR05,
author = {Samir Datta and
Ivan Seskar and
Mustafa Demirhan and
Siun{-}Chuon Mau and
Dipankar Raychaudhuri},
title = {Ad-Hoc Extensions to the 802.15.3 {MAC} Protocol},
booktitle = {2005 International Conference on a World of Wireless, Mobile and Multimedia
Networks {(WOWMOM} 2005), 13-16 June 2005, Taormina, Italy, Proceedings},
pages = {293--298},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/WOWMOM.2005.15},
doi = {10.1109/WOWMOM.2005.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wowmom/DattaSDMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-148,
author = {Eric Allender and
Samir Datta and
Sambuddha Roy},
title = {The Directed Planar Reachability Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-148}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-148/index.html},
eprinttype = {ECCC},
eprint = {TR05-148},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-148.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-149,
author = {Eric Allender and
David A. Mix Barrington and
Tanmoy Chakraborty and
Samir Datta and
Sambuddha Roy},
title = {Grid Graph Reachability Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-149}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-149/index.html},
eprinttype = {ECCC},
eprint = {TR05-149},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-149.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipccc/BiswasD04,
author = {Subir Kumar Biswas and
Samir Datta},
title = {Reducing overhearing energy in 802.11 networks by low-power interface
idling},
booktitle = {Proceedings of the 23rd {IEEE} International Performance Computing
and Communications Conference, {IPCCC} 2004, April 15-17, 2004, Phoenix,
Arizona, {USA}},
pages = {695--700},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/PCCC.2004.1395157},
doi = {10.1109/PCCC.2004.1395157},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ipccc/BiswasD04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-108,
author = {Eric Allender and
Samir Datta and
Sambuddha Roy},
title = {Topology inside NC\({}^{\mbox{1}}\)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-108}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-108/index.html},
eprinttype = {ECCC},
eprint = {TR04-108},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-108.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/AgrawalADVW00,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta and
Heribert Vollmer and
Klaus W. Wagner},
title = {Characterizing Small Depth and Small Space Classes by Operators of
Higher Type},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2000},
year = {2000},
url = {http://cjtcs.cs.uchicago.edu/articles/2000/2/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/AgrawalADVW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AgrawalAD00,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta},
title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {2},
pages = {395--421},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1675},
doi = {10.1006/JCSS.1999.1675},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AgrawalAD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AllenderABDL99,
author = {Eric Allender and
Andris Ambainis and
David A. Mix Barrington and
Samir Datta and
Huong LeThanh},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Bounded Depth Arithmetic Circuits: Counting and Closure},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {149--158},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_12},
doi = {10.1007/3-540-48523-6\_12},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AllenderABDL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-012,
author = {Eric Allender and
Andris Ambainis and
David A. Mix Barrington and
Samir Datta and
Huong LeThanh},
title = {Bounded Depth Arithmetic Circuits: Counting and Closure},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-012}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-012/index.html},
eprinttype = {ECCC},
eprint = {TR99-012},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-057,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta and
Heribert Vollmer and
Klaus W. Wagner},
title = {Characterizing Small Depth and Small Space Classes by Operators of
Higher Types},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-057}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-057/index.html},
eprinttype = {ECCC},
eprint = {TR98-057},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalAD97,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta},
title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {134--148},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612309},
doi = {10.1109/CCC.1997.612309},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalAD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-016,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta},
title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-016}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-016/index.html},
eprinttype = {ECCC},
eprint = {TR97-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-016.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 2024-04-21 16:55 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:
