{"id":{"repo_id":"purdue-thes","oai_identifier":"oai:docs.lib.purdue.edu:open_access_dissertations-2527"},"canonical_url":"https://search.ndltd.org/etd/purdue-thes/oai:docs.lib.purdue.edu:open_access_dissertations-2527","repository":{"repo_id":"purdue-thes","name":"Purdue University","base_url":"https://docs.lib.purdue.edu/do/oai/"},"display":{"title":"Profiles of PATRICIA Tries","abstract":"Digital trees are data structures that represent sets of strings according to their shared prefix structure.","abstract_html":"Digital trees are data structures that represent sets of strings according to their shared prefix structure.","abstract_has_math":false,"creators":["Magner, Abram"],"institution":null,"degree_name":"Doctor of Philosophy (PhD)","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Wojciech Szpankowski","Ananth Grama","Elena Grigorescu","Sam Wagstaff","Mark Ward"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:51:08Z","subjects":["analytic combinatorics","digital trees","Mellin transform","PATRICIA","profiles"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://docs.lib.purdue.edu/open_access_dissertations/1311","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://docs.lib.purdue.edu/open_access_dissertations/1311","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://docs.lib.purdue.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adocs.lib.purdue.edu%3Aopen_access_dissertations-2527","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Wojciech Szpankowski","Ananth Grama","Elena Grigorescu","Sam Wagstaff","Mark Ward"]},{"key":"dc:creator","label":"Author","values":["Magner, Abram"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2015-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy (PhD)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["analytic combinatorics","digital trees","Mellin transform","PATRICIA","profiles"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://docs.lib.purdue.edu/open_access_dissertations/1311"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Digital trees are data structures that represent sets of strings according to their shared prefix structure."]},{"key":"dc:title","label":"Title","values":["Profiles of PATRICIA Tries"]}]}],"canonical_facts":{"dc:contributor":["Wojciech Szpankowski","Ananth Grama","Elena Grigorescu","Sam Wagstaff","Mark Ward"],"dc:creator":["Magner, Abram"],"dc:date.created":["2015-01-01T08:00:00Z"],"dc:description.abstract":["Digital trees are data structures that represent sets of strings according to their shared prefix structure."],"dc:identifier":["https://docs.lib.purdue.edu/open_access_dissertations/1311"],"dc:subject":["analytic combinatorics","digital trees","Mellin transform","PATRICIA","profiles"],"dc:title":["Profiles of PATRICIA Tries"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Doctor of Philosophy (PhD)"]},"updated_at":"2026-11-19T08:51:08Z"}