Skip to search formSkip to main contentSkip to account menu

Best, worst and average case

Known as: Average-case, Worst-case, Best-case analysis 
In computer science, best, worst, and average cases of a given algorithm express what the resource usage is at least, at most and on average… 
Wikipedia (opens in a new tab)

Related topics

Related topics

44 relations
AP Computer Science AAlgorithmAlgorithmic efficiencyAmortized analysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Power control in two-tier femtocell networks
In a two tier cellular network - comprised of a central macrocell underlaid with shorter range femtocell hotspots - cross-tier… 
Highly Cited
2005
Highly Cited
2005
Worst and best-case coverage in sensor networks
Wireless ad hoc sensor networks have recently emerged as a premier research topic. They have great long-term economic potential… 
Review
2005
Review
2005
System level performance analysis - the SymTA/S approach
SymTA/S is a system-level performance and timing analysis approach based on formal scheduling analysis techniques and symbolic… 
Highly Cited
2005
Highly Cited
2005
Erasure-coding based routing for opportunistic networks
Routing in Delay Tolerant Networks (DTN) with unpredictable node mobility is a challenging problem because disconnections are… 
Highly Cited
2004
Highly Cited
2004
Model predictive control for perturbed continuous piecewise affine systems with bounded disturbances
Continuous piecewise-affine systems are a powerful tool for describing or approximating both nonlinear and hybrid systems. In… 
Review
2004
Review
2004
The changing automotive environment: high-temperature electronics
The underhood automotive environment is harsh and current trends in the automotive electronics industry will be pushing the… 
Highly Cited
2003
Highly Cited
2003
Longest prefix matching using bloom filters
We introduce the first algorithm that we are aware of to employ Bloom filters for longest prefix matching (LPM). The algorithm… 
Highly Cited
2000
Highly Cited
2000
Power-aware localized routing in wireless networks
Two metrics where transmission power depends on distance between nodes, and a cost aware metric based on remaining battery power… 
Highly Cited
1998
Highly Cited
1998
A novel unrestricted center-biased diamond search algorithm for block motion estimation
The widespread use of block-based interframe motion estimation for video sequence compression in both MPEG and H.263 standards is… 
Highly Cited
1976
Highly Cited
1976
Timing Recovery in Digital Synchronous Data Receivers
A new class of fast-converging timing recovery methods for synchronous digital data receivers is investigated. Starting with a… 
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)