Maximum size of a dynamic data structure : hashing with lazy delection revisited

Saved in:
Bibliographic Details
Published in:SIAM journal on computing 1992, Vol.21 (4), p.713-732
Main Authors: ALDOUS, D, HOFRI, M, SZPANKOWSKI, W
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming theory
Theoretical computing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 732
container_issue 4
container_start_page 713
container_title SIAM journal on computing
container_volume 21
creator ALDOUS, D
HOFRI, M
SZPANKOWSKI, W
description
format article
fullrecord <record><control><sourceid>pascalfrancis</sourceid><recordid>TN_cdi_pascalfrancis_primary_3887942</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3887942</sourcerecordid><originalsourceid>FETCH-pascalfrancis_primary_38879423</originalsourceid><addsrcrecordid>eNqNyrsKwjAUANAgCtbHP9zBtZDYlrauorgIDu7lkqT2Sl_kpmr79S5-gNNZzkwESuZJmCql5iKQMk_DJMrTpVgxP6VUcayiQNyu-KFmaIBpstCVgGDGFhvSYNAjsHeD9oOzcIAKuaL2AW_yFdQ4jWBsbbWnrgVnX8TkrdmIRYk12-3PtdidT_fjJeyRNdalw1YTF72jBt1YRFmW5vE--rN9AfddQf4</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Maximum size of a dynamic data structure : hashing with lazy delection revisited</title><source>SIAM Journals Archive</source><source>ABI/INFORM Global</source><creator>ALDOUS, D ; HOFRI, M ; SZPANKOWSKI, W</creator><creatorcontrib>ALDOUS, D ; HOFRI, M ; SZPANKOWSKI, W</creatorcontrib><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Programming theory ; Theoretical computing</subject><ispartof>SIAM journal on computing, 1992, Vol.21 (4), p.713-732</ispartof><rights>1994 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4010</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=3887942$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>ALDOUS, D</creatorcontrib><creatorcontrib>HOFRI, M</creatorcontrib><creatorcontrib>SZPANKOWSKI, W</creatorcontrib><title>Maximum size of a dynamic data structure : hashing with lazy delection revisited</title><title>SIAM journal on computing</title><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Programming theory</subject><subject>Theoretical computing</subject><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1992</creationdate><recordtype>article</recordtype><recordid>eNqNyrsKwjAUANAgCtbHP9zBtZDYlrauorgIDu7lkqT2Sl_kpmr79S5-gNNZzkwESuZJmCql5iKQMk_DJMrTpVgxP6VUcayiQNyu-KFmaIBpstCVgGDGFhvSYNAjsHeD9oOzcIAKuaL2AW_yFdQ4jWBsbbWnrgVnX8TkrdmIRYk12-3PtdidT_fjJeyRNdalw1YTF72jBt1YRFmW5vE--rN9AfddQf4</recordid><startdate>1992</startdate><enddate>1992</enddate><creator>ALDOUS, D</creator><creator>HOFRI, M</creator><creator>SZPANKOWSKI, W</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope></search><sort><creationdate>1992</creationdate><title>Maximum size of a dynamic data structure : hashing with lazy delection revisited</title><author>ALDOUS, D ; HOFRI, M ; SZPANKOWSKI, W</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-pascalfrancis_primary_38879423</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1992</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Programming theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>ALDOUS, D</creatorcontrib><creatorcontrib>HOFRI, M</creatorcontrib><creatorcontrib>SZPANKOWSKI, W</creatorcontrib><collection>Pascal-Francis</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>ALDOUS, D</au><au>HOFRI, M</au><au>SZPANKOWSKI, W</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Maximum size of a dynamic data structure : hashing with lazy delection revisited</atitle><jtitle>SIAM journal on computing</jtitle><date>1992</date><risdate>1992</risdate><volume>21</volume><issue>4</issue><spage>713</spage><epage>732</epage><pages>713-732</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub></addata></record>
fulltext fulltext
identifier ISSN: 0097-5397
ispartof SIAM journal on computing, 1992, Vol.21 (4), p.713-732
issn 0097-5397
1095-7111
language eng
recordid cdi_pascalfrancis_primary_3887942
source SIAM Journals Archive; ABI/INFORM Global
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Programming theory
Theoretical computing
title Maximum size of a dynamic data structure : hashing with lazy delection revisited
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-24T02%3A01%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Maximum%20size%20of%20a%20dynamic%20data%20structure%20:%20hashing%20with%20lazy%20delection%20revisited&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=ALDOUS,%20D&rft.date=1992&rft.volume=21&rft.issue=4&rft.spage=713&rft.epage=732&rft.pages=713-732&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/&rft_dat=%3Cpascalfrancis%3E3887942%3C/pascalfrancis%3E%3Cgrp_id%3Ecdi_FETCH-pascalfrancis_primary_38879423%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