default search action
Tom Friedetzky
Person information
- affiliation: Durham University, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i9]Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. CoRR abs/2403.02198 (2024) - 2023
- [c34]Tom Friedetzky, David C. Kutner, George B. Mertzios, Iain A. Stewart, Amitabh Trehan:
Payment Scheduling in the Interval Debt Model. SOFSEM 2023: 267-282 - 2021
- [j20]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Time-space trade-offs in population protocols for the majority problem. Distributed Comput. 34(2): 91-111 (2021) - [j19]Petra Berenbrink, André Brinkmann, Robert Elsässer, Tom Friedetzky, Lars Nagel:
Randomized renaming in shared memory systems. J. Parallel Distributed Comput. 150: 112-120 (2021) - [c33]Petra Berenbrink, Tom Friedetzky, Christopher Hahn, Lukas Hintze, Dominik Kaaser, Peter Kling, Lars Nagel:
Infinite Balanced Allocation via Finite Capacities. ICDCS 2021: 965-975
2010 – 2019
- 2019
- [c32]Petra Berenbrink, Tom Friedetzky, Dominik Kaaser, Peter Kling:
Tight & Simple Load Balancing. IPDPS 2019: 718-726 - 2018
- [j18]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-Stabilizing Balls and Bins in Batches - The Power of Leaky Bins. Algorithmica 80(12): 3673-3703 (2018) - [j17]Petra Berenbrink, Tom Friedetzky, Frederik Mallmann-Trenn, Sepehr Meshkinfamfard, Chris Wastell:
Threshold load balancing with weighted tasks. J. Parallel Distributed Comput. 113: 218-226 (2018) - [c31]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A Population Protocol for Exact Majority with O(log5/3 n) Stabilization Time and Theta(log n) States. DISC 2018: 10:1-10:18 - [i8]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
Majority & Stabilization in Population Protocols. CoRR abs/1805.04586 (2018) - [i7]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter Kling, Tomasz Radzik:
A population protocol for exact majority with O(\log5/3n) stabilization time and asymptotically optimal number of states. CoRR abs/1805.05157 (2018) - [i6]Petra Berenbrink, Tom Friedetzky, Dominik Kaaser, Peter Kling:
Simple Load Balancing. CoRR abs/1808.05389 (2018) - 2017
- [c30]Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker:
Brief Announcement: Rapid Asynchronous Plurality Consensus. PODC 2017: 363-365 - 2016
- [j16]Petra Berenbrink, Robert Elsässer, Tom Friedetzky:
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. Distributed Comput. 29(5): 317-339 (2016) - [c29]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus in Arbitrary Graphs: Lessons Learned from Load Balancing. ESA 2016: 10:1-10:18 - [c28]Petra Berenbrink, Tom Friedetzky, George Giakkoupis, Peter Kling:
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time. ICALP 2016: 136:1-136:14 - [c27]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Christopher Wastell:
Self-stabilizing Balls & Bins in Batches: The Power of Leaky Bins [Extended Abstract]. PODC 2016: 83-92 - [i5]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Chris Wastell:
Plurality Consensus via Shuffling: Lessons Learned from Load Balancing. CoRR abs/1602.01342 (2016) - [i4]Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker:
Efficient k-Party Voting with Two Choices. CoRR abs/1602.04667 (2016) - [i3]Petra Berenbrink, Tom Friedetzky, Peter Kling, Frederik Mallmann-Trenn, Lars Nagel, Chris Wastell:
Self-stabilizing Balls & Bins in Batches. CoRR abs/1603.02188 (2016) - 2015
- [j15]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized diffusion for indivisible loads. J. Comput. Syst. Sci. 81(1): 159-185 (2015) - [j14]Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges: Exploring high girth even degree expanders in linear time. Random Struct. Algorithms 46(1): 36-54 (2015) - [c26]Petra Berenbrink, André Brinkmann, Robert Elsässer, Tom Friedetzky, Lars Nagel:
Randomized Renaming in Shared Memory Systems. IPDPS 2015: 542-549 - [c25]Petra Berenbrink, Tom Friedetzky, Frederik Mallmann-Trenn, Sepehr Meshkinfamfard, Chris Wastell:
Threshold Load Balancing with Weighted Tasks. IPDPS 2015: 550-558 - 2014
- [j13]Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel:
Balls into non-uniform bins. J. Parallel Distributed Comput. 74(2): 2065-2076 (2014) - [j12]Alberto Miranda, Sascha Effert, Yangwook Kang, Ethan L. Miller, Ivan Popov, André Brinkmann, Tom Friedetzky, Toni Cortes:
Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems. ACM Trans. Storage 10(3): 9:1-9:35 (2014) - 2013
- [c24]Petra Berenbrink, André Brinkmann, Tom Friedetzky, Dirk Meister, Lars Nagel:
Distributing Storage in Cloud Environments. IPDPS Workshops 2013: 963-973 - 2012
- [j11]Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu:
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks. Algorithmica 62(3-4): 767-786 (2012) - [j10]Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel:
Balls into bins with related random choices. J. Parallel Distributed Comput. 72(2): 246-253 (2012) - [c23]Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, Lars Nagel:
Multiple-Choice Balanced Allocation in (Almost) Parallel. APPROX-RANDOM 2012: 411-422 - [c22]Tom Friedetzky, Leszek Gasieniec, Thomas Gorry, Russell Martin:
Observe and Remain Silent (Communication-Less Agent Location Discovery). MFCS 2012: 407-418 - [c21]Ivan Popov, André Brinkmann, Tom Friedetzky:
On the Influence of PRNGs on Data Distribution. PDP 2012: 536-543 - [c20]Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges.: exploring high girth even degree expanders in linear time. PODC 2012: 29-36 - [i2]Petra Berenbrink, Colin Cooper, Tom Friedetzky:
Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time. CoRR abs/1204.1939 (2012) - 2011
- [j9]Stefan S. Dantchev, Tom Friedetzky, Lars Nagel:
Sublinear-time algorithms for tournament graphs. J. Comb. Optim. 22(3): 469-481 (2011) - [c19]Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald:
Faster Coupon Collecting via Replication with Applications in Gossiping. MFCS 2011: 72-83 - [c18]Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, Thomas Sauerwald:
Randomized Diffusion for Indivisible Loads. SODA 2011: 429-439 - 2010
- [c17]Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel:
Balls into non-uniform bins. IPDPS 2010: 1-10 - [c16]Petra Berenbrink, André Brinkmann, Tom Friedetzky, Lars Nagel:
Balls into bins with related random choices. SPAA 2010: 100-105
2000 – 2009
- 2009
- [j8]Petra Berenbrink, Tom Friedetzky, Zengjian Hu:
A new analytical method for parallel, diffusion-type load balancing. J. Parallel Distributed Comput. 69(1): 54-61 (2009) - [c15]Stefan S. Dantchev, Tom Friedetzky, Lars Nagel:
Sublinear-Time Algorithms for Tournament Graphs. COCOON 2009: 459-471 - 2008
- [j7]Petra Berenbrink, Tom Friedetzky, Russell A. Martin:
On the Stability of Dynamic Diffusion Load Balancing. Algorithmica 50(3): 329-350 (2008) - [j6]Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell A. Martin:
On weighted balls-into-bins games. Theor. Comput. Sci. 409(3): 511-520 (2008) - [c14]Petra Berenbrink, Robert Elsässer, Tom Friedetzky:
Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. PODC 2008: 155-164 - [e1]Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma:
Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Lecture Notes in Computer Science 5344, 2008, ISBN 978-3-540-92247-6 [contents] - 2007
- [j5]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed Selfish Load Balancing. SIAM J. Comput. 37(4): 1163-1181 (2007) - [c13]Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, Zengjian Hu:
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks. ESA 2007: 41-52 - 2006
- [j4]Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp:
The degree distribution of the generalized duplication model. Theor. Comput. Sci. 369(1-3): 239-249 (2006) - [c12]Petra Berenbrink, Tom Friedetzky, Zengjian Hu:
A new analytical method for parallel, diffusion-type load balancing. IPDPS 2006 - [c11]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed selfish load balancing. SODA 2006: 354-363 - 2005
- [j3]Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho:
(quasi) Spanners for Mobile Ad Hoc Networks. J. Interconnect. Networks 6(2): 63-84 (2005) - [c10]Petra Berenbrink, Funda Ergün, Tom Friedetzky:
Finding Frequent Patterns in a String in Sublinear Time. ESA 2005: 746-757 - [c9]Petra Berenbrink, Tom Friedetzky, Russell A. Martin:
Dynamic Diffusion Load Balancing. ICALP 2005: 1386-1398 - [c8]Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp:
Improved Duplication Models for Proteome Network Evolution. Systems Biology and Regulatory Genomics 2005: 119-137 - [c7]Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell A. Martin:
On Weighted Balls-into-Bins Games. STACS 2005: 231-243 - [i1]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Zengjian Hu, Russell A. Martin:
Distributed Selfish Load Balancing. CoRR abs/cs/0506098 (2005) - 2004
- [j2]Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün:
Identifying Uniformly Mutated Segments within Repeats. J. Bioinform. Comput. Biol. 2(4): 657-668 (2004) - 2003
- [j1]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg:
The Natural Work-Stealing Algorithm is Stable. SIAM J. Comput. 32(5): 1260-1279 (2003) - [c6]Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul W. Goldberg, Mike Paterson:
A proportionate fair scheduling rule with good worst-case performance. SPAA 2003: 101-108 - 2002
- [b1]Thomas Friedetzky:
Randomised dynamic load balancing. Technical University Munich, Germany, 2002, pp. 1-132 - [c5]Süleyman Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, Funda Ergün:
Statistical Identification of Uniformly Mutated Segments within Repeats. CPM 2002: 249-261 - 2001
- [c4]Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg:
The Natural Work-Stealing Algorithm is Stable. FOCS 2001: 178-187 - 2000
- [c3]Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya:
Infinite parallel job allocation (extended abstract). SPAA 2000: 99-108
1990 – 1999
- 1999
- [c2]Petra Berenbrink, Tom Friedetzky, Angelika Steger:
Randomized and Adversarial Load Balancing. SPAA 1999: 175-184 - 1998
- [c1]Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr:
Parallel Continuous Randomized Load Balancing (Extended Abstract). SPAA 1998: 192-201
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 2024-05-08 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint