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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We summarise the state of the art in automatic amortized resource analysis. We then focus on some recent applications to term… (More)
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Recent studies of probabilistic reasoning have postulated general-purpose inference algorithms that can be used to answer… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2014
2014
Automatic methods for computing bounds on the resource consumption of programs are an active area of research. In [SZV14] we… (More)
  • figure 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Traditional approaches to generic secure computation begin by representing the function f being computed as a circuit. If f… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We study the problem of automatically analyzing the worst-case resource usage of procedures with several arguments. Existing… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In 2003, Hofmann and Jost introduced a type system that uses a potential-based amortized analysis to infer bounds on the resource… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
For every e > 0 and integers k and q (with k < q <_ k+k2/4), we present a P C P character iza t ion of NP, where the verifier… (More)
  • figure 1
Is this relevant?
Highly Cited
1995
Highly Cited
1995
In this work we study the direct-sum problem with respect to communication complexity: Consider a relation f deened over f0; 1g n… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
In this article we study the amortized efficiency of the “move-to-front” and similar rules for dynamically maintaining a linear… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The performance of sequential search can be enhanced by the use of heuristics that move elements closer to the front of the list… (More)
  • table I
  • figure 1
Is this relevant?