11214 search results - page 60 / 2243 » Just-in-time data structures |
PODC
2010
ACM
14 years 1 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
SPAA
2010
ACM
13 years 10 months ago
2010
ACM
Given the sequential implementation of any data structure, we show how to obtain an efficient, wait-free implementation of that data structure shared by any fixed number of proces...
MICRO
2009
IEEE
14 years 4 months ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...
DATE
2005
IEEE
14 years 3 months ago
2005
IEEE
Our goal is to produce validation data that can be used as an efficient (pre) test set for structural stuck-at faults. In this paper, we detail an original test-oriented mutation ...
ICCNMC
2005
Springer
14 years 3 months ago
2005
Springer
With the fast growing size and complexity of core network, the hash based data structure of current AS_PATH implementation in BGP is facing challenges in performance, mainly caused...