13 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.DS2023
Binary Search with Distance-Dependent Costs
Calvin Leng, David Kempe
We introduce a search problem generalizing the typical setting of Binary Search on the line. Similar to the setting for Binary Search, a target is chosen adversarially on the line,…
cs.DS2019★ 13 cited
Counting Small Permutation Patterns
Chaim Even-Zohar, Calvin Leng
A sample of n generic points in the xy-plane defines a permutation that relates their ranks along the two axes. Every subset of k points similarly defines a pattern, which occurs i…
math.CO2018
A sequence of quasipolynomials arising from random numerical semigroups
Calvin Leng, Christopher O'Neill
A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generator…