The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Arkadev Chattopadhyay" ( http://dblp.L3S.de/Authors/Arkadev_Chattopadhyay )

  Author page on DBLP  Author page in RDF  Community of Arkadev Chattopadhyay in ASPL-2

Publication years (Num. hits)
2003-2010 (17) 2011-2012 (5)
Publication types (Num. hits)
article(11) inproceedings(11)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 2 occurrences of 2 keywords

Results
Found 22 publication records. Showing 22 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Arkadev Chattopadhyay, Jeff Edmonds, Faith Ellen, Toniann Pitassi A little advice can be very helpful. Search on Bibsonomy SODA The full citation details ... 2012 DBLP  BibTeX  RDF
1Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen The NOF Multiparty Communication Complexity of Composed Functions. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Shachar Lovett Linear systems over abelian groups. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Search on Bibsonomy CSR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Shachar Lovett Linear Systems over Finite Abelian Groups. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner Graph Isomorphism is not AC^0 reducible to Group Isomorphism. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay Multilinear Polynomials Modulo Composites. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2010 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Toniann Pitassi The story of set disjointness. Search on Bibsonomy SIGACT News The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Jacobo Torán, Fabian Wagner Graph Isomorphism is not AC^0 reducible to Group Isomorphism. Search on Bibsonomy FSTTCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Avi Wigderson Linear systems over composite moduli. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Avi Wigderson Linear Systems over Composite Moduli. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Boolean circuit complexity, modular gates, matrix rigidity, exponential sums, constant-depth circuits
1Arkadev Chattopadhyay, Anil Ada Multiparty Communication Complexity of Disjointness. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Anil Ada Multiparty Communication Complexity of Disjointness Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay Discrepancy and the power of bottom fan-in in depth-three circuits. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2007 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien Languages with Bounded Multiparty Communication Complexity. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Bruce A. Reed Properly 2-Colouring Linear Hypergraphs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien Languages with Bounded Multiparty Communication Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay An improved bound on correlation between polynomials over Z_m and MOD_q. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien Lower bounds for circuits with MOD_m gates. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen Lower Bounds for Circuits with Few Modular and Symmetric Gates. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Denis Thérien Locally Commutative Categories. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #22 of 22 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.