BibTeX records: T. C. Vijayaraghavan

download as .bib file

@article{DBLP:journals/corr/abs-2310-11874,
  author       = {V. Janaki and
                  S. Madhan and
                  T. C. Vijayaraghavan},
  title        = {Some derivations among Logarithmic Space Bounded Counting Classes},
  journal      = {CoRR},
  volume       = {abs/2310.11874},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.11874},
  doi          = {10.48550/ARXIV.2310.11874},
  eprinttype    = {arXiv},
  eprint       = {2310.11874},
  timestamp    = {Fri, 27 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-11874.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jco/ArvindV11,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  title        = {The orbit problem is in the GapL hierarchy},
  journal      = {J. Comb. Optim.},
  volume       = {21},
  number       = {1},
  pages        = {124--137},
  year         = {2011},
  url          = {https://doi.org/10.1007/s10878-009-9243-8},
  doi          = {10.1007/S10878-009-9243-8},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jco/ArvindV11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/ArvindV10,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  title        = {Classifying Problems on Linear Congruences and Abelian Permutation
                  Groups Using Logspace Counting Classes},
  journal      = {Comput. Complex.},
  volume       = {19},
  number       = {1},
  pages        = {57--98},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00037-009-0280-6},
  doi          = {10.1007/S00037-009-0280-6},
  timestamp    = {Mon, 26 Oct 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/ArvindV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/Vijayaraghavan10,
  author       = {T. C. Vijayaraghavan},
  title        = {A Note on Closure Properties of ModL},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-099}},
  year         = {2010},
  url          = {https://eccc.weizmann.ac.il/report/2010/099},
  eprinttype    = {ECCC},
  eprint       = {TR10-099},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Vijayaraghavan10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/Vijayaraghavan09,
  author       = {T. C. Vijayaraghavan},
  title        = {Checking Equality of Matroid Linear Representations and the Cycle
                  Matching Problem},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR09-009}},
  year         = {2009},
  url          = {https://eccc.weizmann.ac.il/report/2009/009},
  eprinttype    = {ECCC},
  eprint       = {TR09-009},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Vijayaraghavan09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/Vijayaraghavan09a,
  author       = {T. C. Vijayaraghavan},
  title        = {Characterization of ModL using Prime Modulus},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR09-082}},
  year         = {2009},
  url          = {https://eccc.weizmann.ac.il/report/2009/082},
  eprinttype    = {ECCC},
  eprint       = {TR09-082},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Vijayaraghavan09a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cocoon/ArvindV08,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  editor       = {Xiaodong Hu and
                  Jie Wang},
  title        = {The Orbit Problem Is in the GapL Hierarchy},
  booktitle    = {Computing and Combinatorics, 14th Annual International Conference,
                  {COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5092},
  pages        = {160--169},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-69733-6\_17},
  doi          = {10.1007/978-3-540-69733-6\_17},
  timestamp    = {Tue, 29 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/cocoon/ArvindV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ArvindV08,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  title        = {The Orbit problem is in the GapL Hierarchy},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR08-052}},
  year         = {2008},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-052/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR08-052},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ArvindV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ArvindKV05,
  author       = {Vikraman Arvind and
                  Piyush P. Kurur and
                  T. C. Vijayaraghavan},
  title        = {Bounded Color Multiplicity Graph Isomorphism is in the {\#}L Hierarchy},
  booktitle    = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
                  11-15 June 2005, San Jose, CA, {USA}},
  pages        = {13--27},
  publisher    = {{IEEE} Computer Society},
  year         = {2005},
  url          = {https://doi.org/10.1109/CCC.2005.7},
  doi          = {10.1109/CCC.2005.7},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ArvindKV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/ArvindV05,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  editor       = {Volker Diekert and
                  Bruno Durand},
  title        = {The Complexity of Solving Linear Equations over a Finite Ring},
  booktitle    = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
                  Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3404},
  pages        = {472--484},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/978-3-540-31856-9\_39},
  doi          = {10.1007/978-3-540-31856-9\_39},
  timestamp    = {Wed, 19 May 2021 12:05:43 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/ArvindV05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ArvindV04,
  author       = {Vikraman Arvind and
                  T. C. Vijayaraghavan},
  title        = {Abelian Permutation Group Problems and Logspace Counting Classes},
  booktitle    = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
                  21-24 June 2004, Amherst, MA, {USA}},
  pages        = {204--214},
  publisher    = {{IEEE} Computer Society},
  year         = {2004},
  url          = {https://doi.org/10.1109/CCC.2004.1313844},
  doi          = {10.1109/CCC.2004.1313844},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ArvindV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ECCC-TR04-121,
  author       = {Vikraman Arvind and
                  Piyush P. Kurur and
                  T. C. Vijayaraghavan},
  title        = {Bounded Color Multiplicity Graph Isomorphism is in the {\#}L Hierarchy},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-121}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-121/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-121},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-121.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.