scientific article

From MaRDI portal
Revision as of 15:08, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3816955

zbMath0665.68001MaRDI QIDQ3816955

Gaston H. Gonnet

Publication date: 1984


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (26)

\(B\)-trees with lazy parent splitAverage-case results on heapsortBit serial addition trees and their applicationsFringe analysis for extquick: An in situ distributive external sorting algorithmA variant of heapsort with almost optimal number of comparisonsA NEW HASHING ALGORITHM FOR PARALLEL PROCESSORSBalanced ordered treesSplay trees as priority queuesOn the balance property of Patricia tries: External path length viewpointIn-place linear probing sortHypergeometrics and the cost structure of quadtreesBinary search trees of almost optimal heightA characterization of heaps and its applicationsSolution of a Linear Recurrence Equation Arising in the Analysis of Some AlgorithmsA characterization of digital search trees from the successful search viewpointA note on multikey sorting using modified binary insertion treesProbabilistic estimation of the number of prefixes of a traceA Real Elementary Approach to the Master Recurrence and GeneralizationsDiamond deque: A simple data structure for priority dequesFast two-dimensional pattern matchingAn efficient data structure for branch-and-bound algorithmSpeeding up the computations on an elliptic curve using addition-subtraction chainsOn The variance of the extremal path length in a symmetric digital trieOn the Lambert \(w\) functionAlgorithms for sequential generation of combinatorial structuresAn efficient external sorting algorithm




This page was built for publication: