{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:32:34Z","timestamp":1729661554796,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181892","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"page":"155-163","source":"Crossref","is-referenced-by-count":1,"title":["An inverse-Ackermann style lower bound for the online minimum spanning tree verification problem"],"prefix":"10.1109","author":[{"given":"S.","family":"Pettie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.3"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90042-4"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/0221070"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90137-5"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322281"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/505241.505243"},{"journal-title":"Introduction to Algorithms","year":"1990","author":"cormen","key":"15"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322161"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"16"},{"key":"39","doi-asserted-by":"publisher","DOI":"10.1137\/0214022"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195991000049"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(95)00002-X"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316548"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355554"},{"key":"38","first-page":"128","article-title":"Space-time tradeoff for answering range queries","author":"yao","year":"1982","journal-title":"Proceedings of the 14th ACM Symposium on Theory of Computing (STOC'82)"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/73833.73848"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45022-X_7"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1137\/0222020"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579170"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201022"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1007\/BF02526037"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(92)90005-W"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1137\/0403009"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579443"},{"key":"28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1006\/jcss.1996.0008","article-title":"Lower bounds for the union-find and the split-find problem on pointer machines","volume":"52","author":"lapoutre?","year":"1996","journal-title":"J Comput Syst Sci"},{"key":"29","first-page":"85","article-title":"A faster all-pairs shortest path algorithm for real-weighted sparse graphs","volume":"2380","author":"pettie","year":"2002","journal-title":"Proc 29th Int'l Colloq on Automata Languages and Programming (ICALP'02) LNCS"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/0405001"},{"article-title":"Optimal preprocessing for answering on-line product queries","year":"1987","author":"alon","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/355541.355562"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01459088"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36136-7_4"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-1989-1001852-0"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840366"},{"key":"32","first-page":"713","article-title":"Minimizing randomness in minimum spanning tree, parallel connectivity and set maxima algorithms","author":"pettie","year":"2002","journal-title":"Proc of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276764"},{"key":"31","first-page":"267","article-title":"Computing shortest paths with comparisons and additions","author":"pettie","year":"2002","journal-title":"Proc of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF02573971"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02770864"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79149"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","acronym":"SFCS-02","location":"Vancouver, BC, Canada"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181892.pdf?arnumber=1181892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:46:25Z","timestamp":1497566785000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181892","relation":{},"subject":[]}}