Back to results

University of Illinois at Urbana-Champaign

Optimal round and sample-size complexity for partitioning in parallel sorting

dc:creator Yang, Wentao

thesis:degree_name M.S.

dc:date2022

Abstract

dc:description

Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-05-01

Degree

thesis:*

Name thesis:degree_name: M.S.
Level thesis:degree_level: Thesis
Discipline thesis:degree_discipline: Computer Science
Grantor: University of Illinois at Urbana-Champaign
Year dc:date: 2022

Author and committee

dc:creator, dc:contributor.*

Author dc:creator: Yang, Wentao
Contributors dc:contributor: Solomonik, Edgar

Subjects

dc:subject × 2

Rights

dc:rights

Statement dc:rights: Copyright 2022 Wentao Yang
Language dc:language: en, eng

Identifiers

dc:identifier.*

Handle dc:identifier: https://hdl.handle.net/2142/115736
OAI identifier oai:identifier: oai:www.ideals.illinois.edu:2142/115736

Chain of custody

source

Harvested from: University of Illinois - Urbana-Champaign
Base URL: www.ideals.illinois.edu/oai-pmh
Last updated: 2026-07-22
Source record: OAI-PMH GetRecord

related terms

citation

Yang, Wentao. Optimal round and sample-size complexity for partitioning in parallel sorting. Thesis thesis, University of Illinois at Urbana-Champaign, 2022. https://hdl.handle.net/2142/115736

More from University of Illinois - Urbana-Champaign