Or Zamir

works on

constant-delay enumeration 1 cycle enumeration 1 even cycles 1 graph algorithms 1 subquadratic time 1

From the 1 of 14 linked papers with an AI index.

activity

20242026

collaborators

14 papers

cs.DS2026

Linear Hashing is Not That Awesome

Or Zamir

Consider the canonical universal hash family $h (x) = ((a x + b) mod p) mod m$ , where $a, b$ are chosen uniformly from $Z_{p}$ , which we call linear hashing, being…

cs.DS2026

Enumerating Small Cycles

Or Stern, Or Zamir

The paper presents algorithms that can list or enumerate all small even cycles (up to length 16) in an n‑vertex graph with near‑quadratic preprocessing time and constant‑delay per…

cs.DS2026

k-Coloring is Faster than Computing the Chromatic Number

Or Zamir

We prove that $k$ -coloring on $n$ -vertex graphs has a randomized algorithm running in time $(2 - ε_{k})^{n}$ , where $ε_{k} > 0$ for every fixed $k$ . Previously, only the…

cs.DS2026

Locality in Open Addressing Hash Tables

Or Zamir

Open-addressed hash tables without reordering, such as linear probing and uniform probing, are among the simplest and most widely used data structures. Their performance is traditi…

cs.LG2026

Proofs of Ownership for Machine Learning Models

Ran Canetti, Shafi Goldwasser, Or Zamir

With the increasing adoption of Machine Learning, protecting model ownership has become an essential challenge. We initiate a formal study of Proof of Ownership for machine learnin…

cs.AI2026

Consensus Sampling for Safer Generative AI

Adam Tauman Kalai, Yael Tauman Kalai, Or Zamir

Motivated by undetectable risks in generative AI, we study a general robust aggregation problem: how to aggregate several probability distributions to boost safety. We present cons…