default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Berend
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j51]Daniel Berend, Liat Cohen, Omrit Filtser
:
A tour of general Hanoi graphs. Theor. Comput. Sci. 983: 114289 (2024)- [j50]Daniel Berend, S. Mamana:
A probabilistic algorithm for vertex cover. Theor. Comput. Sci. 983: 114306 (2024) - 2023
- [j49]Daniel Berend, Shahar Golan, Yochai Twitto:
CHAMP: A multipass algorithm for Max Sat based on saver variables. Discret. Optim. 47: 100760 (2023) - [i9]Dina Barak-Pelleg, Daniel Berend, Thomas J. Robinson, Itamar Zimmerman:
Algorithms for Reconstructing DDoS Attack Graphs using Probabilistic Packet Marking. CoRR abs/2304.05123 (2023) - [i8]Dina Barak-Pelleg, Daniel Berend:
The Time for Reconstructing the Attack Graph in DDoS Attacks. CoRR abs/2304.05204 (2023) - 2022
- [j48]Daniel Berend, Shahar Golan, Yochai Twitto:
GO-MOCE: Greedy Order Method of Conditional Expectations for Max Sat. Discret. Optim. 43: 100685 (2022) - [j47]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): 3711-3734 (2022) - [j46]Daniel Berend, Dor Bitan, Shlomi Dolev:
Communicationless Evaluation of Quadratic Functions over Secret Shared Dynamic Database. SN Comput. Sci. 3(2): 174 (2022) - [j45]Dina Barak-Pelleg, Daniel Berend, John C. Saunders:
A model of random industrial SAT. Theor. Comput. Sci. 910: 91-112 (2022) - [c17]Dina Barak-Pelleg, Daniel Berend:
Simulating a Coupon Collector. CSCML 2022: 66-77 - [c16]Daniel Berend, Shlomi Dolev, Manish Kumar:
Randomness for Randomness Testing. CSCML 2022: 153-161 - 2021
- [j44]Daniel Berend, Yochai Twitto:
Probabilistic characterization of random Max r-Sat. Discret. Optim. 40: 100630 (2021) - [c15]Daniel Berend, Shahar Golan, Yochai Twitto:
A Novel Algorithm for Max Sat Calling MOCE to Order. COCOA 2021: 302-317 - 2020
- [j43]Daniel Berend, Aryeh Kontorovich, Lev Reyzin, Thomas J. Robinson:
On biased random walks, corrupted intervals, and learning under adversarial design. Ann. Math. Artif. Intell. 88(8): 887-905 (2020) - [c14]Daniel Berend, Shlomi Dolev, Avinatan Hassidim, Marina Kogan-Sadetsky:
Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache. CSCML 2020: 237-244 - [c13]Daniel Berend, Yochai Twitto:
Effect of Initial Assignment on Local Search Performance for Max Sat. SEA 2020: 8:1-8:14 - [i7]Daniel Berend, Aryeh Kontorovich, Lev Reyzin, Thomas J. Robinson:
On Biased Random Walks, Corrupted Intervals, and Learning Under Adversarial Design. CoRR abs/2003.13561 (2020)
2010 – 2019
- 2019
- [c12]Daniel Berend, Shlomi Dolev, Marina Kogan-Sadetsky:
AdaptiveClimb: adaptive policy for cache replacement. SYSTOR 2019: 187 - [i6]Dina Barak-Pelleg, Daniel Berend, John C. Saunders:
A Model of Random Industrial SAT. CoRR abs/1908.00089 (2019) - [i5]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: 1192 (2019) - 2018
- [j42]Daniel Berend, Amnon Meisels, Or Peri:
Probabilistic optimal solution assessment for DCOPs. Ann. Math. Artif. Intell. 83(1): 99-119 (2018) - [j41]Daniel Berend:
On the number of Sudoku squares. Discret. Math. 341(11): 3241-3248 (2018) - [j40]Daniel Berend, Shira Zucker:
The Asymptotics of Useless Hint Sequences in Nonograms. J. Integer Seq. 21(4): 18.4.2 (2018) - [c11]Dina Barak-Pelleg, Daniel Berend:
On the Satisfiability Threshold of Random Community-Structured SAT. IJCAI 2018: 1249-1255 - 2017
- [j39]Daniel Berend, Ronen I. Brafman, Solomon Eyal Shimony, Shira Zucker, Shimon Cohen:
Optimal ordering of statistically dependent tests. Discret. Appl. Math. 226: 17-31 (2017) - [j38]Daniel Berend, Aryeh Kontorovich, Gil Zagdanski:
The Expected Missing Mass under an Entropy Constraint. Entropy 19(7): 315 (2017) - 2016
- [j37]Yoav Bar-Sinai, Daniel Berend:
Reconstruction of domino tilings - Combinatorial and probabilistic questions. Discret. Appl. Math. 198: 1-19 (2016) - [j36]Daniel Berend, Amir Sapir:
Exponential vs. Subexponential Tower of Hanoi Variants. J. Graph Algorithms Appl. 20(2): 461-479 (2016) - [j35]Daniel Berend, Shlomi Dolev, Sergey Frenkel, Ariel Hanemann:
Towards holographic "brain" memory based on randomization and Walsh-Hadamard transformation. Neural Networks 77: 87-94 (2016) - [j34]Daniel Berend, Aryeh Kontorovich:
The state complexity of random DFAs. Theor. Comput. Sci. 652: 102-108 (2016) - [c10]Daniel Berend, Shira Zucker:
On the Number of Forceless Hint Sequences in Paint-by-Numbers Puzzles. CCCG 2016: 266-269 - [c9]Daniel Berend, Yochai Twitto:
The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r. SAT 2016: 60-76 - 2015
- [j33]Daniel Berend, Ephraim Korach, Orly Yahalom:
Anticoloring of the rook's graph. Discret. Appl. Math. 188: 1-15 (2015) - [j32]Daniel Berend, Aryeh Kontorovich:
A finite sample analysis of the Naive Bayes classifier. J. Mach. Learn. Res. 16: 1519-1545 (2015) - [j31]Daniel Berend, Shlomi Dolev, Ariel Hanemann:
Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability. Neural Comput. 27(1): 202-210 (2015) - [c8]Daniel Berend, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker:
Optimal Ordering of Tests with Extreme Dependencies. MCO (1) 2015: 81-92 - 2014
- [j30]Daniel Berend, Ronen I. Brafman, Shimon Cohen, Solomon Eyal Shimony, Shira Zucker:
Optimal ordering of independent tests with precedence constraints. Discret. Appl. Math. 162: 115-127 (2014) - [j29]Daniel Berend, Dolev Pomeranz, Ronen Rabani, Ben Raziel:
Nonograms: Combinatorial questions and algorithms. Discret. Appl. Math. 169: 30-42 (2014) - [j28]Daniel Berend, Shahar Golan:
Counting solutions to CSP using generating polynomials. J. Discrete Algorithms 26: 89-97 (2014) - [j27]Daniel Berend, Peter Harremoës, Aryeh Kontorovich:
Minimum KL-Divergence on Complements of $L_{1}$ Balls. IEEE Trans. Inf. Theory 60(6): 3172-3177 (2014) - [c7]Daniel Berend, Aryeh Kontorovich:
Consistency of weighted majority votes. NIPS 2014: 3446-3454 - 2013
- [i4]Daniel Berend, Aryeh Kontorovich:
The state complexity of random DFAs. CoRR abs/1307.0720 (2013) - [i3]Daniel Berend, Aryeh Kontorovich:
Consistency of weighted majority votes. CoRR abs/1312.0451 (2013) - 2012
- [j26]Daniel Berend, Amir Sapir, Shay Solomon:
The Tower of Hanoi problem on Pathh graphs. Discret. Appl. Math. 160(10-11): 1465-1483 (2012) - [j25]Daniel Berend, Ephraim Korach, Shira Zucker:
Tabu search for the BWC problem. J. Glob. Optim. 54(4): 649-667 (2012) - [j24]Josué-Antonio Nescolarde-Selva, Francisco Vives-Macià, Josep Lluis Usó-Domènech, Daniel Berend:
An introduction to alysidal algebra (I). Kybernetes 41(1): 21-34 (2012) - [j23]Josué-Antonio Nescolarde-Selva, Francisco Vives-Macià, Josep Lluis Usó-Domènech, Daniel Berend:
An introduction to alysidal algebra (II). Kybernetes 41(5/6): 780-793 (2012) - [c6]Daniel Berend, Amir Sapir:
Which Multi-peg Tower of Hanoi Problems Are Exponential? WG 2012: 81-90 - [i2]Daniel Berend, Aryeh Kontorovich:
A Reverse Pinsker Inequality. CoRR abs/1206.6544 (2012) - 2011
- [j22]Daniel Berend, Amir Sapir, Luba Sapir:
A Decision-Making Approach to the Spam Problem. INFOR Inf. Syst. Oper. Res. 49(1): 1-13 (2011) - [i1]Daniel Berend, Amir Sapir, Shay Solomon:
The Tower of Hanoi problem on Pathh graphs. CoRR abs/1102.4885 (2011) - 2010
- [j21]Daniel Berend, Michael Segal, Hanan Shpungin:
Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks. Ad Hoc Sens. Wirel. Networks 10(1): 61-87 (2010) - [j20]Daniel Berend, Ephraim Korach, Shira Zucker:
Anticoloring and separation of graphs. Discret. Math. 310(3): 390-399 (2010)
2000 – 2009
- 2009
- [j19]Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena, Natan Stolyarov:
Analysis of Airplane Boarding Times. Oper. Res. 57(2): 499-513 (2009) - [j18]Shimon Abravaya, Daniel Berend:
Multi-dimensional dynamic facility location and fast computation at query points. Inf. Process. Lett. 109(8): 386-390 (2009) - [j17]Daniel Berend, Shira Zucker:
The Black-and-White Coloring Problem on Trees. J. Graph Algorithms Appl. 13(2): 133-152 (2009) - [j16]Daniel Berend, Vladimir Braverman:
A linear algorithm for computing convex hulls for random lines. ACM Trans. Algorithms 5(4): 42:1-42:21 (2009) - 2008
- [j15]Daniel Berend, Ephraim Korach, Shira Zucker:
Anticoloring of a family of grid graphs. Discret. Optim. 5(3): 647-662 (2008) - [j14]Daniel Berend, Ephraim Korach, Vladimir Lipets:
Minimal cutwidth linear arrangements of abelian Cayley graphs. Discret. Math. 308(20): 4670-4695 (2008) - [j13]Daniel Berend, Yuri Chernyavsky:
Ranking of decision rules with random power distribution. Math. Comput. Model. 48(9-10): 1326-1334 (2008) - [j12]Daniel Berend, Steven Skiena, Yochai Twitto:
Combinatorial dominance guarantees for problems with infeasible solutions. ACM Trans. Algorithms 5(1): 8:1-8:29 (2008) - [c5]Daniel Berend, Shira Zucker:
An improved Algorithm for the Black-and-White Coloring Problem on Trees. IWOCA 2008: 173-181 - [c4]Daniel Berend, Michael Segal, Hanan Shpungin:
Power efficient resilience and lifetime in wireless ad-hoc networks. FOWANC 2008: 17-24 - [c3]Daniel Berend, Ephraim Korach, Shira Zucker:
Tabu search for the BWC problem. SOFSEM (2) 2008: 22-33 - 2007
- [j11]Daniel Berend, Ephraim Korach, Shira Zucker:
A Reduction of the Anticoloring Problem to Connected Graphs. Electron. Notes Discret. Math. 28: 445-451 (2007) - [j10]Daniel Berend, Luba Sapir:
Monotonicity in Condorcet's Jury Theorem with dependent voters. Soc. Choice Welf. 28(3): 507-528 (2007) - 2006
- [j9]Daniel Berend, Amir Sapir:
The diameter of Hanoi graphs. Inf. Process. Lett. 98(2): 79-85 (2006) - [j8]Daniel Berend, Shahar Golan:
Littlewood polynomials with high order zeros. Math. Comput. 75(255): 1541-1552 (2006) - [j7]Daniel Berend, Amir Sapir:
The cyclic multi-peg Tower of Hanoi. ACM Trans. Algorithms 2(3): 297-317 (2006) - [j6]Dany Azriel, Daniel Berend:
On a question of Leiss regarding the Hanoi Tower problem. Theor. Comput. Sci. 369(1-3): 377-383 (2006) - 2005
- [j5]Daniel Berend, Luba Sapir:
Monotonicity in Condorcet Jury Theorem. Soc. Choice Welf. 24(1): 83-92 (2005) - [c2]Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena:
Airplane Boarding, Disk Scheduling and Space-Time Geometry. AAIM 2005: 192-202 - [c1]Daniel Berend, Amir Sapir:
Complexity of the Path Multi-Peg Tower of Hanoi. ALENEX/ANALCO 2005: 212-217 - 2003
- [j4]Daniel Berend, Nimrod Kriger:
On some questions of Razpet regarding binomial coefficients. Discret. Math. 260(1-3): 177-182 (2003) - 2002
- [j3]Daniel Berend, Luba Sapir:
Expert rule versus majority rule under partial information, II. Adv. Decis. Sci. 6(2): 79-99 (2002)
1990 – 1999
- 1994
- [j2]Daniel Berend, Christiane Frougny:
Computability by Finite Automata and Pisot Bases. Math. Syst. Theory 27(3): 275-282 (1994)
1980 – 1989
- 1987
- [j1]Daniel Berend:
Parallelepipeds in sets of integers. J. Comb. Theory A 45(2): 163-170 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
