Short PCPs Verifiable in Polylogarithmic Time∗ Eli Ben-Sasson † Oded Goldreich

Source URL: www.wisdom.weizmann.ac.il

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

Source URL: drops.dagstuhl.de

A DISTRIBUTED POLYLOGARITHMIC TIME ALGORITHM FOR SELF-STABILIZING SKIP GRAPHS∗ RIKO JACOB†, ANDREA RICHA‡, CHRISTIAN SCHEIDELER§, STEFAN SCHMID¶, AND HANJO k ¨ TAUBIG

Source URL: www.net.t-labs.tu-berlin.de

Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch Pierre Fraigniaud∗ Cyril Gavoille†

Source URL: www.liafa.jussieu.fr

• Graph operations
• Tree decomposition
• Connectivity
• NP-complete problems
• Network flow
• Graph theory
• Theoretical computer science
• Mathematics

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

Source URL: cs-www.cs.yale.edu

• Pointer
• Computing
• Data management
• Computer programming
• Concurrency control
• Linearizability
• Transaction processing

On the Value of Multiple Read/Write Streams for Data Compression Travis Gagie University of Eastern Piedmont CPM ’09

Source URL: www.cs.ucr.edu

• Electronic engineering
• Theoretical computer science
• Computer storage
• Data compression
• Digital television
• Video compression
• Entropy
• Polylogarithmic
• Redundancy
• Information theory
• Information
• Formal sciences

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

Source URL: www.cs.toronto.edu

• Lepidoptera
• Polynomials
• Tree decomposition
• Approximation algorithm
• Caterpillar
• Polylogarithmic
• Theoretical computer science
• Graph theory
• Mathematics

Estimating Entropy and Entropy Norm on Data Streams Amit Chakrabarti∗ Khanh Do Ba† S. Muthukrishnan‡

Source URL: people.csail.mit.edu

• Applied mathematics
• Entropy
• Streaming algorithm
• Time complexity
• Binary logarithm
• Big O notation
• Polylogarithmic
• Randomized algorithm
• Estimation theory
• Theoretical computer science
• Mathematics
• Analysis of algorithms

Polylogarithmic-round Interactive Proofs for coNP Collapse the Exponential Hierarchy Alan L. Selman ∗

Source URL: www.cse.buffalo.edu

• Complexity classes
• Probabilistic complexity theory
• Structural complexity theory
• Arthur–Merlin protocol
• Karp–Lipton theorem
• Quantum complexity theory
• NP
• Interactive proof system
• IP
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

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

Source URL: www.davidhbailey.com

• Logarithms
• Exponentials
• Binary arithmetic
• Pi
• Floating point
• Arbitrary-precision arithmetic
• Factorial
• Approximations of π
• Transcendental number
• Mathematics
• Computer arithmetic
• Integer sequences