Bernhard Haeupler
Post-Prof. & Researcher, Computer Science Department, ETH Zurich (since 2022)
Professor, Computer Science Department, Carnegie Mellon University (since 2014)
(2014 - 2019 Assistant Prof.; 2019 - 2022 Associate Prof.; since 2022 Adjunct Prof.)
Advocate for Neurodiversity and Diversity

Haeupler Contact Information:

Bernhard Haeupler (he/they)
Computer Science Department, ETH Zurich
8006 Zurich, Switzerland

Office: CAB G32.2
Email: bernhard.haeupler at inf.ethz.ch


Publications


Ph.D. Students:   

Funding / Awards: Research Interests:

I am a theoretical computer scientist interested in the design and analyis of algorithms for problems in the intersection of combinatorial optimization, distributed and parallel computing, coding theory, graph/network algorithms, and (network) information theory

Conference Publications

Journal Publications

  • Optimally Resilient Codes for List-Decoding from Insertions and Deletions
    with Amirbehshad Shahrasbi, Venkatesan Guruswami
    TransInf: IEEE Transactions on Information Theory, 2021
    (ArXiv)        (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerTransInf21p21,
      title={Optimally Resilient Codes for List-Decoding from Insertions and Deletions},
      author={Bernhard Haeupler, Amirbehshad Shahrasbi, Venkatesan Guruswami},
      journal={IEEE Transactions on Information Theory (TransInf)},
      year={2021},
      pages={1--21},
      doi={10.1109/TIT.2021.3120910}}
           

  • Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound
    with Amirbehshad Shahrasbi
    JACM: Journal of the ACM, 2021
    (ArXiv)        (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerJACM21p36:19,
      title={Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound},
      author={Bernhard Haeupler, Amirbehshad Shahrasbi},
      journal={Journal of the ACM (JACM)},
      year={2021},
      pages={36:1--36:19},
      doi={10.1145/3468265}}
           

  • Synchronization Strings and Codes for Insertions and Deletions - a Survey
    with Amirbehshad Shahrasbi
    TransInf: IEEE Transactions on Information Theory, 2021
    Invited Contribution to Special Issue Dedicated to the Memory of Vladimir I. Levenshtein
    (ArXiv)        (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerTransInf21p17,
      title={Synchronization Strings and Codes for Insertions and Deletions - a Survey},
      author={Bernhard Haeupler, Amirbehshad Shahrasbi},
      journal={IEEE Transactions on Information Theory (TransInf)},
      year={2021},
      pages={1--17},
      doi={10.1109/TIT.2021.3056317}}
           

  • Low-Congestion Shortcuts without Embedding
    with Taisuke Izumi, Goran Zuzic
    DIST: Distributed Computing, 2020
    (ArXiv)        (Download)        

  • Making Asynchronous Distributed Computations Robust to Noise
    with Keren Censor-Hillel, Ran Gelles
    DIST: Distributed Computing, 2018
    (ArXiv)        (Download)        

  • Explicit Capacity Approaching Coding for Interactive Communication
    with Ran Gelles, Gillat Kol, Noga Ron-Zewi and Avi Wigderson
    TransInf: IEEE Transactions on Information Theory, 2018
    (Download)        

  • Constant-rate coding for multiparty interactive communication is impossible
    with Mark Braverman, Klim Efremenko, Ran Gelles
    JACM: Journal of the ACM, 2017
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerJACM17p4:41,
      title={Constant-rate coding for multiparty interactive communication is impossible},
      author={Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler},
      journal={Journal of the ACM (JACM)},
      year={2017},
      pages={4:1--4:41},
      doi={10.1145/3050218}}
           

  • Capacity of Interactive Communication over Erasure Channels and Channels with Feedback
    with Ran Gelles
    SICOMP: SIAM Journal on Computing, 2017
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerSICOMP17p1472,
      title={Capacity of Interactive Communication over Erasure Channels and Channels with Feedback},
      author={Ran Gelles, Bernhard Haeupler},
      journal={SIAM Journal on Computing (SICOMP)},
      year={2017},
      pages={1449--1472},
      doi={10.1137/15M1052202}}
           

  • Rumor Spreading with No Dependence on Conductance
    with Keren Censor-Hillel, Jonathan Kelner, Petar Maymounkov
    SICOMP: SIAM Journal on Computing, 2017
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerSICOMP17p79,
      title={Rumor Spreading with No Dependence on Conductance},
      author={Keren Censor-Hillel, Bernhard Haeupler, Jonathan Kelner, Petar Maymounkov},
      journal={SIAM Journal on Computing (SICOMP)},
      year={2017},
      pages={58--79},
      doi={10.1137/14099992X}}
           

  • Tight Bounds on Vertex Connectivity under Vertex Sampling
    with Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Fabian Kuhn
    TALG: ACM Transactions on Algorithms, 2017
    Special Issue for SODA 2015
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerTALG17p26,
      title={Tight Bounds on Vertex Connectivity under Vertex Sampling},
      author={Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn},
      journal={ACM Transactions on Algorithms (TALG)},
      year={2017},
      pages={1--26},
      doi={10.1145/3086465}}
           

  • Breathe before Speaking: Efficient Information Dissemination despite Noisy, Limited, and Anonymous Communication
    with Ofer Feinerman, Amos Korman
    DIST: Distributed Computing, 2017
    Distributed Computing Special Issue for PODC 2014
    (ArXiv)        (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerDIST17p355,
      title={Breathe before Speaking: Efficient Information Dissemination despite Noisy, Limited, and Anonymous Communication},
      author={Ofer Feinerman, Bernhard Haeupler, Amos Korman},
      journal={Distributed Computing (DIST)},
      year={2017},
      pages={339--355},
      doi={10.1007/s00446-015-0249-4}}
           

  • Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback
    with Klim Efremenko, Ran Gelles
    TransInf: IEEE Transactions on Information Theory, 2016
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerTransInf16p4588,
      title={Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback},
      author={Klim Efremenko, Ran Gelles, Bernhard Haeupler},
      journal={IEEE Transactions on Information Theory (TransInf)},
      year={2016},
      pages={4575--4588},
      doi={10.1109/TIT.2016.2582176}}
           

  • Analyzing Network Coding (Gossip) Made Easy
    Bernhard Haeupler
    JACM: Journal of the ACM, 2016
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerJACM16p26:22,
      title={Analyzing Network Coding (Gossip) Made Easy},
      author={Bernhard Haeupler},
      journal={Journal of the ACM (JACM)},
      year={2016},
      pages={26:1--26:22},
      doi={10.1145/2629696}}
           

  • Discovery through Gossip
    with Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun
    RSA: Random Structures and Algorithms, 2016
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerRSA16p587,
      title={Discovery through Gossip},
      author={Bernhard Haeupler, Gopal Pandurangan, David Peleg, Rajmohan Rajaraman, Zhifeng Sun},
      journal={Random Structures and Algorithms (RSA)},
      year={2016},
      pages={565--587},
      doi={10.1002/rsa.20621}}
           

  • Simple, Fast, and Deterministic Gossip and Rumor Spreading
    Bernhard Haeupler
    JACM: Journal of the ACM, 2015
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerJACM15p47:18,
      title={Simple, Fast, and Deterministic Gossip and Rumor Spreading},
      author={Bernhard Haeupler},
      journal={Journal of the ACM (JACM)},
      year={2015},
      pages={47:1--47:18},
      doi={10.1145/2767126}}
           

  • Rank-Balanced Trees
    with Siddhartha Sen, Robert Tarjan
    TALG: ACM Transactions on Algorithms, 2015
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerTALG15p26,
      title={Rank-Balanced Trees},
      author={Bernhard Haeupler, Siddhartha Sen, Robert Tarjan},
      journal={ACM Transactions on Algorithms (TALG)},
      year={2015},
      pages={1--26},
      doi={10.1145/2689412}}
           

  • SplayNet: Towards Locally Self-Adjusting Networks
    with Stefan Schmid, Chen Avin, Scheideler Christian, Michael Borokhovich, Zvi Loetker
    ToN: IEEE/ACM Transactions on Networking, 2015
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerToN15p13,
      title={SplayNet: Towards Locally Self-Adjusting Networks},
      author={Stefan Schmid, Chen Avin, Scheideler Christian, Bernhard Haeupler, Michael Borokhovich, Zvi Loetker},
      journal={IEEE/ACM Transactions on Networking (ToN)},
      year={2015},
      pages={1--13},
      doi={10.1109/TNET.2015.2410313 }}
           

  • Bounded-Contention Coding for the Additive Network Model
    with Keren Censor-Hillel, Nancy Lynch, Muriel Medard
    DIST: Distributed Computing, 2015
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerDIST15p12,
      title={Bounded-Contention Coding for the Additive Network Model},
      author={Keren Censor-Hillel, Bernhard Haeupler, Nancy Lynch, Muriel Medard},
      journal={Distributed Computing (DIST)},
      year={2015},
      pages={1--12},
      doi={10.1007/s00446-015-0244-9}}
           

  • Self-Adjusting Grid Networks to Minimize Expected Path Length
    with Chen Avin, Michael Borokhovich, Zvi Loetker
    TCS: Theoretical Computer Science, 2014
    Special Issue for SIROCCO 2013
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerTCS14p102,
      title={Self-Adjusting Grid Networks to Minimize Expected Path Length},
      author={Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Loetker},
      journal={Theoretical Computer Science (TCS)},
      year={2014},
      pages={91--102},
      doi={10.1016/j.tcs.2014.11.036}}
           

  • Network Coding Based Information Spreading in Dynamic Networks with Correlated Data
    with Asaf Cohen, Chen Avin, Muriel Medard
    JSAC: IEEE Journal on Selected Areas in Communications, 2014
    Special Issue on Network Coding in Wireless Communications
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerJSAC14p224,
      title={Network Coding Based Information Spreading in Dynamic Networks with Correlated Data},
      author={Asaf Cohen, Bernhard Haeupler, Chen Avin, Muriel Medard},
      journal={IEEE Journal on Selected Areas in Communications (JSAC)},
      year={2014},
      pages={213--224},
      doi={10.1109/JSAC.2014.2384293}}
           

  • Randomized Broadcast in Radio Networks with Collision Detection
    with Mohsen Ghaffari, Majid Khabbazian
    DIST: Distributed Computing, 2014
    Special Issue for PODC 2013
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerDIST14p16,
      title={Randomized Broadcast in Radio Networks with Collision Detection},
      author={Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian},
      journal={Distributed Computing (DIST)},
      year={2014},
      pages={1--16},
      doi={10.1007/s00446-014-0230-7}}
           

  • Deterministic Algorithms for the Lovasz Local Lemma
    with Karthekeyan Chandrasekaran, Navin Goyal
    SICOMP: SIAM Journal on Computing, 2013
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerSICOMP13p2155,
      title={Deterministic Algorithms for the Lovasz Local Lemma},
      author={Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler},
      journal={SIAM Journal on Computing (SICOMP)},
      year={2013},
      pages={2132--2155},
      doi={10.1137/100799642}}
           

  • Testing Simultaneous Planarity when the Common Graph is 2-Connected
    with Krishnam Raju Jampani, Anna Lubiw
    JGAA: Journal on Graph Algorithms and Applications, 2013
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerJGAA13p171,
      title={Testing Simultaneous Planarity when the Common Graph is 2-Connected},
      author={Krishnam Raju Jampani, Bernhard Haeupler, Anna Lubiw},
      journal={Journal on Graph Algorithms and Applications (JGAA)},
      year={2013},
      pages={147--171},
      doi={10.7155/jgaa.00289}}
           

  • Beeping a Maximal Independent Set
    with Noga Alon, Yehuda Afek, Ziv Bar-Joseph, Alejandro Cornejo, Fabian Kuhn
    DIST: Distributed Computing, 2013
    Special Issue for DISC 2011
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerDIST13p208,
      title={Beeping a Maximal Independent Set},
      author={Noga Alon, Yehuda Afek, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn},
      journal={Distributed Computing (DIST)},
      year={2013},
      pages={195--208},
      doi={10.1007/s00446-012-0175-7}}
           

  • New Constructive Aspects of the Lovasz Local Lemma
    with Barna Saha, Aravind Srinivasan
    JACM: Journal of the ACM, 2012
    (Download)        (ACM Authorizer Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerJACM12p28:28,
      title={New Constructive Aspects of the Lovasz Local Lemma},
      author={Bernhard Haeupler, Barna Saha, Aravind Srinivasan},
      journal={Journal of the ACM (JACM)},
      year={2012},
      pages={28:1--28:28},
      doi={10.1145/2049697.2049702}}
           

  • Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
    with Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Tarjan
    TALG: ACM Transactions on Algorithms, 2012
    (Download)        (ACM Authorizer Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerTALG12p3:33,
      title={Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance},
      author={Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert Tarjan},
      journal={ACM Transactions on Algorithms (TALG)},
      year={2012},
      pages={3:1--3:33},
      doi={10.1145/2071379.2071382}}
           

  • Rank-Pairing Heaps
    with Siddhartha Sen, Robert Tarjan
    SICOMP: SIAM Journal on Computing, 2011
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerSICOMP11p1485,
      title={Rank-Pairing Heaps},
      author={Bernhard Haeupler, Siddhartha Sen, Robert Tarjan},
      journal={SIAM Journal on Computing (SICOMP)},
      year={2011},
      pages={1463--1485},
      doi={10.1137/100785351}}
           

  • Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive
    with William Garsarch
    COMBINATORICS: Electronic Journal on Combinatorics, 2011
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerCOMBINATORICS11p21,
      title={Lower Bounds on the van der Waerden Numbers: Randomized- and Deterministic-Constructive},
      author={William Garsarch, Bernhard Haeupler},
      journal={Electronic Journal on Combinatorics (COMBINATORICS)},
      year={2011},
      pages={1--21},
      doi={}}
           

Letters and Brief Announcements

  • Writeback Aware Caching
    with Nathan Beckmann, Phillip Gibbons, Charles McGuffey
    SPAA Brief Announcement: ACM Symposium on Parallelism in Algorithms and Architectures, 2019
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerSPAA Brief Announcement19p347,
      title={Writeback Aware Caching},
      author={Nathan Beckmann, Phillip Gibbons, Bernhard Haeupler, Charles McGuffey},
      journal={ACM Symposium on Parallelism in Algorithms and Architectures (SPAA Brief Announcement)},
      year={2019},
      pages={345--347},
      doi={10.1145/3323165.3323169}}
           

  • Near-Optimal BFS Computation in Radio Networks
    with Mohsen Ghaffari
    CL: IEEE Communications Letter, 2016
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerCL16p1174,
      title={Near-Optimal BFS Computation in Radio Networks},
      author={Mohsen Ghaffari, Bernhard Haeupler},
      journal={IEEE Communications Letter (CL)},
      year={2016},
      pages={1172--1174},
      doi={10.1109/LCOMM.2016.2539940 }}
           

  • Tighter Worst-Case Bounds on Algebraic Gossip
    Bernhard Haeupler
    CL: IEEE Communications Letter, 2012
    (ArXiv)        (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerCL12p1276,
      title={Tighter Worst-Case Bounds on Algebraic Gossip},
      author={Bernhard Haeupler},
      journal={IEEE Communications Letter (CL)},
      year={2012},
      pages={1274--1276},
      doi={10.1109/LCOMM.2012.060112.120632}}
           

  • SplayNets: Towards Self-Adjusting Distributed Data Structures
    with Chen Avin, Michael Borokhovich, Zvi Loetker, Christian Scheideler, Stefan Schmid
    DISC Brief Announcement: International Symposium on Distributed Computing, 2012
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerDISC Brief Announcement12p440 ,
      title={SplayNets: Towards Self-Adjusting Distributed Data Structures},
      author={Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Loetker, Christian Scheideler, Stefan Schmid},
      journal={International Symposium on Distributed Computing (DISC Brief Announcement)},
      year={2012},
      pages={439--440 },
      doi={10.1007/978-3-642-33651-5_47}}
           

  • Finding a Feasible Flow in a Strongly Connected Network
    with Robert Tarjan
    ORL: Operations Research Letters, 2008
    (ArXiv)        (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerORL08p398,
      title={Finding a Feasible Flow in a Strongly Connected Network},
      author={Bernhard Haeupler, Robert Tarjan},
      journal={Operations Research Letters (ORL)},
      year={2008},
      pages={397--398},
      doi={10.1016/j.orl.2008.02.003}}
           

Patent Applications

  • Method and Apparatus for Performing Finite Memory Network Coding in an Arbitrary Network
    with Muriel Medard
    P: US Utility Patent, 2018
    Patent #US9998406
    (Download)        

  • Generating unweighted samples from weighted samples
    with Mark Manasse, Kunal Talwar
    P: US Utility Patent, 2018
    Patent #US9934311B2
    (Download)        

  • Error Correction for Interactive Message Exchanges Using Summaries
    Bernhard Haeupler
    P: US Utility Patent, 2017
    Patent #US9686221B2
    (Download)        

  • Method and Apparatus for Performing Finite Memory Network Coding in an Arbitrary Network
    with Muriel Medard
    P: US Utility Patent, 2015
    Patent #US9160687B2
    (Download)        

  • Node Identification using Clusters
    with Dahlia Malkhi
    PA: US Utility Patent Application, 2014
    patent pending (Application #US20160105323)
    (Download)        

  • Method for optimal and rateless error correction in interactive communications
    with Ameya Velingker
    PP: Provisional US Utility Patent, 2016


Other Manuscripts

  • Fast Algorithms for Hop-Constrained Flows and Moving Cuts
    with D Ellis Hershkowitz, Thatchaphol Saranurak
    ArXiv: ArXiv.org e-Print, 2021
    (ArXiv)        

  • Rate-Distance Tradeoffs for List-Decodable Insertion-Deletion Codes
    with Amirbehshad Shahrasbi
    ArXiv: ArXiv.org e-Print, 2020
    (ArXiv)        

  • Near-Optimal Schedules for Simultaneous Multicasts
    with David Ellis Hershkowitz, David Wajc
    ArXiv: ArXiv.org e-Print, 2020
    (ArXiv)        

  • Consistent Weighted Sampling Made Fast, Small, and Easy
    with Kunal Talwar, Mark Manasse
    ArXiv: ArXiv.org e-Print, 2014
    (ArXiv)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerArXiv14p18,
      title={Consistent Weighted Sampling Made Fast, Small, and Easy},
      author={Bernhard Haeupler, Kunal Talwar, Mark Manasse},
      journal={ArXiv.org e-Print (ArXiv)},
      year={2014},
      pages={1--18},
      doi={}}
           

  • Probabilistic Methods for Distributed Information Dissemination
    Bernhard Haeupler
    PhD Thesis: MIT, 2013
    Winner of the ACM-EATCS Doctoral Dissertation Award in Distributed Computing 2014
    Awarded with a George M. Sprowls Award for Outstanding Theses in Computer Science

    (BibTex)(Hide BibTex)
    • @article{HaeuplerPhD Thesis13p484,
      title={Probabilistic Methods for Distributed Information Dissemination},
      author={Bernhard Haeupler},
      journal={MIT (PhD Thesis)},
      year={2013},
      pages={1--484},
      doi={}}
           

  • A Bound on the Throughput of Radio Networks
    with Mohsen Ghaffari, Majid Khabbazian
    ArXiv: ArXiv.org e-Print, 2013
    (ArXiv)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerArXiv13p3,
      title={A Bound on the Throughput of Radio Networks},
      author={Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian},
      journal={ArXiv.org e-Print (ArXiv)},
      year={2013},
      pages={1--3},
      doi={}}
           

  • SplayNets: Towards Self-Adjusting Distributed Data Structures
    with Chen Avin, Michael Borokhovich, Zvi Loetker, Christian Scheideler, Stefan Schmid
    DISC Brief Announcement: International Symposium on Distributed Computing, 2012
    (Download)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerDISC Brief Announcement12p440 ,
      title={SplayNets: Towards Self-Adjusting Distributed Data Structures},
      author={Chen Avin, Michael Borokhovich, Bernhard Haeupler, Zvi Loetker, Christian Scheideler, Stefan Schmid},
      journal={International Symposium on Distributed Computing (DISC Brief Announcement)},
      year={2012},
      pages={439--440 },
      doi={10.1007/978-3-642-33651-5_47}}
           

  • Robust Regulatory Networks
    with Arnab Bhattacharyya
    ArXiv: ArXiv.org e-Print, 2009
    (ArXiv)        
    (BibTex)(Hide BibTex)
    • @article{HaeuplerArXiv09p23,
      title={Robust Regulatory Networks},
      author={Arnab Bhattacharyya, Bernhard Haeupler},
      journal={ArXiv.org e-Print (ArXiv)},
      year={2009},
      pages={1--23},
      doi={}}
           

  • Funding Agencies I reviewed for:
    National Science Foundation (NSF)
    (Grant Review Panelist for CCF Core Programs and AitF Algorithms in the Field),
    European Research Council (ERC Starting and Consolidator grants),
    German Research Foundation (DFG),
    Israeli Science Foundation (ISF),
    Chilean National Commission for Scientic and Technological Research (CONICYT/FONDECYT),
    National Science Center, Poland (NCN),
    US-Israeli Binational Science Foundation (BSF)

  • Journals I reviewed for:
    Journal of the ACM (JACM),
    SIAM Journal on Computing (SICOMP),
    Transactions of Information Theory (TransInf),
    Transactions on Algorithms (TransAlg),
    Distributed Computing (DIST),
    Random Structures & Algorithms (RSA),
    Transactions on Communications (TCOM),
    Transactions on Computers (TC),
    Transactions on Networking (TON),
    Discrete Math and Theoretical Computer Science (DMTCS),
    Information Processing Letters (IPL),
    Communications Letters (CL),
    Software, Practice and Experience (SPE)

  • Conferences I reviewed for:
    Symposium on Theory of Computation (STOC),
    Foundations of Computer Science (FOCS),
    Symposium on Discrete Algorithms (SODA),
    Principles of Distributed Computing (PODC),
    Distributed Computing (DISC),
    International Symposium on Information Theory (ISIT),
    International Colloquium on Automata, Languages and Programming (ICALP),
    Symposium on Parallelism in Algorithms and Architectures (SPAA),
    Information Theory Workshop (ITW),
    Allerton Conference on Communication Control and Computing (Allerton),
    European Symposium on Algorithms (ESA),
    Innovations in Computer Science (I(T)CS),
    Mathematical Foundations of Computer Science (MFCS),
    Algorithms Engineering and Experiments (ALENEX),
    Theory and Practice of Algorithms in (Computer) Systems (TAPAS),
    Fun with Algorithms (FUN)