Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 229,841,297 papers from all fields of science
Search
Sign In
Create Free Account
Average-case complexity
Known as:
Average case complexity
, Average case computational complexity
, Expected time
In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
Algorithm
Best, worst and average case
Boyer–Moore–Horspool algorithm
Bubble sort
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Estimating the Completion Time of Crowdsourced Tasks Using Survival Analysis Models
Jing Wang
,
S. Faridani
,
Panagiotis G. Ipeirotis
2011
Corpus ID: 3119585
In order to seamlessly integrate a human computation component (e.g., Amazon Mechanical Turk) within a larger production system…
Expand
Highly Cited
2010
Highly Cited
2010
Reaching Consensus on Social Networks
Elchanan Mossel
,
G. Schoenebeck
International Conference on Supercomputing
2010
Corpus ID: 56796
Research in sociology studies the effectiveness of social networks in achieving computational tasks. Typically the agents who are…
Expand
Highly Cited
2004
Highly Cited
2004
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
D. Kowalski
,
A. Pelc
SIAM journal on computing (Print)
2004
Corpus ID: 8818517
We consider broadcasting in radio networks, modeled as undirected graphs, whose nodes know only their own label and labels of…
Expand
Highly Cited
2004
Highly Cited
2004
Multiuser switched diversity transmission
B. Holter
,
Mohamed-Slim Alouini
,
G. Oien
,
Hong-Chuan Yang
IEEE 60th Vehicular Technology Conference, . VTC…
2004
Corpus ID: 40164230
In this paper, a set of multiuser access schemes are proposed based on switched diversity algorithms originally devised to select…
Expand
2001
2001
Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
D. Mount
,
N. Netanyahu
Computational geometry
2001
Corpus ID: 14918849
1998
1998
Randomized K-Dimensional Binary Search Trees
Amalia Duch Brown
,
V. Estivill-Castro
,
Conrado Martínez
International Symposium on Algorithms and…
1998
Corpus ID: 2729392
We introduce randomized K-dimensional binary search trees (randomized Kd-trees), a variant of K-dimensional binary search trees…
Expand
Highly Cited
1993
Highly Cited
1993
Regulating innovative activity: The role of a public firm
Flavio Delbono
,
V. Denicoló
1993
Corpus ID: 152433158
1993
1993
Optimal copula duration in dungflies: effects of frequency dependence and female mating status
Geoff A. Parker
,
L. Simmons
,
P. Ward
Behavioral Ecology and Sociobiology
1993
Corpus ID: 31651385
SummaryThe addition of frequency dependence to the marginal value theorem (MVT) model of the dung fly (Scatophaga stercoraria…
Expand
1990
1990
The Full-Use-of-Suitable-Spares (FUSS) Approach to Hardware Reconfiguration for Fault-Tolerant Processor Arrays
M. Chean
,
J. Fortes
IEEE Trans. Computers
1990
Corpus ID: 206414354
A general approach to hardware recognition is proposed for VLSI/WSI fault-tolerant processor arrays. The technique, called full…
Expand
Highly Cited
1984
Highly Cited
1984
Integration of geological and seismological data for the analysis of seismic hazard: A case study of Japan
S. Wesnousky
,
C. Scholz
,
K. Shimazaki
,
T. Matsuda
1984
Corpus ID: 51815923
Seismic hazard analyses are associated with large uncertainties when historical data are insufficient to define secular rates of…
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