{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T07:02:05Z","timestamp":1648796525710},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8294,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1016\/0166-218x(90)90084-p","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"97-111","source":"Crossref","is-referenced-by-count":11,"title":["Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm"],"prefix":"10.1016","volume":"29","author":[{"given":"Baruch","family":"Schieber","sequence":"first","affiliation":[]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90084-P_BIB1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","article-title":"Parallel computational geometry","volume":"3","author":"Aggarwal","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(90)90084-P_BIB2","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1016\/0743-7315(86)90011-0","article-title":"Efficient parallel solutions to geometric problems","volume":"3","author":"Atallah","year":"1986","journal-title":"J. Parallel and Distributed Comput."},{"key":"10.1016\/0166-218X(90)90084-P_BIB3","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1137\/0216032","article-title":"Tight lower bounds on the complexity of parallel sorting","volume":"16","author":"Azar","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90084-P_BIB4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(85)90008-X","article-title":"Routing, merging, and sorting on parallel models of comparison","volume":"30","author":"Borodin","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90084-P_BIB5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1146\/annurev.cs.03.060188.001313","article-title":"Parallel algorithmic techniques for combinatorial computation","volume":"3","author":"Eppstein","year":"1988","journal-title":"Annual Rev. Comput. Sci."},{"key":"10.1016\/0166-218X(90)90084-P_BIB6","first-page":"105","article-title":"Comments on the All Nearest Neighbor problem for convex polygons","volume":"9","author":"Fournier","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90084-P_BIB7","series-title":"Ph.D. Thesis","article-title":"Efficient parallel techniques for computational geometry","author":"Goodrich","year":"1987"},{"key":"10.1016\/0166-218X(90)90084-P_BIB8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/0603047","article-title":"Sorting and merging in rounds","volume":"3","author":"Haggkvist","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(90)90084-P_BIB9","series-title":"Rept. UCB\/CDS 88\/408","article-title":"A survey of parallel algorithms for shared memory machines","author":"Karp","year":"1988"},{"key":"10.1016\/0166-218X(90)90084-P_BIB10","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging and sorting in parallel computation","volume":"32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(90)90084-P_BIB11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(78)90066-2","article-title":"The All Nearest Neighbor problem for convex polygons","volume":"7","author":"Lee","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90084-P_BIB12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","article-title":"Parallel Ear Decomposition Search (EDS) and st-numbering in graphs","volume":"47","author":"Maon","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(90)90084-P_BIB13","first-page":"532","article-title":"The complexity of parallel sorting","author":"Meyer auf der Heide","year":"1985","journal-title":"Proceedings 26th Symposium on Foundations of Computer Science"},{"key":"10.1016\/0166-218X(90)90084-P_BIB14","first-page":"344","article-title":"A new triconnectivity algorithm and its parallelization","author":"Miller","year":"1987","journal-title":"Proceedings 19th Symposium on Theory of Computing"},{"key":"10.1016\/0166-218X(90)90084-P_BIB15","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0166-218X(90)90084-P_BIB16","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90084-P_BIB17","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90084-P_BIB18","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0196-6774(82)90013-X","article-title":"An O(n2log n) parallel max-flow algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90084-P_BIB19","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison models","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90084-P_BIB20","series-title":"Tech. Rept. TR # 71","article-title":"Synchronous parallel computation \u2014 a survey","author":"Vishkin","year":"1983"},{"key":"10.1016\/0166-218X(90)90084-P_BIB21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(79)90021-8","article-title":"A note on the All Nearest Neighbor problem for convex polygons","volume":"8","author":"Yang","year":"1979","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090084P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090084P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:43Z","timestamp":1554967423000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090084P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0166218X9090084P"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90084-p","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}