 | 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-Francois Preville-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-Francois Preville-Ratelle,
Sue Whitesides,
Nuo Yu:
On Bus Graph Realizability
CoRR abs/cs/0609127: (2006) |
