Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/toc/toc2.bht:"
@article{DBLP:journals/toc/AroraBLT06, author = {Sanjeev Arora and B{\'{e}}la Bollob{\'{a}}s and L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and Iannis Tourlakis}, title = {Proving Integrality Gaps without Knowing the Linear Program}, journal = {Theory Comput.}, volume = {2}, number = {2}, pages = {19--51}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a002}, doi = {10.4086/TOC.2006.V002A002}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/AroraBLT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Buresh-OppenheimGHMP06, author = {Joshua Buresh{-}Oppenheim and Nicola Galesi and Shlomo Hoory and Avner Magen and Toniann Pitassi}, title = {Rank Bounds and Integrality Gaps for Cutting Planes Procedures}, journal = {Theory Comput.}, volume = {2}, number = {4}, pages = {65--90}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a004}, doi = {10.4086/TOC.2006.V002A004}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Buresh-OppenheimGHMP06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/CharikarK06, author = {Moses Charikar and Robert Krauthgamer}, title = {Embedding the Ulam metric into \emph{l}\({}_{\mbox{1}}\)}, journal = {Theory Comput.}, volume = {2}, number = {11}, pages = {207--224}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a011}, doi = {10.4086/TOC.2006.V002A011}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/CharikarK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/ChekuriKS06, author = {Chandra Chekuri and Sanjeev Khanna and F. Bruce Shepherd}, title = {An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow}, journal = {Theory Comput.}, volume = {2}, number = {7}, pages = {137--146}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a007}, doi = {10.4086/TOC.2006.V002A007}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/ChekuriKS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/DeshpandeRVW06, author = {Amit Deshpande and Luis Rademacher and Santosh S. Vempala and Grant Wang}, title = {Matrix Approximation and Projective Clustering via Volume Sampling}, journal = {Theory Comput.}, volume = {2}, number = {12}, pages = {225--247}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a012}, doi = {10.4086/TOC.2006.V002A012}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/DeshpandeRVW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/FischerF06, author = {Eldar Fischer and Lance Fortnow}, title = {Tolerant Versus Intolerant Testing for Boolean Properties}, journal = {Theory Comput.}, volume = {2}, number = {9}, pages = {173--183}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a009}, doi = {10.4086/TOC.2006.V002A009}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/FischerF06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/GiotisG06, author = {Ioannis Giotis and Venkatesan Guruswami}, title = {Correlation Clustering with a Fixed Number of Clusters}, journal = {Theory Comput.}, volume = {2}, number = {13}, pages = {249--266}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a013}, doi = {10.4086/TOC.2006.V002A013}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/GiotisG06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/GuptaS06, author = {Anupam Gupta and Aravind Srinivasan}, title = {An Improved Approximation Ratio for the Covering Steiner Problem}, journal = {Theory Comput.}, volume = {2}, number = {3}, pages = {53--64}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a003}, doi = {10.4086/TOC.2006.V002A003}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/GuptaS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/JacksonS06, author = {Jeffrey C. Jackson and Rocco A. Servedio}, title = {On Learning Random {DNF} Formulas Under the Uniform Distribution}, journal = {Theory Comput.}, volume = {2}, number = {8}, pages = {147--172}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a008}, doi = {10.4086/TOC.2006.V002A008}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/JacksonS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/KlivansS06, author = {Adam R. Klivans and Amir Shpilka}, title = {Learning Restricted Models of Arithmetic Circuits}, journal = {Theory Comput.}, volume = {2}, number = {10}, pages = {185--206}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a010}, doi = {10.4086/TOC.2006.V002A010}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/KlivansS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/Raz06, author = {Ran Raz}, title = {Separation of Multilinear Circuit and Formula Size}, journal = {Theory Comput.}, volume = {2}, number = {6}, pages = {121--135}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a006}, doi = {10.4086/TOC.2006.V002A006}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/Raz06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/RozenmanSW06, author = {Eyal Rozenman and Aner Shalev and Avi Wigderson}, title = {Iterative Construction of Cayley Expander Graphs}, journal = {Theory Comput.}, volume = {2}, number = {5}, pages = {91--120}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a005}, doi = {10.4086/TOC.2006.V002A005}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/RozenmanSW06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/SpalekS06, author = {Robert Spalek and Mario Szegedy}, title = {All Quantum Adversary Methods are Equivalent}, journal = {Theory Comput.}, volume = {2}, number = {1}, pages = {1--18}, year = {2006}, url = {https://doi.org/10.4086/toc.2006.v002a001}, doi = {10.4086/TOC.2006.V002A001}, timestamp = {Sun, 21 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/toc/SpalekS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.