I am a computer scientist interested in distributed graph algorithms, and in other aspects of algorithms under uncertainty: topological methods in distributed computing, streaming algorithms, and theory of computing in general.

I am currently a post-doctoral researcher at the Faculty of Compute Science, University of Vienna, working with Monika Henzinger and Stefan Schmid. Prior to that, I spent two years as a post-doctoral researcher at IRIF, Paris, under the interaction program of FSMP, hosted by Pierre Fraigniaud. I graduated 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.

Contact: ami.paz@univie.ac.at


Cover photo taken by me at Méert, Lille. My photo was taken by Thaler Tamás.

Publications

(Author order in theoretical computer science is usually alphabetical)

Simple and Fast Distributed Computation of Betweenness Centrality

Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz

INFOCOM 2020

Synchronous t-Resilient Consensus in Arbitrary Graphs

Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy and Corentin Travers

SSS 2019 (best paper award)

Trade-Offs in Distributed Interactive Proofs

Pierluigi Crescenzi, Pierre Fraigniaud, and Ami Paz

arXiv, DISC 2019

Hardness of Distributed Optimization

Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf and Ami Paz

arXiv, PODC 2019

A Topological Perspective on Distributed Network Algorithms

Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy and Corentin Travers

SIROCCO 2019 (Invited talk), arXiv

Vérification de preuves distribuées: compromis temps-espace

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

ALGOTEL 2019 (best student paper award)

Based on our paper "Redundancy in Distributed Verification"

Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks

Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz and Gregory Schwartzman

arXiv

Smaller Cuts, Higher Lower Bounds

Amir Abboud, Keren Censor-Hillel, Seri Khoury and Ami Paz

arXiv

This paper is a merge of our paper "Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model", and the paper "Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks" by Abboud, Censor-Hillel and Khoury

The Sparsest Additive Spanner via Multiple Weighted BFS Trees

Keren Censor-Hillel, Ami Paz and Noam Ravid

OPODIS 2018; arXiv; slides; HALG 2019 (short talk)

Redundancy in Distributed Verification

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

DISC 2018; arXiv; slides

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; HALG 2018 (short talk)

An updated version, merged with a paper by Abboud, Censor-Hillel and Khoury, is now available on arXiv

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; preliminary version at SODA 2017 (best paper award and best student paper award); arxiv; HALG 2017 (invited talk); 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; 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

Academic Activities

Program Committees

  • The 39th ACM Symposium on Principles of Distributed Computing (PODC) 2020
  • The 38th IEEE International Conference on Distributed Computing Systems, Distributed Algorithms & Theory Track (ICDCS) 2018

Organizer

Journal Reviewer

  • SIAM Journal on Computing (SICOMP), ACM Transactions on Algorithms (TALG), Distributed Computing (Dist. Comp.), Algorithmica, Theoretical Computer Science (TCS), Theory of Computing Systems (ToCS), Information Processing Letters (IPL)

Conference Reviewer

  • STOC, PODC, DISC, ITCS, SPAA, ICALP, OPODIS, STACS, SOSA, ESA, MFCS, LATIN, FUN

Teaching

I am currently a teaching assistant to Stefan Schmid in the course Network Technologies. 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
  • Logic and Set Theory
  • Combinatorics