{"id":"https://openalex.org/W2109315180","doi":"https://doi.org/10.1109/sfcs.2002.1181892","title":"An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem","display_name":"An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2109315180","doi":"https://doi.org/10.1109/sfcs.2002.1181892","mag":"2109315180"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"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":true,"raw_author_name":"S. Pettie","raw_affiliation_strings":["Department of Computer Science, University of Technology, Austin, TX, USA","Dept. of Comput. Sci., Texas Univ., Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Technology, Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Texas Univ., Austin, TX, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5076564426"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"52","issue":null,"first_page":"155","last_page":"163"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"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/T10237","display_name":"Cryptography and Data Security","score":0.9968000054359436,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9961000084877014,"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/ackermann-function","display_name":"Ackermann function","score":0.9730833172798157},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7325884699821472},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6986762881278992},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6579726934432983},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6427980065345764},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6118801236152649},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.6064424514770508},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.5877305269241333},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5244237184524536},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5241128206253052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.504562497138977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4953981637954712},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43183642625808716},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3444128930568695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3082410991191864},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09532034397125244},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07199329137802124},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06692773103713989}],"concepts":[{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.9730833172798157},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7325884699821472},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6986762881278992},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6579726934432983},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6427980065345764},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6118801236152649},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.6064424514770508},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.5877305269241333},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5244237184524536},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5241128206253052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.504562497138977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4953981637954712},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43183642625808716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3444128930568695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3082410991191864},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09532034397125244},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07199329137802124},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06692773103713989},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2002.1181892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.129.3616","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.129.3616","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~pettie/papers/focs02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.6752","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.6752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/users/seth/papers/focs02.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4399999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W783504","https://openalex.org/W1547799421","https://openalex.org/W1567047166","https://openalex.org/W1598589216","https://openalex.org/W1705251487","https://openalex.org/W1965525854","https://openalex.org/W1969446695","https://openalex.org/W1972755533","https://openalex.org/W1975990553","https://openalex.org/W1978099551","https://openalex.org/W1980228393","https://openalex.org/W1982842799","https://openalex.org/W1984033909","https://openalex.org/W1986261983","https://openalex.org/W1995232397","https://openalex.org/W1999545213","https://openalex.org/W2016871180","https://openalex.org/W2019176509","https://openalex.org/W2023658462","https://openalex.org/W2030153860","https://openalex.org/W2032841680","https://openalex.org/W2038521122","https://openalex.org/W2039221685","https://openalex.org/W2047976119","https://openalex.org/W2048500523","https://openalex.org/W2048824634","https://openalex.org/W2057941709","https://openalex.org/W2069001533","https://openalex.org/W2075188242","https://openalex.org/W2078939351","https://openalex.org/W2086303161","https://openalex.org/W2087040128","https://openalex.org/W2089290774","https://openalex.org/W2103361121","https://openalex.org/W2124852572","https://openalex.org/W2134845011","https://openalex.org/W2138304862","https://openalex.org/W2152506249","https://openalex.org/W2752885492","https://openalex.org/W3148691794","https://openalex.org/W4246219036","https://openalex.org/W4399554296","https://openalex.org/W6632967923","https://openalex.org/W6662332190","https://openalex.org/W6662855863","https://openalex.org/W6869340774"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W2091507391","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181"],"abstract_inverted_index":{"We":[0,118],"consider":[1],"the":[2,17,27,37,58,84,91,94,112,134],"problem":[3,43],"of":[4,16,31,93,98,107,114,131],"preprocessing":[5,83,116],"an":[6,52],"edge-weighted":[7],"tree":[8,30,41],"T":[9,32],"in":[10,26,57,70,133],"order":[11],"to":[12,127],"quickly":[13],"answer":[14],"queries":[15,69],"following":[18],"type:":[19],"does":[20],"a":[21,45,103,129],"given":[22],"edge":[23],"e":[24],"belong":[25],"minimum":[28,39],"spanning":[29,40],"/spl":[33,75,78,87,108],"cup/":[34],"{e}?":[35],"Whereas":[36],"offline":[38],"verification":[42,61],"admits":[44],"lovely":[46],"linear":[47,115],"time":[48,82],"solution,":[49],"we":[50],"demonstrate":[51],"inherent":[53],"inverse-Ackermann":[54],"type":[55],"tradeoff":[56],"online":[59],"MST":[60],"problem.":[62],"In":[63],"particular,":[64],"any":[65],"scheme":[66],"that":[67,121],"answers":[68],"t":[71,135],"comparisons":[72],"must":[73],"invest":[74],"Omega/(n":[76],"log":[77],"lambda//sub":[79,88],"t/":[80,89],"(n))":[81],"tree,":[85],"where":[86],"is":[90,125],"inverse":[92],"t/sup":[95],"th/":[96],"row":[97],"Ackermann's":[99],"function.":[100],"This":[101],"implies":[102],"query":[104],"lower":[105,123],"bound":[106,124],"Omega/(/spl":[109],"alpha/(n))":[110],"for":[111],"case":[113],"time.":[117],"also":[119],"show":[120],"our":[122],"tight":[126],"within":[128],"factor":[130],"2":[132],"parameter.":[136]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}