This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
The soil nematode Caenorhabditis Elegans (C. elegans) is the most investigated of all multi-cellular organisms. Since the proposal to use it as a model organism, a series of resea...
We built a tool to visualize and explore program execution traces. Our goal was to help programmers without any prior knowledge of a program, quickly get enough knowledge about it...