In 2007-2008 I was working with Robert E. Tarjan while visiting the Theory Group at the Computer Science Department at Princeton University.
From October 2004 - 2007 I studied in Germany at the Technical University Munich in the diploma programs for Mathematics and Computer Science where I graduated with a Diplom in mathematics (GPA: 4.0).
I was also a fellow of the elite graduate program TopMath in Applied Mathematics in which I completed the TopMath Elite Bachelor of Science and the TopMath Master of Science with Honours.

• Tighter Worst-Case Bounds on Algebraic Gossip
  Bernhard Haeupler
  under review
  

• Beeping a Maximal Independent Set
  with Noga Alon, Yehuda Afek, Ziv Bar-Joseph, Alejandro Cornejo and Fabian Kuhn
  under review for the DIST special issue for DISC 2011, (PDF)
  

• Analyzing Network Coding Gossip Made Easy
  Bernhard Haeupler
  under review, arXiv:1010.0558 [cs.DC]

• Testing Simultaneous Planarity when the Common Graph is 2-Connected
  with Krishnam Raju Jampani and Anna Lubiw
  under review, (PDF)

• New Constructive Aspects of the Lovasz Local Lemma
  with Barna Saha and Aravind Srinivasan
  Journal of the ACM (JACM), Volume 58(6), 28:1 - 28:28, 2011
  

• Deterministic Algorithms for the Lovasz Local Lemma
  with Karthekeyan Chandrasekaran and Navin Goyal
  to appear in the SIAM Journal on Computing (SICOMP), (PDF)

• Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive
  with William Garsarch
  Electronic Journal of Combinatorics, Volume 18(1), 2011, P64
  

• Rank-Pairing Heaps
  with Siddhartha Sen and Robert E. Tarjan
  SIAM Journal on Computing (SICOMP), Volume 40, Issue 6, pp. 1463-1485, 2011
  

• Faster Algorithms for Incremental Topological Ordering
  with Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen and Robert E. Tarjan
  ACM Transactions on Algorithms (TALG), Volume 8(1), 2012
  

• Finding a Feasible Flow in a Strongly Connected Network
  with Robert E. Tarjan
  Operations Research Letters 36(4): 397-398 (2008)
  

• The Complexity of Mutli-Message Broadcast in Radio Networks with Known Topology
  with Mohsen Ghaffari, Majid Khabbazian, in submission

• Bounds on Contention Management in Radio Networks
  with Mohsen Ghaffari, Nancy Lynch and Calvin Newport, in submission

• Network Coded Gossip with Correlated Data
  with Asaf Cohen, Chen Avin and Muriel Médard, ISIT 2012
  arXiv:1202.1801

• Discovery through Gossip
  with Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun, SPAA 2012
  arXiv:1202.2092

• Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance
  with Keren Censor-Hillel, Jonathan A. Kelner and Petar Maymounkov, STOC 2012
  arXiv:1104.2944

• Optimality of Network Coding with Buffers
  with Minji Kim and Muriel Médard, IEEE Information Theory Workshop (ITW), pages 533 - 537, 2011
  arXiv:1102.3569

• Online Stochastic Weighted Matching: Improved Approximation Algorithms
  with Vahab Mirrokni and Morteza Zadimoghaddam, Workshop on Internet and Economics 2011 (WINE)
  Lecture Notes in Computer Science, 2011, Volume 7090/2011, 170-181
  

• Beeping a Maximal Independent Set
  with Noga Alon, Yehuda Afek, Ziv Bar-Joseph, Alejandro Cornejo and Fabian Kuhn, International Symposium on Distributed Computing 2011 (DISC)
  Distributed Computing, Lecture Notes in Computer Science, 2011, Volume 6950/2011, 32-50
  invited to the DIST special issue for DISC 2011
  

• One Packet Suffices - Highly Efficient Network Coding With Finite Memory
  with Muriel Médard, International Symposium on Information Theory (ISIT 2011), pages 1151 - 1155
  arXiv:1102.3204

• Faster Information Dissemination in Dynamic Networks via Network Coding
  with David Karger, Symposium on Principles of Distributed Computing (PODC 2011), 381--390
  arXiv:1104.2527

• Analyzing Network Coding Gossip Made Easy
  Symposium on Theory of Computing (STOC 2011), 293 - 302
  winner of the Danny Lewin Best Student Paper Award
  invited to the SICOMP special issue for STOC 2011
  preliminary version presented at an invited session of the Allerton Conference 2010
  full version: arXiv:1010.0558 [cs.DC]
  

• Testing Simultaneous Planarity when the Common Graph is 2-Connected
  with Krishnam Raju Jampani and Anna Lubiw, ISAAC 2010
  Lecture Notes in Computer Science; Vol. 6507, 410 - 421
  arXiv:1009.4517 [cs.DS]

• New Constructive Aspects of the Lovasz Local Lemma
  with Barna Saha and Aravind Srinivasan, Foundations of Computer Science (FOCS 2010), 397 - 406
  arXiv:1001.1231 [cs.DS]
  see above for the JACM journal version

• Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive
  with William Garsarch, invited paper at the Conference on Logic, Computability and Randomness 2010
  arXiv:1005.3749 [math.CO]
  see above for the Electronic Journal of Combinatorics journal version

• Deterministic Algorithms for the Lovasz Local Lemma
  with Karthekeyan Chandrasekaran and Navin Goyal, SODA 2010
  Discrete Algorithms, 2010 21st Annual ACM-SIAM Symposium on; 992 - 1004
  arXiv:0908.0375 [cs.DS]
  see above for the SICOMP journal version

• Rank-Balanced Trees
  with Siddhartha Sen and Robert E. Tarjan, WADS 2009
  Lecture Notes in Computer Science; Vol. 5667, 351 - 362

• Rank-Pairing Heaps
  with Siddhartha Sen and Robert E. Tarjan, ESA 2009
  Lecture Notes in Computer Science, Volume 5757, 659 - 670
  previous version: ''Heaps Simplified''; arXiv:0903.0116 [cs.DS]
  see above for the SICOMP journal version

• Faster Algorithms for Incremental Topological Ordering
  with Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen and Robert E. Tarjan, ICALP 2008
  Lecture Notes in Computer Science, Volume 5125, 421 - 433
  see above for the TALG journal version

• Planarity Algorithms via PQ-trees (Extended Abstract)
  with Robert E. Tarjan, Topological & Geometric Graph Theory International Conference 2008
  Electronic Notes in Discrete Mathematics 31: 143-149 (2008)
  invited to the special issue of the European Journal of Combinatorics (declined)

• Self-Adjusting Networks to Minimize Expected Path Length
  with Chen Avin, Michael Borokhovich, Zvi Loetker
  arXiv:1110.0196

• Computing a Maximal Independent Set using Beeps
  with Alejandro Cornejo and Fabian Kuhn
  arXiv:1108.1926 [cs.DC]
  

• Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections
  with Karthekeyan Chandrasekaran and Navin Goyal
  arXiv:1006.3030 [cs.DM]
  

• Robust Regulatory Networks
  with Arnab Bhattacharyya
  arXiv:0904.4360

• Incremental Topological Ordering and Strong Component Maintenance
  with Siddhartha Sen and Robert E. Tarjan
  arXiv:0803.0792 [cs.DS]

• Finding a Feasible Flow in a Strongly Connected Network
  with Robert E. Tarjan
  arXiv:0711.2710 [cs.DS]
  see above for the ORL journal version

• Maximum flows in planar networks
  diploma thesis, supervised by Ernst W. Mayr, December 2007