Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A backtracking method for constructing perfect hash functions from a set of mapping functions

From MaRDI portal
Publication:1059411
Jump to:navigation, search

DOI10.1007/BF01934995zbMath0566.68081OpenAlexW2061636422MaRDI QIDQ1059411

J. Blot

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01934995


zbMATH Keywords

backtrackingperfect hashing


Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)


Related Items (3)

Perfect hashing ⋮ Graphs, hypergraphs and hashing ⋮ An algebraic approach to Cichelli's perfect hashing



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Reciprocal hashing
  • Backtrack programming techniques
  • Perfect hashing functions
  • Comments on perfect hashing functions
  • Backtrack Programming


This page was built for publication: A backtracking method for constructing perfect hash functions from a set of mapping functions

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1059411&oldid=13070989"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 23:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki