| 2008 |
|---|
| 11 | EE | Arkadev Chattopadhyay,
Anil Ada:
Multiparty Communication Complexity of Disjointness
CoRR abs/0801.3624: (2008) |
| 10 | EE | Arkadev Chattopadhyay,
Anil Ada:
Multiparty Communication Complexity of Disjointness.
Electronic Colloquium on Computational Complexity (ECCC) 15(002): (2008) |
| 2007 |
|---|
| 9 | EE | Arkadev Chattopadhyay,
Bruce A. Reed:
Properly 2-Colouring Linear Hypergraphs.
APPROX-RANDOM 2007: 395-408 |
| 8 | EE | Arkadev Chattopadhyay:
Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits.
FOCS 2007: 449-458 |
| 7 | EE | Arkadev Chattopadhyay,
Andreas Krebs,
Michal Koucký,
Mario Szegedy,
Pascal Tesson,
Denis Thérien:
Languages with Bounded Multiparty Communication Complexity.
STACS 2007: 500-511 |
| 6 | EE | Arkadev Chattopadhyay:
Discrepancy and the power of bottom fan-in in depth-three circuits.
Electronic Colloquium on Computational Complexity (ECCC) 14(050): (2007) |
| 2006 |
|---|
| 5 | EE | Arkadev Chattopadhyay,
Navin Goyal,
Pavel Pudlák,
Denis Thérien:
Lower bounds for circuits with MOD_m gates.
FOCS 2006: 709-718 |
| 4 | EE | Arkadev Chattopadhyay:
An improved bound on correlation between polynomials over Z_m and MOD_q.
Electronic Colloquium on Computational Complexity (ECCC) 13(107): (2006) |
| 3 | EE | Arkadev Chattopadhyay,
Michal Koucký,
Andreas Krebs,
Mario Szegedy,
Pascal Tesson,
Denis Thérien:
Languages with Bounded Multiparty Communication Complexity.
Electronic Colloquium on Computational Complexity (ECCC) 13(117): (2006) |
| 2005 |
|---|
| 2 | EE | Arkadev Chattopadhyay,
Kristoffer Arnsfelt Hansen:
Lower Bounds for Circuits with Few Modular and Symmetric Gates.
ICALP 2005: 994-1005 |
| 2003 |
|---|
| 1 | EE | Arkadev Chattopadhyay,
Denis Thérien:
Locally Commutative Categories.
ICALP 2003: 984-995 |
