A. Paz

activity

20142026

most citedAlgebraic Methods in the Congested Clique

92 citations · 120 across the 20 of their papers we have counts for

collaborators

Showing 2025 · cs.DCShow all

3 papers · 2 filters

cs.DC2025

Lower Bounds for $k$ -Set Agreement in Fault-Prone Networks

Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz +2

We develop a new lower bound for k-set agreement in synchronous message-passing systems connected by an arbitrary directed communication network, where up to t processes may crash.…

cs.DC2025★ 2 cited

Distributed Non-Interactive Zero-Knowledge Proofs

Alex B. Grilo, Ami Paz, Mor Perry

Distributed certification is a set of mechanisms that allows an all-knowing prover to convince the units of a communication network that the network's state has some desired proper…

cs.DC2025

A Simple Lower Bound for Set Agreement in Dynamic Networks

Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz

Given a positive integer $k$ , $k$ -set agreement is the distributed task in which each process $i \in [n]$ in a group of $n$ processing nodes starts with an input value $x_{i}$ in the…

Lower Bounds for k-Set Agreement in Fault-Prone Networks

Distributed Non-Interactive Zero-Knowledge Proofs

A Simple Lower Bound for Set Agreement in Dynamic Networks

Lower Bounds for $k$ -Set Agreement in Fault-Prone Networks