A special feature of Probability and Statistics Day at UMBC 2013 is that the conference, including the workshop, is open to all statistics graduate students
from UMBC and local universites free of charge; however, REGISTRATION IS REQUIRED! The deadline to register is Friday,
April 12, 2013. // REGISTER NOW
For more information, contact any member of the organizing committee:
Bimal Sinha
Conference Chair
443.538.3012
Kofi Adragni
410.455.2406
Yvonne Huang
410.455.2422
Yaakov Malinovsky
410.455.2968
Thomas Mathew
410.455.2418
Nagaraj Neerchal
410.455.2437
DoHwan Park
410.455.2408
Junyong Park
410.455.2407
Anindya Roy
410.455.2435
Elizabeth Stanwyck
410.455.5731
Participant Information
Jason Matterer
Paper: Quickselect Process Convergence with an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-case Find
We define a sequence of tree-indexed processes closely related to the operation of the QuickSelect search algorithm (also known as Find) and establish convergence of these processes in a certain Banach space. As a consequence of this result we prove distributional convergence of the symbol comparison cost of Worst-case Find. Additionally, using this process convergence result, we can recover the previously known convergences of key and symbol comparison costs of QuickSelect and key comparison costs of Worst-case Find.
