Partha Mukhopadhyay Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: Quantum Query Complexity of Multilinear Identity Testing. STACS 2009: 87-98
2008
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. APPROX-RANDOM 2008: 276-289
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan: New Results on Noncommutative and Commutative Polynomial Identity Testing. IEEE Conference on Computational Complexity 2008: 268-279
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan: New results on Noncommutative and Commutative Polynomial Identity Testing CoRR abs/0801.0514: (2008)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size CoRR abs/0804.0957: (2008)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: Quantum Query Complexity of Multilinear Identity Testing CoRR abs/0807.1412: (2008)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan: New results on Noncommutative and Commutative Polynomial Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 15(025): (2008)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. Electronic Colloquium on Computational Complexity (ECCC) 15(049): (2008)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: Quantum Query Complexity of Multilinear Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 15(086): (2008)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: The Monomial Ideal Membership Problem and Polynomial Identity Testing. ISAAC 2007: 800-811
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Partha Mukhopadhyay: The Ideal Membership Problem and Polynomial Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 14(095): (2007)
2006
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Bireswar Das, Partha Mukhopadhyay: The Complexity of Black-Box Ring Problems. COCOON 2006: 126-135
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVikraman Arvind, Bireswar Das, Partha Mukhopadhyay: On Isomorphism and Canonization of Tournaments and Hypertournaments. ISAAC 2006: 449-459

Coauthor Index

1Vikraman Arvind [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]
2Bireswar Das [1] [2]
3Srikanth Srinivasan [7] [10] [11]

Copyright © Tue Dec 1 12:01:14 2009 by Michael Ley (ley@uni-trier.de)