My interests are centred around algorithms and complexity. Specifically, I am interested in computational algebra, quantum computation computational number theory.
Complexity upper bounds using permutation group theory, Institute of Mathematical Sciences, Chennai, 2006. [pdf, dvi, bib]
Quantum cyclic codes of length dividing pt+1. with Sagarmoy Dutta. in the IEEE Symposium on Information Theory, 2011. To appear. [pdf, dvi, bib]
Can quantum search accelerate evolutionary algorithms? with Daniel Johannsen and Johannes Lengler. Genetic and Evolutionary Computation Conference (GECCO) 2010, pages 1433-1440. [pdf, bib]
Representing groups on graphs, with Sagarmoy Dutta. In the 34th International Symposium on Mathematical Foundation of Computer Science (MFCS) 2009, pages 295--306, [pdf, dvi, bib, arxiv]
Computing Single Source Shortest Paths using Single-Objective Fitness Functions, with Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Frank Neumann. In the 10th ACM Foundations of Genetic Algorithms (FOGA), pages 59-66 [pdf, dvi, bib].
Fast integer multiplication using modular arithmetic, with Anindya De, Chandan Saha and Ramprasad Saptharishi. In the 40th ACM Symposium on Theory of Computing (STOC) 2008 [pdf, dvi, bib, arxiv].
A polynomial time nilpotence test for Galois Groups and related results, with V. Arvind In the 31st International symposium on Mathematical Foundatations of Computer Science (MFCS), 2006 [dvi, pdf, bib, arxiv].
Bounded colour multiplicity Graph Isomorphism is in the #L-hierarchy, with V. Arvind and T. C. Vijayaraghavan. In the 20th IEEE Conference on Computational Complexity (CCC) , June 2005 [dvi, pdf, bib].
On the complexity of computing units in a number field, with V. Arvind. In the 6th Algorithmic Number Theory Symposium (ANTS), LNCS 3076, pages 72--86, June 2004. [pdf, dvi, bib]
Upper bounds on the complexity of some Galois Theory Problems. with V. Arvind. In the 14th Annual International Symposium on Algorithms and Computation (ISAAC), LNCS 2906, pages 716--725, December 2003. [pdf, dvi, bib]
Nonstabilizer Quantum Codes from Abelian Subgroups of the Error Group, with V. Arvind and K.R. Parthasarathy. In special issue dedicated to Alexander S. Holevo on his 60th birthday; Quantum Information, Statistics, Probability, Rinton Press, pages 1--29, 2004.
Journal: Quantum Information and Computation volume 4 (6,7), pages 411--436 [pdf, bib, arxiv].
Graph Isomorphism is in SPP. with V. Arvind.
Journal: Information and Computation, volume 204 (5), 2004 pages: 835-852 [pdf, dvi, bib].
Conference: In the 43rd Annual Symposium of Foundations of Computer Science (FOCS), pages 743--750. IEEE, November 2002 [pdf, dvi, bib].
Last modified on Tuesday (24 May 2011 18:18:10 UTC)