The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Michal Koucký: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
    Derandomization and Distinguishing Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:209-220 [Conf]
  2. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
    Time-Space Tradeoffs in the Counting Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:295-302 [Conf]
  3. Michal Koucký
    Universal Traversal Sequences with Backtracking. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:21-27 [Conf]
  4. Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
    Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:190-201 [Conf]
  5. Michal Koucký
    Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03). [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:11-20 [Conf]
  6. Anna Gál, Michal Koucký, Pierre McKenzie
    Incremental Branching Programs. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:178-190 [Conf]
  7. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
    Power from Random Strings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:669-678 [Conf]
  8. Eric Allender, Harry Buhrman, Michal Koucký
    What Can be Efficiently Reduced to the K-Random Strings? [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:584-595 [Conf]
  9. Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien
    Languages with Bounded Multiparty Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:500-511 [Conf]
  10. Michal Koucký, Pavel Pudlák, Denis Thérien
    Bounded-depth circuits: separating wires from gates. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:257-265 [Conf]
  11. Eric Allender, Harry Buhrman, Michal Koucký
    What can be efficiently reduced to the Kolmogorov-random strings? [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:2-19 [Journal]
  12. Michal Koucký
    Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:13, pp:- [Journal]
  13. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
    Time-Space Tradeoffs in the Counting Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:41, pp:- [Journal]
  14. Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek
    Power from Random Strings [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:028, pp:- [Journal]
  15. Eric Allender, Harry Buhrman, Michal Koucký
    What Can be Efficiently Reduced to the Kolmogorov-Random Strings? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:044, pp:- [Journal]
  16. Anna Gál, Michal Koucký, Pierre McKenzie
    Incremental branching programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:136, pp:- [Journal]
  17. Michal Koucký
    Universal traversal sequences with backtracking. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:717-726 [Journal]
  18. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
    Power from Random Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1467-1493 [Journal]
  19. Michal Koucký
    Log-space constructible universal traversal sequences for cycles of length O(n4.03). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:296, n:1, pp:117-144 [Journal]
  20. Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin
    High Entropy Random Selection Protocols. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:366-379 [Conf]
  21. Michal Koucký
    Circuit Complexity of Regular Languages. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:426-435 [Conf]
  22. Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin
    Inverting Onto Functions and Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:92-103 [Conf]

  23. Randomised Individual Communication Complexity. [Citation Graph (, )][DBLP]


  24. Amplifying Lower Bounds by Means of Self-Reducibility. [Citation Graph (, )][DBLP]


  25. A New Characterization of ACC0 and Probabilistic CC0. [Citation Graph (, )][DBLP]


  26. Derandomizing from Random Strings. [Citation Graph (, )][DBLP]


  27. Incremental branching programs. [Citation Graph (, )][DBLP]


  28. High Entropy Random Selection Protocols. [Citation Graph (, )][DBLP]


  29. How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). [Citation Graph (, )][DBLP]


  30. Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. [Citation Graph (, )][DBLP]


  31. Many random walks are faster than one. [Citation Graph (, )][DBLP]


  32. Automatic Classification of Intrapartal Fetal Heart-Rate Recordings - Can It Compete with Experts? [Citation Graph (, )][DBLP]


  33. A New Characterization of ACC0 and Probabilistic CC0. [Citation Graph (, )][DBLP]


  34. Derandomizing from Random Strings [Citation Graph (, )][DBLP]


  35. Amplifying Lower Bounds by Means of Self-Reducibility. [Citation Graph (, )][DBLP]


  36. Inverting onto functions might not be hard. [Citation Graph (, )][DBLP]


  37. Languages with Bounded Multiparty Communication Complexity. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002