Michal Koucký

	2008
32		Chen Avin, Michal Koucký, Zvi Lotker: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ICALP (1) 2008: 121-132
31		Eric Allender, Michal Koucký: Amplifying Lower Bounds by Means of Self-Reducibility. IEEE Conference on Computational Complexity 2008: 31-40
30		Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin: Randomised Individual Communication Complexity. IEEE Conference on Computational Complexity 2008: 321-331
29		Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle: Many random walks are faster than one. SPAA 2008: 119-128
28		Eric Allender, Michal Koucký: Amplifying Lower Bounds by Means of Self-Reducibility. Electronic Colloquium on Computational Complexity (ECCC) 15(038): (2008)
27		Anna Gál, Michal Koucký, Pierre McKenzie: Incremental Branching Programs. Theory Comput. Syst. 43(2): 159-184 (2008)
	2007
26		Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin: High Entropy Random Selection Protocols. APPROX-RANDOM 2007: 366-379
25		Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir: High Entropy Random Selection Protocols. Algebraic Methods in Computational Complexity 2007
24		Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin: Inverting Onto Functions and Polynomial Hierarchy. CSR 2007: 92-103
23		Michal Koucký: Circuit Complexity of Regular Languages. CiE 2007: 426-435
22		Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien: Languages with Bounded Multiparty Communication Complexity. STACS 2007: 500-511
	2006
21		Anna Gál, Michal Koucký, Pierre McKenzie: Incremental Branching Programs. CSR 2006: 178-190
20		Anna Gál, Pierre McKenzie, Michal Koucký: Incremental branching programs. Complexity of Boolean Functions 2006
19		Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien: Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. IEEE Conference on Computational Complexity 2006: 190-201
18		Eric Allender, Harry Buhrman, Michal Koucký: What can be efficiently reduced to the Kolmogorov-random strings? Ann. Pure Appl. Logic 138(1-3): 2-19 (2006)
17		Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin: Inverting onto functions might not be hard. Electronic Colloquium on Computational Complexity (ECCC) 13(024): (2006)
16		Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien: Languages with Bounded Multiparty Communication Complexity. Electronic Colloquium on Computational Complexity (ECCC) 13(117): (2006)
15		Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger: Power from Random Strings. SIAM J. Comput. 35(6): 1467-1493 (2006)
	2005
14		Michal Koucký, Pavel Pudlák, Denis Thérien: Bounded-depth circuits: separating wires from gates. STOC 2005: 257-265
13		Anna Gál, Michal Koucký, Pierre McKenzie: Incremental branching programs Electronic Colloquium on Computational Complexity (ECCC)(136): (2005)
	2004
12		Eric Allender, Harry Buhrman, Michal Koucký: What Can be Efficiently Reduced to the K-Random Strings? STACS 2004: 584-595
11		Eric Allender, Harry Buhrman, Michal Koucký: What Can be Efficiently Reduced to the Kolmogorov-Random Strings? Electronic Colloquium on Computational Complexity (ECCC)(044): (2004)
	2003
10		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: Derandomization and Distinguishing Complexity. IEEE Conference on Computational Complexity 2003: 209-220
9		Michal Koucký: Log-space constructible universal traversal sequences for cycles of length O(n4.03). Theor. Comput. Sci. 296(1): 117-144 (2003)
	2002
8		Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger: Power from Random Strings. FOCS 2002: 669-678
7		Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek: Power from Random Strings Electronic Colloquium on Computational Complexity (ECCC)(028): (2002)
6		Michal Koucký: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65(4): 717-726 (2002)
	2001
5		Michal Koucký: Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03). COCOON 2001: 11-20
4		Michal Koucký: Universal Traversal Sequences with Backtracking. IEEE Conference on Computational Complexity 2001: 21-27
3		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy. IEEE Conference on Computational Complexity 2001: 295-302
2		Michal Koucký: Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) Electronic Colloquium on Computational Complexity (ECCC) 8(13): (2001)
1		Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy Electronic Colloquium on Computational Complexity (ECCC) 8(41): (2001)

Coauthor Index

1	Eric Allender	[1] [3] [7] [8] [10] [11] [12] [15] [18] [28] [31]
2	Noga Alon	[29]
3	Chen Avin	[29] [32]
4	Harry Buhrman	[7] [8] [11] [12] [15] [17] [18] [24] [25] [26] [30]
5	Arkadev Chattopadhyay	[16] [22]
6	Matthias Christandl	[25] [26]
7	Lance Fortnow	[17] [24]
8	Anna Gál	[13] [20] [21] [27]
9	Gady Kozma	[29]
10	Andreas Krebs	[16] [22]
11	Clemens Lautemann	[19]
12	Zvi Lotker	[25] [26] [29] [32]
13	Pierre McKenzie	[13] [20] [21] [27]
14	Dieter van Melkebeek	[7] [8] [15]
15	Boaz Patt-Shamir	[25] [26]
16	Sebastian Poloczek	[19]
17	Pavel Pudlák	[14]
18	John D. Rogers	[17] [24]
19	Detlef Ronneburger	[1] [3] [7] [8] [10] [15]
20	Sambuddha Roy	[1] [3] [10]
21	Mario Szegedy	[16] [22]
22	Pascal Tesson	[16] [22]
23	Denis Thérien	[14] [16] [19] [22]
24	Mark R. Tuttle	[29]
25	Nikolai K. Vereshchagin	[17] [24] [25] [26] [30]
26	V. Vinay	[1] [3]