 | 2012 |
|---|
| 28 |       | Daniel Berend,
Amir Sapir,
Shay Solomon:
The Tower of Hanoi problem on Pathh graphs.
Discrete Applied Mathematics 160(10-11): 1465-1483 (2012) |
| 2011 |
|---|
| 27 | | Daniel Berend,
Amir Sapir,
Shay Solomon:
The Tower of Hanoi problem on Pathh graphs
CoRR abs/1102.4885: (2011) |
| 2010 |
|---|
| 26 | | Daniel Berend,
Michael Segal,
Hanan Shpungin:
Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks.
Ad Hoc & Sensor Wireless Networks 10(1): 61-87 (2010) |
| 25 | | Daniel Berend,
Ephraim Korach,
Shira Zucker:
Anticoloring and separation of graphs.
Discrete Mathematics 310(3): 390-399 (2010) |
| 2009 |
|---|
| 24 | | Daniel Berend,
Vladimir Braverman:
A linear algorithm for computing convex hulls for random lines.
ACM Transactions on Algorithms 5(4): (2009) |
| 23 | | Shimon Abravaya,
Daniel Berend:
Multi-dimensional dynamic facility location and fast computation at query points.
Inf. Process. Lett. 109(8): 386-390 (2009) |
| 22 | | Daniel Berend,
Shira Zucker:
The Black-and-White Coloring Problem on Trees.
J. Graph Algorithms Appl. 13(2): 133-152 (2009) |
| 21 | | Eitan Bachmat,
Daniel Berend,
Luba Sapir,
Steven Skiena,
Natan Stolyarov:
Analysis of Airplane Boarding Times.
Operations Research 57(2): 499-513 (2009) |
| 2008 |
|---|
| 20 | | Daniel Berend,
Michael Segal,
Hanan Shpungin:
Power efficient resilience and lifetime in wireless ad-hoc networks.
FOWANC 2008: 17-24 |
| 19 |  | Daniel Berend,
Shira Zucker:
An improved Algorithm for the Black-and-White Coloring Problem on Trees.
IWOCA 2008: 173-181 |
| 18 | | Daniel Berend,
Ephraim Korach,
Shira Zucker:
Tabu search for the BWC problem.
SOFSEM (2) 2008: 22-33 |
| 17 | | Daniel Berend,
Steven Skiena,
Yochai Twitto:
Combinatorial dominance guarantees for problems with infeasible solutions.
ACM Transactions on Algorithms 5(1): (2008) |
| 16 | | Daniel Berend,
Ephraim Korach,
Vladimir Lipets:
Minimal cutwidth linear arrangements of abelian Cayley graphs.
Discrete Mathematics 308(20): 4670-4695 (2008) |
| 15 | | Daniel Berend,
Ephraim Korach,
Shira Zucker:
Anticoloring of a family of grid graphs.
Discrete Optimization 5(3): 647-662 (2008) |
| 14 | | Daniel Berend,
Yuri Chernyavsky:
Ranking of decision rules with random power distribution.
Mathematical and Computer Modelling 48(9-10): 1326-1334 (2008) |
| 2007 |
|---|
| 13 | | Daniel Berend,
Ephraim Korach,
Shira Zucker:
A Reduction of the Anticoloring Problem to Connected Graphs.
Electronic Notes in Discrete Mathematics 28: 445-451 (2007) |
| 12 | | Daniel Berend,
Luba Sapir:
Monotonicity in Condorcet's Jury Theorem with dependent voters.
Social Choice and Welfare 28(3): 507-528 (2007) |
| 2006 |
|---|
| 11 | | Daniel Berend,
Amir Sapir:
The cyclic multi-peg Tower of Hanoi.
ACM Transactions on Algorithms 2(3): 297-317 (2006) |
| 10 | | Daniel Berend,
Amir Sapir:
The diameter of Hanoi graphs.
Inf. Process. Lett. 98(2): 79-85 (2006) |
| 9 | | Daniel Berend,
Shahar Golan:
Littlewood polynomials with high order zeros.
Math. Comput. 75(255): 1541-1552 (2006) |
| 8 | | Dany Azriel,
Daniel Berend:
On a question of Leiss regarding the Hanoi Tower problem.
Theor. Comput. Sci. 369(1-3): 377-383 (2006) |
| 2005 |
|---|
| 7 | | Eitan Bachmat,
Daniel Berend,
Luba Sapir,
Steven Skiena:
Airplane Boarding, Disk Scheduling and Space-Time Geometry.
AAIM 2005: 192-202 |
| 6 | | Daniel Berend,
Amir Sapir:
Complexity of the Path Multi-Peg Tower of Hanoi.
ALENEX/ANALCO 2005: 212-217 |
| 5 | | Daniel Berend,
Luba Sapir:
Monotonicity in Condorcet Jury Theorem.
Social Choice and Welfare 24(1): 83-92 (2005) |
| 2003 |
|---|
| 4 | | Daniel Berend,
Nimrod Kriger:
On some questions of Razpet regarding binomial coefficients.
Discrete Mathematics 260(1-3): 177-182 (2003) |
| 2002 |
|---|
| 3 | | Daniel Berend,
Luba Sapir:
Expert rule versus majority rule under partial information, II.
JAMDS 6(2): 79-99 (2002) |
| 1994 |
|---|
| 2 | | Daniel Berend,
Christiane Frougny:
Computability by Finite Automata and Pisot Bases.
Mathematical Systems Theory 27(3): 275-282 (1994) |
| 1987 |
|---|
| 1 | | Daniel Berend:
Parallelepipeds in sets of integers.
J. Comb. Theory, Ser. A 45(2): 163-170 (1987) |
Data released under the ODC-BY 1.0 license — See also our legal information page