{"id":"https://openalex.org/W7095963937","doi":null,"title":"\u2022 Required reading","display_name":"\u2022 Required reading","alternate_titles":[],"publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7095963937"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.9827","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.9827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://coral.ie.lehigh.edu/~ted/files/ie170/lectures/Lecture11.pdf","raw_type":"text"},"parent_works":[],"lineage":["https://openalex.org/W7095963937"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108555643","display_name":"Ted K. Ralphs","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dr. Ted Ralphs","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hash Tables","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hash Tables","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.0003000000142492354,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-tables","display_name":"hash tables","score":0.984000027179718},{"id":"https://openalex.org/keywords/dictionaries","display_name":"dictionaries","score":0.7870000004768372},{"id":"https://openalex.org/keywords/hash-functions","display_name":"hash functions","score":0.7149999737739563},{"id":"https://openalex.org/keywords/data-structures","display_name":"data structures","score":0.5299999713897705},{"id":"https://openalex.org/keywords/array-access","display_name":"array access","score":0.46299999952316284},{"id":"https://openalex.org/keywords/collision-resolution","display_name":"collision resolution","score":0.34599998593330383}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7003999948501587},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.696399986743927},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.6545000076293945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6317999958992004},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.5658000111579895},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4253000020980835},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.41179999709129333},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.39149999618530273},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.3905999958515167},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.3644999861717224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36410000920295715},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.35280001163482666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2980000078678131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.296999990940094},{"id":"https://openalex.org/C15845906","wikidata":"https://www.wikidata.org/wiki/Q1172338","display_name":"Data exchange","level":2,"score":0.2825999855995178},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.27730000019073486},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.26660001277923584},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.2556999921798706}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.9827","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.9827","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://coral.ie.lehigh.edu/~ted/files/ie170/lectures/Lecture11.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7097799105","https://openalex.org/W2132054034","https://openalex.org/W7095179564","https://openalex.org/W7097967499","https://openalex.org/W7098166906","https://openalex.org/W4302778563","https://openalex.org/W4205643155","https://openalex.org/W2136399778","https://openalex.org/W2744719529","https://openalex.org/W4240780038"],"abstract_inverted_index":{"\u2022":[0,15,32,50,75,97],"We":[1],"now":[2],"consider":[3],"data":[4,17],"structure":[5],"for":[6,19],"storing":[7,20],"a":[8,55],"dictionary":[9],"that":[10,60],"support":[11],"only":[12],"the":[13,30,35,41,45,86,104],"operations":[14,39,106],"Most":[16],"structures":[18],"dictionaries":[21],"depend":[22],"on":[23,44],"using":[24,95],"comparison":[25],"and":[26],"exchange":[27],"to":[28,66,81,90,101],"order":[29],"items.":[31],"This":[33,98],"limits":[34],"efficiency":[36,46],"of":[37,47,57,63],"certain":[38],"(recall":[40],"lower":[42],"bound":[43],"comparison-based":[48],"sorting).":[49],"A":[51],"hash":[52],"table":[53,87],"is":[54],"generalization":[56],"an":[58,68,83],"array":[59,70],"takes":[61],"advantage":[62],"our":[64],"ability":[65],"access":[67],"arbitrary":[69],"element":[71],"in":[72,85],"constant":[73],"time.":[74],"Using":[76],"hashing,":[77],"we":[78],"determine":[79],"where":[80],"store":[82],"item":[84],"(and":[88],"how":[89],"find":[91],"it":[92],"later)":[93],"without":[94],"comparison.":[96],"allows":[99],"us":[100],"perform":[102],"all":[103],"basic":[105],"extremely":[107],"efficiently.":[108],"2":[109]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7095963937","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2025-10-27T00:00:00"}
