On the Satisfiability Threshold of Random Community-Structured SAT. - Dina Barak-Pelleg; Daniel Berend (IJCAI, 2018)

Simulating a Coupon Collector. - Dina Barak-Pelleg; Daniel Berend (CSCML, 2022)

A model of random industrial SAT. - Dina Barak-Pelleg; Daniel Berend; John C. Saunders (Theor. Comput. Sci., 2022)

Algorithms for Reconstructing DDoS Attack Graphs using Probabilistic Packet Marking. - Dina Barak-Pelleg; Daniel Berend; Thomas J. Robinson 001; Itamar Zimmerman (CoRR, 2023)

The Time for Reconstructing the Attack Graph in DDoS Attacks. - Dina Barak-Pelleg; Daniel Berend (CoRR, 2023)

Super-Teaching in Machine Learning. - Dina Barak-Pelleg; Daniel Berend; Aryeh Kontorovich (CSCML, 2024)

Fast simulations of the multi-album collector. - Dina Barak-Pelleg; Daniel Berend (Theor. Comput. Sci., 2025)