{"id":"https://openalex.org/W1852367285","doi":"https://doi.org/10.1109/tc.1985.1676640","title":"An Efficient Unsorted VLSI Dictionary Machine","display_name":"An Efficient Unsorted VLSI Dictionary Machine","publication_year":1985,"publication_date":"1985-09-01","ids":{"openalex":"https://openalex.org/W1852367285","doi":"https://doi.org/10.1109/tc.1985.1676640","mag":"1852367285"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1985.1676640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1985.1676640","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5101167004","display_name":"Somani","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Somani","raw_affiliation_strings":["Department of Electrical Engineering, McGill University","Dept. of Electrical Engineering, McGill University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, McGill University","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Dept. of Electrical Engineering, McGill University","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110913337","display_name":"Agarwal","orcid":null},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Agarwal","raw_affiliation_strings":["Department of Electrical Engineering, McGill University, Montreal, QUE, Canada","McGill Univ., Montreal, Que., , Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, McGill University, Montreal, QUE, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"McGill Univ., Montreal, Que., , Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":8.1362,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.97244064,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"C-34","issue":"9","first_page":"841","last_page":"852"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.8252137303352356},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.6904683709144592},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.6774640083312988},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6331889629364014},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.62488853931427},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5730748772621155},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5492061972618103},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4996805191040039},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.4715407192707062},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4497586786746979},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.43487444519996643},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4304870367050171},{"id":"https://openalex.org/keywords/priority-queue","display_name":"Priority queue","score":0.41356295347213745},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.41193562746047974},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3825610280036926},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3145119547843933},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.23368874192237854},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1873755156993866},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.16963344812393188},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15120753645896912},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.11885431408882141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09287795424461365}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8252137303352356},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.6904683709144592},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.6774640083312988},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6331889629364014},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.62488853931427},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5730748772621155},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5492061972618103},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4996805191040039},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.4715407192707062},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4497586786746979},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.43487444519996643},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4304870367050171},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.41356295347213745},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.41193562746047974},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3825610280036926},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3145119547843933},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.23368874192237854},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1873755156993866},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.16963344812393188},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15120753645896912},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.11885431408882141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09287795424461365},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1985.1676640","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1985.1676640","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1509443229","https://openalex.org/W1728173818","https://openalex.org/W1852367285","https://openalex.org/W1974106274","https://openalex.org/W1990360797","https://openalex.org/W2014130761","https://openalex.org/W2067021215","https://openalex.org/W2115154457","https://openalex.org/W2171603032","https://openalex.org/W2305779774","https://openalex.org/W6630562399","https://openalex.org/W6685047897"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2026697457","https://openalex.org/W2361906991","https://openalex.org/W2501849745","https://openalex.org/W2061004850","https://openalex.org/W3169685561","https://openalex.org/W2364382882","https://openalex.org/W2371680642","https://openalex.org/W1992432548","https://openalex.org/W1979520615"],"abstract_inverted_index":{"A":[0],"systolic":[1],"binary":[2,120],"tree":[3,37,96,121,152],"machine":[4,11,38,61,82,111],"which":[5,68],"can":[6,32],"handle":[7],"all":[8],"the":[9,36,48,60,79,88,95,119,127,146,151,158],"dictionary":[10],"and":[12,23,47,74,144],"priority":[13],"queue":[14],"operations":[15,31],"such":[16],"as":[17],"Insert,":[18],"Delete,":[19],"Extract-Min,":[20],"Extract-Max,":[21],"Member,":[22],"Near":[24],"is":[25,50,97],"designed":[26],"in":[27,39,53,59,94,133],"this":[28,110],"paper.":[29],"The":[30,81],"be":[33],"fed":[34],"into":[35],"a":[40,44,54,71,75],"pipeline":[41,55],"manner":[42],"at":[43,63],"constant":[45],"rate":[46],"output":[49],"correspondingly":[51],"generated":[52],"manner.":[56],"Each":[57],"processor":[58],"stores":[62],"most":[64],"one":[65,154],"data":[66,91,131],"element,":[67],"consists":[69],"of":[70,90,150,157],"key":[72],"value":[73],"record":[76],"associated":[77],"with":[78],"key.":[80],"has":[83,141],"optimal":[84,124],"performance":[85,125],"since":[86],"if":[87],"number":[89],"elements":[92,132],"present":[93],"n,":[98],"then":[99],"each":[100],"operation":[101],"takes":[102],"O(log":[103],"n)":[104],"steps.":[105],"Unlike":[106],"some":[107],"recent":[108],"designs,":[109],"does":[112],"not":[113],"use":[114],"any":[115,134],"links":[116],"other":[117],"than":[118],"links,":[122],"provides":[123],"without":[126],"need":[128],"to":[129],"store":[130],"sorted":[135],"order":[136],"by":[137],"exploiting":[138],"dynamic":[139],"rebalancing,":[140],"higher":[142],"throughput,":[143],"keeps":[145],"logical":[147],"last":[148],"level":[149,156],"on":[153],"physical":[155],"tree.":[159]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}