Dejan Zivkovic

Learn More
In this paper we analyze a variant of the n-disk Towers of Hanoi problem with an arbitrary starting and ending configuration using transition graphs representing valid configurations. In particular, we show that starting with any configuration, there is a sequence of moves that goes through each valid configuration exactly once and back to the starting(More)
In today’s digital age, with never ending advances of information technology, plagiarism of textual documents is becoming one of leading issues that causes wide concern in higher education and science. The ubiquity of Internet has created a plethora of possibilities for unacknowledged copying and paraphrasing of other people’s work. This has grave legal and(More)