Zobrazeno 1 - 10
of 221
pro vyhledávání: '"Kushilevitz, E."'
Consider the "Number in Hand" multiparty communication complexity model, where k players P 1,...,P k holding inputs x1,…,xk ¿ 0,1n(respectively) communicate in order to compute the value f(x 1,...,x k ). The main lower bound technique for the comm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::addf1b2a8a3ff9a4535f94f00d5cd77d
https://research.tue.nl/nl/publications/68ecad26-0b72-4339-8c60-1ae9b381e9ce
https://research.tue.nl/nl/publications/68ecad26-0b72-4339-8c60-1ae9b381e9ce
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x_1,..,x_k in {0, 1}^n (respectively) communicate in order to compute the value f(x_1,...,x_k). The main lower bound technique for the communi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::52dbaa82b83ee36e918e15a675a2254f
https://ir.cwi.nl/pub/14928
https://ir.cwi.nl/pub/14928
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS); 2011, p120-129, 10p
Autor:
Kushilevitz, E., Weinreb, E.
Publikováno v:
50th Annual IEEE Symposium on Foundations of Computer Science, 2009. FOCS '09; 2009, p63-72, 10p
Publikováno v:
50th Annual IEEE Symposium on Foundations of Computer Science, 2009. FOCS '09; 2009, p261-270, 10p
Publikováno v:
Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07); 2007, p278-291, 14p
Publikováno v:
20th Annual IEEE Conference on Computational Complexity (CCC'05); 2005, p260-274, 15p
Publikováno v:
45th Annual IEEE Symposium on Foundations of Computer Science; 2004, p166-175, 10p
Autor:
Ishai, Y., Kushilevitz, E.
Publikováno v:
Proceedings 41st Annual Symposium on Foundations of Computer Science; 2000, p294-304, 11p