2 papers
cs.DS2026
Performance bounds for nearest neighbor search with k-d trees
Marco Bazzani, Sanjoy Dasgupta
The -d tree is one of the oldest and most widely used data structures for nearest neighbor search. It partitions Euclidean space into axis-aligned rectangular cells. There are t…
cs.IT2026
Probability of super-regular matrices and MDS codes over finite fields
Rathinakumar Appuswamy, Marco Bazzani, Spencer Congero +3
Let be an linear code chosen uniformly at random over a finite field of size . The following asymptotic probability of being maximum distance sepa…