Extendible hashing with overflow (Q1172380)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Extendible hashing with overflow	scientific article

Statements

scholarly article

0 references

Extendible hashing with overflow (English)

0 references

zbMATH Open document ID

0 references

10.1016/0020-0190(82)90123-5

0 references

Markku Tamminen

0 references

Information Processing Letters

0 references

publication date

1982

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

performance analysis

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0020-0190(82)90123-5

0 references

0 references

A note on the analysis of extendible hashing

0 references

On the average height of trees in digital search and dynamic hashing

0 references

On the performance evaluation of extendible hashing and trie searching

0 references

Order preserving extendible hashing and bucket tries

0 references

The extendible cell method for closest point problems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1172380

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1172380&oldid=34676451"