1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.CR2026
Formal verification of the S-two AIR
Jeremy Avigad, Anat Ganor, Lior Goldberg +4
StarkWare's S-two prover provides an efficient means for establishing, on blockchain, that a program written in the Cairo virtual machine language runs to completion. The latter cl…
cs.CC2019
On Communication Complexity of Fixed Point Computation
Anat Ganor, Karthik C. S., Dömötör Pálvölgyi
Brouwer's fixed point theorem states that any continuous function from a compact convex space to itself has a fixed point. Roughgarden and Weinstein (FOCS 2016) initiated the study…
cs.GT2017★ 1 cited
Communication Complexity of Correlated Equilibrium in Two-Player Games
Anat Ganor, Karthik C. S.
We show a communication complexity lower bound for finding a correlated equilibrium of a two-player game. More precisely, we define a two-player game called the 2-cycl…