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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

Silicon photonic interconnection networks can provide significant advantages in bandwidth densities and data communication energy…

2008

Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely…

2006

This paper considers the problem of scalably processing a large number of continuous queries. We propose a flexible framework…

2005

Presented at the 20th European Photovoltaic Solar Energy Conference and Exhibition, Barcelona, Spain; June 6-10, 2005.

2004

∗ A. Helmy was supported by NSF CAREER Award 0134650. Abstract Traditional protocols for routing in ad hoc networks attempt to…

2004

SOAP is an XML-based protocol that is widely used in Web services and that provides extensibility, portability, flexibility, and…

2000

Buffered coscheduling is a scheduling methodology for time-sharing communicating processes in parallel and distributed systems…

1997

We discuss response time properties of linear arrays and tree-like arrays of cells with various handshake communication…

1996

Sparse matrix problems are difficult to parallelize efficiently on distributed memory machines since non-zero elements are…

1953

THE present report deals with the efforts of the Standing Committee on Physical Analyses to formulate an acceptable standard…