
A little about me
I'm a Ph.D. student in Computer Science at the University of Maryland, College Park, where I am fortunate to be advised by Laxman Dhulipala and Aravind Srinivasan. Prior to joining UMD, I completed my bachelor's in Computer Science and Engineering at IIT Gandhinagar.
Research interests
My research focuses on designing efficient and scalable parallel algorithms for graph-theoretic and combinatorial optimization problems. I am particularly interested in clustering algorithms and their theoretical foundations, as well as fast, practical implementations that power large-scale vector and multi-vector retrieval and related applications.
Publications
Google Scholar-
UltraKMeans: Fully Scalable and High Quality k-means
-
Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
-
Improved rounding algorithms for set cover via exponential clocks
-
Chamfer-Linkage for Hierarchical Agglomerative Clustering
-
Improved Bi-point Rounding Algorithms and a Golden Barrier for k-Median
-
Improved Parallel Algorithms for EF1 Allocations
-
Parallel Hierarchical Agglomerative Clustering in Low Dimensions
-
Improved FPT Algorithms for Deletion to Forest-like Structures
Get in touch
Emailkishen19 [at] cs [dot] umd [dot] edu
AddressIRB 2104, 8125 Paint Branch DrCollege Park, MD, US
