Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,935,574 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.
2014
2014
Dynamic Reconfiguration of Silicon Photonic Circuit Switched Interconnection Networks
D. Calhoun
,
K. Wen
,
+5 authors
M. Hochberg
2014
Corpus ID: 1312446
Silicon photonic interconnection networks can provide significant advantages in bandwidth densities and data communication energy…
Expand
2014
2014
Quantum Information Complexity and Amortized Communication
D. Touchette
arXiv.org
2014
Corpus ID: 14149523
We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity…
Expand
2012
2012
Discovery Through Gossip
Bernhard Haeupler
,
Gopal Pandurangan
,
D. Peleg
,
R. Rajaraman
,
Zhifeng Sun
ACM Symposium on Parallelism in Algorithms and…
2012
Corpus ID: 6169083
We study randomized gossip‐based processes in dynamic networks that are motivated by information discovery in large‐scale…
Expand
2008
2008
Improved Approximate Detection of Duplicates for Data Streams Over Sliding Windows
Hong Shen
,
Yu Zhang
Journal of Computational Science and Technology
2008
Corpus ID: 29802848
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely…
Expand
2008
2008
Total Energy Minimization of Real-Time Tasks in an On-Chip Multiprocessor Using Dynamic Voltage Scaling Efficiency Metric
H. Kim
,
Hyejeong Hong
,
Hong-Sik Kim
,
Jin-Ho Ahn
,
Sungho Kang
IEEE Transactions on Computer-Aided Design of…
2008
Corpus ID: 14494040
This paper proposes an algorithm that provides both dynamic voltage scaling and power shutdown to minimize the total energy…
Expand
2005
2005
Sub-optimality Approximations
R. Bent
,
Irit Katriel
,
Pascal Van Hentenryck
International Conference on Principles and…
2005
Corpus ID: 14062605
The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ*, and a variable x with…
Expand
2004
2004
CARD: A Contact-based Architecture for Resource Discovery in Ad Hoc Networks
A. Helmy
,
S. Garg
,
Priyatham Pamu
,
Nitin Nahata
2004
Corpus ID: 61090707
∗ A. Helmy was supported by NSF CAREER Award 0134650. Abstract Traditional protocols for routing in ad hoc networks attempt to…
Expand
2004
2004
Performance of Dynamically Resizing Message Fields for Differential Serialization of SOAP Messages
N. Abu-Ghazaleh
,
M. Lewis
,
M. Govindaraju
International Conference on Internet Computing
2004
Corpus ID: 171409
SOAP is an XML-based protocol that is widely used in Web services and that provides extensibility, portability, flexibility, and…
Expand
2002
2002
Economic Analysis of Hydrogen Energy Station Concepts: Are "H 2E-Stations" a Key Link to a Hydrogen Fuel Cell Vehicle Infrastructure?
T. Lipman
,
J. Edwards
,
D. Kammen
2002
Corpus ID: 107474988
Fuel cell vehicles (FCVs) powered directly with hydrogen (H2) will need access to a H2 refueling infrastruture. For this reason…
Expand
1997
1997
Response time properties of some asynchronous circuits
J. Ebergen
,
R. Berks
Proceedings Third International Symposium on…
1997
Corpus ID: 5240677
We discuss response time properties of linear arrays and tree-like arrays of cells with various handshake communication…
Expand