default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmi Paz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid
, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica 86(6): 1830-1861 (2024)- [j15]Pierre Fraigniaud, Ami Paz:
The topology of local computing in networks. J. Appl. Comput. Topol. 8(4): 1069-1098 (2024) - [j14]Ami Paz, Liat Peterfreund:
Playing Guess Who with your kids: Code-word strategy against adversaries. Theor. Comput. Sci. 1016: 114766 (2024) - [c34]Leyla Biabani, Ami Paz:
k-Center Clustering in Distributed Models. SIROCCO 2024: 83-100 - [c33]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
Brief Announcement: Solvability of Three-Process General Tasks. DISC 2024: 42:1-42:7 - [c32]Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz:
Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures. DISC 2024: 47:1-47:5 - [i27]Leyla Biabani, Ami Paz:
k-Center Clustering in Distributed Models. CoRR abs/2407.18031 (2024) - [i26]Pierre Fraigniaud, Minh-Hang Nguyen, Ami Paz:
Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure. CoRR abs/2410.21538 (2024) - 2023
- [j13]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-resilient consensus in arbitrary graphs. Inf. Comput. 292: 105035 (2023) - [c31]Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. ITCS 2023: 100:1-100:28 - [c30]Alkida Balliu, Janne H. Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, Shreyas Pai, Ami Paz, Joel Rybicki, Stefan Schmid, Jan Studený, Jukka Suomela, Jara Uitto:
Sinkless Orientation Made Simple. SOSA 2023: 175-191 - [c29]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. DISC 2023: 4:1-4:23 - [i25]Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler, Ami Paz, Stefan Schmid:
Topological Characterization of Consensus Solvability in Directed Dynamic Networks. CoRR abs/2304.02316 (2023) - [i24]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. CoRR abs/2308.04213 (2023) - 2022
- [c28]Monika Henzinger, Ami Paz, A. R. Sricharan:
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. ESA 2022: 65:1-65:14 - [c27]Ami Paz, Liat Peterfreund:
Playing Guess Who with Your Kids. FUN 2022: 23:1-23:10 - [c26]Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. PODC 2022: 460-470 - [c25]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid:
The augmentation-speed tradeoff for consistent network updates. SOSR 2022: 67-80 - [i23]Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid, Kyrill Winkler:
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries. CoRR abs/2202.12397 (2022) - [i22]Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement. CoRR abs/2206.05356 (2022) - [i21]Monika Henzinger, Ami Paz, A. R. Sricharan:
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. CoRR abs/2208.07572 (2022) - [i20]Monika Henzinger, Ami Paz, Arash Pourdamghani, Stefan Schmid:
The Augmentation-Speed Tradeoff for Consistent Network Updates. CoRR abs/2211.03716 (2022) - 2021
- [j12]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in distributed proofs. Distributed Comput. 34(2): 113-132 (2021) - [j11]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-Dynamic Distributed Algorithms for Communication Networks. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 06:1-06:33 (2021) - [j10]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz:
Smaller Cuts, Higher Lower Bounds. ACM Trans. Algorithms 17(4): 30:1-30:40 (2021) - [j9]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A topological perspective on distributed network algorithms. Theor. Comput. Sci. 849: 121-137 (2021) - [c24]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Distributed Quantum Proofs for Replicated Data. ITCS 2021: 28:1-28:20 - [c23]Monika Henzinger, Ami Paz, Stefan Schmid:
On the Complexity of Weight-Dynamic Network Algorithms. Networking 2021: 1-9 - [c22]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-Dynamic Distributed Algorithms for Communication Networks. SIGMETRICS (Abstracts) 2021: 71-72 - [c21]Seth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman:
On the Complexity of Load Balancing in Dynamic Networks. SPAA 2021: 254-264 - [c20]Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. DISC 2021: 58:1-58:4 - [i19]Monika Henzinger, Ami Paz, Stefan Schmid:
On the Complexity of Weight-Dynamic Network Algorithms. CoRR abs/2105.13172 (2021) - [i18]Seth Gilbert, Uri Meir, Ami Paz, Gregory Schwartzman:
On the Complexity of Load Balancing in Dynamic Networks. CoRR abs/2105.13194 (2021) - [i17]Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela:
Sinkless orientation is hard also in the supported LOCAL model. CoRR abs/2108.02655 (2021) - 2020
- [j8]Keren Censor-Hillel, Ami Paz, Mor Perry:
Approximate proof-labeling schemes. Theor. Comput. Sci. 811: 112-124 (2020) - [j7]Keren Censor-Hillel, Ami Paz, Noam Ravid:
The sparsest additive spanner via multiple weighted BFS trees. Theor. Comput. Sci. 840: 33-44 (2020) - [c19]Pierre Fraigniaud, Ami Paz:
The Topology of Local Computing in Networks. ICALP 2020: 128:1-128:18 - [c18]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. INFOCOM 2020: 337-346 - [c17]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast Deterministic Algorithms for Highly-Dynamic Networks. OPODIS 2020: 28:1-28:16 - [c16]Ofer Grossman, Seri Khoury, Ami Paz:
Improved Hardness of Approximation of Diameter in the CONGEST Model. DISC 2020: 19:1-19:16 - [c15]Uri Meir, Ami Paz, Gregory Schwartzman:
Models of Smoothing in Dynamic Networks. DISC 2020: 36:1-36:16 - [c14]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Brief Announcement: Distributed Quantum Proofs for Replicated Data. DISC 2020: 43:1-43:3 - [i16]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Simple and Fast Distributed Computation of Betweenness Centrality. CoRR abs/2001.08108 (2020) - [i15]Pierre Fraigniaud, François Le Gall, Harumichi Nishimura, Ami Paz:
Distributed Quantum Proofs for Replicated Data. CoRR abs/2002.10018 (2020) - [i14]Pierre Fraigniaud, Ami Paz:
The Topology of Local Computing in Networks. CoRR abs/2003.03255 (2020) - [i13]Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz, Joel Rybicki, Stefan Schmid:
Input-dynamic distributed graph algorithms for congested networks. CoRR abs/2005.07637 (2020) - [i12]Uri Meir, Ami Paz, Gregory Schwartzman:
Models of Smoothing in Dynamic Networks. CoRR abs/2009.13006 (2020)
2010 – 2019
- 2019
- [j6]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic methods in the congested clique. Distributed Comput. 32(6): 461-478 (2019) - [j5]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. 48(1): 1-32 (2019) - [j4]Ami Paz, Gregory Schwartzman:
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model. ACM Trans. Algorithms 15(2): 18:1-18:15 (2019) - [c13]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. PODC 2019: 238-247 - [c12]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. SIROCCO 2019: 3-18 - [c11]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
Synchronous t-Resilient Consensus in Arbitrary Graphs. SSS 2019: 53-68 - [c10]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-Offs in Distributed Interactive Proofs. DISC 2019: 13:1-13:17 - [i11]Amir Abboud, Keren Censor-Hillel, Seri Khoury, Ami Paz:
Smaller Cuts, Higher Lower Bounds. CoRR abs/1901.01630 (2019) - [i10]Keren Censor-Hillel, Neta Dafni, Victor I. Kolobov, Ami Paz, Gregory Schwartzman:
Fast and Simple Deterministic Algorithms for Highly-Dynamic Networks. CoRR abs/1901.04008 (2019) - [i9]Nir Bachrach, Keren Censor-Hillel, Michal Dory, Yuval Efron, Dean Leitersdorf, Ami Paz:
Hardness of Distributed Optimization. CoRR abs/1905.10284 (2019) - [i8]Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, Corentin Travers:
A Topological Perspective on Distributed Network Algorithms. CoRR abs/1907.03565 (2019) - [i7]Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz:
Trade-offs in Distributed Interactive Proofs. CoRR abs/1908.03363 (2019) - 2018
- [j3]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed construction of purely additive spanners. Distributed Comput. 31(3): 223-240 (2018) - [c9]Keren Censor-Hillel, Ami Paz, Noam Ravid:
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. OPODIS 2018: 7:1-7:16 - [c8]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in Distributed Proofs. DISC 2018: 24:1-24:18 - [i6]Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvonen, Ami Paz, Mor Perry:
Redundancy in Distributed Proofs. CoRR abs/1803.03031 (2018) - [i5]Keren Censor-Hillel, Ami Paz, Noam Ravid:
The Sparsest Additive Spanner via Multiple Weighted BFS Trees. CoRR abs/1811.01997 (2018) - 2017
- [b1]Ami Paz:
Distributed Distance Computation and Related Topics. Technion - Israel Institute of Technology, Israel, 2017 - [c7]Keren Censor-Hillel, Ami Paz, Mor Perry:
Approximate Proof-Labeling Schemes. SIROCCO 2017: 71-89 - [c6]Ami Paz, Gregory Schwartzman:
A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. SODA 2017: 2153-2161 - [c5]Keren Censor-Hillel, Seri Khoury, Ami Paz:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DISC 2017: 10:1-10:16 - [i4]Ami Paz, Gregory Schwartzman:
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-Streaming Model. CoRR abs/1702.04536 (2017) - [i3]Keren Censor-Hillel, Seri Khoury, Ami Paz:
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. CoRR abs/1705.05646 (2017) - 2016
- [j2]Hagit Attiya, Ami Paz:
Counting-based impossibility proofs for set agreement and renaming. J. Parallel Distributed Comput. 87: 1-12 (2016) - [c4]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. DISC 2016: 129-142 - [i2]Keren Censor-Hillel, Telikepalli Kavitha, Ami Paz, Amir Yehudayoff:
Distributed Construction of Purely Additive Spanners. CoRR abs/1607.05597 (2016) - 2015
- [c3]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. PODC 2015: 143-152 - [i1]Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, Jukka Suomela:
Algebraic Methods in the Congested Clique. CoRR abs/1503.04963 (2015) - 2013
- [j1]Ami Paz:
Bremen workshop review. SIGACT News 44(4): 91-97 (2013) - [c2]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Upper bound on the complexity of solving hard renaming. PODC 2013: 190-199 - 2012
- [c1]Hagit Attiya, Ami Paz:
Counting-Based Impossibility Proofs for Renaming and Set Agreement. DISC 2012: 356-370
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:14 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
