Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Background: Cross project defect prediction (CPDP) recently gained considerable attention, yet there are no systematic efforts to… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 7
Is this relevant?
Review
2017
Review
2017
The vehicle routing problem with drones (VRPD) is inspired by the increasing interest in commercial drone delivery by companies… Expand
Is this relevant?
Review
2017
Review
2017
“Linking the power and transport sectors—Part 1” describes the general principle of “sector coupling” (SC), develops a working… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We construct public-key cryptosystems that are secure assuming theworst-case hardness of approximating the minimum distance on n… Expand
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Adaptive beamforming methods are known to degrade if some of underlying assumptions on the environment, sources, or sensor array… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present a probabilistic public key cryptosystem which is secure unless the worst case of the following lattice problem can be… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
This paper analyzes the asymptotic worst-case running time of a number of variants of the well-known method of path compression… Expand
  • figure 2
  • figure 3
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1982
Highly Cited
1982
We describe a data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and… Expand
Is this relevant?