Daniel Berend

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 32

Top Topics

Davis Putnam Logemann Loveland

Precedence Constraints

Top Venues

Discret. Appl. Math.

Theor. Comput. Sci.

Discret. Optim.

Publications

Daniel Berend, Liat Cohen, Omrit Filtser
A tour of general Hanoi graphs. Theor. Comput. Sci. 983 (2024)
Daniel Berend, S. Mamana
A probabilistic algorithm for vertex cover. Theor. Comput. Sci. 983 (2024)
Daniel Berend, Shahar Golan, Yochai Twitto
CHAMP: A multipass algorithm for Max Sat based on saver variables. Discret. Optim. 47 (2023)
Dina Barak-Pelleg, Daniel Berend, Thomas J. Robinson, Itamar Zimmerman
Algorithms for Reconstructing DDoS Attack Graphs using Probabilistic Packet Marking. CoRR (2023)
Dina Barak-Pelleg, Daniel Berend
The Time for Reconstructing the Attack Graph in DDoS Attacks. CoRR (2023)
Daniel Berend, Dor Bitan, Shlomi Dolev
Communicationless Evaluation of Quadratic Functions over Secret Shared Dynamic Database. SN Comput. Sci. 3 (2) (2022)
Daniel Berend, Shahar Golan, Yochai Twitto
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat. Discret. Optim. 43 (2022)
Daniel Berend, Shlomi Dolev, Manish Kumar
Randomness for Randomness Testing. CSCML (2022)
Dina Barak-Pelleg, Daniel Berend, J. C. Saunders
A model of random industrial SAT. Theor. Comput. Sci. 910 (2022)
Dina Barak-Pelleg, Daniel Berend
Simulating a Coupon Collector. CSCML (2022)
Daniel Berend, Shahar Golan, Yochai Twitto
Using the method of conditional expectations to supply an improved starting point for CCLS. J. Comb. Optim. 44 (5) (2022)
Daniel Berend, Shahar Golan, Yochai Twitto
A Novel Algorithm for Max Sat Calling MOCE to Order. COCOA (2021)
Daniel Berend, Yochai Twitto
Probabilistic characterization of random Max r-Sat. Discret. Optim. 40 (2021)
Daniel Berend, Shlomi Dolev, Avinatan Hassidim, Marina Kogan-Sadetsky
Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache. CSCML (2020)
Daniel Berend, Aryeh Kontorovich, Lev Reyzin, Thomas Robinson
On Biased Random Walks, Corrupted Intervals, and Learning Under Adversarial Design. CoRR (2020)
Daniel Berend, Aryeh Kontorovich, Lev Reyzin, Thomas Robinson
On biased random walks, corrupted intervals, and learning under adversarial design. Ann. Math. Artif. Intell. 88 (8) (2020)
Daniel Berend, Yochai Twitto
Effect of Initial Assignment on Local Search Performance for Max Sat. SEA (2020)
Daniel Berend, Dor Bitan, Shlomi Dolev
Polynomials Whose Secret Shares Multiplication Preserves Degree for 2-CNF Circuits Over a Dynamic Set of Secrets. IACR Cryptol. ePrint Arch. 2019 (2019)
Dina Barak-Pelleg, Daniel Berend, J. C. Saunders
A Model of Random Industrial SAT. CoRR (2019)
Daniel Berend, Shlomi Dolev, Marina Kogan-Sadetsky
AdaptiveClimb: adaptive policy for cache replacement. SYSTOR (2019)
Daniel Berend, Amnon Meisels, Or Peri
Probabilistic optimal solution assessment for DCOPs. Ann. Math. Artif. Intell. 83 (1) (2018)
Daniel Berend, Shira Zucker
The Asymptotics of Useless Hint Sequences in Nonograms. J. Integer Seq. 21 (4) (2018)
Daniel Berend
On the number of Sudoku squares. Discret. Math. 341 (11) (2018)
Dina Barak-Pelleg, Daniel Berend
On the Satisfiability Threshold of Random Community-Structured SAT. IJCAI (2018)
Daniel Berend, Ronen I. Brafman, Solomon Eyal Shimony, Shira Zucker, Shimon Cohen
Optimal ordering of statistically dependent tests. Discret. Appl. Math. 226 (2017)
Daniel Berend, Aryeh Kontorovich, Gil Zagdanski
The Expected Missing Mass under an Entropy Constraint. Entropy 19 (7) (2017)
Daniel Berend, Shlomi Dolev, Sergey Frenkel, Ariel Hanemann
Towards holographic "brain" memory based on randomization and Walsh-Hadamard transformation. Neural Networks 77 (2016)
Daniel Berend, Yochai Twitto
The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r. SAT (2016)
Daniel Berend, Aryeh Kontorovich
The state complexity of random DFAs. Theor. Comput. Sci. 652 (2016)
Daniel Berend, Shira Zucker
On the Number of Forceless Hint Sequences in Paint-by-Numbers Puzzles. CCCG (2016)
Daniel Berend, Amir Sapir
Exponential vs. Subexponential Tower of Hanoi Variants. J. Graph Algorithms Appl. 20 (2) (2016)
Yoav Bar-Sinai, Daniel Berend
Reconstruction of domino tilings - Combinatorial and probabilistic questions. Discret. Appl. Math. 198 (2016)
Daniel Berend, Aryeh Kontorovich
A finite sample analysis of the Naive Bayes classifier. J. Mach. Learn. Res. 16 (2015)
Daniel Berend, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker
Optimal Ordering of Tests with Extreme Dependencies. MCO (1) (2015)
Daniel Berend, Shlomi Dolev, Ariel Hanemann
Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability. Neural Comput. 27 (1) (2015)
Daniel Berend, Ephraim Korach, Orly Yahalom
Anticoloring of the rook's graph. Discret. Appl. Math. 188 (2015)
Daniel Berend, Peter Harremoës, Aryeh Kontorovich
Minimum KL-Divergence on Complements of $L_{1}$ Balls. IEEE Trans. Inf. Theory 60 (6) (2014)
Daniel Berend, Ronen I. Brafman, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker
Optimal ordering of independent tests with precedence constraints. Discret. Appl. Math. 162 (2014)
Daniel Berend, Aryeh Kontorovich
Consistency of weighted majority votes. NIPS (2014)
Daniel Berend, Shahar Golan
Counting solutions to CSP using generating polynomials. J. Discrete Algorithms 26 (2014)
Daniel Berend, Dolev Pomeranz, Ronen Rabani, Ben Raziel
Nonograms: Combinatorial questions and algorithms. Discret. Appl. Math. 169 (2014)
Daniel Berend, Aryeh Kontorovich
Consistency of weighted majority votes. CoRR (2013)
Daniel Berend, Aryeh Kontorovich
The state complexity of random DFAs. CoRR (2013)
Josué-Antonio Nescolarde-Selva, Francisco Vives-Macià, Josep Lluis Usó-Domènech, Daniel Berend
An introduction to alysidal algebra (I). Kybernetes 41 (1) (2012)
Daniel Berend, Ephraim Korach, Shira Zucker
Tabu search for the BWC problem. J. Glob. Optim. 54 (4) (2012)
Daniel Berend, Aryeh Kontorovich
A Reverse Pinsker Inequality CoRR (2012)
Daniel Berend, Amir Sapir, Shay Solomon
graphs. Discret. Appl. Math. 160 (10-11) (2012)
Josué-Antonio Nescolarde-Selva, Francisco Vives-Macià, Josep Lluis Usó-Domènech, Daniel Berend
An introduction to alysidal algebra (II). Kybernetes 41 (5/6) (2012)
Daniel Berend, Amir Sapir
Which Multi-peg Tower of Hanoi Problems Are Exponential? WG (2012)
Daniel Berend, Amir Sapir, Shay Solomon
graphs CoRR (2011)
Daniel Berend, Amir Sapir, Luba Sapir
A Decision-Making Approach to the Spam Problem. INFOR Inf. Syst. Oper. Res. 49 (1) (2011)
Daniel Berend, Michael Segal, Hanan Shpungin
Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks. Ad Hoc Sens. Wirel. Networks 10 (1) (2010)
Daniel Berend, Ephraim Korach, Shira Zucker
Anticoloring and separation of graphs. Discret. Math. 310 (3) (2010)
Shimon Abravaya, Daniel Berend
Multi-dimensional dynamic facility location and fast computation at query points. Inf. Process. Lett. 109 (8) (2009)
Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena, Natan Stolyarov
Analysis of Airplane Boarding Times. Oper. Res. 57 (2) (2009)
Daniel Berend, Shira Zucker
The Black-and-White Coloring Problem on Trees. J. Graph Algorithms Appl. 13 (2) (2009)
Daniel Berend, Vladimir Braverman
A linear algorithm for computing convex hulls for random lines. ACM Trans. Algorithms 5 (4) (2009)
Daniel Berend, Steven Skiena, Yochai Twitto
Combinatorial dominance guarantees for problems with infeasible solutions. ACM Trans. Algorithms 5 (1) (2008)
Daniel Berend, Ephraim Korach, Shira Zucker
Anticoloring of a family of grid graphs. Discret. Optim. 5 (3) (2008)
Daniel Berend, Shira Zucker
An improved Algorithm for the Black-and-White Coloring Problem on Trees. IWOCA (2008)
Daniel Berend, Ephraim Korach, Vladimir Lipets
Minimal cutwidth linear arrangements of abelian Cayley graphs. Discret. Math. 308 (20) (2008)
Daniel Berend, Yuri Chernyavsky
Ranking of decision rules with random power distribution. Math. Comput. Model. 48 (9-10) (2008)
Daniel Berend, Ephraim Korach, Shira Zucker
Tabu search for the BWC problem. SOFSEM (2) (2008)
Daniel Berend, Michael Segal, Hanan Shpungin
Power efficient resilience and lifetime in wireless ad-hoc networks. FOWANC (2008)
Daniel Berend, Luba Sapir
Monotonicity in Condorcet's Jury Theorem with dependent voters. Soc. Choice Welf. 28 (3) (2007)
Daniel Berend, Ephraim Korach, Shira Zucker
A Reduction of the Anticoloring Problem to Connected Graphs. Electron. Notes Discret. Math. 28 (2007)
Dany Azriel, Daniel Berend
On a question of Leiss regarding the Hanoi Tower problem. Theor. Comput. Sci. 369 (1-3) (2006)
Daniel Berend, Amir Sapir
The diameter of Hanoi graphs. Inf. Process. Lett. 98 (2) (2006)
Daniel Berend, Amir Sapir
The cyclic multi-peg Tower of Hanoi. ACM Trans. Algorithms 2 (3) (2006)
Daniel Berend, Shahar Golan
Littlewood polynomials with high order zeros. Math. Comput. 75 (255) (2006)
Daniel Berend, Luba Sapir
Monotonicity in Condorcet Jury Theorem. Soc. Choice Welf. 24 (1) (2005)
Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena
Airplane Boarding, Disk Scheduling and Space-Time Geometry. AAIM (2005)
Daniel Berend, Amir Sapir
Complexity of the Path Multi-Peg Tower of Hanoi. ALENEX/ANALCO (2005)
Daniel Berend, Nimrod Kriger
On some questions of Razpet regarding binomial coefficients. Discret. Math. 260 (1-3) (2003)
Daniel Berend, Luba Sapir
Expert rule versus majority rule under partial information, II. Adv. Decis. Sci. 6 (2) (2002)
Daniel Berend, Christiane Frougny
Computability by Finite Automata and Pisot Bases. Math. Syst. Theory 27 (3) (1994)
Daniel Berend
Parallelepipeds in sets of integers. J. Comb. Theory, Ser. A 45 (2) (1987)