Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Michal Koucký" ( http://dblp.L3S.de/Authors/Michal_Koucký )

  Author page on DBLP  Author page in RDF  Community of Michal Koucký in ASPL-2

Publication years (Num. hits)
2001-2006 (21) 2007-2009 (16) 2010-2012 (17)
Publication types (Num. hits)
article(27) inproceedings(27)
Venues (Conferences, Journals, ...)
Electronic Colloquium on Compu...(11) IEEE Conference on Computation...(8) STOC(5) CoRR(3) Theory Comput. Syst.(3) CSR(2) J. Comput. Syst. Sci.(2) STACS(2) Algebraic Methods in Computati...(1) Ann. Pure Appl. Logic(1) APPROX-RANDOM(1) CiE(1) COCOON(1) Combinatorics, Probability & C...(1) Complexity of Boolean Function...(1) Computational Complexity(1) More (+10 of total 26)
Authors
Michal Koucký(54) Eric Allender(14) Harry Buhrman(14) Detlef Ronneburger(8) Kristoffer Arnsfelt Hansen(7) Anna Gál(6) Nikolai K. Vereshchagin(6) Lance Fortnow(5) Pavel Pudlák(5) Sambuddha Roy(5) Zvi Lotker(5) Denis Thérien(4) Dieter van Melkebeek(4) Pierre McKenzie(4) Chen Avin(3) John D. Rogers(3) More (+10 of total 45)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 24 occurrences of 18 keywords
Results
Found 54 publication records. Showing 54 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas Exact Algorithms for Solving Stochastic Games Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Jan Bulánek, Michal Koucký, Michael Saks Tight lower bounds for the online labeling problem. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anna 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. Search on Bibsonomy STOC The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Anna 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. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2011 DBLP  BibTeX  RDF
1Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle Many Random Walks Are Faster Than One. Search on Bibsonomy Combinatorics, Probability & Computing The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Jan Bulánek, Michal Koucký, Michael Saks Tight lower bounds for online labeling problem Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák Pseudorandom generators for group products: extended abstract. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas Exact algorithms for solving stochastic games: extended abstract. Search on Bibsonomy STOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michal Koucký Book review. Search on Bibsonomy Computer Science Review The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák Pseudorandom Generators for Group Products. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2010 DBLP  BibTeX  RDF
1Eric Allender, Michal Koucký Amplifying lower bounds by means of self-reducibility. Search on Bibsonomy J. ACM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Kristoffer Arnsfelt Hansen, Michal Koucký A New Characterization of ACC0 and Probabilistic CC0. Search on Bibsonomy Computational Complexity The full citation details ... 2010 DBLP  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Vá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? Search on Bibsonomy ITBAM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff Derandomizing from Random Strings. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Truth-table Reducibility, Kolmogorov Complexity, Derandomization
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2009 DBLP  BibTeX  RDF
1Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff Derandomizing from Random Strings Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Michal Koucký Circuit Complexity of Regular Languages. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Circuit complexity, Regular languages, Upper and lower bounds
1Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. Search on Bibsonomy LICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Kristoffer Arnsfelt Hansen, Michal Koucký A New Characterization of ACC0 and Probabilistic CC0. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michal Koucký Amplifying Lower Bounds by Means of Self-Reducibility. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2008 DBLP  BibTeX  RDF
1Anna Gál, Michal Koucký, Pierre McKenzie Incremental Branching Programs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Chen Avin, Michal Koucký, Zvi Lotker How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). Search on Bibsonomy ICALP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle Many random walks are faster than one. Search on Bibsonomy SPAA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF distributed algorithms, random walks, graph search, speed-up, cover time
1Eric Allender, Michal Koucký Amplifying Lower Bounds by Means of Self-Reducibility. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF self-reducibility, lower bounds, circuit complexity
1Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin Randomised Individual Communication Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2008 DBLP  DOI  BibTeX  RDF individual communication complexity, Kolmogorov complexity, rounds, randomized protocols
1Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin Inverting Onto Functions and Polynomial Hierarchy. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien Languages with Bounded Multiparty Communication Complexity. Search on Bibsonomy STACS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir High Entropy Random Selection Protocols. Search on Bibsonomy Algebraic Methods in Computational Complexity The full citation details ... 2007 DBLP  BibTeX  RDF
1Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin High Entropy Random Selection Protocols. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Michal Koucký Circuit Complexity of Regular Languages. Search on Bibsonomy CiE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF circuit complexity, regular languages
1Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin Inverting onto functions might not be hard. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien Languages with Bounded Multiparty Communication Complexity. Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2006 DBLP  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký What can be efficiently reduced to the Kolmogorov-random strings? Search on Bibsonomy Ann. Pure Appl. Logic The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Anna Gál, Michal Koucký, Pierre McKenzie Incremental Branching Programs. Search on Bibsonomy CSR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Anna Gál, Pierre McKenzie, Michal Koucký Incremental branching programs. Search on Bibsonomy Complexity of Boolean Functions The full citation details ... 2006 DBLP  BibTeX  RDF
1Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Anna Gál, Michal Koucký, Pierre McKenzie Incremental branching programs Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1Michal Koucký, Pavel Pudlák, Denis Thérien Bounded-depth circuits: separating wires from gates. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF communication, complexity, lower bounds, regular languages, wires, constant-depth circuits, gates
1Eric Allender, Harry Buhrman, Michal Koucký What Can be Efficiently Reduced to the Kolmogorov-Random Strings? Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2004 DBLP  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký What Can be Efficiently Reduced to the K-Random Strings? Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michal Koucký Log-space constructible universal traversal sequences for cycles of length O(n4.03). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy Derandomization and Distinguishing Complexity. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek Power from Random Strings Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2002 DBLP  BibTeX  RDF
1Michal Koucký Universal traversal sequences with backtracking. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger Power from Random Strings. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay Time-Space Tradeoffs in the Counting Hierarchy Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Michal Koucký Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03) Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Michal Koucký Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03). Search on Bibsonomy COCOON The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Michal Koucký Universal Traversal Sequences with Backtracking. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay Time-Space Tradeoffs in the Counting Hierarchy. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #54 of 54 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.