Daniel Berend

According to our database1, Daniel Berend authored at least 59 papers between 1987 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On biased random walks, corrupted intervals, and learning under adversarial design.
Ann. Math. Artif. Intell., 2020

Effect of Initial Assignment on Local Search Performance for Max Sat.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Average-Case Competitive Ratio of Scheduling Algorithms of Multi-user Cache.
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.
IACR Cryptol. ePrint Arch., 2019

A Model of Random Industrial SAT.
CoRR, 2019

AdaptiveClimb: adaptive policy for cache replacement.
Proceedings of the 12th ACM International Conference on Systems and Storage, 2019

2018
The Asymptotics of Useless Hint Sequences in Nonograms.
J. Integer Seq., 2018

On the number of Sudoku squares.
Discret. Math., 2018

Probabilistic optimal solution assessment for DCOPs.
Ann. Math. Artif. Intell., 2018

On the Satisfiability Threshold of Random Community-Structured SAT.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017
The Expected Missing Mass under an Entropy Constraint.
Entropy, 2017

Optimal ordering of statistically dependent tests.
Discret. Appl. Math., 2017

2016
The state complexity of random DFAs.
Theor. Comput. Sci., 2016

Towards holographic "brain" memory based on randomization and Walsh-Hadamard transformation.
Neural Networks, 2016

Exponential vs. Subexponential Tower of Hanoi Variants.
J. Graph Algorithms Appl., 2016

Reconstruction of domino tilings - Combinatorial and probabilistic questions.
Discret. Appl. Math., 2016

The Normalized Autocorrelation Length of Random Max r -Sat Converges in Probability to (1-1/2^r)/r.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

On the Number of Forceless Hint Sequences in Paint-by-Numbers Puzzles.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015
Graph Degree Sequence Solely Determines the Expected Hopfield Network Pattern Stability.
Neural Comput., 2015

A finite sample analysis of the Naive Bayes classifier.
J. Mach. Learn. Res., 2015

Anticoloring of the rook's graph.
Discret. Appl. Math., 2015

Optimal Ordering of Tests with Extreme Dependencies.
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.
IEEE Trans. Inf. Theory, 2014

Counting solutions to CSP using generating polynomials.
J. Discrete Algorithms, 2014

Nonograms: Combinatorial questions and algorithms.
Discret. Appl. Math., 2014

Optimal ordering of independent tests with precedence constraints.
Discret. Appl. Math., 2014

Consistency of weighted majority votes.
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).
Kybernetes, 2012

An introduction to alysidal algebra (I).
Kybernetes, 2012

Tabu search for the BWC problem.
J. Glob. Optim., 2012

The Tower of Hanoi problem on Path<sub>h</sub> graphs.
Discret. Appl. Math., 2012

A Reverse Pinsker Inequality
CoRR, 2012

Which Multi-peg Tower of Hanoi Problems Are Exponential?
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
A Decision-Making Approach to the Spam Problem.
INFOR Inf. Syst. Oper. Res., 2011

2010
Anticoloring and separation of graphs.
Discret. Math., 2010

Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks.
Ad Hoc Sens. Wirel. Networks, 2010

2009
A linear algorithm for computing convex hulls for random lines.
ACM Trans. Algorithms, 2009

The Black-and-White Coloring Problem on Trees.
J. Graph Algorithms Appl., 2009

Multi-dimensional dynamic facility location and fast computation at query points.
Inf. Process. Lett., 2009

Analysis of Airplane Boarding Times.
Oper. Res., 2009

2008
Combinatorial dominance guarantees for problems with infeasible solutions.
ACM Trans. Algorithms, 2008

Ranking of decision rules with random power distribution.
Math. Comput. Model., 2008

Minimal cutwidth linear arrangements of abelian Cayley graphs.
Discret. Math., 2008

Anticoloring of a family of grid graphs.
Discret. Optim., 2008

Power efficient resilience and lifetime in wireless ad-hoc networks.
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.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2007
Monotonicity in Condorcet's Jury Theorem with dependent voters.
Soc. Choice Welf., 2007

A Reduction of the Anticoloring Problem to Connected Graphs.
Electron. Notes Discret. Math., 2007

2006
On a question of Leiss regarding the Hanoi Tower problem.
Theor. Comput. Sci., 2006

The cyclic multi-peg Tower of Hanoi.
ACM Trans. Algorithms, 2006

Littlewood polynomials with high order zeros.
Math. Comput., 2006

The diameter of Hanoi graphs.
Inf. Process. Lett., 2006

2005
Monotonicity in Condorcet Jury Theorem.
Soc. Choice Welf., 2005

Complexity of the Path Multi-Peg Tower of Hanoi.
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.
Proceedings of the Algorithmic Applications in Management, First International Conference, 2005

2003
On some questions of Razpet regarding binomial coefficients.
Discret. Math., 2003

2002
Expert rule versus majority rule under partial information, II.
Adv. Decis. Sci., 2002

1994
Computability by Finite Automata and Pisot Bases.
Math. Syst. Theory, 1994

1987
Parallelepipeds in sets of integers.
J. Comb. Theory, Ser. A, 1987


  Loading...