Tom Friedetzky

Orcid: 0000-0002-1299-5514

Affiliations:
  • Durham University, UK


According to our database1, Tom Friedetzky authored at least 48 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Payment Scheduling in the Interval Debt Model.
Proceedings of the SOFSEM 2023: Theory and Practice of Computer Science, 2023

2021
Randomized renaming in shared memory systems.
J. Parallel Distributed Comput., 2021

Time-space trade-offs in population protocols for the majority problem.
Distributed Comput., 2021

Infinite Balanced Allocation via Finite Capacities.
Proceedings of the 41st IEEE International Conference on Distributed Computing Systems, 2021

2019
Tight & Simple Load Balancing.
Proceedings of the 2019 IEEE International Parallel and Distributed Processing Symposium, 2019

2018
Threshold load balancing with weighted tasks.
J. Parallel Distributed Comput., 2018

Simple Load Balancing.
CoRR, 2018

A population protocol for exact majority with O(\log<sup>5/3</sup>n) stabilization time and asymptotically optimal number of states.
CoRR, 2018

Majority & Stabilization in Population Protocols.
CoRR, 2018

Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins.
Algorithmica, 2018

A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States.
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

2017
Brief Announcement: Rapid Asynchronous Plurality Consensus.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems.
Distributed Comput., 2016

Efficient k-Party Voting with Two Choices.
CoRR, 2016

Plurality Consensus via Shuffling: Lessons Learned from Load Balancing.
CoRR, 2016

Self-stabilizing Balls & Bins in Batches.
CoRR, 2016

Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract].
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time.
Random Struct. Algorithms, 2015

Randomized diffusion for indivisible loads.
J. Comput. Syst. Sci., 2015

2014
Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems.
ACM Trans. Storage, 2014

Balls into non-uniform bins.
J. Parallel Distributed Comput., 2014

2013
Distributing Storage in Cloud Environments.
Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

2012
Balls into bins with related random choices.
J. Parallel Distributed Comput., 2012

Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks.
Algorithmica, 2012

On the Influence of PRNGs on Data Distribution.
Proceedings of the 20th Euromicro International Conference on Parallel, 2012

Observe and Remain Silent (Communication-Less Agent Location Discovery).
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Multiple-Choice Balanced Allocation in (Almost) Parallel.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011
Sublinear-time algorithms for tournament graphs.
J. Comb. Optim., 2011

Faster Coupon Collecting via Replication with Applications in Gossiping.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2009
A new analytical method for parallel, diffusion-type load balancing.
J. Parallel Distributed Comput., 2009

2008
On weighted balls-into-bins games.
Theor. Comput. Sci., 2008

On the Stability of Dynamic Diffusion Load Balancing.
Algorithmica, 2008

2007
Distributed Selfish Load Balancing.
SIAM J. Comput., 2007

2006
The degree distribution of the generalized duplication model.
Theor. Comput. Sci., 2006

2005
(quasi) Spanners for Mobile Ad Hoc Networks.
J. Interconnect. Networks, 2005

Improved Duplication Models for Proteome Network Evolution.
Proceedings of the Systems Biology and Regulatory Genomics, 2005

Dynamic Diffusion Load Balancing.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Finding Frequent Patterns in a String in Sublinear Time.
Proceedings of the Algorithms, 2005

2004
Identifying Uniformly Mutated Segments within Repeats.
J. Bioinform. Comput. Biol., 2004

2003
The Natural Work-Stealing Algorithm is Stable.
SIAM J. Comput., 2003

A proportionate fair scheduling rule with good worst-case performance.
Proceedings of the SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2003

2002
Randomised dynamic load balancing.
PhD thesis, 2002

Statistical Identification of Uniformly Mutated Segments within Repeats.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2000
Infinite parallel job allocation (extended abstract).
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000

1999
Randomized and Adversarial Load Balancing.
Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998
Parallel Continuous Randomized Load Balancing (Extended Abstract).
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998


  Loading...