{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:41:31Z","timestamp":1730295691910,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE Comput. Soc. Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.1994.365722","type":"proceedings-article","created":{"date-parts":[[2002,12,17]],"date-time":"2002-12-17T11:08:05Z","timestamp":1040123285000},"page":"703-712","source":"Crossref","is-referenced-by-count":31,"title":["Randomized and deterministic algorithms for geometric spanners of small diameter"],"prefix":"10.1109","author":[{"given":"S.","family":"Arya","sequence":"first","affiliation":[]},{"given":"D.M.","family":"Mount","sequence":"additional","affiliation":[]},{"given":"M.","family":"Smid","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"668","volume":"33","author":"pugh","year":"1990","journal-title":"Skip lists A probabilistic alternative to balanced search trees Commun ACM"},{"key":"ref11","first-page":"207","article-title":"Approximating the d-dimensional complete Euclidean graph","author":"ruppert","year":"1991","journal-title":"Proc 3rd Canadian Conf on Computational Geometry"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195991000098"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/142675.142716"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0217079"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574695"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/0211059"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/177424.177579"},{"key":"ref3","first-page":"291","article-title":"Faster algorithms for some geometric graph problems in higher dimensions","author":"callahan","year":"1993","journal-title":"Proc 4th ACM-SIAM Sympos on Discrete Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187821"},{"journal-title":"Computational Geometry An Introduction through Randomized Algorithms","year":"1994","author":"mulmuley","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840386"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129766"},{"key":"ref1","article-title":"Efficient construction of a bounded degree spanner with low weight","author":"arya","year":"1994","journal-title":"Proc 2nd ESA"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"}],"event":{"name":"35th Annual Symposium on Foundations of Computer Science","acronym":"SFCS-94","location":"Santa Fe, NM, USA"},"container-title":["Proceedings 35th Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx2\/2955\/8384\/00365722.pdf?arnumber=365722","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,8]],"date-time":"2017-03-08T20:26:53Z","timestamp":1489004813000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/365722\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/sfcs.1994.365722","relation":{},"subject":[]}}