Skip to search formSkip to main contentSkip to account menu

Analysis of algorithms

Known as: Problem size, Uniform cost model, Runtime analysis 
In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACM Turing AwardAOMedia Video 1Abstract data typeAbstract machine

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
An Analytical Performance Model for the Spidergon NoC
Highly Cited
2006
Highly Cited
2006
Scalable visual assessment of cluster tendency for large data sets
Highly Cited
2004
Highly Cited
2004
Silicon complexity for maximum likelihood MIMO detection using spherical decoding
Multiple-input multiple-output (MIMO) wireless systems increase spectral efficiency by transmitting independent signals on… 
Highly Cited
2004
Highly Cited
2004
Performance study of localization methods for ad-hoc sensor networks
In ad-hoc wireless sensor networks, one approach for estimating the positions of sensor nodes is to use connectivity information… 
Highly Cited
2001
Highly Cited
2001
Algorithmic procedure to design water utilization systems featuring a single contaminant in process plants
Highly Cited
2001
Highly Cited
2001
Forming Scatternets from Bluetooth Personal Area Networks
There is increasing interest in wireless ad hoc networks built from portable devices equipped with short-range wireless network… 
Review
1998
Review
1998
Architectural choices in large scale ATM switches
The rapid development of Asynchronous Transfer Mode technology in the last 10-15 years has stimulated renewed interest in the… 
Highly Cited
1998
Highly Cited
1998
Characterization of Communication Patterns in Message-Passing Parallel Scientific Application Programs
This paper examines the communication patterns of parallel scientific programs, including some of the NAS benchmarks and the… 
Highly Cited
1996
Highly Cited
1996
Bayesian face recognition using deformable intensity surfaces
We describe a novel technique for face recognition based on deformable intensity surfaces which incorporates both the shape and… 
Highly Cited
1989
Highly Cited
1989
The fast computation of disparity from phase differences
Previous work has demonstrated that the task of recovering local disparity measurements can be reduced to the task of measuring… 
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)