This is your work, valued

Tom Tseng

Elite
@tomtseng
www.tomhmtseng.com/

dynamic-connectivity-hdt. Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup

26

parallel-euler-tour-tree. Code for "Batch-Parallel Euler Tour Trees" paper (undergrad research project, so I apologize for the code quality)

9

adversarial-segmentation. Reproducing "Universal Adversarial Perturbations Against Semantic Image Segmentation"

7

sublinear-coloring. o(n) coloring 3-colorable graphs in O(n) time

1

wsdc-points. Jupyter Notebook

1