Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,232,324 papers from all fields of science
Search
Sign In
Create Free Account
Amortized analysis
Known as:
Amortized complexity
, Amortised analysis
, Amortized time
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
47 relations
Accounting method
Analysis of algorithms
BLAS
Best, worst and average case
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A limit study of JavaScript parallelism
Emily Fortuna
,
O. Anderson
,
L. Ceze
,
S. Eggers
IEEE International Symposium on Workload…
2010
Corpus ID: 2688690
JavaScript is ubiquitous on the web. At the same time, the language's dynamic behavior makes optimizations challenging, leading…
Expand
Highly Cited
2008
Highly Cited
2008
Using machine learning for non-intrusive modeling and prediction of software aging
A. Andrzejak
,
L. Silva
IEEE/IFIP Network Operations and Management…
2008
Corpus ID: 802346
The wide-spread phenomenon of software (running image) aging is known to cause performance degradation, transient failures or…
Expand
2007
2007
Persistent Code Caching: Exploiting Code Reuse Across Executions and Applications
V. Reddi
,
D. Connors
,
R. Cohn
,
Michael D. Smith
IEEE/ACM International Symposium on Code…
2007
Corpus ID: 409141
Run-time compilation systems are challenged with the task of translating a program's instruction stream while maintaining low…
Expand
Highly Cited
2006
Highly Cited
2006
Cluster sizing and head selection for efficient data aggregation and routing in sensor networks
Hao Chen
,
S. Megerian
IEEE Wireless Communications and Networking…
2006
Corpus ID: 14255302
Efficient sensor data fusion is one of the more critical and challenging tasks in building practical sensor networks. It is…
Expand
2005
2005
Using symbolic execution to guide test generation
Gareth Lee
,
John Morris
,
Kris Parker
,
G. Bundell
,
C. Lam
Software testing, verification & reliability
2005
Corpus ID: 14803486
Although a number of weaknesses of symbolic execution, when used for software testing, have been highlighted in the literature…
Expand
2005
2005
Dynamic Coverage in Ad-Hoc Sensor Networks
Hai Huang
,
Andréa W. Richa
,
M. Segal
Mob. Networks Appl.
2005
Corpus ID: 18835697
AbstractAd-hoc networks of sensor nodes are in general semi-permanently deployed. However, the topology of such networks…
Expand
2004
2004
Down the Wrong Path : Path Dependence , Increasing Returns , and Historical
H. Schwartz
2004
Corpus ID: 43822271
Does the concept of path dependence provide a plausible theoretical framework for historical institutionalism? Practitioners of…
Expand
2003
2003
Generic Algorithms for the Generation of Combinatorial Objects
Conrado Martínez
,
Xavier Molinero
International Symposium on Mathematical…
2003
Corpus ID: 44421481
This paper briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes…
Expand
1992
1992
Compilation of Set Terms in the Logic Data Language (LDL)
O. Shmueli
,
S. Tsur
,
C. Zaniolo
The Journal of Logic Programming
1992
Corpus ID: 10405075
1953
1953
Report of the Committee on Physical Analyses 1951–1953, Soil Science Society of America
Van Bavel
1953
Corpus ID: 129149127
THE present report deals with the efforts of the Standing Committee on Physical Analyses to formulate an acceptable standard…
Expand
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)
ACCEPT & CONTINUE