|
|
Welcome to my
homepage!
I am a Ph.D. student in the Department of Computer Science
and Engineering at the University of California, San
Diego. Currently, I'm working
with Ron Graham in the Theory
Group of UCSD. My Resume. |
|
Research Interest
My research interest includes Applied
Algorithm Design, Combinatorial Algorithm and Optimization. |
|
Papers and
preprints
Enumerating split-pair arrangements (with R. Graham). Journal of Combinatorial Theory, Series A,
Volume 15, Issue 2 (February), 293-303. (preprints) Approximately optimal trees for group key management with batch
updates (with Minming Li, Ze Feng, R. Graham and Frances F. Yao). Accepted
for publication by Special Issue of Theoretical Computer Science. (preprints) Optimal
jumping patterns (with Steve Bulter and R. Graham). Accepted for publication
by Journal of Combinatorics and Number Theory. (preprints) |
|
Ph.D. Thesis
Dissertation Title: Trees for Group Key Management with Batch Update. Dissertation Abstract can be found here. Final
Defense Slides can be found here (pdf version). |
|
Current Project
Optimal trees for
group key management with batch updates Our goal is to find an optimal tree structure to manage group
keys used by the secure multicast problems. This includes building the
mathematical model, running simulations, analyzing the experimental data to
verify the data confirms our predictions, finally, designing efficient
algorithms to construct the optimal key trees. This arose from a joint
project with City University of Hong Kong (with R. Graham and Frances Yao). Enumerating split-pair
arrangements Split-pair problem
arose in analysis of the recent developed robotic scheduling algorithms.
Briefly, an arrangement of {1, 1, 2, 2, ..., k, k} is a sequence (a1,
a2, ... , a2k) with the restriction that, between any
two occurrences of i, there is one and only one occurrence of i+1, i = 1, 2,
... , k-1. Our goals are to enumerate the number of all possible split-pairs
as a function of k, and to connect these arrangements with combinatorial
lists which have previous appeared in the literature. (with R. Graham).
|
|
Other Links
You
can find more about me here!
|