Analysis of N-trees

DOI10.1016/0020-0190(83)90064-9zbMATH Open0506.68050OpenAlexW2017493520MaRDI QIDQ1836985FDOQ1836985

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

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

Cited In (3)

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

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)