32545 search results - page 398 / 6509 » Data Structures and Algorithms |
171
Voted
IWPC
2006
IEEE
16 years 26 days ago
2006
IEEE
Analysis of dynamic data structure usage is useful for both program understanding and for improving the accuracy of other program analyses. Static analysis techniques, however, su...
173
Voted
ISCIS
2005
Springer
16 years 11 days ago
2005
Springer
We introduce a novel data structure for solving the range query problem in generic metric spaces. It can be seen as a dynamic version of the List of Clusters data structure of Ch´...
174
click to vote
DIMVA
2009
15 years 8 months ago
2009
Abstract. This paper introduces a new software polymorphism technique that randomizes program data structure layout. This technique will generate different data structure layouts f...
223
Voted
ACSC
2007
IEEE
16 years 1 months ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
166
Voted
ALGORITHMICA
2005
15 years 6 months ago
2005
We consider history independent data structures as proposed for study by Naor and Teague [3]. In a history independent data structure, nothing can be learned from the memory repre...