scientific article
From MaRDI portal
Publication:3816955
zbMath0665.68001MaRDI QIDQ3816955
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
sortingbibliographyselectionasymptotic analysisdata structuressearchingarithmetic complexitycomplexity measurevan Wijngaarden two-level grammars
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Algorithms in computer science (68W99)
Related Items
\(B\)-trees with lazy parent split, Average-case results on heapsort, Bit serial addition trees and their applications, Fringe analysis for extquick: An in situ distributive external sorting algorithm, A variant of heapsort with almost optimal number of comparisons, A NEW HASHING ALGORITHM FOR PARALLEL PROCESSORS, Balanced ordered trees, Splay trees as priority queues, On the balance property of Patricia tries: External path length viewpoint, In-place linear probing sort, Hypergeometrics and the cost structure of quadtrees, Binary search trees of almost optimal height, A characterization of heaps and its applications, Solution of a Linear Recurrence Equation Arising in the Analysis of Some Algorithms, A characterization of digital search trees from the successful search viewpoint, A note on multikey sorting using modified binary insertion trees, Probabilistic estimation of the number of prefixes of a trace, A Real Elementary Approach to the Master Recurrence and Generalizations, Diamond deque: A simple data structure for priority deques, Fast two-dimensional pattern matching, An efficient data structure for branch-and-bound algorithm, Speeding up the computations on an elliptic curve using addition-subtraction chains, On The variance of the extremal path length in a symmetric digital trie, On the Lambert \(w\) function, Algorithms for sequential generation of combinatorial structures, An efficient external sorting algorithm
