| 2025 | CANS | Enhancing Cold Boot Attacks with Probabilistic-Guided SAT-Solvers. | Daniel Berend, Amit Cohen, Shahar Golan, Boris Tsirkin, Yochai Twitto, Itamar Zimerman |
| 2021 | COCOA | A Novel Algorithm for Max Sat Calling MOCE to Order. | Daniel Berend, Shahar Golan, Yochai Twitto |
| 2019 | SYSTOR | AdaptiveClimb: adaptive policy for cache replacement. | Daniel Berend, Shlomi Dolev, Marina Kogan-Sadetsky |
| 2018 | IJCAI | On the Satisfiability Threshold of Random Community-Structured SAT. | Dina Barak-Pelleg, Daniel Berend |
| 2016 | SAT | The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r. | Daniel Berend, Yochai Twitto |
| 2012 | WG | Which Multi-peg Tower of Hanoi Problems Are Exponential? | Daniel Berend, Amir Sapir |
| 2008 | IWOCA | An improved Algorithm for the Black-and-White Coloring Problem on Trees. | Daniel Berend, Shira Zucker |
| 2008 | MOBIHOC | Power efficient resilience and lifetime in wireless ad-hoc networks. | Daniel Berend, Michael Segal, Hanan Shpungin |
| 2008 | SOFSEM | Tabu search for the BWC problem. | Daniel Berend, Ephraim Korach, Shira Zucker |
| 2005 | AAIM | Airplane Boarding, Disk Scheduling and Space-Time Geometry. | Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena |
| 2005 | ALENEX | Complexity of the Path Multi-Peg Tower of Hanoi. | Daniel Berend, Amir Sapir |