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)

Related topics

Related topics

47 relations
Accounting methodAnalysis of algorithmsBLASBest, worst and average case

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A limit study of JavaScript parallelism
JavaScript is ubiquitous on the web. At the same time, the language's dynamic behavior makes optimizations challenging, leading… 
2007
2007
Persistent Code Caching: Exploiting Code Reuse Across Executions and Applications
Run-time compilation systems are challenged with the task of translating a program's instruction stream while maintaining low… 
2007
2007
AHA: Amortized Heap Space Usage Analysis
8th International Symposium on Trends in Functional Programming (TFP'07), New York,, 2 april 2007 
2005
2005
Using symbolic execution to guide test generation
Although a number of weaknesses of symbolic execution, when used for software testing, have been highlighted in the literature… 
2005
2005
H2A: Hybrid Hash-chaining scheme for Adaptive multicast source authentication of media-streaming
2005
2005
Dynamic Coverage in Ad-Hoc Sensor Networks
AbstractAd-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks… 
2003
2003
Generic Algorithms for the Generation of Combinatorial Objects
This paper briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes… 
Review
2002
Review
2002
Hardware-assisted fast routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically… 
Highly Cited
1996
Highly Cited
1996
Testing of the long code and hardness for clique
We prove that unless NP = COR, Max Clique is hard to approximate wit hin polynomial time within a factor ni /2 ‘c for any c >0… 
1953
1953
Report of the Committee on Physical Analyses 1951–1953, Soil Science Society of America
THE present report deals with the efforts of the Standing Committee on Physical Analyses to formulate an acceptable standard… 
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)