dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Michal Koucký Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Bulánek, Michal Koucký, Michael Saks: Tight lower bounds for the online labeling problem. STOC 2012: 1185-1198
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola: Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC 2012: 479-494
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas: Exact Algorithms for Solving Stochastic Games CoRR abs/1202.3898: (2012)
2011
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas: Exact algorithms for solving stochastic games: extended abstract. STOC 2011: 205-214
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký, Prajakta Nimbhorkar, Pavel Pudlák: Pseudorandom generators for group products: extended abstract. STOC 2011: 263-272
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJan Bulánek, Michal Koucký, Michael Saks: Tight lower bounds for online labeling problem CoRR abs/1112.5636: (2011)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle: Many Random Walks Are Faster Than One. Combinatorics, Probability & Computing 20(4): 481-502 (2011)
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek: Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports 1(3): 42-66 (2011)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola: Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electronic Colloquium on Computational Complexity (ECCC) 18: 150 (2011)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. J. Comput. Syst. Sci. 77(1): 14-40 (2011)
2010
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff: Derandomizing from Random Strings. IEEE Conference on Computational Complexity 2010: 58-63
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVáclav Chudácek, Jirí Spilka, Michal Huptych, George K. Georgoulas, Petr Janku, Michal Koucký, Chrysostomos D. Stylios, Lenka Lhotská: Automatic Classification of Intrapartal Fetal Heart-Rate Recordings - Can It Compete with Experts? ITBAM 2010: 57-66
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKristoffer Arnsfelt Hansen, Michal Koucký: A New Characterization of ACC0 and Probabilistic CC0. Computational Complexity 19(2): 211-234 (2010)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Book review. Computer Science Review 4(1): 61-63 (2010)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký, Prajakta Nimbhorkar, Pavel Pudlák: Pseudorandom Generators for Group Products. Electronic Colloquium on Computational Complexity (ECCC) 17: 113 (2010)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michal Koucký: Amplifying lower bounds by means of self-reducibility. J. ACM 57(3): (2010)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin: Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Theory Comput. Syst. 46(1): 143-156 (2010)
2009
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKristoffer Arnsfelt Hansen, Michal Koucký: A New Characterization of ACC0 and Probabilistic CC0. IEEE Conference on Computational Complexity 2009: 27-34
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen: Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. LICS 2009: 332-341
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff: Derandomizing from Random Strings CoRR abs/0912.3162: (2009)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Electronic Colloquium on Computational Complexity (ECCC) 16: 51 (2009)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Circuit Complexity of Regular Languages. Theory Comput. Syst. 45(4): 865-879 (2009)
2008
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChen 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
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michal Koucký: Amplifying Lower Bounds by Means of Self-Reducibility. IEEE Conference on Computational Complexity 2008: 31-40
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Michal Koucký, Nikolai K. Vereshchagin: Randomised Individual Communication Complexity. IEEE Conference on Computational Complexity 2008: 321-331
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle: Many random walks are faster than one. SPAA 2008: 119-128
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michal Koucký: Amplifying Lower Bounds by Means of Self-Reducibility. Electronic Colloquium on Computational Complexity (ECCC) 15(038): (2008)
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna Gál, Michal Koucký, Pierre McKenzie: Incremental Branching Programs. Theory Comput. Syst. 43(2): 159-184 (2008)
2007
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin: High Entropy Random Selection Protocols. APPROX-RANDOM 2007: 366-379
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir: High Entropy Random Selection Protocols. Algebraic Methods in Computational Complexity 2007
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin: Inverting Onto Functions and Polynomial Hierarchy. CSR 2007: 92-103
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Circuit Complexity of Regular Languages. CiE 2007: 426-435
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien: Languages with Bounded Multiparty Communication Complexity. STACS 2007: 500-511
2006
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna Gál, Michal Koucký, Pierre McKenzie: Incremental Branching Programs. CSR 2006: 178-190
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna Gál, Pierre McKenzie, Michal Koucký: Incremental branching programs. Complexity of Boolean Functions 2006
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien: Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. IEEE Conference on Computational Complexity 2006: 190-201
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric 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)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHarry 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)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArkadev 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)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger: Power from Random Strings. SIAM J. Comput. 35(6): 1467-1493 (2006)
2005
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký, Pavel Pudlák, Denis Thérien: Bounded-depth circuits: separating wires from gates. STOC 2005: 257-265
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnna Gál, Michal Koucký, Pierre McKenzie: Incremental branching programs Electronic Colloquium on Computational Complexity (ECCC)(136): (2005)
2004
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Harry Buhrman, Michal Koucký: What Can be Efficiently Reduced to the K-Random Strings? STACS 2004: 584-595
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Harry Buhrman, Michal Koucký: What Can be Efficiently Reduced to the Kolmogorov-Random Strings? Electronic Colloquium on Computational Complexity (ECCC)(044): (2004)
2003
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy: Derandomization and Distinguishing Complexity. IEEE Conference on Computational Complexity 2003: 209-220
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Log-space constructible universal traversal sequences for cycles of length O(n4.03). Theor. Comput. Sci. 296(1): 117-144 (2003)
2002
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger: Power from Random Strings. FOCS 2002: 669-678
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek: Power from Random Strings Electronic Colloquium on Computational Complexity (ECCC)(028): (2002)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Universal traversal sequences with backtracking. J. Comput. Syst. Sci. 65(4): 717-726 (2002)
2001
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03). COCOON 2001: 11-20
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Universal Traversal Sequences with Backtracking. IEEE Conference on Computational Complexity 2001: 21-27
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay: Time-Space Tradeoffs in the Counting Hierarchy. IEEE Conference on Computational Complexity 2001: 295-302
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Koucký: Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) Electronic Colloquium on Computational Complexity (ECCC) 8(13): (2001)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEric 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

1Eric Allender [1] [3] [7] [8] [10] [11] [12] [15] [18] [28] [31] [34] [39] [45]
2Noga Alon [29] [48]
3Chen Avin [29] [32] [48]
4Harry Buhrman [7] [8] [11] [12] [15] [17] [18] [24] [25] [26] [30] [35] [38] [44]
5Jan Bulánek [49] [54]
6Arkadev Chattopadhyay [16] [22]
7Matthias Christandl [25] [26]
8Václav Chudácek [43]
9Lance Fortnow [17] [24] [35] [38] [44]
10Anna Gál [13] [20] [21] [27] [46] [53]
11George K. Georgoulas [43]
12Martin Grohe [47]
13Kristoffer Arnsfelt Hansen [36] [37] [42] [46] [51] [52] [53]
14Michal Huptych [43]
15Petr Janku [43]
16Gady Kozma [29] [48]
17Andreas Krebs [16] [22]
18Niels Lauritzen [51] [52]
19Clemens Lautemann [19]
20Lenka Lhotská [43]
21Bruno Loff [35] [44]
22Zvi Lotker [25] [26] [29] [32] [48]
23Pierre McKenzie [13] [20] [21] [27]
24Dieter van Melkebeek [7] [8] [15] [47]
25Peter Bro Miltersen [36] [51] [52]
26Prajakta Nimbhorkar [40] [50]
27Boaz Patt-Shamir [25] [26]
28Sebastian Poloczek [19]
29Pavel Pudlák [14] [40] [46] [50] [53]
30Rüdiger Reischuk [47]
31John D. Rogers [17] [24] [38]
32Detlef Ronneburger [1] [3] [7] [8] [10] [15] [34] [45]
33Sambuddha Roy [1] [3] [10] [34] [45]
34Michael E. Saks (Michael Saks) [49] [54]
35Jirí Spilka [43]
36Chrysostomos D. Stylios [43]
37Mario Szegedy [16] [22]
38Pascal Tesson [16] [22]
39Denis Thérien [14] [16] [19] [22]
40Elias P. Tsigaridas [51] [52]
41Mark R. Tuttle [29] [48]
42Nikolai K. Vereshchagin (Nikolay K. Vereshchagin) [17] [24] [25] [26] [30] [38]
43V. Vinay [1] [3]
44Emanuele Viola [46] [53]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page