|
Search the dblp DataBase
Daniel Berend:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena
Airplane Boarding, Disk Scheduling and Space-Time Geometry. [Citation Graph (0, 0)][DBLP] AAIM, 2005, pp:192-202 [Conf]
- Daniel Berend, Amir Sapir
Complexity of the Path Multi-Peg Tower of Hanoi. [Citation Graph (0, 0)][DBLP] ALENEX/ANALCO, 2005, pp:212-217 [Conf]
- Daniel Berend, Nimrod Kriger
On some questions of Razpet regarding binomial coefficients. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:260, n:1-3, pp:177-182 [Journal]
- Daniel Berend, Amir Sapir
The diameter of Hanoi graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:98, n:2, pp:79-85 [Journal]
- Daniel Berend, Luba Sapir
Expert rule versus majority rule under partial information, II. [Citation Graph (0, 0)][DBLP] JAMDS, 2002, v:6, n:2, pp:79-99 [Journal]
- Daniel Berend
Parallelepipeds in sets of integers. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1987, v:45, n:2, pp:163-170 [Journal]
- Daniel Berend, Christiane Frougny
Computability by Finite Automata and Pisot Bases. [Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1994, v:27, n:3, pp:275-282 [Journal]
- Daniel Berend, Amir Sapir
The cyclic multi-peg Tower of Hanoi. [Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:3, pp:297-317 [Journal]
- D. Azriel, Daniel Berend
On a question of Leiss regarding the Hanoi Tower problem. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:369, n:1-3, pp:377-383 [Journal]
Power efficient resilience and lifetime in wireless ad-hoc networks. [Citation Graph (, )][DBLP]
Tabu search for the BWC problem. [Citation Graph (, )][DBLP]
Minimal cutwidth linear arrangements of abelian Cayley graphs. [Citation Graph (, )][DBLP]
Anticoloring and separation of graphs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.002secs
|