Amortized Computational Complexity (Q3735083): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0606031 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987927249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Organizing Binary Search Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric binary B-trees: Data structure and maintenance algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Organization and maintenance of large ordered indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics That Dynamically Organize Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of a Data Structure for Representing Sorted Lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved equivalence algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new data structure for representing sorted lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Pattern Matching in Strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Search Trees of Bounded Balance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3951559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-organizing sequential search heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gauss codes, planar hamiltonian graphs, and stack-sortable permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Adjusting Heaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of algorithms which require nonlinear time to maintain disjoint sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating a balanced search tree in 0(1) rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank

Latest revision as of 15:00, 17 June 2024

scientific article
Language Label Description Also known as
English
Amortized Computational Complexity
scientific article

    Statements

    Amortized Computational Complexity (English)
    0 references
    1985
    0 references
    survey
    0 references
    complexity analysis of data structures
    0 references
    amortization
    0 references
    averaging over time
    0 references
    complexity measure
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references