![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
ACM Transactions on Computation Theory, Volume 3
Volume 3, Number 1, August 2011
- John M. Hitchcock
, Aduri Pavan, N. Variyam Vinodchandran:
Kolmogorov Complexity in Randomness Extraction. 1:1-1:12 - Raghav Kulkarni:
On the Power of Isolation in Planar Graphs. 2:1-2:12 - Clifford D. Smyth
:
Approximate Query Complexity. 3:1-3:11
Volume 3, Number 2, January 2012
- Stephen A. Cook, Pierre McKenzie, Dustin Wehr, Mark Braverman, Rahul Santhanam:
Pebbles and Branching Programs for Tree Evaluation. 4:1-4:43 - Anna Gál, Andrew Mills:
Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length. 5:1-5:34 - Paul Beame, Trinh Huynh:
The Value of Multiple Read/Write Streams for Approximating Frequency Moments. 6:1-6:22
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.