Michal Koucký

1.4k total citations
52 papers, 449 citations indexed

About

Michal Koucký is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Michal Koucký has authored 52 papers receiving a total of 449 indexed citations (citations by other indexed papers that have themselves been cited), including 37 papers in Computational Theory and Mathematics, 36 papers in Artificial Intelligence and 10 papers in Computer Networks and Communications. Recurrent topics in Michal Koucký's work include Complexity and Algorithms in Graphs (23 papers), Computability, Logic, AI Algorithms (14 papers) and semigroups and automata theory (12 papers). Michal Koucký is often cited by papers focused on Complexity and Algorithms in Graphs (23 papers), Computability, Logic, AI Algorithms (14 papers) and semigroups and automata theory (12 papers). Michal Koucký collaborates with scholars based in Czechia, United States and Netherlands. Michal Koucký's co-authors include Eric Allender, Chen Avin, Zvi Lotker, Harry Buhrman, Noga Alon, Gady Kozma, Mark R. Tuttle, Kristoffer Arnsfelt Hansen, Dieter van Melkebeek and Pavel Pudlák and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Michal Koucký

47 papers receiving 414 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Michal Koucký Czechia	10	257	229	166	46	37	52	449
Nabil Kahalé United States	11	224 0.9×	133 0.6×	208 1.3×	25 0.5×	19 0.5×	30	533
Neil J. Calkin United States	11	240 0.9×	137 0.6×	54 0.3×	31 0.7×	34 0.9×	48	504
Luděk Kučera Czechia	8	177 0.7×	102 0.4×	75 0.5×	20 0.4×	20 0.5×	35	303
Alexander Shen France	12	392 1.5×	247 1.1×	48 0.3×	25 0.5×	48 1.3×	58	516
Marcos Kiwi Chile	9	155 0.6×	164 0.7×	40 0.2×	27 0.6×	22 0.6×	36	289
Rotem Oshman Israel	10	189 0.7×	106 0.5×	444 2.7×	31 0.7×	14 0.4×	36	533
Yuri Matiyasevich Russia	9	283 1.1×	205 0.9×	42 0.3×	26 0.6×	32 0.9×	61	473
Andreas Goerdt Germany	11	309 1.2×	186 0.8×	174 1.0×	9 0.2×	16 0.4×	23	388
Jeannette Janssen Canada	14	158 0.6×	123 0.5×	171 1.0×	170 3.7×	22 0.6×	53	539
Alexander V. Karzanov Russia	12	266 1.0×	46 0.2×	103 0.6×	20 0.4×	8 0.2×	37	409

Countries citing papers authored by Michal Koucký

Since Specialization

Citations

This map shows the geographic impact of Michal Koucký's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Michal Koucký with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Michal Koucký more than expected).

Fields of papers citing papers by Michal Koucký

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Michal Koucký. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Michal Koucký. The network helps show where Michal Koucký may publish in the future.

Co-authorship network of co-authors of Michal Koucký

This figure shows the co-authorship network connecting the top 25 collaborators of Michal Koucký. A scholar is included among the top collaborators of Michal Koucký based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Michal Koucký. Michal Koucký is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Koucký, Michal, et al.. (2023). Locally Consistent Decomposition of Strings with Applications to Edit Distance Sketching. 219–232. 3 indexed citations

Dvořák, Pavel, et al.. (2021). Data Structures Lower Bounds and Popular Conjectures. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Dvořák, Pavel & Michal Koucký. (2020). Barrington Plays Cards: The Complexity of Card-based Protocols. arXiv (Cornell University). 1 indexed citations

Buhrman, Harry, et al.. (2017). Catalytic Space: Non-determinism and Hierarchy. Theory of Computing Systems. 62(1). 116–135. 5 indexed citations

Chattopadhyay, Arkadev, et al.. (2017). Composition and Simulation Theorems via Pseudo-random Properties.. 24. 14. 1 indexed citations

Buhrman, Harry, et al.. (2016). Catalytic Space: Non-determinism and Hierarchy. UvA-DARE (University of Amsterdam). 13.

Brody, Joshua, et al.. (2016). Towards a Reverse Newman’s Theorem in Interactive Information Complexity. Algorithmica. 76(3). 749–781.

Koucký, Michal, et al.. (2015). Low Distortion Embedding from Edit to Hamming Distance using Coupling.. Electronic colloquium on computational complexity. 22. 111. 3 indexed citations

Buhrman, Harry, et al.. (2014). Computing with a full memory: Catalytic space.. Electronic colloquium on computational complexity. 21. 53. 1 indexed citations

10.

Chattopadhyay, Arkadev, et al.. (2012). The Hardness of Being Private. ASEP. 68. 192–202. 7 indexed citations

11.

Hansen, Kristoffer Arnsfelt, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, & Elias Tsigaridas. (2011). Exact algorithms for solving stochastic games. ASEP. 13 indexed citations

12.

Alon, Noga, Chen Avin, Michal Koucký, et al.. (2011). Many Random Walks Are Faster Than One. Combinatorics Probability Computing. 20(4). 481–502. 39 indexed citations

13.

Allender, Eric, et al.. (2010). The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. Journal of Computer and System Sciences. 77(1). 14–40. 1 indexed citations

14.

Hansen, Kristoffer Arnsfelt & Michal Koucký. (2009). A New Characterization of ACC^0 and Probabilistic CC^0. 9. 27–34. 6 indexed citations

15.

Allender, Eric & Michal Koucký. (2008). Amplifying Lower Bounds by Means of Self-Reducibility.. Electronic colloquium on computational complexity. 15. 1 indexed citations

16.

Buhrman, Harry, Lance Fortnow, Michal Koucký, John D. Rogers, & Nikolay Vereshchagin. (2007). Inverting Onto Functions and Polynomial Hierarchy. Lecture notes in computer science. 1 indexed citations

17.

Koucký, Michal, et al.. (2006). Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. 190–201. 6 indexed citations

18.

Allender, Eric, Harry Buhrman, & Michal Koucký. (2005). What can be efficiently reduced to the Kolmogorov-random strings?. Annals of Pure and Applied Logic. 138(1-3). 2–19. 1 indexed citations

19.

Koucký, Michal. (2002). Universal traversal sequences with backtracking. Journal of Computer and System Sciences. 65(4). 717–726. 30 indexed citations

20.

Koucký, Michal. (2001). Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n 4.03). Theoretical Computer Science. 296(1). 11–144. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact