{"id":"https://openalex.org/W4251432797","doi":"https://doi.org/10.1145/1411204.1411230","title":"Efficient nondestructive equality checking for trees and graphs","display_name":"Efficient nondestructive equality checking for trees and graphs","publication_year":2008,"publication_date":"2008-09-20","ids":{"openalex":"https://openalex.org/W4251432797","doi":"https://doi.org/10.1145/1411204.1411230"},"language":"en","primary_location":{"id":"doi:10.1145/1411204.1411230","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1411204.1411230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM SIGPLAN international conference on Functional 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/A5014296250","display_name":"Michael D. Adams","orcid":"https://orcid.org/0000-0001-6163-7062"},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael D. Adams","raw_affiliation_strings":["Indiana University, Bloomington, IN, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN, USA","institution_ids":["https://openalex.org/I4210119109"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079493924","display_name":"R. Kent Dybvig","orcid":null},"institutions":[{"id":"https://openalex.org/I4210119109","display_name":"Indiana University Bloomington","ror":"https://ror.org/02k40bc56","country_code":"US","type":"education","lineage":["https://openalex.org/I4210119109","https://openalex.org/I592451"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Kent Dybvig","raw_affiliation_strings":["Indiana University, Bloomington, IN, USA"],"affiliations":[{"raw_affiliation_string":"Indiana University, Bloomington, IN, USA","institution_ids":["https://openalex.org/I4210119109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5014296250"],"corresponding_institution_ids":["https://openalex.org/I4210119109"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34529069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"179","last_page":"188"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9936000108718872,"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/computer-science","display_name":"Computer science","score":0.6647681593894958},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.6296234130859375},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5818178057670593},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.535198986530304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5010673999786377},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.46142107248306274},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4341942071914673},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.31972843408584595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26775991916656494},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08243396878242493}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6647681593894958},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.6296234130859375},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5818178057670593},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.535198986530304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5010673999786377},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46142107248306274},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4341942071914673},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31972843408584595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26775991916656494},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08243396878242493}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1411204.1411230","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1411204.1411230","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM SIGPLAN international conference on Functional programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6000000238418579},{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1986022261","https://openalex.org/W2002301065","https://openalex.org/W2022132320","https://openalex.org/W2044146725","https://openalex.org/W2101344335","https://openalex.org/W6604031874"],"related_works":["https://openalex.org/W2387387477","https://openalex.org/W2394051415","https://openalex.org/W4388218401","https://openalex.org/W4255928847","https://openalex.org/W2352114091","https://openalex.org/W121845590","https://openalex.org/W4241809317","https://openalex.org/W2379950384","https://openalex.org/W82217049","https://openalex.org/W92485060"],"abstract_inverted_index":{"The":[0],"Revised6":[1],"Report":[2],"on":[3,14],"Scheme":[4],"requires":[5],"its":[6],"generic":[7],"equivalence":[8],"predicate,":[9],"equal?,":[10],"to":[11,37,50,70],"terminate":[12],"even":[13],"cyclic":[15],"inputs.":[16],"While":[17],"the":[18,60,66,71],"terminating":[19],"equal?":[20],"can":[21],"be":[22,38,56],"implemented":[23],"via":[24],"a":[25],"DFA-equivalence":[26],"or":[27],"union-find":[28],"algorithm,":[29],"these":[30],"algorithms":[31],"usually":[32],"require":[33],"an":[34],"additional":[35],"pointer":[36],"stored":[39],"in":[40],"each":[41],"object,":[42],"are":[43,65],"not":[44],"suitable":[45],"for":[46,59],"multithreaded":[47],"code":[48],"due":[49],"their":[51],"destructive":[52],"nature,":[53],"and":[54],"may":[55],"unacceptably":[57],"slow":[58],"small":[61],"acyclic":[62],"values":[63],"that":[64],"most":[67],"likely":[68],"inputs":[69],"predicate.":[72]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}