{"id":"https://openalex.org/W1999978255","doi":"https://doi.org/10.1145/59287.59293","title":"Efficient implementation of lattice operations","display_name":"Efficient implementation of lattice operations","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W1999978255","doi":"https://doi.org/10.1145/59287.59293","mag":"1999978255"},"language":"en","primary_location":{"id":"doi:10.1145/59287.59293","is_oa":true,"landing_page_url":"https://doi.org/10.1145/59287.59293","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/59287.59293","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/59287.59293","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045841458","display_name":"Hassan A\u0131\u0308t-Kaci","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hassan A\u00eft-Kaci","raw_affiliation_strings":["DEC/Paris Research Laboratory, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEC/Paris Research Laboratory, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109991971","display_name":"Robert S. Boyer","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert Boyer","raw_affiliation_strings":["Univ. of Texas, Austin","University of Texas @ Austin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ. of Texas, Austin","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas @ Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003908930","display_name":"Patrick Lincoln","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Patrick Lincoln","raw_affiliation_strings":["Stanford Univ., Stanford, CA","Stanford University Stanford CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford Univ., Stanford, CA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University Stanford CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113600245","display_name":"Roger Nasr","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Roger Nasr","raw_affiliation_strings":["MCC, Austin, TX"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MCC, Austin, TX","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.7015,"has_fulltext":true,"cited_by_count":199,"citation_normalized_percentile":{"value":0.987532,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":"1","first_page":"115","last_page":"146"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","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/T10126","display_name":"Logic, programming, and type systems","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/T10317","display_name":"Advanced Database Systems and Queries","score":0.996399998664856,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8044435977935791},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.6118212342262268},{"id":"https://openalex.org/keywords/lattice","display_name":"Lattice (music)","score":0.6097670197486877},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5212174654006958},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4862278997898102},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48006901144981384},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41540712118148804},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4147999882698059},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38855642080307007},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3055437207221985},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20270434021949768},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.170196533203125},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16903018951416016}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8044435977935791},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6118212342262268},{"id":"https://openalex.org/C2781204021","wikidata":"https://www.wikidata.org/wiki/Q6497091","display_name":"Lattice (music)","level":2,"score":0.6097670197486877},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5212174654006958},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4862278997898102},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48006901144981384},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41540712118148804},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4147999882698059},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38855642080307007},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3055437207221985},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20270434021949768},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.170196533203125},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16903018951416016},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/59287.59293","is_oa":true,"landing_page_url":"https://doi.org/10.1145/59287.59293","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/59287.59293","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.2.596","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csl.sri.com/users/lincoln/papers/toplas89.ps.gz","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/59287.59293","is_oa":true,"landing_page_url":"https://doi.org/10.1145/59287.59293","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/59287.59293","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1999978255.pdf","grobid_xml":"https://content.openalex.org/works/W1999978255.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W8723063","https://openalex.org/W103505580","https://openalex.org/W1558607653","https://openalex.org/W1655990431","https://openalex.org/W1770006921","https://openalex.org/W1994133441","https://openalex.org/W2007008666","https://openalex.org/W2015910045","https://openalex.org/W2035182234","https://openalex.org/W2047669821","https://openalex.org/W2065333363","https://openalex.org/W2095219277","https://openalex.org/W2107046473","https://openalex.org/W2117967197","https://openalex.org/W2123396057","https://openalex.org/W2156470319","https://openalex.org/W2295988014","https://openalex.org/W2547662413","https://openalex.org/W2602753196","https://openalex.org/W4234122916"],"related_works":["https://openalex.org/W2359423766","https://openalex.org/W1600485007","https://openalex.org/W2364216866","https://openalex.org/W2362009423","https://openalex.org/W2614633957","https://openalex.org/W2391894074","https://openalex.org/W2046799759","https://openalex.org/W2365750584","https://openalex.org/W2070329106","https://openalex.org/W1553139688"],"abstract_inverted_index":{"Lattice":[0],"operations":[1,39,114],"such":[2,38],"as":[3,148],"greatest":[4],"lower":[5],"bound":[6,10],"(GLB),":[7],"least":[8],"upper":[9],"(LUB),":[11],"and":[12,19,167],"relative":[13],"complementation":[14],"(BUTNOT)":[15],"are":[16,132,141],"becoming":[17],"more":[18,20,87],"important":[21],"in":[22,137,156,161],"programming":[23],"languages":[24],"supporting":[25],"object":[26],"inheritance.":[27],"We":[28,144],"present":[29],"a":[30,57,81,86,96],"general":[31],"technique":[32,99,118],"for":[33],"the":[34,48,53,71,124,127,162],"efficient":[35],"implementation":[36],"of":[37,47,60,70,123,126,165,169],"based":[40,79],"on":[41,80],"an":[42,65,149],"encoding":[43,49],"method.":[44],"The":[45],"effect":[46],"is":[50,77,93,102],"to":[51,64,135],"plunge":[52],"given":[54],"ordering":[55],"into":[56,120],"boolean":[58],"lattice":[59,72,113],"binary":[61],"words,":[62],"leading":[63],"almost":[66],"constant":[67],"time":[68],"complexity":[69],"operations.":[73],"A":[74],"first":[75],"method":[76,89],"described":[78],"transitive":[82],"closure":[83],"approach.":[84],"Then":[85],"space-efficient":[88],"minimizing":[90],"code-word":[91],"length":[92],"described.":[94],"Finally":[95],"powerful":[97],"grouping":[98],"called":[100],"modulation":[101],"presented,":[103],"which":[104],"drastically":[105],"reduces":[106],"code":[107],"space":[108],"while":[109],"keeping":[110],"all":[111],"three":[112],"highly":[115],"efficient.":[116],"This":[117],"takes":[119],"account":[121],"idiosyncrasies":[122],"topology":[125],"poset":[128],"being":[129],"encoded":[130],"that":[131],"quite":[133],"likely":[134],"occur":[136],"practice.":[138],"All":[139],"methods":[140],"formally":[142],"justified.":[143],"see":[145],"this":[146,157],"work":[147],"original":[150],"contribution":[151],"towards":[152],"using":[153],"semantic":[154],"(vz.,":[155,170],"case,":[158],"taxonomic)":[159],"information":[160],"engineering":[163],"pragmatics":[164],"storage":[166],"retrieval":[168],"partially":[171],"or":[172],"quasi-ordered)":[173],"information.":[174]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}