Research index·ThesisEfficient parallel algorithms for closest point problems.SuNobleIDark:/48914/w1/20260525/D6EC4D84DOI10.1349/ddlp.1799ThesisEfficient parallel algorithms for closest point problems.Su · SubscriptionNobleIDark:/48914/w1/20260525/D6EC4D84DOI10.1349/ddlp.1799ReadRead at the publisherSaveCiteAdd to literature reviewPaywalledThe full text is at the publisherOpen it at the publisher to read it.Read at the publisherDiscussionAdd to the discussionCitations1Cited byRelated papersMoreDetailsPublisherSuggest a correction or report