{"id":"https://openalex.org/W1966388760","doi":"https://doi.org/10.1137/s0097539794274404","title":"An Efficient Data Structure for Lattice Operations","display_name":"An Efficient Data Structure for Lattice Operations","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1966388760","doi":"https://doi.org/10.1137/s0097539794274404","mag":"1966388760"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794274404","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794274404","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077567390","display_name":"Maurizio Talamo","orcid":"https://orcid.org/0000-0002-3888-0889"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maurizio Talamo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039580089","display_name":"Paola Vocca","orcid":"https://orcid.org/0000-0002-8018-0309"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paola Vocca","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":0.5158,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.73702938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":"5","first_page":"1783","last_page":"1805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6959365010261536},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6894257068634033},{"id":"https://openalex.org/keywords/successor-cardinal","display_name":"Successor cardinal","score":0.5430899858474731},{"id":"https://openalex.org/keywords/element","display_name":"Element (criminal law)","score":0.5019524097442627},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5000813007354736},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.490389347076416},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49003612995147705},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4596211016178131},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.43883639574050903},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.42521804571151733},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4204006791114807},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19013768434524536}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6959365010261536},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6894257068634033},{"id":"https://openalex.org/C75306776","wikidata":"https://www.wikidata.org/wiki/Q7632662","display_name":"Successor cardinal","level":2,"score":0.5430899858474731},{"id":"https://openalex.org/C200288055","wikidata":"https://www.wikidata.org/wiki/Q2621792","display_name":"Element (criminal law)","level":2,"score":0.5019524097442627},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5000813007354736},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.490389347076416},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49003612995147705},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4596211016178131},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.43883639574050903},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.42521804571151733},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4204006791114807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19013768434524536},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539794274404","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794274404","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:art.torvergata.it:2108/41901","is_oa":false,"landing_page_url":"http://hdl.handle.net/2108/41901","pdf_url":null,"source":{"id":"https://openalex.org/S4306400993","display_name":"Cineca Institutional Research Information System (Tor Vergata University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I116067653","host_organization_name":"University of Rome Tor Vergata","host_organization_lineage":["https://openalex.org/I116067653"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1508509647","https://openalex.org/W1515761432","https://openalex.org/W1549843541","https://openalex.org/W1555293549","https://openalex.org/W1585310225","https://openalex.org/W1591983355","https://openalex.org/W1655990431","https://openalex.org/W1675585586","https://openalex.org/W1963907467","https://openalex.org/W1993165549","https://openalex.org/W2002818110","https://openalex.org/W2009695707","https://openalex.org/W2012005762","https://openalex.org/W2017351109","https://openalex.org/W2022812949","https://openalex.org/W2023552332","https://openalex.org/W2028247588","https://openalex.org/W2030166143","https://openalex.org/W2031251427","https://openalex.org/W2044935944","https://openalex.org/W2056090773","https://openalex.org/W2064136209","https://openalex.org/W2071260871","https://openalex.org/W2078642151","https://openalex.org/W2091993453","https://openalex.org/W2092251403","https://openalex.org/W2093031769","https://openalex.org/W2093397547","https://openalex.org/W2156184725","https://openalex.org/W2156267397","https://openalex.org/W2325654786","https://openalex.org/W2340365916","https://openalex.org/W4254807835","https://openalex.org/W4300885858"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W4389362338","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W1976803949","https://openalex.org/W78560857","https://openalex.org/W2521054645"],"abstract_inverted_index":{"In":[0,22,251],"this":[1,221],"paper,":[2],"we":[3,204,224],"consider":[4],"the":[5,27,40,48,77,82,97,100,120,123,129,135,139,147,152,163,168,183,194,198,202,212,217,228,232,241,266,274],"representation":[6],"and":[7,126],"management":[8],"of":[9,43,50,87,99,122,138,269],"an":[10,33,51,206],"element":[11,28,275],"set":[12,29,42,86,125],"on":[13,193],"which":[14,210,272],"a":[15,63,88,245,258],"lattice":[16,259],"partial":[17],"order":[18,52,140,213],"relation":[19,53],"is":[20,76,96,119,128,189,254,265],"defined.":[21],"particular,":[23,252],"let":[24],"n":[25],"be":[26,249],"size.":[30],"We":[31],"present":[32,218],"\\nradn-space":[34],"implicit":[35],"data":[36],"structure":[37],"for":[38,200,220,231],"performing":[39],"following":[41],"basic":[44],"operations:":[45],"1.":[46],"Test":[47],"presence":[49],"between":[54,65,110],"two":[55,66,105,144],"given":[56,89],"elements,":[57,106,145,161],"in":[58,71,91,112,134,156,172,260],"constant":[59],"time.":[60],"2.":[61],"Find":[62],"path":[64,78],"elements":[67,109],"whenever":[68],"one":[69],"exists,":[70],"O(l)":[72],"steps,":[73,93],"where":[74,94,117,263],"l":[75],"length.":[79],"3.":[80],"Compute":[81],"successors":[83],"and/or":[84,151,167],"predecessors":[85],"element,":[90],"O(h)":[92],"h":[95],"size":[98,121],"returned":[101,124],"set.":[102,276],"4.":[103],"Given":[104,143,159],"find":[107,146,162],"all":[108,179,201],"them,":[111],"time":[113,188],"O(k":[114],"log":[115],"d),":[116],"k":[118,160],"d":[127],"maximum":[130],"in-degree":[131],"or":[132],"out-degree":[133],"transitive":[136],"reduction":[137],"relation.":[141],"5.":[142],"least":[148,164],"common":[149,154,165,170],"ancestor":[150,166],"greatest":[153,169],"successor":[155,171],"$O(\\sqrt{n})$-time.":[157],"6.":[158],"$O(\\sqrt{n}+k":[173],"\\log":[174],"n)$time.":[175],"(Unless":[176],"stated":[177],"otherwise,":[178],"logarithms":[180],"are":[181,236],"to":[182,240,256],"base":[184],"2.)":[185],"The":[186],"preprocessing":[187],"O(n2":[190],").":[191],"Focusing":[192],"first":[195,233],"operation,":[196],"representing":[197,216],"building-box":[199],"others,":[203],"derive":[205],"overall":[207],"\\nradn-space\\,$\\times$\\,time":[208],"bound":[209],"beats":[211],"n2":[214],"bottleneck":[215],"complexity":[219,229],"problem.":[222],"Moreover,":[223],"will":[225],"show":[226],"that":[227],"bounds":[230],"three":[234],"operations":[235],"optimal":[237],"with":[238],"respect":[239],"worst":[242],"case.":[243],"Additionally,":[244],"stronger":[246],"result":[247],"can":[248],"derived.":[250],"it":[253],"possible":[255],"represent":[257],"space":[261],"$O(n\\sqrt{t})$,":[262],"t":[264],"minimum":[267],"number":[268],"disjoint":[270],"chains":[271],"partition":[273]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}