My research interests include algorithms under uncertainty, especially distributed graph algorithms but also topological methods in distributed computing, streaming algorithms, and theory of computing in general.

I am a post-doctoral researcher at IRIF, Paris, under the interaction program of FSMP, hosted by Pierre Fraigniaud. Previously, I did my PhD under the supervision of Keren Censor-Hillel, and my MSc under the supervision of Hagit Attiya, both at the Computer Science Department, Technion, Israel.


Cover photo taken at Méert, Lille


The Sparsest Additive Spanner via Multiple Weighted BFS Trees

Keren Censor-Hillel, Ami Paz and Noam Ravid

OPODIS 2018 (to appear); arXiv

Redundancy in Distributed Verification

Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz and Mor Perry

DISC 2018; arXiv; presentation

Distributed Distance Computation and Related Topics

Ami Paz

PhD Thesis, Technion, 2017

Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model

Keren Censor-Hillel, Seri Khoury and Ami Paz

DISC 2017; arxiv; slides (short talk)

Approximate Proof-Labeling Schemes

Keren Censor-Hillel, Ami Paz and Mor Perry

TCS; preliminary version at SIROCCO 2017; see also SIROCCO's per-proceedings

A (2+ε)-Approximation for Maximum Weight Matching in the Semi-Streaming Model

Ami Paz and Gregory Schwartzman

TALG (to be published); preliminary version at SODA 2017 (best paper award and best student paper award); arxiv; slides

Distributed Construction of Purely Additive Spanners

Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz and Amir Yehudayoff

Distributed Computing 2018; preliminary version at DISC 2016; arxiv

Algebraic Methods in the Congested Clique

Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz and Jukka Suomela

Distributed Computing 2016. Preliminary version at PODC 2015; arxiv

Bremen Workshop Review

Ami Paz

SIGACT News 2013

Bounds on the Step and Namespace complexity of Renaming

Hagit Attiya, Armando Castañeda, Maurice Herlihy and Ami Paz

SICOMP (to be published). Preliminary version at PODC 2013 (best student paper award); slides

Counting-Based Impossibility Proofs for Distributed Tasks

Ami Paz

MSc Thesis, Technion, 2013

Counting-Based Impossibility Proofs for Set Agreement and Renaming

Hagit Attiya and Ami Paz

JPDC 2016. Preliminary version at DISC 2012; slides


My Post-doc position does not include teaching . While at the Technion, I was a TA in various courses:

  • Distributed Algorithms A: distributed graph algorithms
  • Distributed Algorithms B: shared memory systems
  • Modern Cryptology
  • Computability Theory
  • Logics and Set Theory for Computer Science
  • Combinatorics for Computer Science