De-amortization of Algorithms

Authors:
S. Rao Kosaraju;Mihai Pop
Affiliations:
-;-
Venue:
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Year:
1998

Citing 25
Cited 2

Adding range restriction capability to dynamic data structures

Journal of the ACM (JACM)
Deques with heap order

Information Processing Letters
Hash functions for priority queues

Information and Control
Good worst-case algorithms for inserting and deleting records in dense sequential files

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Two algorithms for maintaining order in a list

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation

Communications of the ACM
A balanced search tree with O(1) worst case update time

Acta Informatica
Making data structures persistent

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Eliminating amortization: on data structures with guaranteed response time

Eliminating amortization: on data structures with guaranteed response time
Persistent lists with catenation via recursive slow-down

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Purely functional representations of catenable sorted lists

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Confluently persistent deques via data structuaral bootstrapping

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
An optimal RAM implementation of catenable min double-ended queues

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Real-Time Simulation of Multihead Tape Units

Journal of the ACM (JACM)
List processing in real time on a serial computer

Communications of the ACM
Design of Dynamic Data Structures

Design of Dynamic Data Structures
Amortization, lazy evaluation, and persistence: lists with catenation via lazy linking

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Maintaining dense sequential files in a dynamic environment (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Localized search in sorted lists

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
New real-time simulations of multihead tape units

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition—(Extended Abstract)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Real-time simulation of concatenable double-ended queues by double-ended queues (Preliminary Version)

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
1-Way stack automaton with jumps

Journal of Computer and System Sciences

Oblivious RAM simulation with efficient worst-case access overhead

Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Cache-Oblivious dictionaries and multimaps with negligible failure probability

MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

De-amortization aims to convert algorithms with excellent overall speed, f(n) for performing n operations, into algorithms that take no more than O(f(n)/n) steps for each operation. The paper reviews several existing techniques for de-amortization of algorithms.