Tom Friedetzky

835 total citations
42 papers, 380 citations indexed

About

Tom Friedetzky is a scholar working on Computer Networks and Communications, Artificial Intelligence and Computational Theory and Mathematics. According to data from OpenAlex, Tom Friedetzky has authored 42 papers receiving a total of 380 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computer Networks and Communications, 9 papers in Artificial Intelligence and 9 papers in Computational Theory and Mathematics. Recurrent topics in Tom Friedetzky's work include Distributed systems and fault tolerance (16 papers), Optimization and Search Problems (10 papers) and Complexity and Algorithms in Graphs (9 papers). Tom Friedetzky is often cited by papers focused on Distributed systems and fault tolerance (16 papers), Optimization and Search Problems (10 papers) and Complexity and Algorithms in Graphs (9 papers). Tom Friedetzky collaborates with scholars based in United Kingdom, Canada and Germany. Tom Friedetzky's co-authors include Petra Berenbrink, Zengjian Hu, Leslie Ann Goldberg, Paul W. Goldberg, Colin Cooper, Lars Nagel, André Brinkmann, Russell Martin, Joseph H. Nadeau and S. Cenk Şahinalp and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Tom Friedetzky

40 papers receiving 363 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Tom Friedetzky United Kingdom 10 263 71 56 53 48 42 380
Shahin Kamali Canada 10 277 1.1× 117 1.6× 27 0.5× 12 0.2× 95 2.0× 38 408
Isabelle Stanton United States 6 184 0.7× 117 1.6× 36 0.6× 76 1.4× 144 3.0× 7 384
Ramesh Viswanathan United States 8 203 0.8× 135 1.9× 49 0.9× 15 0.3× 99 2.1× 24 313
Simon Fischer Germany 14 189 0.7× 37 0.5× 8 0.1× 47 0.9× 117 2.4× 26 427
Dehui Du China 11 57 0.2× 88 1.2× 28 0.5× 23 0.4× 95 2.0× 41 306
S. S. Yau United States 7 99 0.4× 50 0.7× 38 0.7× 12 0.2× 71 1.5× 18 295
Kedar Dhamdhere United States 9 205 0.8× 58 0.8× 19 0.3× 11 0.2× 133 2.8× 15 358
Pingpeng Yuan China 11 198 0.8× 170 2.4× 32 0.6× 48 0.9× 303 6.3× 55 485
Ashot Harutyunyan Armenia 10 201 0.8× 63 0.9× 16 0.3× 13 0.2× 87 1.8× 36 329
Guy Jacobson United States 9 135 0.5× 55 0.8× 38 0.7× 14 0.3× 160 3.3× 15 328

Countries citing papers authored by Tom Friedetzky

Since Specialization
Citations

This map shows the geographic impact of Tom Friedetzky'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 Tom Friedetzky with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tom Friedetzky more than expected).

Fields of papers citing papers by Tom Friedetzky

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tom Friedetzky. 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 Tom Friedetzky. The network helps show where Tom Friedetzky may publish in the future.

Co-authorship network of co-authors of Tom Friedetzky

This figure shows the co-authorship network connecting the top 25 collaborators of Tom Friedetzky. A scholar is included among the top collaborators of Tom Friedetzky 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 Tom Friedetzky. Tom Friedetzky is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Berenbrink, Petra, André Brinkmann, Robert Elsässer⋆, Tom Friedetzky, & Lars Nagel. (2021). Randomized renaming in shared memory systems. Journal of Parallel and Distributed Computing. 150. 112–120. 1 indexed citations
2.
Berenbrink, Petra, et al.. (2018). A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 6 indexed citations
3.
Berenbrink, Petra, et al.. (2017). Threshold load balancing with weighted tasks. Journal of Parallel and Distributed Computing. 113. 218–226. 2 indexed citations
4.
Berenbrink, Petra, Robert Elsässer⋆, & Tom Friedetzky. (2016). Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. Distributed Computing. 29(5). 317–339. 2 indexed citations
5.
Berenbrink, Petra, Tom Friedetzky, Peter Kling, et al.. (2016). Self-stabilizing Balls & Bins in Batches. Durham Research Online (Durham University). 83–92. 4 indexed citations
6.
Berenbrink, Petra, Colin Cooper, Tom Friedetzky, Tobias Friedrich, & Thomas Sauerwald. (2014). Randomized diffusion for indivisible loads. Journal of Computer and System Sciences. 81(1). 159–185. 8 indexed citations
7.
Miller, Ethan L., et al.. (2014). Random Slicing. ACM Transactions on Storage. 10(3). 1–35. 8 indexed citations
8.
Berenbrink, Petra, Colin Cooper, & Tom Friedetzky. (2013). Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. Random Structures and Algorithms. 46(1). 36–54. 5 indexed citations
9.
Berenbrink, Petra, Colin Cooper, & Tom Friedetzky. (2012). Random walks which prefer unvisited edges.. Durham Research Online (Durham University). 29–36. 2 indexed citations
10.
Berenbrink, Petra, Colin Cooper, Tom Friedetzky, Tobias Friedrich, & Thomas Sauerwald. (2011). Randomized Diffusion for Indivisible Loads. 429–439. 3 indexed citations
11.
Friedetzky, Tom, et al.. (2010). Sublinear-time algorithms for tournament graphs. Journal of Combinatorial Optimization. 22(3). 469–481.
12.
Berenbrink, Petra, André Brinkmann, Tom Friedetzky, & Lars Nagel. (2010). Balls into non-uniform bins. Durham Research Online (Durham University). 1. 1–10. 5 indexed citations
13.
Broersma, Hajo, Thomas Erlebach, Tom Friedetzky, & Daniël Paulusma. (2008). Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers. Springer eBooks. 1 indexed citations
14.
Berenbrink, Petra, Tom Friedetzky, Zengjian Hu, & Russell Martin. (2008). On weighted balls-into-bins games. Theoretical Computer Science. 409(3). 511–520. 28 indexed citations
15.
Berenbrink, Petra, Tom Friedetzky, & Zengjian Hu. (2006). A new analytical method for parallel, diffusion-type load balancing. International Parallel and Distributed Processing Symposium. 56–56. 1 indexed citations
16.
Berenbrink, Petra, et al.. (2006). Distributed selfish load balancing. Symposium on Discrete Algorithms. 354–363. 29 indexed citations
17.
Bebek, Gürkan, Petra Berenbrink, Colin Cooper, et al.. (2006). The degree distribution of the generalized duplication model. Theoretical Computer Science. 369(1-3). 239–249. 34 indexed citations
18.
Adler, Micah, Petra Berenbrink, Tom Friedetzky, et al.. (2003). A proportionate fair scheduling rule with good worst-case performance. Durham Research Online (Durham University). 101–108. 8 indexed citations
19.
Adler, Micah, Petra Berenbrink, Tom Friedetzky, et al.. (2003). A proportionate fair scheduling rule with good worst-case performance. 1 indexed citations
20.
Berenbrink, Petra, et al.. (2000). Infinite parallel job allocation (extended abstract). Durham Research Online (Durham University). 99–108. 7 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

Rankless by CCL
2026