 | 2012 |
| 36 |  | Keren Censor-Hillel,
Bernhard Haeupler,
Jonathan A. Kelner,
Petar Maymounkov:
Global computation in a poorly connected world: fast rumor spreading with no dependence on conductance.
STOC 2012: 961-970 |
| 35 |  | Bernhard Haeupler,
Telikepalli Kavitha,
Rogers Mathew,
Siddhartha Sen,
Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance.
ACM Transactions on Algorithms 8(1): 3 (2012) |
| 34 |  | Bernhard Haeupler,
Asaf Cohen,
Chen Avin,
Muriel Médard:
Network Coded Gossip with Correlated Data
CoRR abs/1202.1801: (2012) |
| 33 |  | Bernhard Haeupler,
Gopal Pandurangan,
David Peleg,
Rajmohan Rajaraman,
Zhifeng Sun:
Discovery through Gossip
CoRR abs/1202.2092: (2012) |
| 2011 |
| 32 |  | Yehuda Afek,
Noga Alon,
Ziv Bar-Joseph,
Alejandro Cornejo,
Bernhard Haeupler,
Fabian Kuhn:
Beeping a Maximal Independent Set.
DISC 2011: 32-50 |
| 31 |  | Bernhard Haeupler,
Muriel Médard:
One packet suffices - Highly efficient packetized Network Coding With finite memory.
ISIT 2011: 1151-1155 |
| 30 |  | Bernhard Haeupler,
David R. Karger:
Faster information dissemination in dynamic networks via network coding.
PODC 2011: 381-390 |
| 29 |  | Bernhard Haeupler:
Analyzing network coding gossip made easy.
STOC 2011: 293-302 |
| 28 |  | Bernhard Haeupler,
Vahab S. Mirrokni,
Morteza Zadimoghaddam:
Online Stochastic Weighted Matching: Improved Approximation Algorithms.
WINE 2011: 170-181 |
| 27 |  | Bernhard Haeupler,
Muriel Médard:
One Packet Suffices - Highly Efficient Packetized Network Coding With Finite Memory
CoRR abs/1102.3204: (2011) |
| 26 |  | Bernhard Haeupler,
MinJi Kim,
Muriel Médard:
Optimality of Network Coding in Packet Networks
CoRR abs/1102.3569: (2011) |
| 25 |  | Bernhard Haeupler,
David R. Karger:
Faster Information Dissemination in Dynamic Networks via Network Coding
CoRR abs/1104.2527: (2011) |
| 24 |  | Keren Censor-Hillel,
Bernhard Haeupler,
Jonathan A. Kelner,
Petar Maymounkov:
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance
CoRR abs/1104.2944: (2011) |
| 23 |  | Bernhard Haeupler,
Telikepalli Kavitha,
Rogers Mathew,
Siddhartha Sen,
Robert Endre Tarjan:
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
CoRR abs/1105.2397: (2011) |
| 22 |  | Alejandro Cornejo,
Bernhard Haeupler,
Fabian Kuhn:
Computing a Maximal Independent Set Using Beeps
CoRR abs/1108.1926: (2011) |
| 21 |  | Chen Avin,
Michael Borokhovich,
Bernhard Haeupler,
Zvi Lotker:
Self-Adjusting Networks to Minimize Expected Path Length
CoRR abs/1110.0196: (2011) |
| 20 |  | William I. Gasarch,
Bernhard Haeupler:
Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive.
Electr. J. Comb. 18(1): (2011) |
| 19 |  | Bernhard Haeupler,
Barna Saha,
Aravind Srinivasan:
New Constructive Aspects of the Lovász Local Lemma.
J. ACM 58(6): 28 (2011) |
| 18 |  | Bernhard Haeupler,
Siddhartha Sen,
Robert Endre Tarjan:
Rank-Pairing Heaps.
SIAM J. Comput. 40(6): 1463-1485 (2011) |
| 2010 |
| 17 |  | Bernhard Haeupler,
Barna Saha,
Aravind Srinivasan:
New Constructive Aspects of the Lovasz Local Lemma.
FOCS 2010: 397-406 |
| 16 |  | Bernhard Haeupler,
Krishnam Raju Jampani,
Anna Lubiw:
Testing Simultaneous Planarity When the Common Graph Is 2-Connected.
ISAAC (2) 2010: 410-421 |
| 15 |  | Karthekeyan Chandrasekaran,
Navin Goyal,
Bernhard Haeupler:
Deterministic Algorithms for the Lovász Local Lemma.
SODA 2010: 992-1004 |
| 14 |  | Bernhard Haeupler,
Barna Saha,
Aravind Srinivasan:
New Constructive Aspects of the Lovasz Local Lemma
CoRR abs/1001.1231: (2010) |
| 13 |  | Karthekeyan Chandrasekaran,
Navin Goyal,
Bernhard Haeupler:
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections
CoRR abs/1006.3030: (2010) |
| 12 |  | Bernhard Haeupler,
Krishnam Raju Jampani,
Anna Lubiw:
Testing Simultaneous Planarity when the Common Graph is 2-Connected
CoRR abs/1009.4517: (2010) |
| 11 |  | Bernhard Haeupler:
Analyzing Network Coding Gossip Made Easy
CoRR abs/1010.0558: (2010) |
| 2009 |
| 10 |  | Bernhard Haeupler,
Siddhartha Sen,
Robert Endre Tarjan:
Rank-Pairing Heaps.
ESA 2009: 659-670 |
| 9 |  | Bernhard Haeupler,
Siddhartha Sen,
Robert Endre Tarjan:
Rank-Balanced Trees.
WADS 2009: 351-362 |
| 8 |  | Bernhard Haeupler,
Siddhartha Sen,
Robert Endre Tarjan:
Heaps Simplified
CoRR abs/0903.0116: (2009) |
| 7 |  | Arnab Bhattacharyya,
Bernhard Haeupler:
Robust Regulatory Networks
CoRR abs/0904.4360: (2009) |
| 6 |  | Karthekeyan Chandrasekaran,
Navin Goyal,
Bernhard Haeupler:
Deterministic Algorithms for the Lovasz Local Lemma
CoRR abs/0908.0375: (2009) |
| 2008 |
| 5 |  | Bernhard Haeupler,
Telikepalli Kavitha,
Rogers Mathew,
Siddhartha Sen,
Robert Endre Tarjan:
Faster Algorithms for Incremental Topological Ordering.
ICALP (1) 2008: 421-433 |
| 4 |  | Bernhard Haeupler,
Siddhartha Sen,
Robert Endre Tarjan:
Incremental Topological Ordering and Strong Component Maintenance
CoRR abs/0803.0792: (2008) |
| 3 |  | Bernhard Haeupler,
Robert Endre Tarjan:
Planarity Algorithms via PQ-Trees (Extended Abstract).
Electronic Notes in Discrete Mathematics 31: 143-149 (2008) |
| 2 |  | Bernhard Haeupler,
Robert Endre Tarjan:
Finding a feasible flow in a strongly connected network.
Oper. Res. Lett. 36(4): 397-398 (2008) |
| 2007 |
| 1 |  | Bernhard Haeupler,
Robert Endre Tarjan:
Finding a Feasible Flow in a Strongly Connected Network
CoRR abs/0711.2710: (2007) |