![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "toc:db/journals/toct/toct3.bht:"
@article{DBLP:journals/toct/BeameH12, author = {Paul Beame and Trinh Huynh}, title = {The Value of Multiple Read/Write Streams for Approximating Frequency Moments}, journal = {{ACM} Trans. Comput. Theory}, volume = {3}, number = {2}, pages = {6:1--6:22}, year = {2012}, url = {https://doi.org/10.1145/2077336.2077339}, doi = {10.1145/2077336.2077339}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/BeameH12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/CookMWBS12, author = {Stephen A. Cook and Pierre McKenzie and Dustin Wehr and Mark Braverman and Rahul Santhanam}, title = {Pebbles and Branching Programs for Tree Evaluation}, journal = {{ACM} Trans. Comput. Theory}, volume = {3}, number = {2}, pages = {4:1--4:43}, year = {2012}, url = {https://doi.org/10.1145/2077336.2077337}, doi = {10.1145/2077336.2077337}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/CookMWBS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/GalM12, author = {Anna G{\'{a}}l and Andrew Mills}, title = {Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length}, journal = {{ACM} Trans. Comput. Theory}, volume = {3}, number = {2}, pages = {5:1--5:34}, year = {2012}, url = {https://doi.org/10.1145/2077336.2077338}, doi = {10.1145/2077336.2077338}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/GalM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/HitchcockPV11, author = {John M. Hitchcock and Aduri Pavan and N. Variyam Vinodchandran}, title = {Kolmogorov Complexity in Randomness Extraction}, journal = {{ACM} Trans. Comput. Theory}, volume = {3}, number = {1}, pages = {1:1--1:12}, year = {2011}, url = {https://doi.org/10.1145/2003685.2003686}, doi = {10.1145/2003685.2003686}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/HitchcockPV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/Kulkarni11, author = {Raghav Kulkarni}, title = {On the Power of Isolation in Planar Graphs}, journal = {{ACM} Trans. Comput. Theory}, volume = {3}, number = {1}, pages = {2:1--2:12}, year = {2011}, url = {https://doi.org/10.1145/2003685.2003687}, doi = {10.1145/2003685.2003687}, timestamp = {Mon, 08 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/Kulkarni11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toct/Smyth11, author = {Clifford D. Smyth}, title = {Approximate Query Complexity}, journal = {{ACM} Trans. Comput. Theory}, volume = {3}, number = {1}, pages = {3:1--3:11}, year = {2011}, url = {https://doi.org/10.1145/2003685.2003688}, doi = {10.1145/2003685.2003688}, timestamp = {Wed, 09 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toct/Smyth11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp1.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.