-
...service attacks and cryptanalysis via timing attacks,
are enabled by data structures for which an adversary can...and exclusive access to the data structure and the timings
of past operations. we also design a data structure for implementing a set (supporting...
-
...the framework of soft kinetic data structures (skds). a soft kinetic data structure is an approximate data structure that can be used to answer queries on a set of moving objects with unpredictable motion. we analyze the quality of a soft kinetic data structure by giving a competitive analysis with respect to the dynamics of...
-
...irregular both in space and time: the data structures are dynamic pointer-based structures and the computations on the structures have unpredictable duration. the algorithm is presented...of guarded commands. two key data structures, a set and a priority queue, are distributed across processors in the parallel algorithm. the data structures are designed for high throughput...
-
...irregular both in space and time: the data structures are dynamic pointer-based structures and the computations on the structures have unpredictable duration. the algorithm is presented...of guarded commands. two key data structures, a set and a priority queue, are distributed across processors in the parallel algorithm. the data structures are designed for high throughput...
-
...an efficient amortized data structure is one that ensures that the average time per operation spent on processing any sequence of operations is small. amortized data structures typically have very non-uniform response times, i.e., individual operations can...
-
...leaves of a quad-tree structure. in this paper, we evaluate...allowing the use of multiple data structures in leaf matrices (csr/coo, with either 16/32 bit indices...
Published in 2010.
-
...electronic patient data are associated with many potential benefits, e.g. data sharing, quality assessment, research, and...the potential benefits of electronic data, the data must also be available in a structured format to enable processing by computer applications. narrative data are typically recorded as free...
-
...tion of dataguide-based statistical structure for xml stores is proposed...is shown. generalization of the structure on distributed case is described...
-
...is to dis- tinguish between data structures that exhibit a predictable versus unpredictable cache behavior. cache performance of accesses to predictable data structures can be automat- ically and...that a vast majority of data accesses stems from predictable data structures. we analyze what kind of data structures that fall into this category...
-
...a notion of predictable and unpredictable data structures, it is shown how to classify program data structures according to their influence on data cache analysis. for both categories, several examples of frequently used types of data structures are provided. furthermore, it is shown how to make an ecient data cache analysis even when data structures have an unknown placement in...
Published in 2002.