Yarin Shechter

According to our database, Yarin Shechter authored at least 3 papers between 2024 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Bounding the Fragmentation of B-Trees Subject to Batched Insertions.

Michael A. Bender, Aaron Bernstein, Nairen Cao, Alexander Conway, Martín Farach-Colton, Hanna Komlós, Yarin Shechter, Nicole Wein

CoRR, March, 2026

Efficiently Constructing Sparse Navigable Graphs.

Alex Conway, Laxman Dhulipala, Martin Farach-Colton, Rob Johnson, Ben Landrum, Christopher Musco, Yarin Shechter, Torsten Suel, Richard Wen

Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2024

Faster Combinatorial k-Clique Algorithms.

Amir Abboud, Nick Fischer, Yarin Shechter

Proceedings of the LATIN 2024: Theoretical Informatics, 2024