Cache-oblivious algorithms
From MaRDI portal
Recommendations
Cited in
(93)- Cache-oblivious R-trees
- Algorithms for parallel memory, I: Two-level memories
- I/O efficient dynamic data structures for longest prefix queries
- Cache-independent algorithms
- I/O-efficient data structures for non-overlapping indexing
- An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- The worst page-replacement policy
- I/O-efficient similarity join
- On the importance of cache tuning in a cache-aware algorithm: a case study
- Cache oblivious matrix multiplication using an element ordering based on a Peano curve
- Space-efficient substring occurrence estimation
- Scientific computations on multi-core systems using different programming frameworks
- A cache-optimal alternative to the unidirectional hierarchization algorithm
- On a model of virtual address translation
- An efficient multicore implementation of a novel HSS-structured multifrontal solver using randomized sampling
- A survey on priority queues
- On the weak prefix-search problem
- Space-efficient frameworks for top-k string retrieval
- Kings, name days, lazy servants and magic
- Cache-oblivious iterated predecessor queries via range coalescing
- Sorting and Permuting without Bank Conflicts on GPUs
- I/O-efficient similarity join
- Towards a theory of cache-efficient algorithms
- Cache-Oblivious Red-Blue Line Segment Intersection
- On the Limits of Cache-Oblivious Matrix Transposition
- Design and Engineering of External Memory Traversal Algorithms for General Graphs
- Via Detours to I/O-Efficient Shortest Paths
- On the weak prefix-search problem
- Out-of-core computations of high-resolution level sets by means of code transformation
- scientific article; zbMATH DE number 2011837 (Why is no real title available?)
- Array layouts for comparison-based searching
- Introduction to communication avoiding algorithms for direct methods of factorization in linear algebra
- scientific article; zbMATH DE number 2086622 (Why is no real title available?)
- scientific article; zbMATH DE number 2086641 (Why is no real title available?)
- An approach to multicore parallelism using functional programming: a case study based on Presburger arithmetic
- scientific article; zbMATH DE number 1445384 (Why is no real title available?)
- Fine-grained I/O complexity via reductions: new lower bounds, faster algorithms, and a time hierarchy
- External memory priority queues with decrease-key and applications to graph algorithms
- scientific article; zbMATH DE number 7559165 (Why is no real title available?)
- Cache Oblivious Algorithms for Computing the Triplet Distance Between Trees
- Resilient dynamic programming
- Non-overlapping indexing -- cache obliviously
- scientific article; zbMATH DE number 6315783 (Why is no real title available?)
- Basic polynomial algebra subprograms
- The basic polynomial algebra subprograms
- Packing a knapsack of unknown capacity
- Cache oblivious minimum cut
- Algorithm Theory - SWAT 2004
- Cache-oblivious R-trees
- Cache-adaptive algorithms
- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
- Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
- Cache miss analysis of WHT algorithms
- Cache-oblivious index for approximate string matching
- Computational Science - ICCS 2004
- I/O-efficient data structures for colored range and prefix reporting
- On Memory Traffic and Optimisations for Low-order Finite Element Assembly Algorithms on Multi-core CPUs
- The combinatorics of cache misses during matrix multiplication
- Efficient implementation of the Pivot algorithm for self-avoiding walks
- A note on the O(n)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
- Implicit \(B\)-trees: A new data structure for the dictionary problem
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
- The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation
- Optimal sparse matrix dense vector multiplication in the I/O-model
- ISB-tree: A new indexing scheme with efficient expected behaviour
- Minimizing I/Os in Out-of-Core Task Tree Scheduling
- External-memory sorting with comparison errors
- Cache oblivious algorithms for the RMQ and the RMSQ problems
- Optimal cache-oblivious mesh layouts
- The cost of cache-oblivious searching
- CAGE: cache-aware graphlet enumeration
- Cache-oblivious Hilbert curve-based blocking scheme for matrix transposition
- Cache optimization and performance modeling of batched, small, and rectangular matrix multiplication on Intel, AMD, and Fujitsu processors
- Design and implementation of multi-threaded algorithms in polynomial algebra
- Parallel computation of the power series solutions to linear ordinary differential equations
- Deterministic cache-oblivious funnelselect
- Paging and the address-translation problem
- When are cache-oblivious algorithms cache adaptive? A case study of matrix multiplication and sorting
- Efficient detection of redundancies in systems of linear inequalities
- Efficient detection of redundancies in systems of linear inequalities
- Masking patterns in sequences: A new class of motif discovery with don't cares
- External-memory priority queues with optimal insertions
- Buffered partially-persistent external-memory search trees
- The cache complexity of multithreaded cache oblivious algorithms
- Oblivious algorithms for multicores and networks of processors
- On the limits of cache-oblivious rational permutations
- On sorting, heaps, and minimum spanning trees
- An empirical study of cache-oblivious polygon indecomposability testing
- Cache-oblivious selection in sorted \(X+Y\) matrices
- Assembling approximately optimal binary search trees efficiently using arithmetics
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- A general approach for cache-oblivious range reporting and approximate range counting
This page was built for publication: Cache-oblivious algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189045)
