Skip to search formSkip to main contentSkip to account menu

Amortized analysis

Known as: Amortized complexity, Amortised analysis, Amortized time 
In computer science, amortized analysis is a method for analyzing a given algorithm's time complexity, or how much of a resource, especially time or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
JavaScript is ubiquitous on the web. At the same time, the language's dynamic behavior makes optimizations challenging, leading… 
Highly Cited
2008
Highly Cited
2008
The wide-spread phenomenon of software (running image) aging is known to cause performance degradation, transient failures or… 
2007
2007
Run-time compilation systems are challenged with the task of translating a program's instruction stream while maintaining low… 
Highly Cited
2006
Highly Cited
2006
Efficient sensor data fusion is one of the more critical and challenging tasks in building practical sensor networks. It is… 
2005
2005
Although a number of weaknesses of symbolic execution, when used for software testing, have been highlighted in the literature… 
2005
2005
AbstractAd-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks… 
2004
2004
Does the concept of path dependence provide a plausible theoretical framework for historical institutionalism? Practitioners of… 
2003
2003
This paper briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes… 
1953
1953
THE present report deals with the efforts of the Standing Committee on Physical Analyses to formulate an acceptable standard…