Michal Koucky

Cited by

	All	Since 2016
Citations	1500	686
h-index	21	14
i10-index	34	18

160

120

200320042005200620072008200920102011201220132014201520162017201820192020202112 19 16 34 17 49 59 77 81 109 104 112 95 116 134 118 140 156 18

Co-authors

Harry BuhrmanGroup leader CWI & Distinguished Research Professor University of Amsterdam & Director QuSoftVerified email at cwi.nl
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Zvi LotkerProfessor of Communication Systems Engineering, Ben Gurion University of the NegevVerified email at bgu.ac.il
Chen AvinAssociate Professor. Communication Systems Engineering Dpt. Ben Gurion University of the Negev.Verified email at cse.bgu.ac.il
Michael SaksRutgers University-New BrunswickVerified email at math.rutgers.edu
Kristoffer Arnsfelt HansenAssociate Professor, Aarhus UniversityVerified email at cs.au.dk
Diptarka ChakrabortySchool of Computing, National University of SingaporeVerified email at comp.nus.edu.sg
Elazar GoldenbergLecturer of Computer Science at the Academic College of Tel Aviv YaffoVerified email at mta.ac.il
Bruno LoffUniversity of Porto and INESC-TecVerified email at fc.up.pt
Florian SpeelmanUniversity of Amsterdam, QuSoftVerified email at uva.nl
Lance FortnowIllinois Institute of TechnologyVerified email at iit.edu
Denis TherienVerified email at elementai.com
Noga AlonPrinceton University and Tel Aviv UniversityVerified email at tau.ac.il
Sambuddha RoyUnaffiliated - Deep Learning Consultant/PractitionerVerified email at in.ibm.com
Peter Bro MiltersenFormer Professor of Computer Science at Aarhus UniversityVerified email at cs.au.dk
Arkadev ChattopadhyayAssociate Professor at Tata Institute of Fundamental ResearchVerified email at tifr.res.in
Justin GilmerGoogleVerified email at google.com
Elias TsigaridasINRIAVerified email at inria.fr
Prajakta NimbhorkarChennai Mathematical InstituteVerified email at cmi.ac.in
Richard CleveInstitute for Quantum Computing, University of WaterlooVerified email at uwaterloo.ca

Michal Koucky

Charles University, Prague

Verified email at iuuk.mff.cuni.cz

Computational Complexity Theoretical Computer Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Many random walks are faster than one N Alon, C Avin, M Koucký, G Kozma, Z Lotker, MR Tuttle Combinatorics, Probability and Computing 20 (4), 481-502, 2011	224	2011
How to explore a fast-changing world (cover time of a simple random walk on evolving graphs) C Avin, M Koucký, Z Lotker Automata, Languages and Programming, 121-132, 2008	223	2008
Power from random strings E Allender, H Buhrman, M Koucký, D Van Melkebeek, D Ronneburger SIAM Journal on Computing 35 (6), 1467-1493, 2006	99	2006
Amplifying lower bounds by means of self-reducibility E Allender, M Koucký Journal of the ACM (JACM) 57 (3), 1-36, 2010	77	2010
Universal traversal sequences with backtracking M Koucký Journal of Computer and System Sciences 65 (4), 717-726, 2002	75	2002
Exact algorithms for solving stochastic games KA Hansen, M Koucky, N Lauritzen, PB Miltersen, EP Tsigaridas Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	53	2011
Pseudorandom generators for group products M Koucký, P Nimbhorkar, P Pudlák Proceedings of the 43rd ACM Symposium on Theory of Computing (to appear), 2011	52	2011
Streaming algorithms for embedding and computing edit distance in the low distance regime D Chakraborty, E Goldenberg, M Koucký Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016	50	2016
What can be efficiently reduced to the Kolmogorov-random strings? E Allender, H Buhrman, M Koucky Annals of Pure and Applied Logic 138 (1-3), 2-19, 2006	47*	2006
Computing with a full memory: catalytic space H Buhrman, R Cleve, M Koucký, B Loff, F Speelman Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	37	2014
Power from random strings E Allender, H Buhrman, M Koucky, D Van Melkebeek, D Ronneburger The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002 …, 2002	37	2002
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory E Allender, M Koucký, D Ronneburger, S Roy Journal of Computer and System Sciences 77 (1), 14-40, 2011	35	2011
Towards a reverse newman’s theorem in interactive information complexity J Brody, H Buhrman, M Koucký, B Loff, F Speelman, N Vereshchagin Algorithmica 76 (3), 749-781, 2016	34	2016
Winning concurrent reachability games requires doubly-exponential patience KA Hansen, M Koucky, PB Miltersen 2009 24th Annual IEEE Symposium on Logic In Computer Science, 332-341, 2009	33	2009
Time-space tradeoffs in the counting hierarchy E Allender, M Koucky, D Ronneburger, S Roy, V Vinay Proceedings 16th Annual IEEE Conference on Computational Complexity, 295-302, 2001	33	2001
Bounded-depth circuits: separating wires from gates M Koucký, P Pudlák, D Thérien Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005	28	2005
The hardness of being private A Ada, A Chattopadhyay, SA Cook, L Fontes, M Koucký, T Pitassi ACM Transactions on Computation Theory (TOCT) 6 (1), 1-24, 2014	24	2014
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates A Gál, KA Hansen, M Koucký, P Pudlák, E Viola Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	24	2012
Circuit lower bounds via Ehrenfeucht-Fraisse games M Koucky, S Poloczek, C Lautemann, D Thérien 21st Annual IEEE Conference on Computational Complexity (CCC'06), 12 pp.-201, 2006	22	2006
A new approach to the sensitivity conjecture J Gilmer, M Koucký, ME Saks Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015	21	2015

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors