1![Short PCPs Verifiable in Polylogarithmic Time∗ Eli Ben-Sasson † Oded Goldreich Short PCPs Verifiable in Polylogarithmic Time∗ Eli Ben-Sasson † Oded Goldreich](https://www.pdfsearch.io/img/3d1bfc276b8ca2e836dccc84e881fdb4.jpg) | Add to Reading ListSource URL: www.wisdom.weizmann.ac.ilLanguage: English - Date: 2014-06-22 06:24:32
|
---|
2![A Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian Setting Daniel M. Kane University of California, San Diego Department of Computer Science and Engineering / Department of Mathematics 9500 Gilman Dri A Polylogarithmic PRG for Degree 2 Threshold Functions in the Gaussian Setting Daniel M. Kane University of California, San Diego Department of Computer Science and Engineering / Department of Mathematics 9500 Gilman Dri](https://www.pdfsearch.io/img/b9e5158c62c1d2c8c262d5b0d849a1b1.jpg) | Add to Reading ListSource URL: drops.dagstuhl.deLanguage: English - Date: 2015-05-27 10:18:38
|
---|
3![A DISTRIBUTED POLYLOGARITHMIC TIME ALGORITHM FOR SELF-STABILIZING SKIP GRAPHS∗ RIKO JACOB†, ANDREA RICHA‡, CHRISTIAN SCHEIDELER§, STEFAN SCHMID¶, AND HANJO k ¨ TAUBIG A DISTRIBUTED POLYLOGARITHMIC TIME ALGORITHM FOR SELF-STABILIZING SKIP GRAPHS∗ RIKO JACOB†, ANDREA RICHA‡, CHRISTIAN SCHEIDELER§, STEFAN SCHMID¶, AND HANJO k ¨ TAUBIG](https://www.pdfsearch.io/img/45b52fff6c942b2f33cfbcf542225c45.jpg) | Add to Reading ListSource URL: www.net.t-labs.tu-berlin.deLanguage: English - Date: 2015-01-07 16:21:25
|
---|
4![Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch Pierre Fraigniaud∗ Cyril Gavoille† Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch Pierre Fraigniaud∗ Cyril Gavoille†](https://www.pdfsearch.io/img/365a3b5e7250e74a6ac2121df6ebc4ba.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2008-04-15 13:07:10
|
---|
5![A Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity JAMES ASPNES, Yale University HAGIT ATTIYA, Technion KEREN CENSOR-HILLEL, Technion FAITH ELLEN, University of Toronto A Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity JAMES ASPNES, Yale University HAGIT ATTIYA, Technion KEREN CENSOR-HILLEL, Technion FAITH ELLEN, University of Toronto](https://www.pdfsearch.io/img/98b331f4677d3ad0ef74d81cd99be6be.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2015-04-30 10:34:00
|
---|
6![On the Value of Multiple Read/Write Streams for Data Compression Travis Gagie University of Eastern Piedmont CPM ’09 On the Value of Multiple Read/Write Streams for Data Compression Travis Gagie University of Eastern Piedmont CPM ’09](https://www.pdfsearch.io/img/248570176e9a8364115ccc5defb9c6e6.jpg) | Add to Reading ListSource URL: www.cs.ucr.eduLanguage: English - Date: 2009-06-22 02:36:46
|
---|
7![Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate](https://www.pdfsearch.io/img/2d97d62a6b83773f2814a434a3610b36.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2009-12-02 23:07:07
|
---|
8![Estimating Entropy and Entropy Norm on Data Streams Amit Chakrabarti∗ Khanh Do Ba† S. Muthukrishnan‡ Estimating Entropy and Entropy Norm on Data Streams Amit Chakrabarti∗ Khanh Do Ba† S. Muthukrishnan‡](https://www.pdfsearch.io/img/445c27a8792c42b5ad51d68db9a6cce1.jpg) | Add to Reading ListSource URL: people.csail.mit.eduLanguage: English - Date: 2009-11-10 15:56:52
|
---|
9![Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗ Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗](https://www.pdfsearch.io/img/befb85955ff05eedea4c794e2cde2eb1.jpg) | Add to Reading ListSource URL: www.cse.buffalo.eduLanguage: English - Date: 2004-02-23 11:23:03
|
---|
10![ON THE RAPID COMPUTATION OF VARIOUS POLYLOGARITHMIC CONSTANTS David Bailey, Peter Borwein1 and Simon Plouffe Abstract. We give algorithms for the computation of the d-th digit of certain transcendental ON THE RAPID COMPUTATION OF VARIOUS POLYLOGARITHMIC CONSTANTS David Bailey, Peter Borwein1 and Simon Plouffe Abstract. We give algorithms for the computation of the d-th digit of certain transcendental](https://www.pdfsearch.io/img/7fa465429f6f84a2e300355065fbe35a.jpg) | Add to Reading ListSource URL: www.davidhbailey.comLanguage: English - Date: 2012-11-07 15:21:59
|
---|