Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,719,856 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
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
1999
1999
Performance Evaluation of Control Networks : Ethernet ,
Feng‐Li Lian
,
J. Moyne
,
D. Tilbury
1999
Corpus ID: 18131346
1 Introduction The traditional communication architecture for control systems is point-to-point, which has been successfully…
Expand
1997
1997
How useful is old information (extended abstract)?
M. Mitzenmacher
ACM SIGACT-SIGOPS Symposium on Principles of…
1997
Corpus ID: 1811150
We consider the problem of load balancing in dynamic distributed systems in cases where new incoming tasks can make use of old…
Expand
1997
1997
Average case computational complexity theory
T. Yamakami
1997
Corpus ID: 124748483
The hardest problems in the complexity class NP are called NP-complete. However, not all NP-complete problems are equally hard to…
Expand
1994
1994
Genetic drift in sharing methods
Samir W. Mahfoud
Proceedings of the First IEEE Conference on…
1994
Corpus ID: 8136426
Adding a sharing method to a genetic algorithm promotes the formation and maintenance of stable subpopulations. The paper…
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
1986
1986
Storing a dynamic sparse table
A. Aho
,
David Lee
27th Annual Symposium on Foundations of Computer…
1986
Corpus ID: 417354
We present a family of data structures that can process a sequence of insert, delete, and lookup instructions such that each…
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
1984
1984
A constant expected time, linear storage data structure for representing three-dimensional objects
T. Woo
,
J. Wolter
IEEE Transactions on Systems, Man and Cybernetics
1984
Corpus ID: 2960742
The interrogation of spatial relations and properties of three-dimensional objects are often involved in applications programs…
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