Skip to search formSkip to main contentSkip to account menu

Polylogarithmic function

Known as: Polylogarithmic 
A polylogarithmic function in n is a polynomial in the logarithm of n, In computer science, polylogarithmic functions occur as the order of memory… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
AlgorithmApproximate max-flow min-cut theoremComputer scienceKinetic data structure

Broader (1)

Analysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Approximately Counting Triangles in Sublinear Time
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both… 
Highly Cited
2013
Highly Cited
2013
Dynamic Proofs of Retrievability Via Oblivious RAM
Proofs of retrievability allow a client to store her data on a remote server (e.g., “in the cloud”) and periodically execute an… 
Highly Cited
2012
Highly Cited
2012
Compressive principal component pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set… 
Highly Cited
2012
Highly Cited
2012
Single round access privacy on outsourced storage
We present SR-ORAM1, the first single-round-trip polylogarithmic time Oblivious RAM that requires only logarithmic client storage… 
Highly Cited
2010
Highly Cited
2010
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
We describe schemes for the oblivious RAM simulation problem with a small logarithmic or polylogarithmic amortized increase in… 
Highly Cited
2008
Highly Cited
2008
Fully compressed suffix trees
Suffix trees are by far the most important data structure in stringology, with a myriad of applications in fields like… 
Highly Cited
2005
Highly Cited
2005
An algebraic theory for primal and dual substructuring methods by constraints
Highly Cited
2001
Highly Cited
2001
Sequential and parallel algorithms for mixed packing and covering
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (aka mixed… 
Highly Cited
1995
Highly Cited
1995
Online tracking of mobile users
This paper deals with the problem of maintaining a distributed directory server, that enables us to keep track of mobile users in… 
Highly Cited
1984
Highly Cited
1984
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers
  • A. FiatAdi Shamir
  • Journal of computer and system sciences (Print)
  • 1984
  • Corpus ID: 8927584
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)