From post

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.

 

Другие публикации лиц с тем же именем

The Hardness of Being Private., , , , , и . CCC, стр. 192-202. IEEE Computer Society, (2012)The NOF Multiparty Communication Complexity of Composed Functions., , , и . Comput. Complex., 24 (3): 645-694 (2015)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., , , и . Electron. Colloquium Comput. Complex., (2011)On the Non-deterministic Communication Complexity of Regular Languages.. Developments in Language Theory, том 5257 из Lecture Notes in Computer Science, стр. 96-107. Springer, (2008)The NOF Multiparty Communication Complexity of Composed Functions., , , и . ICALP (1), том 7391 из Lecture Notes in Computer Science, стр. 13-24. Springer, (2012)The Hardness of Being Private., , , , , и . ACM Trans. Comput. Theory, 6 (1): 1:1-1:24 (2014)Multiparty Communication Complexity of Disjointness., и . Electron. Colloquium Comput. Complex., (2008)On Bus Graph Realizability, , , , , , , , , и 1 other автор(ы). CoRR, (2006)On Bus Graph Realizability., , , , , , , , , и 1 other автор(ы). CCCG, стр. 229-232. Carleton University, Ottawa, Canada, (2007)