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.
2011
2011
Efficient Distributed Communication in Ad-Hoc Radio Networks
We present new distributed deterministic solutions to two communication problems in n-node ad-hoc radio networks: rumor gathering… 
2011
2011
Tight bounds on information dissemination in sparse mobile networks
Motivated by the growing interest in mobile systems, we study the dynamics of information dissemination between agents moving… 
Highly Cited
2010
Highly Cited
2010
Distributed Algorithms for Approximating Wireless Network Capacity
  • M. Dinitz
  • Proceedings IEEE INFOCOM
  • 2010
  • Corpus ID: 11366805
In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol… 
2010
2010
Towards the randomized k-server conjecture: a primal-dual approach
Recently, Coté et al. [10] proposed an approach for solving the k-server problem on Hierchically Separated Trees (HSTs). In… 
2010
2010
Fat Polygonal Partitions with Applications to Visualization and Embeddings
LetT be a rooted and weighted tree, where the weight of any node is equal to the sum of the weights of its children. The popular… 
2009
2009
Upper Bounds for Monotone Planar Circuit Value and Variants
Abstract.The P-complete Circuit Value Problem CVP, when restricted to monotone planar circuits MPCVP, is known to be in NC3, and… 
2006
2006
Local approximation schemes for topology control
This paper presents a distributed algorithm for wireless ad-hoc networks that runs in polylogarithmic number of rounds in the… 
2003
2003
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
Consider a network of processors modeled by an <i>n</i>-vertex graph <i>G</i> = (<i>V</i>, <i>E</i>). Assume that the… 
1997
1997
Efficient VLSI Layouts for Homogeneous Product Networks
In this paper, we develop generalized methods to layout homogeneous product networks with any number of dimensions, and analyze… 
1992
1992
On the Complexity of Polynomial Zeros
The parallel complexity of the simultaneous approximation to all the zeros of a polynomial is investigated. By modifying and… 
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)