Prefix Filter: Practically and Theoretically Better Than Bloom. - Tomer Even; Guy Even; Adam Morrison 001 (Proc. VLDB Endow., 2022)

Fast Approximate Counting of Cycles. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (ICALP, 2024)

Faster Cycle Detection in the Congested Clique. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (DISC, 2024)

Dynamic Filter and Retrieval with One Access to Modifiable Memory. - Ioana O. Bercea; Guy Even; Tomer Even; Gabriel Marques Domingues (CIAC (1), 2025)

When MIS and Maximal Matching are Easy in the Congested Clique. - Keren Censor-Hillel; Tomer Even; Maxime Flin; Magnús M. Halldórsson (SIROCCO, 2025)

Output-Sensitive Approximate Counting via a Measure-Bounded Hyperedge Oracle, or: How Asymmetry Helps Estimate k-Clique Counts Faster. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (STOC, 2025)

Output-sensitive approximate counting via a measure-bounded hyperedge oracle, or: How asymmetry helps estimate k-clique counts faster. - Keren Censor-Hillel; Tomer Even; Virginia Vassilevska Williams (CoRR, 2025)