We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Abstract. Phylogenetic trees are tree structures that depict relationships between organisms. Popular analysis techniques often produce large collections of candidate trees, which ...
Suzanne Matthews, Seung-Jin Sul, Tiffani L. Willia...
Critical properties of software systems, such as reliability, should be considered early in the development, when they can govern crucial architectural design decisions. A number o...
Franz Brosch, Heiko Koziolek, Barbora Buhnova, Ral...
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...