Author of the publication

On the Non-Deterministic Communication Complexity of Regular Languages.

. Int. J. Found. Comput. Sci., 21 (4): 479-493 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Hardness of Being Private., , , , , and . CCC, page 192-202. IEEE Computer Society, (2012)The NOF Multiparty Communication Complexity of Composed Functions., , , and . Comput. Complex., 24 (3): 645-694 (2015)The NOF Multiparty Communication Complexity of Composed Functions., , , and . Electron. Colloquium Comput. Complex., (2011)On the Non-Deterministic Communication Complexity of Regular Languages.. Int. J. Found. Comput. Sci., 21 (4): 479-493 (2010)The NOF Multiparty Communication Complexity of Composed Functions., , , and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 13-24. Springer, (2012)On the Non-deterministic Communication Complexity of Regular Languages.. Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, page 96-107. Springer, (2008)On Bus Graph Realizability, , , , , , , , , and 1 other author(s). CoRR, (2006)The Hardness of Being Private., , , , , and . ACM Trans. Comput. Theory, 6 (1): 1:1-1:24 (2014)Multiparty Communication Complexity of Disjointness., and . Electron. Colloquium Comput. Complex., (2008)On Bus Graph Realizability., , , , , , , , , and 1 other author(s). CCCG, page 229-232. Carleton University, Ottawa, Canada, (2007)