Petra Berenbrink, Tom Friedetzky, Iman Hajirasouliha, and Zengjian Hu. Convergence to equilibria in distributed, selfish reallocation processes with weighted tasks. Algorithmica, 62(3-4):767-786, 2012. [ bib ]

Petra Berenbrink, André Brinkmann, Tom Friedetzky, and Lars Nagel. Balls into bins with related random choices. J. Parallel Distrib. Comput., 72(2):246-253, 2012. [ bib ]

Petra Berenbrink and Oliver Schulte. Evolutionary equilibrium in bayesian routing games: Specialization and niche formation. Theoretical Computer Science, 411(7-9):1054-1074, 2010. [ bib ]

Tugkan Batu, Betra Berenbrink, and Christian Sohler. A sub-linear time approximation scheme for binpacking. Theoretical Computer Science, 2009. To appear. [ bib ]

Petra Berenbrink, Colin Coooper, and Zengjian Hu. Energy efficient randomised communication in unknown adhoc networks. Theoretical Computing Science, 410:2549-2561, 2009. [ bib ]

Petra Berenbrink, Tom Friedetzky, and Zengjian Hu. A new analytical method for parallel, diffusion-type load balancing. Journal of Parallel and Distributed Computing, 69(1):54061, 2009. [ bib ]

Petra Berenbrink, Tom Friedetzky, and Russell Martin. On the stability of dynamic diffusion load balancing. Algorithmica, November 2008. [ bib | DOI ]

Petra Berenbrink, Tom Friedetzky, Zengjian Hu, and Russell Martin. On weighted balls-into-bins games. Theoretical Computer Science, October 2008. [ bib | DOI ]

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, 2007. [ bib | DOI ]

Fereydoun Hormozdiari, Petra Berenbrink, Natasa Przulj, and Süleyman Cenk Sahinalp. Not all scale free networks are born equal: The role of the seed graph in ppi network emulation. PLOS Computational Biology, 3(7), 2007. [ bib | DOI ]

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 ]

Petra Berenbrink, Artur Czumaj, Angelika Steger, and Berthold Vöcking. Balanced allocations: The heavily loaded case. SIAM Journal of Computing, 35(6):1350-1385, 2006. [ bib ]

Petra Berenbrink, Leslie Ann Goldberg, Paul W. Goldberg, and Russell A. Martin. Utilitarian resource assignment. Journal of Discrete Algorithms, 4(4):567-587, 2006. [ bib ]

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 ]

S. Cenk Sahinalp, Evan E. Eichler, Paul W. Goldberg, Petra Berenbrink, Tom Friedetzky, and Funda Ergün. Identifying uniformly mutated segments within repeats. Journal of Bioinformatics and Computational Biology, 2(4):657-668, December 2004. [ bib | DOI ]

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 ]

Petra Berenbrink, Friedhelm Meyer auf der Heide, and Klaus Schröder. Allocating weighted jobs in parallel. Theory of Computing Systems, pages 281-300, 1999. [ bib ]

Valentin Rottmann, Petra Berenbrink, and Reinhard Lüling. A simple distributed scheduling policy for parallel interactive continuous media servers. Parallel Computing, 23:1757-1776, 1997. [ bib ]

Clemens Adolphs and Petra Berenbrink. Distributed selfish load balancing with weights and speeds. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2012. To appear. [ bib ]

Hoda Akbari, Petra Berenbrink, and Thomas Sauerwald. A simple approach for adapting continuous load balancing processes to discrete settings. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2012. To appear. [ bib ]

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 (PODC), 2012. To appear. [ bib ]

Clemens Adolphs and Petra Berenbrink. Improved bounds for discrete diffusive load balancing. In Proceedings of the 26th International Parallel and Distributed Processing Symposium, 2012. [ bib ]

Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, and Thomas Sauerwald. Faster coupon collecting via replication with applications in gossiping. In Proceedings of the 36th International Symposium Mathematical Foundations of Computer Science 2011, pages 72-83, 2011. [ bib ]

Petra Berenbrink, Colin Cooper, Tom Friedetzky, Tobias Friedrich, and Thomas Sauerwald. Randomized diffusion for indivisible loads. In Proceedings of the 22nd Annual Symposium on Discrete Algorithms (SODA 11), 2011. [ bib ]

Petra Berenbrink, Martin Hoefer, and Thomas Sauerwald. Distributed selfish load balancing on networks. In Proceedings of the 22nd Symposium on Discrete Algorithms (SODA 11), 2011. [ bib ]

Tugkan Batu, Petra Berenbrink, and Colin Cooper. Chains-into-bins processes. In 21st International Workshop on Combinatorial Algorithms (IWOCA 10), 2010. [ bib ]

Petra Berenbrink, Andre Brinkman, Tom Friedetzky, and Lars Nagel. Balls into bins with related random choices. In Proceedings of the 22nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 10), 2010. [ bib ]

Petra Berenbrink, Andre Brinkmann, Tom Friedetzky, and Lars Nagel. Balls into non-uniform bins. In International Parallel & Distributed Processing Symposium (IPDPS 10), 2010. [ bib ]

Petra Berenbrink, Colin Cooper, Robert Elsässer, Tomasz Radzik, and Thomas Sauerwald. Speeding up random walks with neighborhood exploration. In Proceedings of the 21st Symposium on Discrete Algorithms (SODA 10), 2010. [ bib ]

Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, and Leszek Gasieniec. Efficient information exchange in the random phone-call model. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP 10), 2010. [ bib ]

Petra Berenbrink, Robert Elsässer, and Thomas Sauerwald. Randomised broadcasting: Memory vs. randomness. In Latin American Theoretical Informatics Symposium (Latin 10), 2010. [ bib ]

Petra Berenbrink, Robert Elsäesser, and Thomas Sauerwald. Communication complexity of quasirandom rumor spreading. In Proceedings of the 18th Annual European Symposium on Algorithms (ESA 10), 2010. [ bib ]

Heiner Ackermann, Petra Berenbrink, Simon Fischer, and Martin Hoefer. Concurrent imitation dynamics in congestion games. In Proceedings of the 28th Symposium on Principles of Distributed Computing (PODC), 2009. [ bib ]

Petra Berenbrink and Thomas Sauerwald. The weighted coupon collector's problem and applications. In The 15th International Computing and Combinatorics Conference (COCOON), 2009. [ bib ]

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 27th Symposium on Principles of Distributed Computing (PODC), 2008. [ bib ]

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 of Lecture Notes in Computer Science, pages 41-52. Springer, October 2007. [ bib | DOI ]

Petra Berenbrink, Colin Cooper, and Zengjian Hu. Energy efficient randomised communication in unknown adhoc networks. In Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pages 250-259. ACM Press, 2007. [ bib | DOI ]

Petra Berenbrink and Oliver Schulte. Evolutionary equilibrium in bayesian routing games: Specialization and niche formation. In Proceedings of the 15th Annual European Symposium on Algorithms (ESA 2007), pages 29-40, 2007. [ bib | DOI ]

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 (IPDPS06). IEEE, April 2006. [ bib | DOI ]

Gurkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joe H. Nadeau, and S. Cenk Sahinalp. Improved duplication based models for proteome network evolution. In Lecture Notes in Bioinformatics: Proceedings of the First Annual RECOMB Satellite Workshop on Systems Biology and the Second Annual RECOMB Satellite Workshop on Regulatory Genomics, volume 4023, pages 119-137. Springer, 2006. [ bib ]

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 ]

Fereydoun Hormozdiari, Petra Berenbrink, Natasa Przulj, and Süleyman Cenk Sahinalp. Not all scale free networks are born equal: The role of the seed graph in ppi network emulation. In Systems Biology and Computational Proteomics, Joint RECOMB 2006 Satellite Workshops on Systems Biology and on Computational Proteomics. Springer, 2006. [ bib | DOI ]

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 ]

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 ]

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 ]

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 ]

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 | http ]

Baruch Awerbuch, Petra Berenbrink, André Brinkmann, and Christian Scheideler. Simple routing strategies for adversarial systems. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS'01), pages 158-167, 2001. [ bib ]

Petra Berenbrink, André Brinkmann, and Christian Scheideler. Simlab - a simulation environment for storage area networks. In Proceedings of the 9th Euromicro Workshop on Parallel and Distributed Processing (PDP), 2001. [ bib ]

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 | http ]

Petra Berenbrink, André Brinkmann, and Christian Scheideler. Distributed path selection for storage networks. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'00), pages 1097-1105, 2000. [ bib ]

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 | http ]

Petra Berenbrink, Artur Czumaj, Angelika Steger, and Berthold Vöcking. Balanced allocations: The heavily loaded case. In Proceedings of the 32th ACM Symposium on Theory of Computing (STOC'00), pages 745-754, 2000. [ bib ]

Petra Berenbrink, André Brinkmann, and Christian Scheideler. Design of the presto multimedia storage network. In International Workshop on Communication and Data Management in Large Networks (CDMLarge), pages 2-12, 1999. [ bib ]

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 ]

Petra Berenbrink, Marco Riedel, and Christian Scheideler. Simple competitive request scheduling strategies. In Proceedings of the 11th ACM Symposium on Parallel Algorithms and Architectures (SPAA'99), pages 33-42, 1999. [ bib ]

Petra Berenbrink and Christian Scheideler. Locally efficient on-line strategies for routing packets along fixed paths. In Proceedings of the 10th ACM SIAM Symposium on Discrete Algorithms (SODA'99), pages 112-121, 1999. [ bib ]

Micah Adler, Petra Berenbrink, and Klaus Schröder. Analyzing an infinite parallel job allocation process. In Proceedings of the 6th European Symposium on Algorithms (ESA'98), pages 417-428, 1998. [ bib ]

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 | http ]

Petra Berenbrink, Friedhelm Meyer auf der Heide, and Klaus Schröder. Allocating weighted jobs in parallel. In Proceedings of the 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA'97), pages 302-310, 1997. [ bib ]

Burkhard Monien, Petra Berenbrink, Reinhard Lüling, and Marco Riedel. Online scheduling of continuous media streams. In Foundations of Computer Science: Potential-Theory-Cognition, Lecture Notes of Computing Science, pages 313-320. Springer, 1997. [ bib ]

Petra Berenbrink, Friedhelm Meyer auf der Heide, and Volker Stemann. Fault-tolerant shared memory simulations. In Proceedings of the 13th Symposium on Theoretical Aspects of Computer Science (STACS'96), 1996. [ bib ]

Petra Berenbrink, Valentin Rottmann, and Reinhard Lüling. A comparison of data layout schemes for multimedia servers. In Proceedings of the 1st European Conference on Multimedia Applications, Services, and Techniques (ECMAST'96), pages 345-364, 1996. [ bib ]

Petra Berenbrink. Randomized Allocation of Independent Tasks. PhD thesis, University of Paderborn, Germany, 2000. [ bib ]

Petra Berenbrink. Fault-tolerant shared memory simulations. Master's thesis, University of Paderborn, 1996. [ bib ]