On the search for geometric orders, centers, and separation
type: CreativeWork
description: Made available in DSpace on 2022-01-12T21:45:32Z (GMT). No. of bitstreams: 3 JONES-DISSERTATION-2021.pdf: 1914890 bytes, checksum: 366dcc38c4c71d40866af435a7013829 (MD5) LICENSE.txt: 4211 bytes, checksum: e50fd91468e7c0c29de29137ca817c8f (MD5) PROQUEST_LICENSE.txt: 4557 bytes, checksum: b7d874722caa5109ed0d28a53c90906a (MD5) Previous issue date: 2021-07-12
abstract: Made available in DSpace on 2022-01-12T21:45:32Z (GMT). No. of bitstreams: 3 JONES-DISSERTATION-2021.pdf: 1914890 bytes, checksum: 366dcc38c4c71d40866af435a7013829 (MD5) LICENSE.txt: 4211 bytes, checksum: e50fd91468e7c0c29de29137ca817c8f (MD5) PROQUEST_LICENSE.txt: 4557 bytes, checksum: b7d874722caa5109ed0d28a53c90906a (MD5) Previous issue date: 2021-07-12
author: Jones, Mitchell Francis
language: en
keywords: theoretical computer science, computational geometry, approximation algorithms, randomized algorithms, centerpoint, order, separation, yolk, active learning
date published: 2022-01-12T21:45:32Z
date modified: 2026-07-22T22:24:52Z
provider: University of Illinois - Urbana-Champaign
publisher: Networked Digital Library of Theses and Dissertations
type: WebPage
source organization: University of Illinois at Urbana-Champaign

PropertyValue
property ID: Handle
value: http://hdl.handle.net/2142/113010