max planck institut
informatik

Homepage: Anna Huber

Anna Huber Since October 2010, I have worked as a Post-Doctoral Research Associate in the Algorithms and Complexity research group at Durham University. Here, I am working on the EPSRC project “Submodular Optimization, Lattice Theory and Maximum Constraint Satisfaction Problems” led by Andrei Krokhin. Contact details: See here. Email: Get my email address via email.

---

Research Interests

---

• Submodular Functions and Generalizations
• Valued Constraint Satisfaction Problems
• Randomized and Combinatorial Methods, Quasirandomness
• Algebra, Graph theory

---

Teaching at Saarland University

---

• Summer Semester 2010:
  Coteaching the lecture Algorithms and Randomization with Chinmoy Dutta and Nikolaos Fountoulakis.
• Summer Semester 2009:
  Teaching assistant for The Probabilistic Method held by Nikolaos Fountoulakis and Konstantinos Panagiotou.
• Winter Semester 2008/2009:
  Coteaching the lecture Randomized Algorithms with Benjamin Doerr and Daniel Johannsen.
• Winter Semester 2007/2008:
  Teaching assistant for Algorithms and Datastructures held by Benjamin Doerr and Ernst Althaus.

---

Education

---

• September 2010:
  Ph. D. in Computer Science at the Universität des Saarlandes, Saarbrücken, Germany and the Max-Planck-Institut für Informatik, Department 1: Algorithms and Complexity
  Title of Ph. D. thesis: Randomized Rounding and Rumor Spreading with Stochastic Dependencies (supervisor: Prof. Dr. Benjamin Doerr)
• July 2007:
  Diplom in Mathematics at the Christian-Albrechts-Universität zu Kiel
  Title of Diplom thesis: Zur Struktur von Radikalalgebren: Beziehungen zwischen der zugehörigen Lie-Algebra und der adjungierten Gruppe (supervisor: Prof. Dr. Hartmut Laue)

---

Publications

---

• Skew Bisubmodularity and Valued CSPs.
  A. Huber, A. Krokhin and R. Powell..
  Submitted. Short version in the proceedings of SODA 2013, pp. 1296-1305.
• Towards Minimizing k-Submodular Functions.
  A. Huber and V. Kolmogorov.
  Submitted. Short version in the proceedings of ISCO 2012.
• Strong robustness of randomized rumor spreading protocols.
  B. Doerr, A. Huber and A. Levavi.
  Discrete Applied Mathematics. A short version appeared in the proceedings of ISAAC 2009.
• Reliable broadcasting in random networks and the effect of density.
  N. Fountoulakis, A. Huber and K. Panagiotou.
  Proceedings of IEEE INFOCOM 2010, pp. 2552-2560.
• The speed of broadcasting in random networks: density does not matter.
  N. Fountoulakis, A. Huber and K. Panagiotou.
  A brief announcement appeared in the proceedings of DISC 2009.
• Quasirandom rumor spreading on the complete graph is as fast as randomized rumor spreading.
  N. Fountoulakis and A. Huber.
  SIAM Journal on Discrete Mathematics, 23(4):1964-1991, 2009. Extended abstract in the proceedings of EUROCOMB 2009.
• Tight bounds for quasirandom rumor spreading.
  S. Angelopoulos, B. Doerr, A. Huber and K. Panagiotou.
  The Electronic Journal of Combinatorics, 16(1), #R102, 2009.

• Anna Huber:
• Research Interests
• Teaching
• Education
• Publications