11211 search results - page 13 / 2243 » (Data) STRUCTURES |
139
Voted
ACSC
2007
IEEE
15 years 7 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...
94
Voted
ALGORITHMICA
2005
15 years 18 days 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...
138
Voted
PODC
2010
ACM
15 years 4 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 ...
93
Voted
SPAA
2010
ACM
15 years 27 days 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...
152
click to vote
Lecture Notes
"The study of data structures and the algorithms that manipulate them is among the most fundamental topics in computer science. Most of what computer systems spend their time ...