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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Community detection and analysis is an important methodology for understanding the organization of various real-world networks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper presents a rigorous running time analysis of evolutionary algorithms on pseudo-Boolean multiobjective optimization… (More)
  • figure 1
  • figure 2
  • figure 4
  • table I
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The computational time complexity is an important topic in t he theory of evolutionary algorithms (EAs). This paper repo rts some… (More)
  • table I
Is this relevant?
Highly Cited
2001
Highly Cited
2001
One of the major obstacles to using Bayesian methods for pattern recognition has been its computational expense. This thesis… (More)
  • figure 3-2
  • figure 5-2
  • figure 5-11
  • figure 5-15
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Thank you for downloading an introduction to the analysis of algorithms. Maybe you have knowledge that, people have search… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
The charter of SRC is to advance both the state of knowledge and the state of the art in computer systems. From our establishment… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Problem #1. A “true” medieval story... Sir Arthur de Templar was paid 27 gold coins for the information he provided on the last… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
This monograph is an ideal companion for a graduate student in computer science or applied mathematics. The material was taken… (More)
Is this relevant?