Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,812,545 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Algorithm
Approximate max-flow min-cut theorem
Computer science
Kinetic data structure
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation
Matteo Ceccarello
,
A. Pietracaprina
,
G. Pucci
,
E. Upfal
ACM Symposium on Parallelism in Algorithms and…
2014
Corpus ID: 15404050
We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected…
Expand
Highly Cited
2012
Highly Cited
2012
Minimum-energy connected coverage in wireless sensor networks with omni-directional and directional features
K. Han
,
Liu Xiang
,
Jun Luo
,
Yang Liu
ACM Interational Symposium on Mobile Ad Hoc…
2012
Corpus ID: 5648533
Wireless Sensor Networks (WSNs) have acquired new features recently, i.e., both the sensor and the antenna of a node can be…
Expand
2011
2011
Efficient Distributed Communication in Ad-Hoc Radio Networks
Bogdan S. Chlebus
,
D. Kowalski
,
A. Pelc
,
Mariusz A. Rokicki
International Colloquium on Automata, Languages…
2011
Corpus ID: 1799481
We present new distributed deterministic solutions to two communication problems in n-node ad-hoc radio networks: rumor gathering…
Expand
2010
2010
Towards the randomized k-server conjecture: a primal-dual approach
N. Bansal
,
Niv Buchbinder
,
J. Naor
ACM-SIAM Symposium on Discrete Algorithms
2010
Corpus ID: 12834174
Recently, Coté et al. [10] proposed an approach for solving the k-server problem on Hierchically Separated Trees (HSTs). In…
Expand
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…
Expand
2008
2008
Substructuring Preconditioners for Mortar Discretization of a Degenerate Evolution Problem
M. Pennacchio
,
V. Simoncini
Journal of Scientific Computing
2008
Corpus ID: 6773802
In this paper we present new efficient variants of substructuring preconditioners for algebraic linear systems arising from the…
Expand
2006
2006
Local approximation schemes for topology control
Mirela Damian
,
Saurav Pandit
,
Sriram V. Pemmaraju
ACM SIGACT-SIGOPS Symposium on Principles of…
2006
Corpus ID: 3266423
This paper presents a distributed algorithm for wireless ad-hoc networks that runs in polylogarithmic number of rounds in the…
Expand
2005
2005
A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
Michael Elkin
,
G. Kortsarz
SIAM journal on computing (Print)
2005
Corpus ID: 46464751
Consider a synchronous network of processors, modeled by directed or undirected graph $G = (V,E)$, in which in each round every…
Expand
2001
2001
Scalable Sparse Topologies with Small Spectrum
Robert Elsässer
,
Rastislav Kralovic
,
B. Monien
Symposium on Theoretical Aspects of Computer…
2001
Corpus ID: 17962712
One of the fundamental properties of a graph is the number of distinct eigenvalues of its adjacency or Laplacian matrix…
Expand
1995
1995
E cient Self Simulation Algorithmsfor Recon gurable Arrays
Y. Ben-Asher
,
D. Gordon
,
A. Schuster
1995
Corpus ID: 15341752
There are several reconnguring-network models of parallel computation that are considered in the published literature, depending…
Expand
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)
ACCEPT & CONTINUE