Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
AlgorithmBest, worst and average caseBoyer–Moore–Horspool algorithmBubble sort

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
In order to seamlessly integrate a human computation component (e.g., Amazon Mechanical Turk) within a larger production system… 
Highly Cited
2004
Highly Cited
2004
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
We consider broadcasting in radio networks, modeled as undirected graphs, whose nodes know only their own label and labels of… 
Highly Cited
2004
Highly Cited
2004
Multiuser switched diversity transmission
In this paper, a set of multiuser access schemes are proposed based on switched diversity algorithms originally devised to select… 
Highly Cited
2002
Highly Cited
2002
Rendezvous search on labeled networks
Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least… 
Highly Cited
2001
Highly Cited
2001
Approximate distance oracles
Let <italic>G=(V,E)</italic> be an undirected <italic>weighted</italic> graph with <italic>|V|=n</italic> and <italic>|E|=m… 
Highly Cited
2000
Highly Cited
2000
AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles
Wide spread clustering algorithms use the Euclidean distance to measure spatial proximity. However, obstacles in other GIS data… 
Highly Cited
1993
Highly Cited
1993
Regulating innovative activity: The role of a public firm
1990
1990
The Full-Use-of-Suitable-Spares (FUSS) Approach to Hardware Reconfiguration for Fault-Tolerant Processor Arrays
A general approach to hardware recognition is proposed for VLSI/WSI fault-tolerant processor arrays. The technique, called full… 
Highly Cited
1984
Highly Cited
1984
Integration of geological and seismological data for the analysis of seismic hazard: A case study of Japan
Seismic hazard analyses are associated with large uncertainties when historical data are insufficient to define secular rates of… 
Highly Cited
1976
Highly Cited
1976
An Evaluation of Exponential and Weibull Test Plans
MIL-STD-781B gives sampling plans (sequential and fixed length) for reliability tests under the assumption of a constant failure… 
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)