The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Arkadev Chattopadhyay: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien
    Lower bounds for circuits with MOD_m gates. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:709-718 [Conf]
  2. Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen
    Lower Bounds for Circuits with Few Modular and Symmetric Gates. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:994-1005 [Conf]
  3. Arkadev Chattopadhyay, Denis Thérien
    Locally Commutative Categories. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:984-995 [Conf]
  4. Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien
    Languages with Bounded Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:500-511 [Conf]
  5. Arkadev Chattopadhyay, Bruce A. Reed
    Properly 2-Colouring Linear Hypergraphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:395-408 [Conf]

  6. Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits. [Citation Graph (, )][DBLP]


  7. Linear Systems over Composite Moduli. [Citation Graph (, )][DBLP]


  8. Multiparty Communication Complexity of Disjointness [Citation Graph (, )][DBLP]


  9. Multiparty Communication Complexity of Disjointness. [Citation Graph (, )][DBLP]


  10. Discrepancy and the power of bottom fan-in in depth-three circuits. [Citation Graph (, )][DBLP]


  11. Languages with Bounded Multiparty Communication Complexity. [Citation Graph (, )][DBLP]


  12. An improved bound on correlation between polynomials over Z_m and MOD_q. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002