Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jayalal Sarma
@inproceedings{DBLP:conf/dcfs/KuntewarAS23,
author = {Neha Kuntewar and
S. K. M. Anoop and
Jayalal Sarma},
editor = {Henning Bordihn and
Nicholas Q. Tran and
Gy{\"{o}}rgy Vaszil},
title = {Separating Words Problem over Groups},
booktitle = {Descriptional Complexity of Formal Systems - 25th {IFIP} {WG} 1.02
International Conference, {DCFS} 2023, Potsdam, Germany, July 4-6,
2023, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13918},
pages = {109--120},
publisher = {Springer},
year = {2023},
url = {https://doi.org/10.1007/978-3-031-34326-1\_8},
doi = {10.1007/978-3-031-34326-1\_8},
timestamp = {Sun, 21 Jan 2024 19:26:00 +0100},
biburl = {https://dblp.org/rec/conf/dcfs/KuntewarAS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-00136,
author = {Prashanth Amireddy and
Sai Jayasurya and
Jayalal Sarma},
title = {Power of Decision Trees with Monotone Queries},
journal = {CoRR},
volume = {abs/2301.00136},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.00136},
doi = {10.48550/ARXIV.2301.00136},
eprinttype = {arXiv},
eprint = {2301.00136},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-00136.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-03985,
author = {S. K. M. Anoop and
Jayalal Sarma},
title = {On Rotation Distance of Rank Bounded Trees},
journal = {CoRR},
volume = {abs/2304.03985},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.03985},
doi = {10.48550/ARXIV.2304.03985},
eprinttype = {arXiv},
eprint = {2304.03985},
timestamp = {Tue, 18 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-03985.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/RaoS22,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
title = {Isomorphism testing of read-once functions and polynomials},
journal = {Inf. Comput.},
volume = {285},
number = {Part},
pages = {104921},
year = {2022},
url = {https://doi.org/10.1016/j.ic.2022.104921},
doi = {10.1016/J.IC.2022.104921},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/RaoS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BisoyiDS22,
author = {Sagar Bisoyi and
Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {On pure space vs catalytic space},
journal = {Theor. Comput. Sci.},
volume = {921},
pages = {112--126},
year = {2022},
url = {https://doi.org/10.1016/j.tcs.2022.04.005},
doi = {10.1016/J.TCS.2022.04.005},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BisoyiDS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AnoopS22,
author = {S. K. M. Anoop and
Jayalal Sarma},
editor = {Yong Zhang and
Dongjing Miao and
Rolf H. M{\"{o}}hring},
title = {Rotation Distance for Rank Bounded Trees},
booktitle = {Computing and Combinatorics - 28th International Conference, {COCOON}
2022, Shenzhen, China, October 22-24, 2022, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13595},
pages = {529--536},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-22105-7\_47},
doi = {10.1007/978-3-031-22105-7\_47},
timestamp = {Mon, 09 Jan 2023 17:58:31 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/AnoopS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AmireddyJS22,
author = {Prashanth Amireddy and
Sai Jayasurya and
Jayalal Sarma},
title = {Power of Decision Trees with Monotone Queries},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-186}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/186},
eprinttype = {ECCC},
eprint = {TR22-186},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/AmireddyJS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/KulkarniSS21,
author = {Manasi S. Kulkarni and
Jayalal Sarma and
Janani Sundaresan},
editor = {Alberto Leporati and
Carlos Mart{\'{\i}}n{-}Vide and
Dana Shapira and
Claudio Zandron},
title = {On the Computational Power of Programs over BA\({}_{\mbox{2}}\) Monoid},
booktitle = {Language and Automata Theory and Applications - 15th International
Conference, {LATA} 2021, Milan, Italy, March 1-5, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12638},
pages = {29--40},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-68195-1\_3},
doi = {10.1007/978-3-030-68195-1\_3},
timestamp = {Tue, 23 Feb 2021 12:56:48 +0100},
biburl = {https://dblp.org/rec/conf/lata/KulkarniSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DineshS20,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {Sensitivity, affine transforms and quantum communication complexity},
journal = {Theor. Comput. Sci.},
volume = {838},
pages = {68--80},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.05.048},
doi = {10.1016/J.TCS.2020.05.048},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DineshS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DineshOS20,
author = {Krishnamoorthy Dinesh and
Samir Otiv and
Jayalal Sarma},
title = {New bounds for energy complexity of Boolean functions},
journal = {Theor. Comput. Sci.},
volume = {845},
pages = {59--75},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.09.003},
doi = {10.1016/J.TCS.2020.09.003},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DineshOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AmireddyJS20,
author = {Prashanth Amireddy and
Sai Jayasurya and
Jayalal Sarma},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {Power of Decision Trees with Monotone Queries},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {287--298},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_23},
doi = {10.1007/978-3-030-58150-3\_23},
timestamp = {Thu, 27 Aug 2020 12:32:24 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AmireddyJS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/AmireddyJS20a,
author = {Prashanth Amireddy and
Sai Jayasurya and
Jayalal Sarma},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {On the Mystery of Negations in Circuits: Structure vs Power},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {566--577},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_46},
doi = {10.1007/978-3-030-58150-3\_46},
timestamp = {Thu, 27 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/AmireddyJS20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Bisoyi0S20,
author = {Sagar Bisoyi and
Krishnamoorthy Dinesh and
Jayalal Sarma},
editor = {Jianer Chen and
Qilong Feng and
Jinhui Xu},
title = {On Pure Space vs Catalytic Space},
booktitle = {Theory and Applications of Models of Computation, 16th International
Conference, {TAMC} 2020, Changsha, China, October 18-20, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12337},
pages = {439--451},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-59267-7\_37},
doi = {10.1007/978-3-030-59267-7\_37},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/Bisoyi0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/RamaswamySS19,
author = {Vidhya Ramaswamy and
Jayalal Sarma and
K. S. Sunil},
title = {Space complexity of reachability testing in labelled graphs},
journal = {J. Comput. Syst. Sci.},
volume = {105},
pages = {40--53},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.04.002},
doi = {10.1016/J.JCSS.2019.04.002},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/RamaswamySS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DineshS19,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {Alternation, sparsity and sensitivity: Bounds and exponential gaps},
journal = {Theor. Comput. Sci.},
volume = {771},
pages = {71--82},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.11.015},
doi = {10.1016/J.TCS.2018.11.015},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DineshS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DineshKS19,
author = {Krishnamoorthy Dinesh and
Sajin Koroth and
Jayalal Sarma},
title = {Characterization and Lower Bounds for Branching Program Size using
Projective Dimension},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {2},
pages = {8:1--8:22},
year = {2019},
url = {https://doi.org/10.1145/3305274},
doi = {10.1145/3305274},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/DineshKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/0001S19,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
editor = {Ding{-}Zhu Du and
Zhenhua Duan and
Cong Tian},
title = {Sensitivity, Affine Transforms and Quantum Communication Complexity},
booktitle = {Computing and Combinatorics - 25th International Conference, {COCOON}
2019, Xi'an, China, July 29-31, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11653},
pages = {140--152},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-26176-4\_12},
doi = {10.1007/978-3-030-26176-4\_12},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/0001S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KomarathSS18,
author = {Balagopal Komarath and
Jayalal Sarma and
K. S. Sunil},
title = {Comparator Circuits over Finite Bounded Posets},
journal = {Inf. Comput.},
volume = {261},
pages = {160--174},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.02.002},
doi = {10.1016/J.IC.2018.02.002},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KomarathSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KomarathSS18,
author = {Balagopal Komarath and
Jayalal Sarma and
Saurabh Sawlani},
title = {Pebbling meets coloring: Reversible pebble game on trees},
journal = {J. Comput. Syst. Sci.},
volume = {91},
pages = {33--41},
year = {2018},
url = {https://doi.org/10.1016/j.jcss.2017.07.009},
doi = {10.1016/J.JCSS.2017.07.009},
timestamp = {Fri, 20 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/KomarathSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/0001S18,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
editor = {B. S. Panda and
Partha P. Goswami},
title = {Alternation, Sparsity and Sensitivity: Combinatorial Bounds and Exponential
Gaps},
booktitle = {Algorithms and Discrete Applied Mathematics - 4th International Conference,
{CALDAM} 2018, Guwahati, India, February 15-17, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10743},
pages = {260--273},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-74180-2\_22},
doi = {10.1007/978-3-319-74180-2\_22},
timestamp = {Wed, 09 Jun 2021 08:38:40 +0200},
biburl = {https://dblp.org/rec/conf/caldam/0001S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/0001OS18,
author = {Krishnamoorthy Dinesh and
Samir Otiv and
Jayalal Sarma},
editor = {Lusheng Wang and
Daming Zhu},
title = {New Bounds for Energy Complexity of Boolean Functions},
booktitle = {Computing and Combinatorics - 24th International Conference, {COCOON}
2018, Qing Dao, China, July 2-4, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10976},
pages = {738--750},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94776-1\_61},
doi = {10.1007/978-3-319-94776-1\_61},
timestamp = {Thu, 20 Aug 2020 16:02:36 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/0001OS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-07199,
author = {Krishnamoorthy Dinesh and
Samir Otiv and
Jayalal Sarma},
title = {New Bounds for Energy Complexity of Boolean Functions},
journal = {CoRR},
volume = {abs/1808.07199},
year = {2018},
url = {http://arxiv.org/abs/1808.07199},
eprinttype = {arXiv},
eprint = {1808.07199},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-07199.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-10191,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {Sensitivity, Affine Transforms and Quantum Communication Complexity},
journal = {CoRR},
volume = {abs/1808.10191},
year = {2018},
url = {http://arxiv.org/abs/1808.10191},
eprinttype = {arXiv},
eprint = {1808.10191},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-10191.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001OS18,
author = {Krishnamoorthy Dinesh and
Samir Otiv and
Jayalal Sarma},
title = {New Bounds for Energy Complexity of Boolean Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-153}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/153},
eprinttype = {ECCC},
eprint = {TR18-153},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001OS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001S18,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {Sensitivity, Affine Transforms and Quantum Communication Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-152}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/152},
eprinttype = {ECCC},
eprint = {TR18-152},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001S18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/KorothS17,
author = {Sajin Koroth and
Jayalal Sarma},
title = {Depth Lower Bounds against Circuits with Sparse Orientation},
journal = {Fundam. Informaticae},
volume = {152},
number = {2},
pages = {123--144},
year = {2017},
url = {https://doi.org/10.3233/FI-2017-1515},
doi = {10.3233/FI-2017-1515},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/KorothS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DhayalSS17,
author = {Anant Dhayal and
Jayalal Sarma and
Saurabh Sawlani},
title = {Min/Max-Poly Weighting Schemes and the {NL} versus {UL} Problem},
journal = {{ACM} Trans. Comput. Theory},
volume = {9},
number = {2},
pages = {10:1--10:25},
year = {2017},
url = {https://doi.org/10.1145/3070902},
doi = {10.1145/3070902},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/DhayalSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BlaserRS17,
author = {Markus Bl{\"{a}}ser and
B. V. Raghavendra Rao and
Jayalal Sarma},
editor = {Ralf Klasing and
Marc Zeitoun},
title = {Testing Polynomial Equivalence by Scaling Matrices},
booktitle = {Fundamentals of Computation Theory - 21st International Symposium,
{FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10472},
pages = {111--122},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-55751-8\_10},
doi = {10.1007/978-3-662-55751-8\_10},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/BlaserRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/RamaswamySS17,
author = {Vidhya Ramaswamy and
Jayalal Sarma and
K. S. Sunil},
editor = {Frank Drewes and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Space Complexity of Reachability Testing in Labelled Graphs},
booktitle = {Language and Automata Theory and Applications - 11th International
Conference, {LATA} 2017, Ume{\aa}, Sweden, March 6-9, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10168},
pages = {351--363},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-53733-7\_26},
doi = {10.1007/978-3-319-53733-7\_26},
timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
biburl = {https://dblp.org/rec/conf/lata/RamaswamySS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KomarathSS17,
author = {Balagopal Komarath and
Jayalal Sarma and
K. S. Sunil},
title = {On the Complexity of L-reachability},
journal = {CoRR},
volume = {abs/1701.03255},
year = {2017},
url = {http://arxiv.org/abs/1701.03255},
eprinttype = {arXiv},
eprint = {1701.03255},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KomarathSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-05735,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps},
journal = {CoRR},
volume = {abs/1712.05735},
year = {2017},
url = {http://arxiv.org/abs/1712.05735},
eprinttype = {arXiv},
eprint = {1712.05735},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-05735.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DineshS17,
author = {Krishnamoorthy Dinesh and
Jayalal Sarma},
title = {Alternation, Sparsity and Sensitivity : Bounds and Exponential Gaps},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-192}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/192},
eprinttype = {ECCC},
eprint = {TR17-192},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DineshS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/KomarathSS16,
author = {Balagopal Komarath and
Jayalal Sarma and
K. S. Sunil},
title = {On the Complexity of L-reachability},
journal = {Fundam. Informaticae},
volume = {145},
number = {4},
pages = {471--483},
year = {2016},
url = {https://doi.org/10.3233/FI-2016-1371},
doi = {10.3233/FI-2016-1371},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/KomarathSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/0001MS16,
author = {Mrinal Kumar and
Gaurav Maheshwari and
Jayalal Sarma},
title = {Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative
Matrices},
journal = {{ACM} Trans. Comput. Theory},
volume = {8},
number = {3},
pages = {8:1--8:17},
year = {2016},
url = {https://doi.org/10.1145/2898437},
doi = {10.1145/2898437},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/0001MS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/0001KS16,
author = {Krishnamoorthy Dinesh and
Sajin Koroth and
Jayalal Sarma},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {Characterization and Lower Bounds for Branching Program Size Using
Projective Dimension},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {37:1--37:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.37},
doi = {10.4230/LIPICS.FSTTCS.2016.37},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/0001KS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KomarathSS16,
author = {Balagopal Komarath and
Jayalal Sarma and
Saurabh Sawlani},
title = {Pebbling Meets Coloring: Reversible Pebble Game On Trees},
journal = {CoRR},
volume = {abs/1604.05510},
year = {2016},
url = {http://arxiv.org/abs/1604.05510},
eprinttype = {arXiv},
eprint = {1604.05510},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KomarathSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KrishnamoorthyK16,
author = {Krishnamoorthy Dinesh and
Sajin Koroth and
Jayalal Sarma},
title = {Characterization and Lower Bounds for Branching Program Size using
Projective Dimension},
journal = {CoRR},
volume = {abs/1604.07200},
year = {2016},
url = {http://arxiv.org/abs/1604.07200},
eprinttype = {arXiv},
eprint = {1604.07200},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KrishnamoorthyK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KomarathSS16,
author = {Balagopal Komarath and
Jayalal Sarma and
Saurabh Sawlani},
title = {Pebbling Meets Coloring : Reversible Pebble Game On Trees},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-067}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/067},
eprinttype = {ECCC},
eprint = {TR16-067},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KomarathSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KrishnamoorthyK16,
author = {Krishnamoorthy Dinesh and
Sajin Koroth and
Jayalal Sarma},
title = {Characterization and Lower Bounds for Branching Program Size using
Projective Dimension},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-076}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/076},
eprinttype = {ECCC},
eprint = {TR16-076},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KrishnamoorthyK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/KomarathS15,
author = {Balagopal Komarath and
Jayalal Sarma},
title = {Pebbling, Entropy, and Branching Program Size Lower Bounds},
journal = {{ACM} Trans. Comput. Theory},
volume = {7},
number = {2},
pages = {8:1--8:21},
year = {2015},
url = {https://doi.org/10.1145/2751320},
doi = {10.1145/2751320},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/KomarathS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KomarathSS15,
author = {Balagopal Komarath and
Jayalal Sarma and
Saurabh Sawlani},
editor = {Dachuan Xu and
Donglei Du and
Ding{-}Zhu Du},
title = {Reversible Pebble Game on Trees},
booktitle = {Computing and Combinatorics - 21st International Conference, {COCOON}
2015, Beijing, China, August 4-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9198},
pages = {83--94},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-21398-9\_7},
doi = {10.1007/978-3-319-21398-9\_7},
timestamp = {Sun, 25 Oct 2020 22:58:52 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/KomarathSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KomarathSS15,
author = {Balagopal Komarath and
Jayalal Sarma and
K. S. Sunil},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Comparator Circuits over Finite Bounded Posets},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {834--845},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_68},
doi = {10.1007/978-3-662-47672-7\_68},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/KomarathSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KomarathSS15,
author = {Balagopal Komarath and
Jayalal Sarma and
K. S. Sunil},
title = {Comparator Circuits over Finite Bounded Posets},
journal = {CoRR},
volume = {abs/1503.00275},
year = {2015},
url = {http://arxiv.org/abs/1503.00275},
eprinttype = {arXiv},
eprint = {1503.00275},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KomarathSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SunilKS15,
author = {K. S. Sunil and
Balagopal Komarath and
Jayalal Sarma},
title = {Comparator Circuits over Finite Bounded Posets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-035}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/035},
eprinttype = {ECCC},
eprint = {TR15-035},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SunilKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/KumarLPS14,
author = {Abhinav Kumar and
Satyanarayana V. Lokam and
Vijay M. Patankar and
Jayalal Sarma},
title = {Using Elimination Theory to Construct Rigid Matrices},
journal = {Comput. Complex.},
volume = {23},
number = {4},
pages = {531--563},
year = {2014},
url = {https://doi.org/10.1007/s00037-013-0061-0},
doi = {10.1007/S00037-013-0061-0},
timestamp = {Tue, 19 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/KumarLPS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/RaoS14,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
title = {Complexity of Testing Reachability in Matroids},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2014},
year = {2014},
url = {http://cjtcs.cs.uchicago.edu/articles/2014/5/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/RaoS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JansenS14,
author = {Maurice J. Jansen and
Jayalal Sarma},
title = {Balancing Bounded Treewidth Circuits},
journal = {Theory Comput. Syst.},
volume = {54},
number = {2},
pages = {318--336},
year = {2014},
url = {https://doi.org/10.1007/s00224-013-9519-3},
doi = {10.1007/S00224-013-9519-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JansenS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/KorothS14,
author = {Sajin Koroth and
Jayalal Sarma},
editor = {Zhipeng Cai and
Alex Zelikovsky and
Anu G. Bourgeois},
title = {Depth Lower Bounds against Circuits with Sparse Orientation},
booktitle = {Computing and Combinatorics - 20th International Conference, {COCOON}
2014, Atlanta, GA, USA, August 4-6, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8591},
pages = {596--607},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08783-2\_51},
doi = {10.1007/978-3-319-08783-2\_51},
timestamp = {Thu, 20 Aug 2020 15:36:49 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/KorothS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcfs/KomarathSS14,
author = {Balagopal Komarath and
Jayalal Sarma and
K. S. Sunil},
editor = {Helmut J{\"{u}}rgensen and
Juhani Karhum{\"{a}}ki and
Alexander Okhotin},
title = {On the Complexity of L-reachability},
booktitle = {Descriptional Complexity of Formal Systems - 16th International Workshop,
{DCFS} 2014, Turku, Finland, August 5-8, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8614},
pages = {258--269},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09704-6\_23},
doi = {10.1007/978-3-319-09704-6\_23},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/dcfs/KomarathSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DhayalSS14,
author = {Anant Dhayal and
Jayalal Sarma and
Saurabh Sawlani},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {597--609},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.597},
doi = {10.4230/LIPICS.FSTTCS.2014.597},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/DhayalSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HansenKSST14,
author = {Kristoffer Arnsfelt Hansen and
Balagopal Komarath and
Jayalal Sarma and
Sven Skyum and
Navid Talebanfard},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth},
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 = {336--347},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_29},
doi = {10.1007/978-3-662-44465-8\_29},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HansenKSST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KorothS14,
author = {Sajin Koroth and
Jayalal Sarma},
title = {Depth Lower Bounds against Circuits with Sparse Orientation},
journal = {CoRR},
volume = {abs/1404.7443},
year = {2014},
url = {http://arxiv.org/abs/1404.7443},
eprinttype = {arXiv},
eprint = {1404.7443},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KorothS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KorothS14,
author = {Sajin Koroth and
Jayalal Sarma},
title = {Depth Lower Bounds against Circuits with Sparse Orientation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-072}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/072},
eprinttype = {ECCC},
eprint = {TR14-072},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KorothS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KumarMN13,
author = {Mrinal Kumar and
Gaurav Maheshwari and
Jayalal Sarma},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Arithmetic Circuit Lower Bounds via MaxRank},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {661--672},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_56},
doi = {10.1007/978-3-642-39206-1\_56},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KumarMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KomarathS13,
author = {Balagopal Komarath and
Jayalal Sarma},
editor = {Natacha Portier and
Thomas Wilke},
title = {Pebbling, Entropy and Branching Program Size Lower Bounds},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {622--633},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.622},
doi = {10.4230/LIPICS.STACS.2013.622},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KomarathS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/KumarSS13,
author = {Prasun Kumar and
Jayalal Sarma and
Saurabh Sawlani},
editor = {Subir Kumar Ghosh and
Takeshi Tokuyama},
title = {On Directed Tree Realizations of Degree Sets},
booktitle = {{WALCOM:} Algorithms and Computation, 7th International Workshop,
{WALCOM} 2013, Kharagpur, India, February 14-16, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7748},
pages = {274--285},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36065-7\_26},
doi = {10.1007/978-3-642-36065-7\_26},
timestamp = {Sat, 30 Sep 2023 09:58:46 +0200},
biburl = {https://dblp.org/rec/conf/walcom/KumarSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-1425,
author = {Balagopal Komarath and
Jayalal Sarma},
title = {Pebbling, Entropy and Branching Program Size Lower Bounds},
journal = {CoRR},
volume = {abs/1301.1425},
year = {2013},
url = {http://arxiv.org/abs/1301.1425},
eprinttype = {arXiv},
eprint = {1301.1425},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-1425.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-3308,
author = {Mrinal Kumar and
Gaurav Maheshwari and
Jayalal Sarma},
title = {Arithmetic Circuit Lower Bounds via MaxRank},
journal = {CoRR},
volume = {abs/1302.3308},
year = {2013},
url = {http://arxiv.org/abs/1302.3308},
eprinttype = {arXiv},
eprint = {1302.3308},
timestamp = {Wed, 27 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-3308.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KomarathS13,
author = {Balagopal Komarath and
Jayalal Sarma},
title = {Pebbling, Entropy and Branching Program Size Lower Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-006}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/006},
eprinttype = {ECCC},
eprint = {TR13-006},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KomarathS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KumarMN13,
author = {Mrinal Kumar and
Gaurav Maheshwari and
Jayalal Sarma},
title = {Arithmetic Circuit Lower Bounds via MaxRank},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-028}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/028},
eprinttype = {ECCC},
eprint = {TR13-028},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KumarMN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcst/QiaoNT12,
author = {Youming Qiao and
Jayalal Sarma and
Bangsheng Tang},
title = {On Isomorphism Testing of Groups with Normal Hall Subgroups},
journal = {J. Comput. Sci. Technol.},
volume = {27},
number = {4},
pages = {687--701},
year = {2012},
url = {https://doi.org/10.1007/s11390-012-1255-7},
doi = {10.1007/S11390-012-1255-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcst/QiaoNT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RaoS11,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
title = {On the Complexity of Matroid Isomorphism Problem},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {246--272},
year = {2011},
url = {https://doi.org/10.1007/s00224-010-9260-0},
doi = {10.1007/S00224-010-9260-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RaoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/RaoS11,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Isomorphism testing of read-once functions and polynomials},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {115--126},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.115},
doi = {10.4230/LIPICS.FSTTCS.2011.115},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/RaoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/QiaoST11,
author = {Youming Qiao and
Jayalal Sarma and
Bangsheng Tang},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {On Isomorphism Testing of Groups with Normal Hall Subgroups},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {567--578},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.567},
doi = {10.4230/LIPICS.STACS.2011.567},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/QiaoST11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MahajanS10,
author = {Meena Mahajan and
Jayalal Sarma},
title = {On the Complexity of Matrix Rank and Rigidity},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {9--26},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9136-8},
doi = {10.1007/S00224-008-9136-8},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MahajanS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/JansenS10,
author = {Maurice J. Jansen and
Jayalal Sarma},
editor = {Farid M. Ablayev and
Ernst W. Mayr},
title = {Balancing Bounded Treewidth Circuits},
booktitle = {Computer Science - Theory and Applications, 5th International Computer
Science Symposium in Russia, {CSR} 2010, Kazan, Russia, June 16-20,
2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6072},
pages = {228--239},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13182-0\_21},
doi = {10.1007/978-3-642-13182-0\_21},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/JansenS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/JansenQS10,
author = {Maurice J. Jansen and
Youming Qiao and
Jayalal Sarma},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Deterministic Black-Box Identity Testing {\textdollar}pi{\textdollar}-Ordered
Algebraic Branching Programs},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010,
Chennai, India},
series = {LIPIcs},
volume = {8},
pages = {296--307},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.296},
doi = {10.4230/LIPICS.FSTTCS.2010.296},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/JansenQS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HeLS10,
author = {Jing He and
Hongyu Liang and
Jayalal Sarma},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Limiting Negations in Bounded Treewidth and Upward Planar Circuits},
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 = {417--428},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_37},
doi = {10.1007/978-3-642-15155-2\_37},
timestamp = {Mon, 15 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HeLS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-1496,
author = {Maurice J. Jansen and
Youming Qiao and
Jayalal Sarma},
title = {Deterministic Black-Box Identity Testing {\textdollar}{\textbackslash}pi{\textdollar}-Ordered
Algebraic Branching Programs},
journal = {CoRR},
volume = {abs/1002.1496},
year = {2010},
url = {http://arxiv.org/abs/1002.1496},
eprinttype = {arXiv},
eprint = {1002.1496},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-1496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JansenQS10,
author = {Maurice J. Jansen and
Youming Qiao and
Jayalal Sarma},
title = {Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching
Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-015}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/015},
eprinttype = {ECCC},
eprint = {TR10-015},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JansenQS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JansenQS10a,
author = {Maurice J. Jansen and
Youming Qiao and
Jayalal Sarma},
title = {Deterministic Identity Testing of Read-Once Algebraic Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-084}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/084},
eprinttype = {ECCC},
eprint = {TR10-084},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JansenQS10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/LimayeMS09,
author = {Nutan Limaye and
Meena Mahajan and
Jayalal Sarma},
title = {Upper Bounds for Monotone Planar Circuit Value and Variants},
journal = {Comput. Complex.},
volume = {18},
number = {3},
pages = {377--412},
year = {2009},
url = {https://doi.org/10.1007/s00037-009-0265-5},
doi = {10.1007/S00037-009-0265-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/LimayeMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/RaoS09,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {On the Complexity of Matroid Isomorphism Problems},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {286--298},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_27},
doi = {10.1007/978-3-642-03351-3\_27},
timestamp = {Mon, 01 Mar 2021 13:46:21 +0100},
biburl = {https://dblp.org/rec/conf/csr/RaoS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AbhinavLPS09,
author = {Abhinav Kumar and
Satyanarayana V. Lokam and
Vijay M. Patankar and
Jayalal Sarma},
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {Using Elimination Theory to construct Rigid Matrices},
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 = {299--310},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2327},
doi = {10.4230/LIPICS.FSTTCS.2009.2327},
timestamp = {Tue, 19 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/AbhinavLPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-1427,
author = {Maurice J. Jansen and
Jayalal Sarma},
title = {Balancing Bounded Treewidth Circuits},
journal = {CoRR},
volume = {abs/0910.1427},
year = {2009},
url = {http://arxiv.org/abs/0910.1427},
eprinttype = {arXiv},
eprint = {0910.1427},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-1427.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0910-5301,
author = {Abhinav Kumar and
Satyanarayana V. Lokam and
Vijay M. Patankar and
Jayalal Sarma},
title = {Using Elimination Theory to construct Rigid Matrices},
journal = {CoRR},
volume = {abs/0910.5301},
year = {2009},
url = {http://arxiv.org/abs/0910.5301},
eprinttype = {arXiv},
eprint = {0910.5301},
timestamp = {Tue, 19 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-0910-5301.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-2565,
author = {Maurice J. Jansen and
Youming Qiao and
Jayalal Sarma},
title = {Deterministic Identity Testing of Read-Once Algebraic Branching Programs},
journal = {CoRR},
volume = {abs/0912.2565},
year = {2009},
url = {http://arxiv.org/abs/0912.2565},
eprinttype = {arXiv},
eprint = {0912.2565},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-2565.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AbhinavLPS09,
author = {Abhinav Kumar and
Satyanarayana V. Lokam and
Vijay M. Patankar and
Jayalal Sarma},
title = {Using Elimination Theory to construct Rigid Matrices},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-106}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/106},
eprinttype = {ECCC},
eprint = {TR09-106},
timestamp = {Tue, 19 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/AbhinavLPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MahajanS08,
author = {Meena Mahajan and
Jayalal Sarma},
title = {Rigidity of a simple extended lower triangular matrix},
journal = {Inf. Process. Lett.},
volume = {107},
number = {5},
pages = {149--153},
year = {2008},
url = {https://doi.org/10.1016/j.ipl.2008.02.010},
doi = {10.1016/J.IPL.2008.02.010},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MahajanS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-3859,
author = {B. V. Raghavendra Rao and
Jayalal Sarma},
title = {On the Complexity of Matroid Isomorphism Problem},
journal = {CoRR},
volume = {abs/0811.3859},
year = {2008},
url = {http://arxiv.org/abs/0811.3859},
eprinttype = {arXiv},
eprint = {0811.3859},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-3859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/MahajanS07,
author = {Meena Mahajan and
Jayalal Sarma},
editor = {Volker Diekert and
Mikhail V. Volkov and
Andrei Voronkov},
title = {On the Complexity of Matrix Rank and Rigidity},
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 = {269--280},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74510-5\_28},
doi = {10.1007/978-3-540-74510-5\_28},
timestamp = {Thu, 09 Nov 2023 20:20:35 +0100},
biburl = {https://dblp.org/rec/conf/csr/MahajanS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LimayeMS06,
author = {Nutan Limaye and
Meena Mahajan and
Jayalal Sarma},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Evaluating Monotone Circuits on Cylinders, Planes and Tori},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {660--671},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_54},
doi = {10.1007/11672142\_54},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LimayeMS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-009,
author = {Nutan Limaye and
Meena Mahajan and
Jayalal Sarma},
title = {Evaluating Monotone Circuits on Cylinders, Planes and Tori},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-009}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-009/index.html},
eprinttype = {ECCC},
eprint = {TR06-009},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR06-009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MahajanS06,
author = {Meena Mahajan and
Jayalal Sarma},
title = {On the Complexity of Rank and Rigidity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-100}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-100/index.html},
eprinttype = {ECCC},
eprint = {TR06-100},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MahajanS06.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-03-21 02:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
