{"id":"https://openalex.org/W2139672898","doi":"https://doi.org/10.1109/arith.2009.25","title":"Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates","display_name":"Efficient Data Structure and Algorithms for Sparse Integers, Sets and Predicates","alternate_titles":[],"publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2139672898","doi":"https://doi.org/10.1109/arith.2009.25","mag":"2139672898"},"language":"en","primary_location":{"id":"doi:10.1109/arith.2009.25","doi":"https://doi.org/10.1109/arith.2009.25","is_oa":false,"landing_page_url":"https://doi.org/10.1109/arith.2009.25","pdf_url":null,"source":{"id":"https://openalex.org/S4210169913","display_name":"IEEE Symposium on Computer Arithmetic (ARITH)","issn_l":"1063-6889","issn":["1063-6889","2576-2265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 19th IEEE Symposium on Computer Arithmetic","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2139672898"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5065974046","display_name":"Jean E. Vuillemin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I29607241","display_name":"\u00c9cole Normale Sup\u00e9rieure - PSL","ror":"https://ror.org/05a0dhs15","country_code":"FR","type":"other","lineage":["https://openalex.org/I2746051580","https://openalex.org/I29607241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Jean E. Vuillemin","raw_affiliation_strings":["Ecole Normale Sup\u00e9erieure, Paris, France","Ecole Normale Super, PAris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Normale Sup\u00e9erieure, Paris, France","institution_ids":["https://openalex.org/I29607241"]},{"raw_affiliation_string":"Ecole Normale Super, PAris, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5065974046"],"corresponding_institution_ids":["https://openalex.org/I29607241"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"14"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.36079999804496765,"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.36079999804496765,"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/T11567","display_name":"semigroups and automata theory","score":0.09839999675750732,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.09749999642372131,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bit-arrays","display_name":"bit arrays","score":0.6669999957084656},{"id":"https://openalex.org/keywords/directed-acyclic-graphs","display_name":"directed acyclic graphs","score":0.8759999871253967},{"id":"https://openalex.org/keywords/integer-arithmetic","display_name":"integer arithmetic","score":0.5220000147819519},{"id":"https://openalex.org/keywords/equality-testing","display_name":"equality testing","score":0.7070000171661377},{"id":"https://openalex.org/keywords/sets-of-integers","display_name":"integer sets","score":0.6620000004768372},{"id":"https://openalex.org/keywords/boolean-predicates","display_name":"Boolean predicates","score":0.8539999723434448},{"id":"https://openalex.org/keywords/set-operations","display_name":"set operations","score":0.4230000078678131},{"id":"https://openalex.org/keywords/boolean-function-representation","display_name":"Boolean function representation","score":0.3490000069141388}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5473268032073975},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5348753929138184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5124028325080872},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44288310408592224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4380868971347809},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37131115794181824},{"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.1109/arith.2009.25","doi":"https://doi.org/10.1109/arith.2009.25","is_oa":false,"landing_page_url":"https://doi.org/10.1109/arith.2009.25","pdf_url":null,"source":{"id":"https://openalex.org/S4210169913","display_name":"IEEE Symposium on Computer Arithmetic (ARITH)","issn_l":"1063-6889","issn":["1063-6889","2576-2265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1","norway-1"],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 19th IEEE Symposium on Computer Arithmetic","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.539.6263","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.539.6263","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ac.usc.es/arith19/sites/default/files/3670a007-session1-paper1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W175946384","https://openalex.org/W1569253481","https://openalex.org/W1595607623","https://openalex.org/W1600795850","https://openalex.org/W1725430864","https://openalex.org/W2030224590","https://openalex.org/W2041404167","https://openalex.org/W2041905826","https://openalex.org/W2055314056","https://openalex.org/W2088204730","https://openalex.org/W2127271657","https://openalex.org/W2171818384","https://openalex.org/W2752853835"],"related_works":["https://openalex.org/W2737550933","https://openalex.org/W1882149055","https://openalex.org/W2887822454","https://openalex.org/W57307034","https://openalex.org/W2126479399","https://openalex.org/W4287200651","https://openalex.org/W317243567","https://openalex.org/W3022537391","https://openalex.org/W7135050085","https://openalex.org/W36984940"],"abstract_inverted_index":{"We":[0],"construct":[1],"a":[2,39,208],"natural":[3],"number":[4],"n":[5,10,46,64,142],">":[6],"1":[7],"by":[8,24,47],"trichotomy":[9],"=":[11],"g":[12],"+":[13],"xpd;":[14],"xp=":[15],"22p,":[16],"0":[17],"les":[18],"gp,":[19],"0p,":[20],"applied":[21],"recursively,":[22],"and":[23,131,166,198,226,236],"systematically":[25],"sharing":[26],"nodes":[27,49],"with":[28,55,129,151,154,184],"equal":[29],"integer":[30,34,196],"value.":[31],"The":[32,94,188,204],"resulting":[33],"decision":[35],"diagram":[36],"IDD":[37,95,205],"is":[38,80,89,100,114,124,207],"directed":[40],"acyclic":[41],"graph":[42],"DAG":[43],"which":[44,58],"represents":[45],"s(n)":[48,79],"in":[50,70,126,240],"computer":[51],"memory.":[52,71],"IDDs":[53,111,130,152,185,194,237],"compete":[54],"bit":[56,119,155],"arrays,":[57,156],"represent":[59],"the":[60,73,77,106,132,164],"consecutive":[61],"bits":[62,69],"of":[63,97,110,118,135,169,191],"within":[65],"roughly":[66],"1(n)":[67],"contiguous":[68],"Unlike":[72],"binary":[74],"length":[75],"1(n),":[76],"size":[78,88,96],"not":[81],"monotonic.":[82],"Most":[83],"integers":[84,99,192],"are":[85,146,179,231],"dense:":[86],"their":[87],"near":[90],"worst":[91],"&":[92],"average.":[93],"sparse":[98,162,243],"arbitrarily":[101,182],"smaller.":[102],"Over":[103,161],"dense":[104,159,234],"numbers,":[105,224],"worst/average":[107],"time/space":[108,133],"complexity":[109,134,168],"arithmetic":[112],"operations":[113,137,172],"proportional":[115],"to":[116,212],"that":[117],"arrays.":[120],"Yet,":[121],"equality":[122],"testing":[123],"performed":[125],"unit":[127],"time":[128,165],"some":[136],"(e.g.":[138],"sign(n":[139],"-":[140],"m),":[141],"plusmn":[143],"2m,":[144],"22n)":[145],"(at":[147],"least)":[148],"exponentially":[149],"better":[150,183],"than":[153,186],"even":[157],"over":[158,233,242],"operands.":[160],"operands,":[163],"space":[167],"all":[170],"ALU":[171],"{cap":[173],",":[174],"cup,":[175],"oplus,":[176],"+,":[177],"-}":[178],"(in":[180],"general)":[181],"bit-arrays.":[187],"coding":[189],"powers":[190],"lets":[193],"implement":[195],"sets":[197],"predicates":[199],"as":[200,202],"well":[201],"arithmetics.":[203],"package":[206],"one":[209],"shop":[210],"alternative":[211],"3":[213],"(and":[214],"more)":[215],"successful":[216],"yet":[217],"rather":[218],"different":[219],"packages":[220],"for":[221],"processing":[222],"large":[223],"dictionaries":[225],"Boolean":[227],"functions.":[228],"Performance":[229],"levels":[230],"comparable":[232],"structures,":[235],"prove":[238],"best":[239],"class":[241],"structures.":[244]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2139672898","counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
