{"id":"https://openalex.org/W2164609939","doi":"https://doi.org/10.1137/0220050","title":"The Maximum Size of Dynamic Data Structures","display_name":"The Maximum Size of Dynamic Data Structures","publication_year":1991,"publication_date":"1991-10-01","ids":{"openalex":"https://openalex.org/W2164609939","doi":"https://doi.org/10.1137/0220050","mag":"2164609939"},"language":"en","primary_location":{"id":"doi:10.1137/0220050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220050","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1808/7172","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081879208","display_name":"Claire Kenyon-Mathieu","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Claire M. Kenyon-Mathieu","raw_affiliation_strings":["Laboratoire d'Informatique de l'Ecole Normale Sup6rieure, 45, rue d'Ulm, 75230 Paris Cedex 05, France","Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912"],"affiliations":[{"raw_affiliation_string":"Laboratoire d'Informatique de l'Ecole Normale Sup6rieure, 45, rue d'Ulm, 75230 Paris Cedex 05, France","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003340402","display_name":"Jeffrey Scott Vitter","orcid":"https://orcid.org/0000-0001-7970-6118"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey Scott Vitter","raw_affiliation_strings":["Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912","Laboratoire d'Informatique de l'Ecole Normale Sup6rieure, 45, rue d'Ulm, 75230 Paris Cedex 05, France"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Brown University, Box 1910, Providence, Rhode Island 02912","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Laboratoire d'Informatique de l'Ecole Normale Sup6rieure, 45, rue d'Ulm, 75230 Paris Cedex 05, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081879208"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":1.6178,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86791364,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"20","issue":"5","first_page":"807","last_page":"823"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6512556672096252},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.610444188117981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5568272471427917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5407400727272034},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.531893253326416},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4779210686683655},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4600489139556885},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.44766733050346375},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.4461784362792969},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.4160860776901245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38997548818588257},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3527272343635559},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13299915194511414}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6512556672096252},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.610444188117981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5568272471427917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5407400727272034},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.531893253326416},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4779210686683655},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4600489139556885},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.44766733050346375},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4461784362792969},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.4160860776901245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38997548818588257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3527272343635559},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13299915194511414},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0220050","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220050","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.998.3157","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.998.3157","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://kuscholarworks.ku.edu/bitstream/handle/1808/7172/vitter_oct1991.pdf%3Bjsessionid%3DE62BF925E19DAA0215716E89D5E0DBB3?sequence%3D1","raw_type":"text"},{"id":"pmh:oai:kuscholarworks.ku.edu:1808/7172","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/7172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:kuscholarworks.ku.edu:1808/7172","is_oa":true,"landing_page_url":"http://hdl.handle.net/1808/7172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400421","display_name":"KU ScholarWorks (The University of Kansas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I146416000","host_organization_name":"University of Kansas","host_organization_lineage":["https://openalex.org/I146416000"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W193706516","https://openalex.org/W1552754510","https://openalex.org/W1964772730","https://openalex.org/W1967171647","https://openalex.org/W1984996833","https://openalex.org/W1994813238","https://openalex.org/W2021278014","https://openalex.org/W2023189876","https://openalex.org/W2048344198","https://openalex.org/W2060392318","https://openalex.org/W2061637728","https://openalex.org/W2751862591"],"related_works":["https://openalex.org/W3148718598","https://openalex.org/W2163788280","https://openalex.org/W2012749513","https://openalex.org/W2159024673","https://openalex.org/W3001987467","https://openalex.org/W4252190074","https://openalex.org/W2968165261","https://openalex.org/W2105238802","https://openalex.org/W2154676777","https://openalex.org/W1603161560"],"abstract_inverted_index":{"This":[0,136],"paper":[1],"develops":[2],"two":[3],"probabilistic":[4,71,190],"methods":[5,60],"that":[6,105,109],"allow":[7],"the":[8,11,50,99,121,125,132,161,169,173,177,181,185,188],"analysis":[9,162],"of":[10,20,49,56,67,119,124,148,158,163],"maximum":[12,101,126,133,178,198],"data":[13,25,102],"structure":[14,103],"size":[15,104,127],"encountered":[16],"during":[17],"a":[18,77,166],"sequence":[19],"insertions":[21],"and":[22,34,37,43,70,153,179],"deletions":[23],"in":[24,38,85,116,144,201],"structures":[26,40],"such":[27],"as":[28,73,75],"priority":[29],"queues,":[30],"dictionaries,":[31],"linear":[32],"lists,":[33],"symbol":[35],"tables,":[36],"sweepline":[39,83],"for":[41,81,98],"geometry":[42],"Very-Large-Scale-Integration":[44],"(VLSI)":[45],"applications.":[46],"The":[47,59],"notion":[48],"\u201cmaximum\u201d":[51],"is":[52,128,192],"basic":[53],"to":[54,64,76,113,131,176,194],"issues":[55],"resource":[57],"preallocation.":[58],"here":[61],"are":[62,96,106,151],"applied":[63],"combinatorial":[65],"models":[66],"file":[68],"histories":[69],"models,":[72],"well":[74],"non-Markovian":[78],"process":[79],"(algorithm)":[80],"processing":[82],"information":[84],"an":[86],"efficient":[87],"way,":[88],"called":[89],"\u201chashing":[90],"with":[91],"lazy":[92],"deletion\u201d":[93],"(HwLD).":[94],"Expressions":[95],"derived":[97],"expected":[100,122,134],"asymptotically":[107,129],"exact,":[108],"is,":[110],"correct":[111],"up":[112],"lower-order":[114],"terms;":[115],"several":[117,138],"cases":[118],"interest":[120],"value":[123],"equal":[130],"size.":[135],"solves":[137],"open":[139],"problems,":[140],"including":[141],"longstanding":[142],"questions":[143],"queueing":[145],"theory.":[146],"Both":[147],"these":[149],"approaches":[150],"robust":[152],"rely":[154],"upon":[155],"novel":[156],"applications":[157],"techniques":[159],"from":[160],"algorithms.":[164],"At":[165],"high":[167],"level,":[168],"first":[170],"method":[171],"isolates":[172],"primary":[174],"contribution":[175],"bounds":[180],"lesser":[182],"effects.":[183],"In":[184],"second":[186],"technique":[187],"continuous-time":[189],"model":[191],"related":[193],"its":[195],"discrete":[196],"analog\u2014the":[197],"slot":[199],"occupancy":[200],"hashing.":[202]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}