The following pages link to Cache-Oblivious Algorithms (Q3189045):
Displaying 50 items.
- Space-efficient substring occurrence estimation (Q261345) (← links)
- Scientific computations on multi-core systems using different programming frameworks (Q268844) (← links)
- On the weak prefix-search problem (Q390882) (← links)
- Out-of-core computations of high-resolution level sets by means of code transformation (Q421330) (← links)
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic (Q478379) (← links)
- Resilient dynamic programming (Q513272) (← links)
- Cache-oblivious index for approximate string matching (Q551183) (← links)
- Implicit \(B\)-trees: A new data structure for the dictionary problem (Q598254) (← links)
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation (Q613114) (← links)
- Optimal sparse matrix dense vector multiplication in the I/O-model (Q613122) (← links)
- ISB-tree: A new indexing scheme with efficient expected behaviour (Q616991) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- Optimal cache-oblivious mesh layouts (Q633762) (← links)
- The cost of cache-oblivious searching (Q639274) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- The cache complexity of multithreaded cache oblivious algorithms (Q733717) (← links)
- Oblivious algorithms for multicores and networks of processors (Q897114) (← links)
- On the limits of cache-oblivious rational permutations (Q935473) (← links)
- On sorting, heaps, and minimum spanning trees (Q973020) (← links)
- An empirical study of cache-oblivious polygon indecomposability testing (Q975317) (← links)
- Cache-oblivious selection in sorted \(X+Y\) matrices (Q975535) (← links)
- Assembling approximately optimal binary search trees efficiently using arithmetics (Q989540) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- A general approach for cache-oblivious range reporting and approximate range counting (Q991183) (← links)
- Cache-oblivious R-trees (Q1017905) (← links)
- I/O efficient dynamic data structures for longest prefix queries (Q1939656) (← links)
- I/O-efficient data structures for non-overlapping indexing (Q2220773) (← links)
- An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition (Q2234794) (← links)
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions (Q2269835) (← links)
- The worst page-replacement policy (Q2272194) (← links)
- I/O-efficient similarity join (Q2408174) (← links)
- On the importance of cache tuning in a cache-aware algorithm: a case study (Q2458690) (← links)
- Cache oblivious matrix multiplication using an element ordering based on a Peano curve (Q2502879) (← links)
- A Cache-Optimal Alternative to the Unidirectional Hierarchization Algorithm (Q2808020) (← links)
- On a Model of Virtual Address Translation (Q2828187) (← links)
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling (Q2830621) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- RAM-Efficient External Memory Sorting (Q2872113) (← links)
- On the Weak Prefix-Search Problem (Q3011860) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Kings, Name Days, Lazy Servants and Magic (Q3305728) (← links)
- Cache-Oblivious Iterated Predecessor Queries via Range Coalescing (Q3449823) (← links)
- Sorting and Permuting without Bank Conflicts on GPUs (Q3452764) (← links)
- I/O-Efficient Similarity Join (Q3452853) (← links)
- Cache-Oblivious Red-Blue Line Segment Intersection (Q3541077) (← links)
- On the Limits of Cache-Oblivious Matrix Transposition (Q3608461) (← links)
- Design and Engineering of External Memory Traversal Algorithms for General Graphs (Q3637309) (← links)
- Via Detours to I/O-Efficient Shortest Paths (Q3644724) (← links)
- Array Layouts for Comparison-Based Searching (Q4577950) (← links)
- Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
