3 citations · 5 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 3 cited
Reconstructing Biological and Digital Phylogenetic Trees in Parallel
Ramtin Afshar, Michael T. Goodrich, Pedro Matias +1
In this paper, we study the parallel query complexity of reconstructing biological and digital phylogenetic trees from simple queries involving their nodes. This is motivated from…
cs.DS2019
Taming the Knight's Tour: Minimizing Turns and Crossings
Juan Jose Besa, Timothy Johnson, Nil Mamano +2
We introduce two new metrics of "simplicity" for knight's tours: the number of turns and the number of crossings. We give a novel algorithm that produces tours with tu…