Daniel Berend

According to our database, Daniel Berend authored at least 71 papers between 1987 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A probabilistic algorithm for vertex cover.

Daniel Berend, S. Mamana

Theor. Comput. Sci., February, 2024

A tour of general Hanoi graphs.

Daniel Berend, Liat Cohen, Omrit Filtser

Theor. Comput. Sci., February, 2024

2023

CHAMP: A multipass algorithm for Max Sat based on saver variables.

Daniel Berend, Shahar Golan, Yochai Twitto

Discret. Optim., February, 2023

The Time for Reconstructing the Attack Graph in DDoS Attacks.

Dina Barak-Pelleg, Daniel Berend

CoRR, 2023

Algorithms for Reconstructing DDoS Attack Graphs using Probabilistic Packet Marking.

Dina Barak-Pelleg, Daniel Berend, Thomas J. Robinson, Itamar Zimmerman

CoRR, 2023

2022

A model of random industrial SAT.

Dina Barak-Pelleg, Daniel Berend, John C. Saunders

Theor. Comput. Sci., 2022

Communicationless Evaluation of Quadratic Functions over Secret Shared Dynamic Database.

Daniel Berend, Dor Bitan, Shlomi Dolev

SN Comput. Sci., 2022

Using the method of conditional expectations to supply an improved starting point for CCLS.

Daniel Berend, Shahar Golan, Yochai Twitto

J. Comb. Optim., 2022

GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat.

Daniel Berend, Shahar Golan, Yochai Twitto

Discret. Optim., 2022

Randomness for Randomness Testing.

Daniel Berend, Shlomi Dolev, Manish Kumar

Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

Simulating a Coupon Collector.

Dina Barak-Pelleg, Daniel Berend

Proceedings of the Cyber Security, Cryptology, and Machine Learning, 2022

2021

Probabilistic characterization of random Max r-Sat.

Daniel Berend, Yochai Twitto

Discret. Optim., 2021

A Novel Algorithm for Max Sat Calling MOCE to Order.

Daniel Berend, Shahar Golan, Yochai Twitto

Proceedings of the Combinatorial Optimization and Applications, 2021

2020

On biased random walks, corrupted intervals, and learning under adversarial design.

Daniel Berend, Aryeh Kontorovich, Lev Reyzin, Thomas J. Robinson

Ann. Math. Artif. Intell., 2020

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

Daniel Berend, Yochai Twitto

Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

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

Daniel Berend, Shlomi Dolev, Avinatan Hassidim, Marina Kogan-Sadetsky

Proceedings of the Cyber Security Cryptography and Machine Learning, 2020

2019

Polynomials Whose Secret Shares Multiplication Preserves Degree for 2-CNF Circuits Over a Dynamic Set of Secrets.

Daniel Berend, Dor Bitan, Shlomi Dolev

IACR Cryptol. ePrint Arch., 2019

AdaptiveClimb: adaptive policy for cache replacement.

Daniel Berend, Shlomi Dolev, Marina Kogan-Sadetsky

Proceedings of the 12th ACM International Conference on Systems and Storage, 2019

2018

The Asymptotics of Useless Hint Sequences in Nonograms.

Daniel Berend, Shira Zucker

J. Integer Seq., 2018

On the number of Sudoku squares.

Daniel Berend

Discret. Math., 2018

Probabilistic optimal solution assessment for DCOPs.

Daniel Berend, Amnon Meisels, Or Peri

Ann. Math. Artif. Intell., 2018

On the Satisfiability Threshold of Random Community-Structured SAT.

Dina Barak-Pelleg, Daniel Berend

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

The Expected Missing Mass under an Entropy Constraint.

Daniel Berend, Aryeh Kontorovich, Gil Zagdanski

Entropy, 2017

Optimal ordering of statistically dependent tests.

Daniel Berend, Ronen I. Brafman, Solomon Eyal Shimony, Shira Zucker, Shimon Cohen

Discret. Appl. Math., 2017

2016

The state complexity of random DFAs.

Daniel Berend, Aryeh Kontorovich

Theor. Comput. Sci., 2016

Towards holographic "brain" memory based on randomization and Walsh-Hadamard transformation.

Daniel Berend, Shlomi Dolev, Sergey Frenkel, Ariel Hanemann

Neural Networks, 2016

Exponential vs. Subexponential Tower of Hanoi Variants.

Daniel Berend, Amir Sapir

J. Graph Algorithms Appl., 2016

Reconstruction of domino tilings - Combinatorial and probabilistic questions.

Yoav Bar-Sinai, Daniel Berend

Discret. Appl. Math., 2016

The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r.

Daniel Berend, Yochai Twitto

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

On the Number of Forceless Hint Sequences in Paint-by-Numbers Puzzles.

Daniel Berend, Shira Zucker

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability.

Daniel Berend, Shlomi Dolev, Ariel Hanemann

Neural Comput., 2015

A finite sample analysis of the Naive Bayes classifier.

Daniel Berend, Aryeh Kontorovich

J. Mach. Learn. Res., 2015

Anticoloring of the rook's graph.

Daniel Berend, Ephraim Korach, Orly Yahalom

Discret. Appl. Math., 2015

Optimal Ordering of Tests with Extreme Dependencies.

Daniel Berend, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker

Proceedings of the 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, 2015

2014

Minimum KL-Divergence on Complements of $L_{1}$ Balls.

Daniel Berend, Peter Harremoës, Aryeh Kontorovich

IEEE Trans. Inf. Theory, 2014

Counting solutions to CSP using generating polynomials.

Daniel Berend, Shahar Golan

J. Discrete Algorithms, 2014

Nonograms: Combinatorial questions and algorithms.

Daniel Berend, Dolev Pomeranz, Ronen Rabani, Ben Raziel

Discret. Appl. Math., 2014

Optimal ordering of independent tests with precedence constraints.

Daniel Berend, Ronen I. Brafman, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker

Discret. Appl. Math., 2014

Consistency of weighted majority votes.

Daniel Berend, Aryeh Kontorovich

Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2012

An introduction to alysidal algebra (II).

Josué-Antonio Nescolarde-Selva, Francisco Vives-Macià, Josep Lluis Usó-Domènech, Daniel Berend

Kybernetes, 2012

An introduction to alysidal algebra (I).

Josué-Antonio Nescolarde-Selva, Francisco Vives-Macià, Josep Lluis Usó-Domènech, Daniel Berend

Kybernetes, 2012

Tabu search for the BWC problem.

Daniel Berend, Ephraim Korach, Shira Zucker

J. Glob. Optim., 2012

The Tower of Hanoi problem on Path_h graphs.

Daniel Berend, Amir Sapir, Shay Solomon

Discret. Appl. Math., 2012

A Reverse Pinsker Inequality

Daniel Berend, Aryeh Kontorovich

CoRR, 2012

Which Multi-peg Tower of Hanoi Problems Are Exponential?

Daniel Berend, Amir Sapir

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

A Decision-Making Approach to the Spam Problem.

Daniel Berend, Amir Sapir, Luba Sapir

INFOR Inf. Syst. Oper. Res., 2011

2010

Anticoloring and separation of graphs.

Daniel Berend, Ephraim Korach, Shira Zucker

Discret. Math., 2010

Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks.

Daniel Berend, Michael Segal, Hanan Shpungin

Ad Hoc Sens. Wirel. Networks, 2010

2009

A linear algorithm for computing convex hulls for random lines.

Daniel Berend, Vladimir Braverman

ACM Trans. Algorithms, 2009

The Black-and-White Coloring Problem on Trees.

Daniel Berend, Shira Zucker

J. Graph Algorithms Appl., 2009

Multi-dimensional dynamic facility location and fast computation at query points.

Shimon Abravaya, Daniel Berend

Inf. Process. Lett., 2009

Analysis of Airplane Boarding Times.

Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena, Natan Stolyarov

Oper. Res., 2009

2008

Combinatorial dominance guarantees for problems with infeasible solutions.

Daniel Berend, Steven Skiena, Yochai Twitto

ACM Trans. Algorithms, 2008

Ranking of decision rules with random power distribution.

Daniel Berend, Yuri Chernyavsky

Math. Comput. Model., 2008

Minimal cutwidth linear arrangements of abelian Cayley graphs.

Daniel Berend, Ephraim Korach, Vladimir Lipets

Discret. Math., 2008

Anticoloring of a family of grid graphs.

Daniel Berend, Ephraim Korach, Shira Zucker

Discret. Optim., 2008

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

Daniel Berend, Michael Segal, Hanan Shpungin

Proceedings of the 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, 2008

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

Daniel Berend, Shira Zucker

Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007

Monotonicity in Condorcet's Jury Theorem with dependent voters.

Daniel Berend, Luba Sapir

Soc. Choice Welf., 2007

A Reduction of the Anticoloring Problem to Connected Graphs.

Daniel Berend, Ephraim Korach, Shira Zucker

Electron. Notes Discret. Math., 2007

2006

On a question of Leiss regarding the Hanoi Tower problem.

Dany Azriel, Daniel Berend

Theor. Comput. Sci., 2006

The cyclic multi-peg Tower of Hanoi.

Daniel Berend, Amir Sapir

ACM Trans. Algorithms, 2006

Littlewood polynomials with high order zeros.

Daniel Berend, Shahar Golan

Math. Comput., 2006

The diameter of Hanoi graphs.

Daniel Berend, Amir Sapir

Inf. Process. Lett., 2006

2005

Monotonicity in Condorcet Jury Theorem.

Daniel Berend, Luba Sapir

Soc. Choice Welf., 2005

Complexity of the Path Multi-Peg Tower of Hanoi.

Daniel Berend, Amir Sapir

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

Airplane Boarding, Disk Scheduling and Space-Time Geometry.

Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena

Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2003

On some questions of Razpet regarding binomial coefficients.

Daniel Berend, Nimrod Kriger

Discret. Math., 2003

2002

Expert rule versus majority rule under partial information, II.

Daniel Berend, Luba Sapir

Adv. Decis. Sci., 2002

1994

Computability by Finite Automata and Pisot Bases.

Daniel Berend, Christiane Frougny

Math. Syst. Theory, 1994

1987

Parallelepipeds in sets of integers.

Daniel Berend

J. Comb. Theory, Ser. A, 1987