BibTeX records: T. C. Vijayaraghavan

download as .bib file

@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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/jco/ArvindV11},
  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   = {Computational Complexity},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/cc/ArvindV10},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {99},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/099},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Vijayaraghavan10},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {9},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/009},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Vijayaraghavan09},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {82},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/082},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/Vijayaraghavan09a},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/ArvindV08,
  author    = {Vikraman Arvind and
               T. C. Vijayaraghavan},
  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},
  pages     = {160--169},
  year      = {2008},
  crossref  = {DBLP:conf/cocoon/2008},
  url       = {https://doi.org/10.1007/978-3-540-69733-6\_17},
  doi       = {10.1007/978-3-540-69733-6\_17},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/ArvindV08},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {15},
  number    = {052},
  year      = {2008},
  url       = {http://eccc.hpi-web.de/eccc-reports/2008/TR08-052/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ArvindV08},
  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},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.7},
  doi       = {10.1109/CCC.2005.7},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/ArvindKV05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindV05,
  author    = {Vikraman Arvind and
               T. C. Vijayaraghavan},
  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},
  pages     = {472--484},
  year      = {2005},
  crossref  = {DBLP:conf/stacs/2005},
  url       = {https://doi.org/10.1007/978-3-540-31856-9\_39},
  doi       = {10.1007/978-3-540-31856-9\_39},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/ArvindV05},
  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},
  year      = {2004},
  crossref  = {DBLP:conf/coco/2004},
  url       = {https://doi.org/10.1109/CCC.2004.1313844},
  doi       = {10.1109/CCC.2004.1313844},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/ArvindV04},
  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   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {121},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-121/index.html},
  timestamp = {Tue, 14 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/bib/journals/eccc/ECCC-TR04-121},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2008,
  editor    = {Xiaodong Hu and
               Jie Wang},
  title     = {Computing and Combinatorics, 14th Annual International Conference,
               {COCOON} 2008, Dalian, China, June 27-29, 2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5092},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-69733-6},
  doi       = {10.1007/978-3-540-69733-6},
  isbn      = {978-3-540-69732-9},
  timestamp = {Tue, 13 Jun 2017 10:37:56 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/cocoon/2008},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2005,
  title     = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9851},
  isbn      = {0-7695-2364-1},
  timestamp = {Fri, 13 May 2016 10:29:32 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2005,
  editor    = {Volker Diekert and
               Bruno Durand},
  title     = {{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},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/b106485},
  doi       = {10.1007/b106485},
  isbn      = {3-540-24998-2},
  timestamp = {Tue, 30 May 2017 16:36:52 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/stacs/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/coco/2004,
  title     = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
               21-24 June 2004, Amherst, MA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2004},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9188},
  isbn      = {0-7695-2120-7},
  timestamp = {Fri, 13 May 2016 10:29:53 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/coco/2004},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
maintained by Schloss Dagstuhl LZI, founded at University of Trier