10048 search results - page 210 / 2010 » The Structure and Performance of Interpreters |
236
click to vote
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...
187
click to vote
ISLPED
2004
ACM
16 years 19 days ago
2004
ACM
In an attempt to enable the cost-effective production of lowand mid-volume application-specific chips, researchers have proposed a number of so-called structured ASIC architectur...
219
click to vote
PODC
2010
ACM
15 years 11 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 ...
182
click to vote
HVC
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Despite many advances, today's software model checkers and extended static checkers still do not scale well to large code bases, when verifying properties that depen...
190
click to vote
DEBS
2010
ACM
15 years 2 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...