Abstract. UML models consist of several diagrams of different types describing different views of a software system ranging from specifications of the static system structure to de...
Partitioning within a B-tree, based on an artificial leading key column and combined with online reorganization, can be exploited during external merge sort for accurate deep read...
In these lecture notes we present a novel toolkit to program web applications with that have dynamic, complex behavior based on interconnect forms. This toolkit is the iData Toolki...
We present dynamic search-tree data structures that perform well in the setting of a hierarchical memory (including various levels of cache, disk, etc.), but do not depend on the ...
Michael A. Bender, Erik D. Demaine, Martin Farach-...
This work is designed to contribute to a deeper understanding of the recently proposed Merging SOM (MSOM). Its context model aims at the representation of sequences, an important s...