Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
The choice of approximate posterior distribution is one of the core problems in variational inference. Most applications of… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 3
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… Expand
  • 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… Expand
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Hofmann and Jost have presented a heap space analysis [1] that finds linear space bounds for many functional programs. It uses an… Expand
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Large-scale Internet services require a computing infrastructure that can beappropriately described as a warehouse-sized… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We propose a packet switched platform for single chip systems which scales well to an arbitrary number of processor like… Expand
  • figure 1
  • figure 3
  • figure 4
  • table 1
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1984
Highly Cited
1984
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, Fibonacci heaps… Expand
Is this relevant?
Highly Cited
1979
Highly Cited
1979
In a high level query and data manipulation language such as SQL, requests are stated non-procedurally, without reference to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?