Search for publications:
Home
Publications
About
Login
Activate Account
Publications
Search
Publications :: Search
Basic Search
Advanced Search
Author Info
Show author
On this page you see the details of the selected author.
Author information
First name:
Partha
Last name:
Mukhopadhyay
DBLP:
16/1565
Rating:
(not rated yet)
Bookmark:
Below you find the publications which have been written by this author.
Show item
1
to
25
of
26
Select a publication
Show
Title
Venue
Rating
Date
Journal article
Guy N. Brock
,
Partha Mukhopadhyay
,
Vasyl Pihur
,
Cynthia Webb
,
Robert M. Greene
,
M. Michele Pisano
.
MmPalateMiRNA, an R package compendium illustrating analysis of miRNA microarray data.
Source Code for Biology and Medicine 2013, Volume 8
(0)
2013
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Prajakta Nimbhorkar
.
Erd?s-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs.
LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings 2012
(0)
2012
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Prajakta Nimbhorkar
,
Yadu Vasudev
.
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.
Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings 2012
(0)
2012
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Prajakta Nimbhorkar
,
Yadu Vasudev
.
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
CoRR 2012, Volume 0
(0)
2012
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Prajakta Nimbhorkar
.
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 2011, Volume 18
(0)
2011
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Prajakta Nimbhorkar
,
Yadu Vasudev
.
Expanding Generator Sets for Solvable Permutation Groups.
Electronic Colloquium on Computational Complexity (ECCC) 2011, Volume 18
(0)
2011
Conference paper
Zohar Shay Karnin
,
Partha Mukhopadhyay
,
Amir Shpilka
,
Ilya Volkovich
.
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in.
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 2010
(0)
2010
Conference paper
Vikraman Arvind
,
Bireswar Das
,
Partha Mukhopadhyay
.
Isomorphism and canonization of tournaments and hypertournaments.
J. Comput. Syst. Sci. 2010, Volume 76
(0)
2010
Journal article
Shachar Lovett
,
Partha Mukhopadhyay
,
Amir Shpilka
.
Pseudorandom generators for CC
Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17
(0)
2010
Conference paper
Shachar Lovett
,
Partha Mukhopadhyay
,
Amir Shpilka
.
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields.
51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA 2010
(0)
2010
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Srikanth Srinivasan
.
New Results on Noncommutative and Commutative Polynomial Identity Testing.
Computational Complexity 2010, Volume 19
(0)
2010
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
The ideal membership problem and polynomial identity testing.
Inf. Comput. 2010, Volume 208
(0)
2010
Journal article
Zohar Shay Karnin
,
Partha Mukhopadhyay
,
Amir Shpilka
,
Ilya Volkovich
.
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in.
Electronic Colloquium on Computational Complexity (ECCC) 2009, Volume 16
(0)
2009
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
Quantum Query Complexity of Multilinear Identity Testing.
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings 2009
(0)
2009
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings 2008
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Srikanth Srinivasan
.
New Results on Noncommutative and Commutative Polynomial Identity Testing.
Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA 2008
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Srikanth Srinivasan
.
New results on Noncommutative and Commutative Polynomial Identity Testing
CoRR 2008, Volume 0
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
CoRR 2008, Volume 0
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
Quantum Query Complexity of Multilinear Identity Testing
CoRR 2008, Volume 0
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
,
Srikanth Srinivasan
.
New results on Noncommutative and Commutative Polynomial Identity Testing.
Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size.
Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
Quantum Query Complexity of Multilinear Identity Testing.
Electronic Colloquium on Computational Complexity (ECCC) 2008, Volume 15
(0)
2008
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
The Monomial Ideal Membership Problem and Polynomial Identity Testing.
Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings 2007
(0)
2007
Conference paper
Vikraman Arvind
,
Partha Mukhopadhyay
.
The Ideal Membership Problem and Polynomial Identity Testing.
Electronic Colloquium on Computational Complexity (ECCC) 2007, Volume 14
(0)
2007
Conference paper
Vikraman Arvind
,
Bireswar Das
,
Partha Mukhopadhyay
.
The Complexity of Black-Box Ring Problems.
Computing and Combinatorics, 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings 2006
(0)
2006
Show item
1
to
25
of
26
Your query returned
26
matches in the database.