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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Finding opinionated blog posts is still an open problem in information retrieval, as exemplified by the recent TREC blog tracks… 
Highly Cited
2004
Highly Cited
2004
Multiple-input multiple-output (MIMO) wireless systems increase spectral efficiency by transmitting independent signals on… 
Highly Cited
2004
Highly Cited
2004
This study reports on the integration of a novel reconfigurable microstrip antenna capable of reconfiguring both its radiation… 
Highly Cited
2004
Highly Cited
2004
In ad-hoc wireless sensor networks, one approach for estimating the positions of sensor nodes is to use connectivity information… 
Highly Cited
2000
Highly Cited
2000
There is growing interest in extending complex systems approaches to the social sciences. This is apparent in the increasingly… 
Highly Cited
1997
Highly Cited
1997
The finite difference time domain (FDTD) method is well suited for the computation of bio-electromagnetic effects and has become… 
Highly Cited
1995
Highly Cited
1995
In compiling applications for distributed memory machines, runtime analysis is required when data to be communicated cannot be… 
Highly Cited
1993
Highly Cited
1993
Manufacturing tolerances, installation errors and link oflsets contaminate the nominal values of the kinematic parameters used in… 
Highly Cited
1989
Highly Cited
1989
Previous work has demonstrated that the task of recovering local disparity measurements can be reduced to the task of measuring…