Daniel Berend

View Scopus Profile

Daniel Berend

 https://orcid.org/0000-0002-5756-5921
1983 …2024

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2022

    Randomness for Randomness Testing

    Berend, D., Dolev, S. & Kumar, M., 23 Jun 2022, Cyber Security, Cryptology, and Machine Learning - 6th International Symposium, CSCML 2022, Proceedings. Dolev, S., Meisels, A. & Katz, J. (eds.). Springer Cham, p. 153-161 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13301 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Simulating a Coupon Collector

    Barak-Pelleg, D. & Berend, D., 1 Jan 2022, Cyber Security, Cryptology, and Machine Learning - 6th International Symposium, CSCML 2022, Proceedings. Dolev, S., Meisels, A. & Katz, J. (eds.). Springer Science and Business Media Deutschland GmbH, p. 66-77 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13301 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2021

    A Novel Algorithm for Max Sat Calling MOCE to Order

    Berend, D., Golan, S. & Twitto, Y., 1 Jan 2021, Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Proceedings. Du, D-Z., Du, D., Wu, C. & Xu, D. (eds.). Springer Science and Business Media Deutschland GmbH, p. 302-317 16 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13135 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2020

    Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache

    Berend, D., Dolev, S., Hassidim, A. & Kogan-Sadetsky, M., 1 Jan 2020, Cyber Security Cryptography and Machine Learning - 4th International Symposium, CSCML 2020, Proceedings. Dolev, S., Weiss, G., Kolesnikov, V. & Lodha, S. (eds.). Springer, p. 237-244 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12161 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Effect of Initial Assignment on Local Search Performance for Max Sat

    Berend, D. & Twitto, Y., 1 Jun 2020, 18th International Symposium on Experimental Algorithms, SEA 2020. Faro, S. & Cantone, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 8. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 160).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    2 Scopus citations
  • 2019

    AdaptiveClimb: Adaptive Policy for Cache Replacement

    Berend, D., Dolev, S. & Kogan-Sadetsky, M., 2019, Proceedings of the 12th ACM International Conference on Systems and Storage. New York, NY, USA: Association for Computing Machinery, p. 187 1 p. (SYSTOR '19).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    1 Scopus citations
  • 2018

    On the satisfiability threshold of random community-structured SAT

    Barak-Pelleg, D. & Berend, D., 1 Jan 2018, Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018. Lang, J. (ed.). International Joint Conferences on Artificial Intelligence, p. 1249-1255 7 p. (IJCAI International Joint Conference on Artificial Intelligence; vol. 2018-July).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    Open Access
  • 2017

    Average-case competitive ratio for evaluating scheduling algorithms of multi-user cache

    Dolev, S., Berend, D., Hassidim, A. & Kogan-Sadetsky, M., 29 Jun 2017, 2017 International Symposium on Cyber Security Cryptography and Machine Learning (CSCML 2017).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • 2016

    The normalized autocorrelation length of random max r-Sat converges in probability to (1 − 1/2r)/r

    Berend, D. & Twitto, Y., 1 Jan 2016, Theory and Applications of Satisfiability Testing – SAT 2016 - 19th International Conference, Proceedings. Le Berre, D. & Creignou, N. (eds.). Springer Verlag, p. 60-76 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9710).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    3 Scopus citations
  • 2015

    Optimal ordering of tests with extreme dependencies

    Berend, D., Cohen, S., Shimony, S. E. & Zucker, S., 1 Jan 2015, Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, MCO 2015. Nguyen, N. T., Le Thi, H. A. & Dinh, T. P. (eds.). Springer Verlag, p. 81-92 12 p. (Advances in Intelligent Systems and Computing; vol. 359).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 2012

    Which multi-peg tower of Hanoi problems are exponential?

    Berend, D. & Sapir, A., 2 Nov 2012, Graph-Theoretic Concepts in Computer Science - 38th International Workshop, WG 2012, Revised Selcted Papers. p. 81-90 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7551 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    1 Scopus citations
  • 2008

    An improved Algorithm for the Black-and-White Coloring Problem on Trees.

    Berend, D. & Zucker, S., 2008, Proceedings of the 19th International Workshop on Combinatorial Algorithms, IWOCA: September 13-15, 2008, Nagoya, Japan. Miller, M. & Wada, K. (eds.). College Publications, p. 173-181

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Power efficient resilience and lifetime in wireless ad-hoc networks

    Berend, D., Segal, M. & Shpungin, H., 15 Dec 2008, 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Proceeding of the 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing 2008. p. 17-24 8 p. (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    4 Scopus citations
  • 2005

    Complexity of the path multi-peg Tower of Hanoi

    Berend, D. & Sapir, A., 1 Dec 2005, Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics. Demetrescu, C., Sedgewick, R. & Tamassia, R. (eds.). p. 212-215 4 p. (Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  • Two-anticoloring of planar and related graphs

    Berend, D., Korach, E. & Zucker, S., 2005, 2005 In-ternational Conference on Analysis of Algorithms, . Martínez, C. (ed.). Barcelona: DMTCS, p. 335-342

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review