Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q2070573> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Q2070573 subject Q6104879.
- Q2070573 subject Q6467387.
- Q2070573 subject Q7005249.
- Q2070573 abstract "A perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions. A perfect hash function has many of the same applications as other hash functions, but with the advantage that no collision resolution has to be implemented. In mathematical terms, it is a total injective function.".
- Q2070573 wikiPageExternalLink 0702159.
- Q2070573 wikiPageExternalLink perfect.html.
- Q2070573 wikiPageExternalLink index.html.
- Q2070573 wikiPageExternalLink cikm07.pdf.
- Q2070573 wikiPageExternalLink sux.di.unimi.it.
- Q2070573 wikiPageExternalLink MonotoneMinimalPerfectHashing.pdf.
- Q2070573 wikiPageExternalLink gperf.pdf.
- Q2070573 wikiPageExternalLink 9.
- Q2070573 wikiPageExternalLink gperf.
- Q2070573 wikiPageExternalLink alx09_013_belazzouguid.pdf.
- Q2070573 wikiPageWikiLink Q1141518.
- Q2070573 wikiPageWikiLink Q1144915.
- Q2070573 wikiPageWikiLink Q1195184.
- Q2070573 wikiPageWikiLink Q1584911.
- Q2070573 wikiPageWikiLink Q1756942.
- Q2070573 wikiPageWikiLink Q1806121.
- Q2070573 wikiPageWikiLink Q182003.
- Q2070573 wikiPageWikiLink Q183427.
- Q2070573 wikiPageWikiLink Q2024396.
- Q2070573 wikiPageWikiLink Q207440.
- Q2070573 wikiPageWikiLink Q2524992.
- Q2070573 wikiPageWikiLink Q39162.
- Q2070573 wikiPageWikiLink Q5318999.
- Q2070573 wikiPageWikiLink Q578036.
- Q2070573 wikiPageWikiLink Q583461.
- Q2070573 wikiPageWikiLink Q6104879.
- Q2070573 wikiPageWikiLink Q6467387.
- Q2070573 wikiPageWikiLink Q690265.
- Q2070573 wikiPageWikiLink Q7005249.
- Q2070573 wikiPageWikiLink Q7041820.
- Q2070573 wikiPageWikiLink Q7158377.
- Q2070573 wikiPageWikiLink Q7632678.
- Q2070573 wikiPageWikiLink Q846912.
- Q2070573 wikiPageWikiLink Q93028.
- Q2070573 wikiPageWikiLink Q949972.
- Q2070573 comment "A perfect hash function for a set S is a hash function that maps distinct elements in S to a set of integers, with no collisions. A perfect hash function has many of the same applications as other hash functions, but with the advantage that no collision resolution has to be implemented. In mathematical terms, it is a total injective function.".
- Q2070573 label "Perfect hash function".