File structures using hashing functions

DOI10.1145/362686.362693MaRDI QIDQ5619640zbMATH OpenOpenAlexWikidataFDO

Authors J. Eve, E. G. jun. Coffman

Publication date 1970

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/362686.362693

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Cited in

(19)

• The total path length of split trees
• Dynamic hashing
• Weighted height of random trees
• Multiple choice tries and distributed hash tables
• On the variance of a class of inductive valuations of data structures for digital search
• Universal hash functions for an infinite universe and hash trees
• Distances in random digital search trees
• The oscillatory distribution of distances in random tries
• Node profiles of symmetric digital search trees: Concentration properties
• On-line construction of position heaps
• Position heaps: a simple and dynamic text indexing data structure
• Position heaps for Cartesian-tree matching on strings and tries
• On the shape of the fringe of various types of random trees
• The asymptotic distribution of cluster sizes for supercritical percolation on random split trees
• The fluctuations of the giant cluster for percolation on random split trees
• Inversions in split trees and conditional Galton-Watson trees
• Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
• On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
• Order preserving extendible hashing and bucket tries

This page was built for publication: File structures using hashing functions

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