|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 151 occurrences of 96 keywords
|
|
|
Results
Found 220 publication records. Showing 220 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
19 | Michael Bader, Robert Franz, Stephan Günther, Alexander Heinecke |
Hardware-Oriented Implementation of Cache Oblivious Matrix Operations Based on Space-Filling Curves. |
PPAM |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Miriam Mehl, Tobias Weinzierl, Christoph Zenger 0001 |
A cache-oblivious self-adaptive full multigrid method. |
Numer. Linear Algebra Appl. |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
The cache-oblivious gaussian elimination paradigm: theoretical framework and experimental evaluation. |
SPAA |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Michael A. Bender, Erik D. Demaine, Martin Farach-Colton |
Cache-Oblivious B-Trees. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg |
Cache-Oblivious Data Structures. |
Handbook of Data Structures and Applications |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Michael A. Bender, Ziyang Duan, John Iacono, Jing Wu |
A locality-preserving cache-oblivious dynamic dictionary. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther |
Engineering a Cache-Oblivious Sorting Algorith. |
ALENEX/ANALC |
2004 |
DBLP BibTeX RDF |
|
19 | Piyush Kumar |
Cache Oblivious Algorithms. |
Algorithms for Memory Hierarchies |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Behzad Sajadi, Yan Huang 0003, Pablo Diaz-Gutierrez, Sung-Eui Yoon, M. Gopi 0001 |
A novel page-based data structure for interactive walkthroughs. |
SI3D |
2009 |
DBLP DOI BibTeX RDF |
walkthrough systems, spatial data structures, out-of-core algorithms, data layouts |
16 | Herman J. Haverkort, Laura Toma, Yi Zhuang |
Computing visibility on terrains in external memory. |
ACM J. Exp. Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Computational geometry, visibility, terrains, I/O-efficiency, digital elevation models, data structures and algorithms |
16 | Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari |
Optimal sparse matrix dense vector multiplication in the I/O-model. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
I/O-model, sparse matrix dense vector multiplication, lower bound, external memory algorithms |
12 | Roberto Grossi |
Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Erik D. Demaine, Gad M. Landau, Oren Weimann |
On Cartesian Trees and Range Minimum Queries. |
ICALP (1) |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong Chwa |
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs. |
FAW |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Jeremy Fishman, Herman J. Haverkort, Laura Toma |
Improved visibility computation on massive grid terrains. |
GIS |
2009 |
DBLP DOI BibTeX RDF |
|
12 | Grey Ballard, James Demmel, Olga Holtz, Oded Schwartz |
Communication-optimal parallel and sequential Cholesky decomposition: extended abstract. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
Cholesky decomposition, communication avoiding, algorithm, lower bound, latency, bandwidth |
12 | Marc Pérache, Hervé Jourdren, Raymond Namyst |
MPC: A Unified Parallel Runtime for Clusters of NUMA Machines. |
Euro-Par |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Georgios Tsilikas, Martin Fleury |
Matrix Multiplication Performance on Commodity Shared-Memory Multiprocessors. |
PARELEC |
2004 |
DBLP DOI BibTeX RDF |
|
12 | Juha Kärkkäinen, Peter Sanders 0001 |
Simple Linear Work Suffix Array Construction. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Michael A. Bender, Richard Cole 0001, Erik D. Demaine, Martin Farach-Colton |
Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #201 - #220 of 220 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3] |
|