0084614 - MÚ 2008 RIV DE eng C - Conference Paper (international conference)
Chattopadhyay, A. - Koucký, Michal - Krebs, A. - Szegedy, M. - Tesson, P. - Thérien, D.Languages with Bounded Multiparty Communication Complexity.
[Jazyky s omezenou komunikační složitostí pro více hráčů.]
Proceeding of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2007. Berlin: Springer-Verlag, 2007 - (Thomas, W.; Weil, P.), s. 500-511. Lecture Notes in Computer Science, 4393. ISBN 978-3-540-70917-6.
[Annual Symposium on Theoretical Aspects of Computer Science (STACS). Aachen (DE), 22.02.2007-24.02.2007]
R&D Projects: GA ČR GA201/05/0124
Institutional research plan: CEZ:AV0Z10190503
Keywords : communication complexity * codes * Ramsey theory
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0147333
