| [1] | Petra Berenbrink, Colin Cooper, and Tom Friedetzky. Random walks which prefer unexplored edges can cover random regular graphs in linear time. Random Structures and Algorithms, 2013. To appear. [ bib ] |
| [2] | Petra Berenbrink, Andre Brinkmann, Tom Friedetzky, Dirk Meister, and Lars Nagel. Distributing storage in cloud environments. In Proceedings of High-Performance Grid and Cloud Computing Workshop (workshop of IPDPS), 2013. To appear. [ bib ] |
| [3] | Petra Berenbrink, Artur Czumaj, Matthias Englert, Tom Friedetzky, and Lars Nagel. Multiple-choice balanced allocation in (almost) parallel. In Proceedings of the 16th International Workshop on Randomization and Computation (RANDOM 2012), volume 7408 of Lecture Notes in Computer Science, pages 411-422. Springer, 2012. [ bib ] |
| [4] | Tom Friedetzky, Leszek Gasieniec, Thomas Gorry, and Russell Martin. Observe and remain silent (communication-less agent location discovery). In Proceedings of the 37th International Symposium of Mathematical Foundations of Computer Science (MFCS 2012), volume 7464 of Lecture Notes in Computer Science, pages 407-418. Springer, 2012. [ bib ] |
| [5] | Petra Berenbrink, Colin Cooper, and Tom Friedetzky. Random walks which prefer unvisited edges, and exploring high girth even degree expanders in linear time. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pages 29-36, 2012. [ bib ] |
| [6] | André Brinkmann, Tom Friedetzky, and Ivan Popov. On the influence of PRNGs on data distribution. In Proceedings of the 20th Euromicro International Conference on Parallel, Distributed and Network-Based Computing, pages 536-543. IEEE Computer Society, 2012. [ bib | DOI ] |
| [7] | Petra Berenbrink, Andre Brinkmann, Tom Friedetzky, and Lars Nagel. Balls into bins with related random choices. Journal of Parallel and Distributed Computing, 72(2):246-253, 2012. [ bib | DOI ] |
| [8] | Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, and Zengjian Hu. Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. Algorithmica, 63(3-4):767-786, 2012. [ bib | DOI ] |
| [9] | Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, and Thomas Sauerwald. Randomized diffusion for indivisible loads. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pages 429-439, January 2011. [ bib ] |
| [10] | Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, and Thomas Sauerwald. Faster coupon collecting via replication with applications in gossiping. In Filip Murlak and Piotr Sankowski, editors, Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS 2011). Springer, 2011. [ bib ] |
| [11] | Petra Berenbrink, André Brinkmann, Tom Friedetzky, and Lars Nagel. Balls into bins with related random choices. In Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 100-105. ACM, ACM Press, June 2010. [ bib ] |
| [12] | Petra Berenbrink, André Brinkmann, Tom Friedetzky, and Lars Nagel. Balls into non-uniform bins. In Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 1-10. IEEE, April 2010. [ bib | DOI | .pdf ] |
| [13] | Stefan Dantchev, Tom Friedetzky, and Lars Nagel. Sublinear-time algorithms for tournament graphs. Journal of Combinatorial Optimization, April 2010. [ bib | DOI ] |
| [14] | Petra Berenbrink, Tom Friedetzky, and Zengjian Hu. A new analytical method for parallel, diffusion-type load balancing. ScienceDirect Journal of Parallel and Distributed Computing (JPDC), 69(1):54-61, January 2009. [ bib | DOI | .pdf ] |
| [15] | Stefan Dantchev, Tom Friedetzky, and Lars Nagel. Sublinear-time algorithms for tournament graphs. In Proceedings of the Fifteenth International Computing and Combinatorics Conference (COCOON), volume 5609/2009 of Lecture Notes in Computer Science, pages 459-471. Springer, 2009. [ bib | DOI | .pdf ] |
| [16] | Petra Berenbrink, Tom Friedetzky, Zengjian Hu, and Russell Martin. On weighted balls-into-bins games. Theoretical Computer Science, 409(3):511-520, December 2008. [ bib | DOI ] |
| [17] | Petra Berenbrink, Tom Friedetzky, and Russell Martin. On the stability of dynamic diffusion load balancing. Algorithmica, 50(3):329-350, March 2008. [ bib | DOI ] |
| [18] | Petra Berenbrink, Robert Elsässer, and Tom Friedetzky. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In Proceedings of the Twenty-Seventh Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 155-164. ACM, 2008. [ bib | DOI ] |
| [19] | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul Goldberg, Zengjian Hu, and Russell Martin. Distributed selfish load balancing. SIAM Journal on Computing, 37(4):1163-1181, November 2007. [ bib | DOI ] |
| [20] | Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, and Zengjian Hu. Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. In Lars Arge, Michael Hoffmann, and Emo Welzl, editors, Proceedings of the 15th Annual European Symposium on Algorithms (ESA 2007), volume 4698/2007 of Lecture Notes in Computer Science, pages 41-52. Springer, Springer, October 2007. [ bib | DOI ] |
| [21] | Gurkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joe H. Nadeau, and S. Cenk Sahinalp. The degree distribution of the generalized duplication model. Theoretical Computer Science (TCS), 369(1-3):239-249, December 2006. [ bib | DOI ] |
| [22] | Petra Berenbrink, Tom Friedetzky, and Zengjian Hu. A new analytical method for parallel, diffusion-type load balancing. In Proceedings of the 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), page 10pp. IEEE, IEEE, April 2006. [ bib | DOI ] |
| [23] | Gurkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joe H. Nadeau, and S. Cenk Sahinalp. Improved duplication based models for proteome network evolution. In Systems Biology and Regulatory Genomics: Proceedings of the First Annual RECOMB Satellite Workshop on Systems Biology and the Second Annual RECOMB Satellite Workshop on Regulatory Genomics, volume 4023 of Lecture Notes in Computer Science, pages 119-137. Springer, 2006. [ bib | DOI ] |
| [24] | Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul Goldberg, Zengjian Hu, and Russell Martin. Distributed selfish load balancing. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pages 354-363. ACM SIAM, 2006. [ bib | DOI ] |
| [25] | Petra Berenbrink, Tom Friedetzky, and Russell Martin. Dynamic diffusion load balancing. In Luis Caires, Giuseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, and Moti Yung, editors, Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), volume 2580 of Lecture Notes in Computer Science, pages 1386-1398. Springer, July 2005. [ bib | DOI ] |
| [26] | Petra Berenbrink, Tom Friedetzky, Jan Manuch, and Ladislav Stacho. Quasi spanners for mobile adhoc-networks. World Scientific Journal of Interconnection Networks (JOIN), 6(2):63-84, June 2005. [ bib | DOI ] |
| [27] | Petra Berenbrink, Tom Friedetzky, Zengjian Hu, and Russell Martin. On weighted balls-into-bins games. In Volker Diekert and Bruno Durand, editors, Proceedings of the 22nd International Symposium on Theoretical Aspects of Computer Science (STACS 2005), volume 3404 of Lecture Notes in Computer Science, pages 231-243. Springer, February 2005. ISBN 3-540-24998-2. [ bib | DOI ] |
| [28] | Petra Berenbrink, Funda Ergün, and Tom Friedetzky. Finding frequent patterns in a string in sublinear time. In G.S. Brodal and S. Leonardi, editors, Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), volume 3669 of Lecture Notes in Computer Science, pages 746-757. Springer, 2005. ISSN 0302-9743. [ bib | DOI ] |
| [29] | S. Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, and Funda Ergün. Identifying uniformly mutated segments within repeats. World Scientific Journal of Bioinformatics and Computational Biology, 2(4):657-668, December 2004. [ bib | DOI ] |
| [30] | Micah Adler, Petra Berenbrink, Tom Friedetzky, Leslie Ann Goldberg, Paul Goldberg, and Mike Paterson. A proportionate fair scheduling rule with good worst-case performance. In Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2003), pages 101-108. ACM Press, 2003. ISBN 1-58113-661-7. [ bib | DOI ] |
| [31] | Petra Berenbrink, Tom Friedetzky, and Leslie Ann Goldberg. The natural work-stealing algorithm is stable. SIAM Journal of Computing, 32(5):1260-1279, 2003. [ bib | DOI ] |
| [32] | S. Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, and Funda Ergün. Statistical identification of uniformly mutated segments within repeats. In A. Apostolico and M. Takeda, editors, Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching (CPM 2002), volume 2373 of Lecture Notes in Computer Science, pages 249-261. Springer, 2002. ISBN 3-540-43862-9. [ bib | DOI ] |
| [33] | Petra Berenbrink, Tom Friedetzky, and Leslie Ann Goldberg. The natural work-stealing algorithm is stable. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), pages 178-189. IEEE Press, 2001. ISBN 0-7695-1390-5. [ bib | DOI ] |
| [34] | Petra Berenbrink, Artur Czumaj, Tom Friedetzky, and Nikita D. Vvedenskaya. Infinite parallel job allocation. In Proceedings of the 12th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2000), pages 99-108. ACM Press, 2000. ISBN 1-58113-185-2. [ bib | DOI ] |
| [35] | Tom Friedetzky. Randomised Dynamic Load Balancing. PhD thesis, Technical University of Munich, Germany, 2000. [ bib ] |
| [36] | Petra Berenbrink, Tom Friedetzky, and Angelika Steger. Randomized and adversarial load balancing. In Proceedings of the 11th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1999), pages 175-184. ACM Press, 1999. ISBN 1-58113-124-0. [ bib | DOI ] |
| [37] | Petra Berenbrink, Tom Friedetzky, and Ernst W. Mayr. Parallel continuous randomized load balancing. In Proceedings of the 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 1998), pages 192-201. ACM Press, 1998. ISBN 0-89791-989-0. [ bib | DOI | .pdf ] |
| [38] | Tom Friedetzky. Wormhole routing in multidimensional meshes. Master's thesis, University of Paderborn, Germany, 1996. [ bib ] |
This file was generated by bibtex2html 1.96.