Journal Article Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance 2012 • Annual ACM Symposium on Theory of Computing • 961-970 Censor-Hillel K, Haeupler B, Kelner JA, Maymounkov P
Journal Article Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance 2012 • ACM Transactions on Algorithms (TALG) • 8(1): Haeupler B, Kavitha T, Mathew R, Sen S, Tarjan RE
Journal Article Lower Bounds on Information Dissemination in Dynamic Networks 2012 • Lecture Notes in Computer Science • 7611:166-180 Haeupler B, Kuhn F
Journal Article Network Coded Gossip with Correlated Data 2012 • IEEE International Symposium on Information Theory - Proceedings Haeupler B, Cohen A, Avin C, Medard M
Journal Article Tighter Worst-Case Bounds on Algebraic Gossip 2012 • IEEE Communications Letters • 16(8):1274-1276 Haeupler B
Conference Analyzing Network Coding Gossip Made Easy 2011 • Annual ACM Symposium on Theory of Computing • 293-302 Haeupler B
Conference Beeping a Maximal Independent Set 2011 • Lecture Notes in Computer Science • 6950:32-+ Afek Y, Alon N, Bar-Joseph Z, Cornejo A, Haeupler B, Kuhn F
Journal Article Faster Information Dissemination in Dynamic Networks via Network Coding 2011 • Proceedings of the Annual ACM Symposium on Principles of Distributed Computing • 381-390 Haeupler B, Karger DR
Journal Article Lower Bounds on van der Waerden Numbers: Randomized- and Deterministic-Constructive 2011 • Electronic Journal of Combinatorics • 18(1): Gasarch W, Haeupler B
Journal Article New Constructive Aspects of the Lovasz Local Lemma 2011 • Journal of the ACM • 58(6): Haeupler B, Saha B, Srinivasan A
Journal Article One Packet Suffices - Highly Efficient Packetized Network Coding With Finite Memory 2011 • IEEE International Symposium on Information Theory - Proceedings • 1151-1155 Haeupler B, Medard M
Conference Online Stochastic Weighted Matching: Improved Approximation Algorithms 2011 • Lecture Notes in Computer Science • 7090:170-181 Haeupler B, Mirrokni VS, Zadimoghaddam M
Conference Optimality of Network Coding with Buffers 2011 • 2011 IEEE INFORMATION THEORY WORKSHOP (ITW) Haeupler B, Kim M, Medard M
Journal Article RANK-PAIRING HEAPS 2011 • SIAM journal on computing (Print) • 40(6):1463-1485 Haeupler B, Sen S, Tarjan RE
Conference Deterministic Algorithms for the Lovasz Local Lemma 2010 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 135:992-+ Chandrasekaran K, Goyal N, Haeupler B
Conference New Constructive Aspects of the Lovasz Local Lemma 2010 • Annual Symposium on Foundations of Computer Science • 397-406 Haeupler B, Saha B, Srinivasan A
Journal Article Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections 2010 Chandrasekaran K, Goyal N, Haeupler B
Conference Testing Simultaneous Planarity When the Common Graph Is 2-Connected 2010 • Lecture Notes in Computer Science • 6507:410-+ Haeupler B, Jampani KR, Lubiw A
Conference Rank-Balanced Trees 2009 • Lecture Notes in Computer Science • 5664:351-+ Haeupler B, Sen S, Tarjan RE
Conference Rank-Pairing Heaps 2009 • Lecture Notes in Computer Science • 5757:659-+ Haeupler B, Sen S, Tarjan RE
Conference Faster algorithms for incremental topological ordering 2008 • Lecture Notes in Computer Science • 5125:421-+ Haeupler B, Kavitha T, Mathew R, Sen S, Tarjan RE
