Michal Koucký

141 papers A* 20A 22B 3C 1Misc 3Journal 83Unranked 8

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Frontier Space-Time Algorithms Using Only Full Memory. CoRR Petr Chmel, Aditi Dudeja, Michal Koucký, Ian Mertz, Ninad Rajgopal
2025	A*	`conf`	Collapsing Catalytic Classes. FOCS Michal Koucký, Ian Mertz, Edward Pyne, Sasha Sami
2025	J	`jnl`	Collapsing Catalytic Classes. CoRR Michal Koucký, Ian Mertz, Edward Pyne, Sasha Sami
2025	J	`jnl`	Collapsing Catalytic Classes. Electron. Colloquium Comput. Complex. Michal Koucký, Ian Mertz, Edward Pyne, Sasha Sami
2025	J	`jnl`	Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric. CoRR Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. S., Michal Koucký
2025	A*	`ed.`	Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, Prague, Czechia, June 23-27, 2025 STOC Michal Koucký, Nikhil Bansal
2024	A*	`conf`	Almost Linear Size Edit Distance Sketch. STOC Michal Koucký, Michael E. Saks
2024	J	`jnl`	Almost Linear Size Edit Distance Sketch. CoRR Michal Koucký, Michael Saks
2024	—	`conf`	Many Flavors of Edit Distance. FSTTCS Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Michal Koucký
2024	J	`jnl`	Many Flavors of Edit Distance. CoRR Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Michal Koucký
2024	A*	`conf`	Nearly Optimal List Labeling. FOCS Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks
2024	J	`jnl`	Nearly Optimal List Labeling. CoRR Michael A. Bender, Alex Conway, Martín Farach-Colton, Hanna Komlós, Michal Koucký, William Kuszmaul, Michael E. Saks
2024	J	`jnl`	SquareSort: a cache-oblivious sorting algorithm. CoRR Michal Koucký, Josef Matejka
2023	J	`jnl`	Automata and Formal Languages: Shall we let them go? Bull. EATCS Michal Koucký
2023	A*	`conf`	Locally Consistent Decomposition of Strings with Applications to Edit Distance Sketching. STOC Sudatta Bhattacharya, Michal Koucký
2023	J	`jnl`	Locally consistent decomposition of strings with applications to edit distance sketching. CoRR Sudatta Bhattacharya, Michal Koucký
2023	A*	`conf`	Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance. SODA Michal Koucký, Michael E. Saks
2023	A*	`conf`	Streaming k-Edit Approximate Pattern Matching via String Decomposition. ICALP Sudatta Bhattacharya, Michal Koucký
2023	J	`jnl`	Streaming k-edit approximate pattern matching via string decomposition. CoRR Sudatta Bhattacharya, Michal Koucký
2021	J	`jnl`	A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. CoRR Michal Koucký, Vojtech Rödl, Navid Talebanfard
2021	J	`jnl`	A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Log. Methods Comput. Sci. Michal Koucký, Vojtech Rödl, Navid Talebanfard
2021	A	`conf`	Barrington Plays Cards: The Complexity of Card-Based Protocols. STACS Pavel Dvorák, Michal Koucký
2021	—	`ch.`	Circuit complexity of regular languages. Handbook of Automata Theory (I.) Michal Koucký
2021	B	`conf`	Computing Edit Distance (Invited Talk). CPM Michal Koucký
2021	A	`conf`	Data Structures Lower Bounds and Popular Conjectures. ESA Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová
2021	J	`jnl`	Data Structures Lower Bounds and Popular Conjectures. CoRR Pavel Dvorák, Michal Koucký, Karel Král, Veronika Slívová
2021	J	`jnl`	High Entropy Random Selection Protocols. Algorithmica Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin
2021	J	`jnl`	Improved Bounds on Fourier Entropy and Min-entropy. ACM Trans. Comput. Theory Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2021	A*	`conf`	Sorting Short Integers. ICALP Michal Koucký, Karel Král
2021	J	`jnl`	Sorting Short Integers. CoRR Michal Koucký, Karel Král
2021	J	`jnl`	Sorting Short Integers: The Exposition. Bull. EATCS Michal Koucký
2020	J	`jnl`	Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic Time. J. ACM Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2020	J	`jnl`	Barrington Plays Cards: The Complexity of Card-based Protocols. CoRR Pavel Dvorák, Michal Koucký
2020	A*	`conf`	Constant factor approximations to edit distance on far input pairs in nearly linear time. STOC Michal Koucký, Michael E. Saks
2020	J	`jnl`	Expander construction in VNC Ann. Pure Appl. Log. Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký
2020	A	`conf`	Improved Bounds on Fourier Entropy and Min-Entropy. STACS Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2019	J	`jnl`	A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Electron. Colloquium Comput. Complex. Michal Koucký, Vojtech Rödl, Navid Talebanfard
2019	—	`conf`	Approximate Online Pattern Matching in Sublinear Time. FSTTCS Diptarka Chakraborty, Debarati Das, Michal Koucký
2019	J	`jnl`	Constant factor approximations to edit distance on far input pairs in nearly linear time. CoRR Michal Koucký, Michael E. Saks
2019	J	`jnl`	On Online Labeling with Large Label Set. SIAM J. Discret. Math. Martin Babka, Jan Bulánek, Vladimír Cunát, Michal Koucký, Michael E. Saks
2019	J	`jnl`	Simulation Theorems via Pseudo-random Properties. Comput. Complex. Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2019	—	`conf`	Stronger Lower Bounds for Online ORAM. TCC (2) Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová
2019	J	`jnl`	Stronger Lower Bounds for Online ORAM. CoRR Pavel Hubácek, Michal Koucký, Karel Král, Veronika Slívová
2018	J	`jnl`	Approximate Online Pattern Matching in Sub-linear Time. CoRR Diptarka Chakraborty, Debarati Das, Michal Koucký
2018	J	`jnl`	Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time. CoRR Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2018	A*	`conf`	Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time. FOCS Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucký, Michael E. Saks
2018	J	`jnl`	Catalytic Space: Non-determinism and Hierarchy. Theory Comput. Syst. Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
2018	J	`jnl`	Cover time and mixing time of random walks on dynamic graphs. Random Struct. Algorithms Chen Avin, Michal Koucký, Zvi Lotker
2018	J	`jnl`	Improved bounds on Fourier entropy and Min-entropy. CoRR Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2018	J	`jnl`	Improved bounds on Fourier entropy and Min-entropy. Electron. Colloquium Comput. Complex. Srinivasan Arunachalam, Sourav Chakraborty, Michal Koucký, Nitin Saurabh, Ronald de Wolf
2018	A	`conf`	Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. STACS Debarati Das, Michal Koucký, Michael E. Saks
2018	J	`jnl`	Lower bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. CoRR Debarati Das, Michal Koucký, Michael E. Saks
2018	A*	`conf`	Simulation beats richness: new data-structure lower bounds. STOC Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2018	A	`conf`	Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity. ESA Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh
2017	J	`jnl`	A Communication Game Related to the Sensitivity Conjecture. Theory Comput. Justin Gilmer, Michal Koucký, Michael E. Saks
2017	J	`jnl`	Composition and Simulation Theorems via Pseudo-random Properties. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2017	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 17121). Dagstuhl Reports Anna Gál, Michal Koucký, Oded Regev, Till Tantau
2017	A	`conf`	Expander Construction in VNC1. ITCS Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký
2017	A	`conf`	Lower Bounds for Elimination via Weak Regularity. STACS Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2017	J	`jnl`	Optimal Quasi-Gray Codes: Does the Alphabet Matter? CoRR Diptarka Chakraborty, Debarati Das, Michal Koucký, Nitin Saurabh
2017	J	`jnl`	Simulation Beats Richness: New Data-Structure Lower Bounds. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2017	J	`jnl`	Simulation Theorems via Pseudorandom Properties. CoRR Arkadev Chattopadhyay, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2016	A	`conf`	Catalytic Space: Non-determinism and Hierarchy. STACS Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
2016	J	`jnl`	Catalytic computation. Bull. EATCS Michal Koucký
2016	J	`jnl`	Expander Construction in VNC Electron. Colloquium Comput. Complex. Sam Buss, Valentine Kabanets, Antonina Kolokolova, Michal Koucký
2016	J	`jnl`	Lower Bounds for Elimination via Weak Regularity. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay
2016	J	`jnl`	Streaming Algorithms For Computing Edit Distance Without Exploiting Suffix Trees. CoRR Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2016	A*	`conf`	Streaming algorithms for embedding and computing edit distance in the low distance regime. STOC Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2016	B	`conf`	The Big Match in Small Space - (Extended Abstract). SAGT Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
2016	J	`jnl`	The Big Match in Small Space. CoRR Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
2016	J	`jnl`	Towards a Reverse Newman's Theorem in Interactive Information Complexity. Algorithmica Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolai K. Vereshchagin
2015	A	`conf`	A New Approach to the Sensitivity Conjecture. ITCS Justin Gilmer, Michal Koucký, Michael E. Saks
2015	J	`jnl`	A communication game related to the sensitivity conjecture. CoRR Justin Gilmer, Michal Koucký, Michael E. Saks
2015	J	`jnl`	Low Distortion Embedding from Edit to Hamming Distance using Coupling. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2015	J	`jnl`	Nonuniform catalytic space and the direct sum for space. Electron. Colloquium Comput. Complex. Michal Koucký
2015	J	`jnl`	Tight Lower Bounds for the Online Labeling Problem. SIAM J. Comput. Jan Bulánek, Michal Koucký, Michael E. Saks
2014	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 14121). Dagstuhl Reports Anna Gál, Michal Koucký, Oded Regev, Rüdiger Reischuk
2014	J	`jnl`	Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
2014	A*	`conf`	Computing with a full memory: catalytic space. STOC Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
2014	J	`jnl`	Information Complexity for Multiparty Communication. Electron. Colloquium Comput. Complex. Diptarka Chakraborty, Elazar Goldenberg, Michal Koucký
2014	J	`jnl`	The Hardness of Being Private. ACM Trans. Comput. Theory Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi
2013	—	`conf`	On Randomized Online Labeling with Polynomially Many Labels. ICALP (1) Jan Bulánek, Michal Koucký, Michael E. Saks
2013	J	`jnl`	Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates. IEEE Trans. Inf. Theory Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2013	A	`conf`	Towards a Reverse Newman's Theorem in Interactive Information Complexity. CCC Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman, Nikolay K. Vereshchagin
2012	J	`jnl`	Exact Algorithms for Solving Stochastic Games CoRR Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas
2012	J	`jnl`	On Online Labeling with Polynomially Many Labels CoRR Martin Babka, Jan Bulánek, Vladimír Cunát, Michal Koucký, Michael E. Saks
2012	A	`conf`	On Online Labeling with Polynomially Many Labels. ESA Martin Babka, Jan Bulánek, Vladimír Cunát, Michal Koucký, Michael E. Saks
2012	A	`conf`	The Hardness of Being Private. CCC Anil Ada, Arkadev Chattopadhyay, Stephen A. Cook, Lila Fontes, Michal Koucký, Toniann Pitassi
2012	A*	`conf`	Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2012	A*	`conf`	Tight lower bounds for the online labeling problem. STOC Jan Bulánek, Michal Koucký, Michael E. Saks
2012	J	`jnl`	Towards a Reverse Newman's Theorem in Interactive Information Complexity. Electron. Colloquium Comput. Complex. Joshua Brody, Harry Buhrman, Michal Koucký, Bruno Loff, Florian Speelman
2011	J	`jnl`	Computational Complexity of Discrete Problems (Dagstuhl Seminar 11121). Dagstuhl Reports Martin Grohe, Michal Koucký, Rüdiger Reischuk, Dieter van Melkebeek
2011	A*	`conf`	Exact algorithms for solving stochastic games: extended abstract. STOC Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas
2011	J	`jnl`	Many Random Walks Are Faster Than One. Comb. Probab. Comput. Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle
2011	A*	`conf`	Pseudorandom generators for group products: extended abstract. STOC Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák
2011	J	`jnl`	The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory. J. Comput. Syst. Sci. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
2011	J	`jnl`	Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electron. Colloquium Comput. Complex. Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2011	J	`jnl`	Tight lower bounds for online labeling problem CoRR Jan Bulánek, Michal Koucký, Michael E. Saks
2010	J	`jnl`	A New Characterization of ACC Comput. Complex. Kristoffer Arnsfelt Hansen, Michal Koucký
2010	J	`jnl`	Amplifying lower bounds by means of self-reducibility. J. ACM Eric Allender, Michal Koucký
2010	J	`jnl`	Book review. Comput. Sci. Rev. Michal Koucký
2010	A	`conf`	Derandomizing from Random Strings. CCC Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff
2010	J	`jnl`	Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Theory Comput. Syst. Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin
2010	J	`jnl`	Pseudorandom Generators for Group Products. Electron. Colloquium Comput. Complex. Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák
2009	A	`conf`	A New Characterization of ACC CCC Kristoffer Arnsfelt Hansen, Michal Koucký
2009	J	`jnl`	Circuit Complexity of Regular Languages. Theory Comput. Syst. Michal Koucký
2009	J	`jnl`	Derandomizing from Random Strings CoRR Harry Buhrman, Lance Fortnow, Michal Koucký, Bruno Loff
2009	J	`jnl`	The Pervasive Reach of Resource-Bounded Kolmogorov Complexity in Computational Complexity Theory. Electron. Colloquium Comput. Complex. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
2009	A*	`conf`	Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. LICS Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen
2008	A	`conf`	Amplifying Lower Bounds by Means of Self-Reducibility. CCC Eric Allender, Michal Koucký
2008	J	`jnl`	Amplifying Lower Bounds by Means of Self-Reducibility. Electron. Colloquium Comput. Complex. Eric Allender, Michal Koucký
2008	—	`conf`	How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs). ICALP (1) Chen Avin, Michal Koucký, Zvi Lotker
2008	J	`jnl`	Incremental Branching Programs. Theory Comput. Syst. Anna Gál, Michal Koucký, Pierre McKenzie
2008	B	`conf`	Many random walks are faster than one. SPAA Noga Alon, Chen Avin, Michal Koucký, Gady Kozma, Zvi Lotker, Mark R. Tuttle
2008	A	`conf`	Randomised Individual Communication Complexity. CCC Harry Buhrman, Michal Koucký, Nikolai K. Vereshchagin
2007	C	`conf`	Circuit Complexity of Regular Languages. CiE Michal Koucký
2007	—	`conf`	High Entropy Random Selection Protocols. APPROX-RANDOM Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir, Nikolai K. Vereshchagin
2007	—	`conf`	High Entropy Random Selection Protocols. Algebraic Methods in Computational Complexity Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir
2007	Misc	`conf`	Inverting Onto Functions and Polynomial Hierarchy. CSR Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin
2007	A	`conf`	Languages with Bounded Multiparty Communication Complexity. STACS Arkadev Chattopadhyay, Andreas Krebs, Michal Koucký, Mario Szegedy, Pascal Tesson, Denis Thérien
2006	A	`conf`	Circuit Lower Bounds via Ehrenfeucht-Fraisse Games. CCC Michal Koucký, Clemens Lautemann, Sebastian Poloczek, Denis Thérien
2006	Misc	`conf`	Incremental Branching Programs. CSR Anna Gál, Michal Koucký, Pierre McKenzie
2006	—	`conf`	Incremental branching programs. Complexity of Boolean Functions Anna Gál, Pierre McKenzie, Michal Koucký
2006	J	`jnl`	Inverting onto functions might not be hard. Electron. Colloquium Comput. Complex. Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin
2006	J	`jnl`	Languages with Bounded Multiparty Communication Complexity. Electron. Colloquium Comput. Complex. Arkadev Chattopadhyay, Michal Koucký, Andreas Krebs, Mario Szegedy, Pascal Tesson, Denis Thérien
2006	J	`jnl`	Power from Random Strings. SIAM J. Comput. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
2006	J	`jnl`	What can be efficiently reduced to the Kolmogorov-random strings? Ann. Pure Appl. Log. Eric Allender, Harry Buhrman, Michal Koucký
2005	A*	`conf`	Bounded-depth circuits: separating wires from gates. STOC Michal Koucký, Pavel Pudlák, Denis Thérien
2005	J	`jnl`	Incremental branching programs Electron. Colloquium Comput. Complex. Anna Gál, Michal Koucký, Pierre McKenzie
2004	A	`conf`	What Can be Efficiently Reduced to the K-Random Strings? STACS Eric Allender, Harry Buhrman, Michal Koucký
2004	J	`jnl`	What Can be Efficiently Reduced to the Kolmogorov-Random Strings? Electron. Colloquium Comput. Complex. Eric Allender, Harry Buhrman, Michal Koucký
2003	A	`conf`	Derandomization and Distinguishing Complexity. CCC Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
2003	J	`jnl`	Log-space constructible universal traversal sequences for cycles of length O(n Theor. Comput. Sci. Michal Koucký
2002	J	`jnl`	Power from Random Strings Electron. Colloquium Comput. Complex. Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek
2002	A*	`conf`	Power from Random Strings. FOCS Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
2002	J	`jnl`	Universal traversal sequences with backtracking. J. Comput. Syst. Sci. Michal Koucký
2001	Misc	`conf`	Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n COCOON Michal Koucký
2001	J	`jnl`	Log-space Constructible Universal Traversal Sequences for Cycles of Length O(n Electron. Colloquium Comput. Complex. Michal Koucký
2001	J	`jnl`	Time-Space Tradeoffs in the Counting Hierarchy Electron. Colloquium Comput. Complex. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
2001	A	`conf`	Time-Space Tradeoffs in the Counting Hierarchy. CCC Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
2001	A	`conf`	Universal Traversal Sequences with Backtracking. CCC Michal Koucký