The effect of table expansion on the program complexity of perfect hash functions

Saved in:
Bibliographic Details
Published in:BIT 1992-09, Vol.32 (3), p.430-440
Main Author: Mairson, Harry G.
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c229t-487eaac5f540d308a835ef6f48ba662462da296c2e64eb69982763da563280d03
cites cdi_FETCH-LOGICAL-c229t-487eaac5f540d308a835ef6f48ba662462da296c2e64eb69982763da563280d03
container_end_page 440
container_issue 3
container_start_page 430
container_title BIT
container_volume 32
creator Mairson, Harry G.
description
doi_str_mv 10.1007/BF02074879
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1007_BF02074879</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1007_BF02074879</sourcerecordid><originalsourceid>FETCH-LOGICAL-c229t-487eaac5f540d308a835ef6f48ba662462da296c2e64eb69982763da563280d03</originalsourceid><addsrcrecordid>eNpFkN1KxDAUhIMoWFdvfIJcC9WTpEmbS11cFRZEWK_LaZrYSv9IIuy-vVkVhIHDwMzhYwi5ZnDLAMq7hw1wKIuq1CckY7LkuWZcnpIMAFQuKiHPyUUInwBcKyYy8rbrLLXOWRPp7GjEZkh-v-AU-nmiSTEFFj9_eBypmcdlsPs-Ho7hxfqfXoeho-5rMjFVwiU5czgEe_V3V-R987hbP-fb16eX9f02N5zrmCdGi2ikkwW0AipMbNYpV1QNKsULxVtMjIZbVdhGaV3xUokWpRK8ghbEitz8_jV-DsFbVy--H9Efagb1cYz6fwzxDcNfUV4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The effect of table expansion on the program complexity of perfect hash functions</title><source>Springer LINK Archives</source><creator>Mairson, Harry G.</creator><creatorcontrib>Mairson, Harry G.</creatorcontrib><identifier>ISSN: 0006-3835</identifier><identifier>EISSN: 1572-9125</identifier><identifier>DOI: 10.1007/BF02074879</identifier><language>eng</language><ispartof>BIT, 1992-09, Vol.32 (3), p.430-440</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c229t-487eaac5f540d308a835ef6f48ba662462da296c2e64eb69982763da563280d03</citedby><cites>FETCH-LOGICAL-c229t-487eaac5f540d308a835ef6f48ba662462da296c2e64eb69982763da563280d03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Mairson, Harry G.</creatorcontrib><title>The effect of table expansion on the program complexity of perfect hash functions</title><title>BIT</title><issn>0006-3835</issn><issn>1572-9125</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNpFkN1KxDAUhIMoWFdvfIJcC9WTpEmbS11cFRZEWK_LaZrYSv9IIuy-vVkVhIHDwMzhYwi5ZnDLAMq7hw1wKIuq1CckY7LkuWZcnpIMAFQuKiHPyUUInwBcKyYy8rbrLLXOWRPp7GjEZkh-v-AU-nmiSTEFFj9_eBypmcdlsPs-Ho7hxfqfXoeho-5rMjFVwiU5czgEe_V3V-R987hbP-fb16eX9f02N5zrmCdGi2ikkwW0AipMbNYpV1QNKsULxVtMjIZbVdhGaV3xUokWpRK8ghbEitz8_jV-DsFbVy--H9Efagb1cYz6fwzxDcNfUV4</recordid><startdate>199209</startdate><enddate>199209</enddate><creator>Mairson, Harry G.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>199209</creationdate><title>The effect of table expansion on the program complexity of perfect hash functions</title><author>Mairson, Harry G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c229t-487eaac5f540d308a835ef6f48ba662462da296c2e64eb69982763da563280d03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mairson, Harry G.</creatorcontrib><collection>CrossRef</collection><jtitle>BIT</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mairson, Harry G.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The effect of table expansion on the program complexity of perfect hash functions</atitle><jtitle>BIT</jtitle><date>1992-09</date><risdate>1992</risdate><volume>32</volume><issue>3</issue><spage>430</spage><epage>440</epage><pages>430-440</pages><issn>0006-3835</issn><eissn>1572-9125</eissn><doi>10.1007/BF02074879</doi><tpages>11</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0006-3835
ispartof BIT, 1992-09, Vol.32 (3), p.430-440
issn 0006-3835
1572-9125
language eng
recordid cdi_crossref_primary_10_1007_BF02074879
source Springer LINK Archives
title The effect of table expansion on the program complexity of perfect hash functions
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T02%3A23%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20effect%20of%20table%20expansion%20on%20the%20program%20complexity%20of%20perfect%20hash%20functions&rft.jtitle=BIT&rft.au=Mairson,%20Harry%20G.&rft.date=1992-09&rft.volume=32&rft.issue=3&rft.spage=430&rft.epage=440&rft.pages=430-440&rft.issn=0006-3835&rft.eissn=1572-9125&rft_id=info:doi/10.1007/BF02074879&rft_dat=%3Ccrossref%3E10_1007_BF02074879%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c229t-487eaac5f540d308a835ef6f48ba662462da296c2e64eb69982763da563280d03%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true