Daniel Berend

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