Ami Paz

846 total citations
26 papers, 256 citations indexed

About

Ami Paz is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Ami Paz has authored 26 papers receiving a total of 256 indexed citations (citations by other indexed papers that have themselves been cited), including 17 papers in Computational Theory and Mathematics, 16 papers in Computer Networks and Communications and 8 papers in Artificial Intelligence. Recurrent topics in Ami Paz's work include Complexity and Algorithms in Graphs (13 papers), Advanced Graph Theory Research (10 papers) and Optimization and Search Problems (9 papers). Ami Paz is often cited by papers focused on Complexity and Algorithms in Graphs (13 papers), Advanced Graph Theory Research (10 papers) and Optimization and Search Problems (9 papers). Ami Paz collaborates with scholars based in Israel, France and Austria. Ami Paz's co-authors include Shlomo Moran, Shimon Even, Keren Censor-Hillel, Janne H. Korhonen, Petteri Kaski, Christoph Lenzen, Jukka Suomela, Hagit Attiya, Pierre Fraigniaud and Maurice Herlihy and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Soft Computing.

In The Last Decade

Ami Paz

20 papers receiving 237 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ami Paz Israel	7	167	108	77	48	40	26	256
Neeldhara Misra India	10	211 1.3×	71 0.7×	52 0.7×	54 1.1×	42 1.1×	38	268
Johannes Uhlmann Germany	9	175 1.0×	79 0.7×	65 0.8×	37 0.8×	20 0.5×	19	268
Manuel Sorge Germany	8	102 0.6×	59 0.5×	32 0.4×	15 0.3×	12 0.3×	36	187
Sebastian Ordyniak Austria	11	208 1.2×	96 0.9×	190 2.5×	36 0.8×	33 0.8×	73	364
Robert Ganian Austria	9	203 1.2×	71 0.7×	56 0.7×	39 0.8×	28 0.7×	70	276
Claire Kenyon-Mathieu United States	6	98 0.6×	72 0.7×	65 0.8×	49 1.0×	59 1.5×	9	196
A. V. Karzanov Russia	7	143 0.9×	68 0.6×	31 0.4×	18 0.4×	33 0.8×	19	213
Eric Balkanski United States	8	85 0.5×	61 0.6×	94 1.2×	15 0.3×	48 1.2×	26	165
Garth Isaak United States	11	216 1.3×	43 0.4×	38 0.5×	18 0.4×	37 0.9×	31	305
Yasushi Kawase Japan	8	33 0.2×	64 0.6×	35 0.5×	34 0.7×	50 1.3×	32	186

Countries citing papers authored by Ami Paz

Since Specialization

Citations

This map shows the geographic impact of Ami Paz's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ami Paz with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ami Paz more than expected).

Fields of papers citing papers by Ami Paz

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ami Paz. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ami Paz. The network helps show where Ami Paz may publish in the future.

Co-authorship network of co-authors of Ami Paz

This figure shows the co-authorship network connecting the top 25 collaborators of Ami Paz. A scholar is included among the top collaborators of Ami Paz based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ami Paz. Ami Paz is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Paz, Ami, et al.. (2024). Playing Guess Who with your kids: Code-word strategy against adversaries. Theoretical Computer Science. 1016. 114766–114766. 1 indexed citations

2.

Paz, Ami, et al.. (2024). The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica. 86(6). 1830–1861. 1 indexed citations

3.

Castañeda, Armando, et al.. (2023). Synchronous t-resilient consensus in arbitrary graphs. Information and Computation. 292. 105035–105035.

4.

Censor-Hillel, Keren, et al.. (2021). Fast Deterministic Algorithms for Highly-Dynamic Networks. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16.

5.

Gilbert, Seth, et al.. (2021). On the Complexity of Load Balancing in Dynamic Networks. 254–264. 2 indexed citations

6.

Paz, Ami, et al.. (2020). Improved Hardness of Approximation of Diameter in the CONGEST Model. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

7.

Fraigniaud, Pierre & Ami Paz. (2020). The Topology of Local Computing in Networks. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

8.

Attiya, Hagit, Armando Castañeda, Maurice Herlihy, & Ami Paz. (2019). Bounds on the Step and Namespace Complexity of Renaming. SIAM Journal on Computing. 48(1). 1–32. 2 indexed citations

9.

Censor-Hillel, Keren, et al.. (2019). Hardness of Distributed Optimization. 238–247. 7 indexed citations

10.

Censor-Hillel, Keren, et al.. (2018). Approximate proof-labeling schemes. Theoretical Computer Science. 811. 112–124. 6 indexed citations

11.

Paz, Ami, et al.. (2018). A (2+ϵ)-Approximation for Maximum Weight Matching in the Semi-streaming Model. ACM Transactions on Algorithms. 15(2). 1–15. 1 indexed citations

12.

Censor-Hillel, Keren, et al.. (2017). Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations

13.

Paz, Ami, et al.. (2017). A (2 + ϵ)-approximation for maximum weight matching in the semi-streaming model. arXiv (Cornell University). 2153–2161. 7 indexed citations

14.

Censor-Hillel, Keren, Telikepalli Kavitha, Ami Paz, & Amir Yehudayoff. (2017). Distributed construction of purely additive spanners. Distributed Computing. 31(3). 223–240. 2 indexed citations

15.

Censor-Hillel, Keren, Petteri Kaski, Janne H. Korhonen, et al.. (2016). Algebraic methods in the congested clique. Distributed Computing. 32(6). 461–478. 25 indexed citations

16.

Censor-Hillel, Keren, Petteri Kaski, Janne H. Korhonen, et al.. (2015). Algebraic Methods in the Congested Clique. 143–152. 29 indexed citations

17.

Attiya, Hagit, Armando Castañeda, Maurice Herlihy, & Ami Paz. (2013). Upper bound on the complexity of solving hard renaming. 190–199. 3 indexed citations

18.

Even, Shimon & Ami Paz. (1984). A note on cake cutting. Discrete Applied Mathematics. 7(3). 285–296. 64 indexed citations

19.

Greibach, Sheila A., et al.. (1983). Matching and spanning in certain planar graphs. Theory of Computing Systems. 16(1). 159–183. 1 indexed citations

20.

Paz, Ami & Shlomo Moran. (1981). Non deterministic polynomial optimization problems and their approximations. Theoretical Computer Science. 15(3). 251–277. 93 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact