Anil Ada

	2011
8		Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen: The NOF Multiparty Communication Complexity of Composed Functions. Electronic Colloquium on Computational Complexity (ECCC) 18: 155 (2011)
	2010
7		Anil Ada: On the Non-Deterministic Communication Complexity of Regular Languages. Int. J. Found. Comput. Sci. 21(4): 479-493 (2010)
	2008
6		Anil Ada: On the Non-deterministic Communication Complexity of Regular Languages. Developments in Language Theory 2008: 96-107
5		Arkadev Chattopadhyay, Anil Ada: Multiparty Communication Complexity of Disjointness CoRR abs/0801.3624: (2008)
4		Anil Ada: Non-Deterministic Communication Complexity of Regular Languages CoRR abs/0801.4777: (2008)
3		Arkadev Chattopadhyay, Anil Ada: Multiparty Communication Complexity of Disjointness. Electronic Colloquium on Computational Complexity (ECCC) 15(002): (2008)
	2007
2		Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu: On Bus Graph Realizability. CCCG 2007: 229-232
	2006
1		Anil Ada, Melanie Coggan, Paul Di Marco, Alain Doyon, Liam Flookes, Samuli Heilala, Ethan Kim, Jonathan Li On Wing, Louis-François Préville-Ratelle, Sue Whitesides, Nuo Yu: On Bus Graph Realizability CoRR abs/cs/0609127: (2006)

Coauthor Index

1	Arkadev Chattopadhyay	[3] [5] [8]
2	Melanie Coggan	[1] [2]
3	Alain Doyon	[1] [2]
4	Omar Fawzi	[8]
5	Liam Flookes	[1] [2]
6	Samuli Heilala	[1] [2]
7	Ethan Kim	[1] [2]
8	Paul Di Marco	[1] [2]
9	Phuong Nguyen	[8]
10	Louis-François Préville-Ratelle	[1] [2]
11	Sue Whitesides	[1] [2]
12	Jonathan Li On Wing	[1] [2]
13	Nuo Yu	[1] [2]

Colors in the list of coauthors

Last update Thu May 24 01:13:30 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page