Analysis of N-trees

DOI10.1016/0020-0190(83)90064-9MaRDI QIDQ1836985zbMATH OpenOpenAlexFDO

Authors Markku Tamminen

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90064-9

zbMATH Keywords

analysis of algorithmssearchingdistributive sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 3141621 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Average time behavior of distributive sorting algorithms
• On the average-case complexity of “bucketing” algorithms
• Optimal Expected-Time Algorithms for Closest Point Problems
• Order preserving extendible hashing and bucket tries
• Searching and sorting real numbers
• Sorting by distributive partitioning
• Storing a sparse table
• The design and analysis of a new hybrid sorting algorithm

Cited in

(3)

• Distribution of the size of random hash trees, pebbled hash trees and \(N\)-trees
• Analysis of random LC tries
• Some results on tries with adaptive branching.

This page was built for publication: Analysis of N-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1836985)