Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010info:eu-repo/semantics/publishe
Partial persistence is a general transformation that takes a data structure and allows queries to be...
The Dagstuhl Seminar 04301 ``Cache-Oblivious and Cache-Aware Algorithms\u27\u27 was held in the Inte...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB ...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key...
New cache-oblivious and cache-aware algorithms for simple dynamic programming based on Valiant's con...
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed d...
In this paper we present an implicit dynamic dictionary with the working-set property, support-ing i...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
Partial persistence is a general transformation that takes a data structure and allows queries to be...
Memory efficiency and locality have substantial impact on the performance of programs, particularly ...
Cache-oblivious techniques, proposed in the theory community, have optimal asymptotic bounds on the ...
Semantic cache and distribution introduce new obstacles to how we use cache in query processing in d...
Partial persistence is a general transformation that takes a data structure and allows queries to be...
The Dagstuhl Seminar 04301 ``Cache-Oblivious and Cache-Aware Algorithms\u27\u27 was held in the Inte...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB ...
We introduce the cache-adaptive model, which generalizes the external-memory model to apply to envir...
A dictionary (or map) is a key-value store that requires all keys be unique, and a multimap is a key...
New cache-oblivious and cache-aware algorithms for simple dynamic programming based on Valiant's con...
This paper presents a simple dictionary structure designed for a hierarchical memory. The proposed d...
In this paper we present an implicit dynamic dictionary with the working-set property, support-ing i...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
We present a new technique of universe reduction. Primary applications are the dictionary problem an...
Partial persistence is a general transformation that takes a data structure and allows queries to be...
Memory efficiency and locality have substantial impact on the performance of programs, particularly ...
Cache-oblivious techniques, proposed in the theory community, have optimal asymptotic bounds on the ...
Semantic cache and distribution introduce new obstacles to how we use cache in query processing in d...
Partial persistence is a general transformation that takes a data structure and allows queries to be...
The Dagstuhl Seminar 04301 ``Cache-Oblivious and Cache-Aware Algorithms\u27\u27 was held in the Inte...
Abstract. We develop dynamic dictionaries on the word RAM that use asymptotically optimal space, up ...
DOI
Add to ORKG