65 citations · 210 across the 15 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024★ 65 cited
Maximization of Approximately Submodular Functions
Thibaut Horel, Yaron Singer
We study the problem of maximizing a function that is approximately submodular under a cardinality constraint. Approximate submodularity implicitly appears in a wide range of appli…
cs.DS2019★ 1 cited
Data Structures Meet Cryptography: 3SUM with Preprocessing
Alexander Golovnev, Siyao Guo, Thibaut Horel +2
This paper shows several connections between data structure problems and cryptography against preprocessing attacks. Our results span data structure upper bounds, cryptographic app…