Implemented various Union Find Algorithms on Image Grids
Found worst case examples for small instances
Developed new Raster Scanning Algorithm for 4-way connectivity.
In Prague for TAMC 2010 Conference.
Confirmed Correctness of 4-way algorithm and extended to 8-way
Developed Model of Energy Balance Update Problem and explored
potential c-competitive algorithms.
New Potential Function generalizes to most scanning orders
Showed that no deterministic algorithm can be c-competitive in
the list Energy Update problem.
Showed that no randomized algoirthm can be c-competitive in the
list Energy update Problem
Generalized to the Tree Energy Update Problem. Showed that MTR
is 3d-2 competitive for a d-depth tree.
Last update: 7/2/2010