Search results
- 1.0386317 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Ada, A. - Chattopadhyay, A. - Cook, S.A. - Fontes, L. - Koucký, Michal - Pitassi, T.
The hardness of being private.
2012 IEEE 27th Annual Conference on Computational Complexity (CCC). New York: IEEE, 2012, s. 192-202. Annual IEEE Conference on Computational Complexity. ISBN 978-0-7695-4708-4. ISSN 1093-0159.
[Computational Complexity (CCC), 2012 IEEE 27th Annual Conference. Porto (PT), 26.06.2012-29.6.2012]
R&D Projects: GA ČR GAP202/10/0854; GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : privacy * communication complexity * Vickrey auctions
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6243395
Permanent Link: http://hdl.handle.net/11104/0215655File Download Size Commentary Version Access Koucky.pdf 1 351.6 KB Publisher’s postprint require - 2.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/0147333File Download Size Commentary Version Access Koucky2.pdf 1 498.8 KB Publisher’s postprint require