Analysis of N-trees

DOI10.1016/0020-0190(83)90064-9zbMath0506.68050OpenAlexW2017493520MaRDI QIDQ1836985

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)

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Average time behavior of distributive sorting algorithms
• The design and analysis of a new hybrid sorting algorithm
• Order preserving extendible hashing and bucket tries
• Sorting by distributive partitioning
• Storing a sparse table
• Optimal Expected-Time Algorithms for Closest Point Problems
• On the average-case complexity of “bucketing” algorithms
• Searching and sorting real numbers

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