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.
2014
2014
RoBuSt: A Crash-Failure-Resistant Distributed Storage System
In this work we present the first distributed storage system that is provably robust against crash failures issued by an adaptive… 
2013
2013
A BDDC Algorithm for Raviart-Thomas Vector Fields.
A BDDC preconditioner is defined by a coarse component, expressed in terms of primal constraints and a weighted average across… 
Highly Cited
2009
Highly Cited
2009
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task, since it requires a simple mathematical object on which… 
2008
2008
Substructuring Preconditioners for Mortar Discretization of a Degenerate Evolution Problem
In this paper we present new efficient variants of substructuring preconditioners for algebraic linear systems arising from the… 
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… 
2004
2004
Invadable self-assembly: combining robustness with efficiency
DNA self-assembly is emerging as a key paradigm for nano-technology, nano-computation, and several related disciplines. In nature… 
2002
2002
Location management handoff overhead in hierarchically organized mobile ad hoc networks
  • J. SucecI. Marsic
  • Proceedings 16th International Parallel and…
  • 2002
  • Corpus ID: 18985936
Control overhead in a mobile ad hoc network may be reduced through hierarchical routing. However, to facilitate packet forwarding… 
2001
2001
Scalable Sparse Topologies with Small Spectrum
One of the fundamental properties of a graph is the number of distinct eigenvalues of its adjacency or Laplacian matrix… 
1995
1995
E cient Self Simulation Algorithmsfor Recon gurable Arrays
There are several reconnguring-network models of parallel computation that are considered in the published literature, depending… 
1991
1991
Efficient parallel independent subsets and matrix factorizations
  • W. Eberly
  • Proceedings of the Third IEEE Symposium on…
  • 1991
  • Corpus ID: 365085
A parallel algorithm is given for computation of a maximal linearly independent subset of a set of vectors over a field. The… 
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)