We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...