{"id":"https://openalex.org/W2106643670","doi":"https://doi.org/10.1145/2505879.2505891","title":"Extensible sparse functional arrays with circuit parallelism","display_name":"Extensible sparse functional arrays with circuit parallelism","publication_year":2013,"publication_date":"2013-09-16","ids":{"openalex":"https://openalex.org/W2106643670","doi":"https://doi.org/10.1145/2505879.2505891","mag":"2106643670"},"language":"en","primary_location":{"id":"doi:10.1145/2505879.2505891","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-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/A5103425234","display_name":"John T. O\u2019Donnell","orcid":null},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"John T. O'Donnell","raw_affiliation_strings":["University of Glasgow"],"affiliations":[{"raw_affiliation_string":"University of Glasgow","institution_ids":["https://openalex.org/I7882870"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5103425234"],"corresponding_institution_ids":["https://openalex.org/I7882870"],"apc_list":null,"apc_paid":null,"fwci":1.0873,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81384032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"133","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9995999932289124,"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.9991000294685364,"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.8072143793106079},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5609360337257385},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.46662747859954834},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4642430543899536},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4323299527168274},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.4240318238735199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4224301874637604},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.38421380519866943},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3521367609500885}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8072143793106079},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5609360337257385},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.46662747859954834},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4642430543899536},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4323299527168274},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.4240318238735199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4224301874637604},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.38421380519866943},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3521367609500885},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2505879.2505891","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2505879.2505891","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.gla.ac.uk:83574","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":false,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W144022585","https://openalex.org/W1546619691","https://openalex.org/W1555859008","https://openalex.org/W1568888158","https://openalex.org/W1974120505","https://openalex.org/W2002033705","https://openalex.org/W2041300124","https://openalex.org/W2078944436","https://openalex.org/W2085057490","https://openalex.org/W2089181966","https://openalex.org/W2101413772","https://openalex.org/W2104958979","https://openalex.org/W2105045857","https://openalex.org/W2108157916","https://openalex.org/W2113757735","https://openalex.org/W2158697867","https://openalex.org/W2180849554","https://openalex.org/W4290864872"],"related_works":["https://openalex.org/W2922314686","https://openalex.org/W1789848037","https://openalex.org/W961142965","https://openalex.org/W108605771","https://openalex.org/W2097465621","https://openalex.org/W2148482302","https://openalex.org/W4240724541","https://openalex.org/W2188379963","https://openalex.org/W1964609106","https://openalex.org/W1496519673"],"abstract_inverted_index":{"A":[0],"longstanding":[1],"open":[2],"question":[3],"in":[4,30,103,153,184,202],"algorithms":[5,230],"and":[6,12,23,77,82,121,157,186,220,231,235],"data":[7],"structures":[8],"is":[9,37,68,130,141],"the":[10,31,49,60,99,128,145,149],"time":[11,29,76,111,154],"space":[13,78,185],"complexity":[14,51,79,152],"of":[15,65,160,198,229],"pure":[16],"functional":[17,53,85,219],"arrays.":[18,86,123],"Imperative":[19],"arrays":[20,176],"provide":[21],"update":[22,81],"lookup":[24,83],"operations":[25,112],"that":[26,39,47,71,113,140,168],"require":[27],"constant":[28,181],"RAM":[32,45,134,146],"theoretical":[33],"model,":[34],"but":[35,95],"it":[36,97,236],"conjectured":[38],"there":[40],"does":[41,72,89],"not":[42,90],"exist":[43],"a":[44,93,133,137,179,227,232,241],"algorithm":[46,70,88,107,129,163],"achieves":[48],"same":[50,150],"for":[52,80],"arrays,":[54],"unless":[55],"restrictions":[56],"are":[57],"placed":[58],"on":[59,84,92,240],"operations.":[61],"The":[62,106,124,162,224],"main":[63,125],"result":[64],"this":[66],"paper":[67],"an":[69,165],"achieve":[73],"optimal":[74],"unit":[75,110],"This":[87,188],"run":[91],"RAM,":[94],"instead":[96],"exploits":[98,194],"massive":[100],"parallelism":[101],"inherent":[102],"digital":[104],"circuits.":[105],"also":[108],"provides":[109],"support":[114],"storage":[115],"management,":[116],"as":[117,119],"well":[118],"sparse":[120],"extensible":[122],"idea":[126],"behind":[127],"to":[131,171,204],"replace":[132],"memory":[135],"by":[136],"tree":[138],"circuit":[139,191,233],"more":[142],"powerful":[143],"than":[144],"yet":[147],"has":[148,237],"asymptotic":[151],"(gate":[155],"delays)":[156],"size":[158],"(number":[159],"components).":[161],"uses":[164],"array":[166],"representation":[167],"allows":[169],"elements":[170],"be":[172,215],"shared":[173],"between":[174],"many":[175],"with":[177,217,243],"only":[178],"small":[180],"factor":[182],"penalty":[183],"time.":[187],"system":[189,225],"exemplifies":[190],"parallelism,":[192],"which":[193],"very":[195],"large":[196],"numbers":[197],"transistors":[199],"per":[200],"chip":[201],"order":[203],"speed":[205],"up":[206],"key":[207],"algorithms.":[208],"Extensible":[209],"Sparse":[210],"Functional":[211],"Arrays":[212],"(ESFA)":[213],"can":[214],"used":[216],"both":[218],"imperative":[221],"programming":[222],"languages.":[223],"comprises":[226],"set":[228],"specification,":[234],"been":[238],"implemented":[239],"GPGPU":[242],"good":[244],"performance.":[245]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}