Abstract. A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to...
This paper discusses the use of “relative debugging” as a technique for locating errors in a program that has been ported or developed using evolutionary software engineering ...
David Abramson, Raphael A. Finkel, Donny Kurniawan...
Efficient isosurface extraction from large volume data sets requires special algorithms and data structures. Such algorithms typically either use a hierarchical spatial subdivisio...
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...
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...
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...
This paper describes some of our efforts in infusing the critical thinking skill of comparing and contrasting into a course on data structures. Comparing and contrasting is the pr...
M. R. K. Krishna Rao, Muhammad Shafique, Kanaan A....
The integration of data from different sources often leads to the adoption of schemata that entail a loss of information in respect of one or more of the data sets being combined....
We have developed a new programming paradigm which, for conforming programs, allows the averagecase execution time (ACET) to be obtained automatically by a static analysis. This i...
David Hickey, Diarmuid Early, Michel P. Schelleken...