Search results
- 1.0422288 - MÚ 2014 RIV US eng C - Conference Paper (international conference)
Brody, J. - Buhrman, H. - Koucký, Michal - Loff, B. - Speelman, F. - Vereshchagin, N.K.
Towards a reverse Newman's theorem in interactive information complexity.
IEEE Conference on Computational Complexity 2013. Washington: IEEE, 2013, s. 24-33. ISBN 978-1-4673-6466-9.
[IEEE Conference on Computational Complexity 2013. Palo Alto (US), 05.06.2013-07.06.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : comlexity theory * communication complexity * interactive information complexity
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6597746
Permanent Link: http://hdl.handle.net/11104/0228474File Download Size Commentary Version Access Koucky1.pdf 1 260.9 KB Publisher’s postprint require - 2.0395301 - MÚ 2014 RIV DE eng C - Conference Paper (international conference)
Bulánek, Jan - Koucký, Michal - Saks, M.
On randomized online labeling with polynomially many labels.
Automata, Languages, and Programming. Part I. Berlin: Springer, 2013 - (Fomin, F.; Freivalds, R.; Kwiatkowska, M.; Peleg, D.), s. 291-302. Lecture Notes in Computer Science, 7965. ISBN 978-3-642-39205-4.
[International Colloquium, ICALP 2013 /40./. Riga (LT), 08.07.2013-12.07.2013]
R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061
Institutional support: RVO:67985840
Keywords : online labeling * complexity
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007%2F978-3-642-39206-1_25
Permanent Link: http://hdl.handle.net/11104/0223374File Download Size Commentary Version Access Bulanek1.pdf 1 221.1 KB Publisher’s postprint require - 3.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 - 4.0386313 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Bulánek, Jan - Koucký, Michal - Saks, M.
Tight lower bounds for the online labeling problem.
Proceedings of the 44th Symposium on Theory of Computing, STOC'2012. New York: ACM, 2012 - (Karloff, H.; Pitassi, T.), s. 1185-1198. ISBN 978-1-4503-1245-5.
[STOC'12 Symposium on Theory of Computing Conference /44./. New York (US), 19.05.2012-22.05.2012]
R&D Projects: GA ČR GAP202/10/0854
Institutional support: RVO:67985840
Keywords : online labeling * file maintenance problem * lower bounds
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?id=2213977.2214083&coll=DL&dl=GUIDE&CFID=245194486&CFTOKEN=14126751
Permanent Link: http://hdl.handle.net/11104/0219391File Download Size Commentary Version Access Koucky2.pdf 10 315.4 KB Author’s postprint require - 5.0386309 - MÚ 2013 RIV US eng C - Conference Paper (international conference)
Gál, A. - Hansen, K.A. - Koucký, Michal - Pudlák, Pavel - Viola, E.
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
Proceedings of the 44th Symposium on Theory of Computing, STOC'2012. New York: ACM, 2012 - (Karloff, H.; Pitassi, T.), s. 479-494. ISBN 978-1-4503-1245-5.
[STOC'12 Symposium on Theory of Computing Conference /44./. New York (US), 19.05.2012-22.05.2012]
R&D Projects: GA ČR GBP202/12/G061; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional support: RVO:67985840
Keywords : error correcting codes * bounded depth circuits * superconcentrators
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?id=2213977.2214023&coll=DL&dl=GUIDE&CFID=245194486&CFTOKEN=14126751
Permanent Link: http://hdl.handle.net/11104/0219390File Download Size Commentary Version Access Koucky3.pdf 1 287.1 KB Author’s postprint require - 6.0382019 - MÚ 2013 RIV DE eng C - Conference Paper (international conference)
Babka, M. - Bulánek, Jan - Čunát, V. - Koucký, Michal - Saks, M.
On online labeling with polynomially many labels.
Algorithms – ESA 2012 : 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Berlin: Springer, 2012 - (Epstein, L.; Ferragina, P.), s. 121-132. Lecture Notes in Computer Science, 7501. ISBN 978-3-642-33089-6.
[20th Annual European Symposium on Algorithms (ESA 2012). Ljubljana (SI), 10.09.2012-12.09.2012]
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institutional support: RVO:67985840
Keywords : online labeling * file maintenance problem * lower bounds
Subject RIV: BA - General Mathematics
http://link.springer.com/chapter/10.1007/978-3-642-33090-2_12
Permanent Link: http://hdl.handle.net/11104/0215656File Download Size Commentary Version Access Koucky1.pdf 1 235.2 KB Publisher’s postprint require - 7.0371063 - MÚ 2012 RIV US eng C - Conference Paper (international conference)
Koucký, Michal - Nimbhorkar, Prajakta - Pudlák, Pavel
Pseudorandom generators for group products.
Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC 2011). New York: ACM, 2011 - (Fortnow, L.; Vadhan, S.), s. 263-272. ISBN 978-1-4503-0691-1.
[STOC 2011. Symposium on Theory of Computing /43./. San Jose (US), 06.06.2011-08.06.2011]
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : pseudorandom generators * permutation branching programs * finite groups
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=1993636.1993672
Permanent Link: http://hdl.handle.net/11104/0204694File Download Size Commentary Version Access Koucky3.pdf 14 291.8 KB Author’s postprint require - 8.0369977 - MÚ 2012 RIV US eng C - Conference Paper (international conference)
Hansen, A. K. - Koucký, Michal - Lauritzen, N. - Miltersen, P.B. - Tsigaridas, E.P.
Exact algorithms for solving stochastic games.
Proceedings of the 43rd annual ACM Symposium on Theory of Computing (STOC 2011). New York: ACM, 2011 - (Fortnow, L.; Vadhan, S.), s. 205-214. ISBN 978-1-4503-0691-1.
[43rd annual ACM symposium on Theory of computing (STOC 2011). San José (US), 06.06.2011-08.06.2011]
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : stochastic games * recursive games * algorithms
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=1993636.1993665
Permanent Link: http://hdl.handle.net/11104/0203909File Download Size Commentary Version Access Koucky2.pdf 1 457.5 KB Author’s postprint require - 9.0352483 - MÚ 2011 RIV US eng C - Conference Paper (international conference)
Buhrman, H. - Fortnow, L. - Koucký, Michal - Loff, B.
Derandomizing from random strings.
Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010. Los Alamitos: IEEE Computer Society 2010, 2010, s. 58-63. ISBN 978-0-7695-4060-3.
[25th Annual IEEE Conference on Computational Complexity, CCC 2010. Cambridge (US), 09.06.2010-12.06.2010]
R&D Projects: GA ČR GAP202/10/0854; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : Kolmogorov random strings * reducibility * complexity classes
Subject RIV: BA - General Mathematics
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5497897
Permanent Link: http://hdl.handle.net/11104/0191982File Download Size Commentary Version Access Koucky1.pdf 1 337.3 KB Publisher’s postprint require - 10.0336102 - MÚ 2010 RIV US eng C - Conference Paper (international conference)
Hansen, K.A. - Koucký, Michal
A new characterization of ACC(0) and probabilistic CC0.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity. Los Alamitos: IEEE Computer Society, 2009, s. 27-34. ISBN 978-0-7695-3717-7. ISSN 1093-0159.
[24th Annual IEEE Conference on Computational Complexity. Paris (FR), 15.07.2009-18.07.2009]
R&D Projects: GA ČR GP201/07/P276; GA AV ČR IAA100190902; GA MŠMT(CZ) 1M0545
Institutional research plan: CEZ:AV0Z10190503
Keywords : bounded depth circuits * counting circuits
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0180415File Download Size Commentary Version Access Koucky.pdf 1 343.6 KB Publisher’s postprint require