An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
A new Blink Tree latching method and protocol simplifies implementation of Lehman and Yao's high
concurrency Blink Tree with Jaluta's balanced Blink Tree methods with in...
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
This paper presents a new protocol, the Ordered Core Based Tree (OCBT) protocol, which remedies several shortcomings of the Core Based Tree (CBT) multicast protocol. We show that ...