On the public citation graph

Algorithms for parallel memory, I: Two-level memories

https://doi.org/10.1007/bf01185207
0 signed · 329 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_10openalex-snapshot
Permuting Information in Idealized Two-Level Storage
inferredcites →https://doi.org/10.1007/bf01185208openalex-snapshot
Algorithms for parallel memory, II: Hierarchical multilevel memories
inferredcites →https://doi.org/10.1007/bf01185210openalex-snapshot
Coding techniques for handling failures in large disk arrays
inferredcites →https://doi.org/10.1016/0022-0000(79)90044-8openalex-snapshot
Universal classes of hash functions
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50014-xopenalex-snapshot
Average-Case Analysis of Algorithms and Data Structures
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tc.1980.1675525openalex-snapshot
IEEE Transactions on Computers
inferredcites →https://doi.org/10.1109/tc.1981.1675790openalex-snapshot
The Universality of the Shuffle-Exchange Network
inferredcites →https://doi.org/10.1109/tc.1985.1676565openalex-snapshot
The Design and Analysis of BucketSort for Bubble Memory Secondary Storage
inferredcites →https://doi.org/10.1109/tc.1985.1676584openalex-snapshot
Wafer-Scale Integration of Systolic Arrays
inferredcites →https://doi.org/10.1109/tc.1985.5009385openalex-snapshot
Tight Bounds on the Complexity of Parallel Sorting
inferredcites →https://doi.org/10.1145/113379.113382openalex-snapshot
Large-scale sorting in parallel memories (extended abstract)
inferredcites →https://doi.org/10.1145/165231.165247openalex-snapshot
Deterministic distribution sort in shared and distributed memory multiprocessors
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/971701.50214openalex-snapshot
A case for redundant arrays of inexpensive disks (RAID)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/spe.844openalex-snapshot
S TXXL : standard template library for XXL data sets
inferred← citeshttps://doi.org/10.1002/spe.960openalex-snapshot
A survey of practical algorithms for suffix tree construction in external memory
inferred← citeshttps://doi.org/10.1006/inco.1998.2733openalex-snapshot
Dynamic Dictionary Matching in External Memory
inferred← citeshttps://doi.org/10.1006/jagm.2000.1089openalex-snapshot
Competitive Parallel Disk Prefetching and Buffer Management
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1678openalex-snapshot
Prefix Computations on Symmetric Multiprocessors
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1682openalex-snapshot
Selection Algorithms for Parallel Disk Systems
inferred← citeshttps://doi.org/10.1007/10692760_14openalex-snapshot
Compact Implicit Representation of Graphs
inferred← citeshttps://doi.org/10.1007/11561071_30openalex-snapshot
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
inferred← citeshttps://doi.org/10.1007/11561071_57openalex-snapshot
Stxxl: Standard Template Library for XXL Data Sets
inferred← citeshttps://doi.org/10.1007/11602613_55openalex-snapshot
A Simple Optimal Randomized Algorithm for Sorting on the PDM
inferred← citeshttps://doi.org/10.1007/11780441_8openalex-snapshot
Obtaining Provably Good Performance from Suffix Trees in Secondary Storage
inferred← citeshttps://doi.org/10.1007/11945918_8openalex-snapshot
Algorithmic Ramifications of Prefetching in Memory Hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-36383-1_1openalex-snapshot
Algorithm Engineering for Parallel Computation
inferred← citeshttps://doi.org/10.1007/3-540-44503-x_9openalex-snapshot
Parallelizing the Data Cube
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_5openalex-snapshot
Duality Between Prefetching and Queued Writing with Parallel Disks
inferred← citeshttps://doi.org/10.1007/3-540-44688-5_11openalex-snapshot
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
inferred← citeshttps://doi.org/10.1007/3-540-44691-5_5openalex-snapshot
Efficient Sorting Using Registers and Caches
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_73openalex-snapshot
Simple Linear Work Suffix Array Construction
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_21openalex-snapshot
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_21openalex-snapshot
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
inferred← citeshttps://doi.org/10.1007/3-540-45703-8_26openalex-snapshot
Querying and Clustering Very Large Data Sets Using Dynamic Bucketing Approach
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_12openalex-snapshot
Implementing I/O-efficient Data Structures Using TPIE
inferred← citeshttps://doi.org/10.1007/3-540-45749-6_63openalex-snapshot
External-Memory Breadth-First Search with Sublinear I/O
inferred← citeshttps://doi.org/10.1007/3-540-46632-0_31openalex-snapshot
External Memory Algorithms for Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_19openalex-snapshot
LEDA-SM: Extending LEDA to Secondary Memory
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_27openalex-snapshot
An Experimental Study of Priority Queues in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48447-7_35openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_20openalex-snapshot
On Constructing Suffix Arrays in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_19openalex-snapshot
Fast Priority Queues for Cached Memory
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_3openalex-snapshot
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_62openalex-snapshot
Accessing Multiple Sequences Through Set Associative Caches
inferred← citeshttps://doi.org/10.1007/3-540-48686-0_5openalex-snapshot
An External Memory Data Structure for Shortest Path Queries (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_74openalex-snapshot
The buffer tree: A new technique for optimal I/O-algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_75openalex-snapshot
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_151openalex-snapshot
External-memory algorithms for processing line segments in geographic information systems
inferred← citeshttps://doi.org/10.1007/3-540-63818-0_8openalex-snapshot
External-memory algorithms with applications in GIS
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_692openalex-snapshot
Locality optimization for program instances
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_708openalex-snapshot
Randomized parallel prefetching and buffer management
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_1openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_122openalex-snapshot
Edit Distance Under Block Operations
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_137openalex-snapshot
External Sorting and Permuting
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_178openalex-snapshot
High Performance Algorithm Engineering for Large-scale Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_190openalex-snapshot
I/O-model
inferred← citeshttps://doi.org/10.1007/978-1-4612-1516-5_14openalex-snapshot
Determining an out-of-Core FFT Decomposition Strategy for Parallel Disks by Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4613-1401-1_1openalex-snapshot
I/O in Parallel and Distributed Systems: An Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4613-1401-1_2openalex-snapshot
An Introduction to Parallel I/O Models and Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-1401-1_3openalex-snapshot
Issues in Compiling I/O Intensive Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4_9openalex-snapshot
Randomized Parallel Prefetching and Buffer Management
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_10openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_24openalex-snapshot
Sorting and Selection on Parallel Disk Models
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_1openalex-snapshot
Random Sampling: Sorting and Selection
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_137openalex-snapshot
External Sorting and Permuting
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_178openalex-snapshot
High Performance Algorithm Engineering for Large-Scale Problems
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_190openalex-snapshot
I/O-Model
inferred← citeshttps://doi.org/10.1007/978-3-030-67063-4_7openalex-snapshot
The Interleaved Memory Efficiency for Multithread Memory Calls Processing
inferred← citeshttps://doi.org/10.1007/978-3-031-42833-3_11openalex-snapshot
An Empirical Study on the Energy Efficiency of Matrix Transposition Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-20086-6_3openalex-snapshot
A Bulk-Parallel Priority Queue in External Memory with STXXL
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_8openalex-snapshot
Algorithms for Scalable Storage Servers
inferred← citeshttps://doi.org/10.1007/978-3-540-24644-2_28openalex-snapshot
A Data Cache with Dynamic Mapping
inferred← citeshttps://doi.org/10.1007/978-3-540-24688-6_45openalex-snapshot
Parallel I/O in Bulk-Synchronous Parallel ML
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_19openalex-snapshot
Parallel Prefetching and Caching Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_2openalex-snapshot
Cache-Oblivious Algorithms and Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-45209-6_125openalex-snapshot
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_7openalex-snapshot
Red-Black Prefetching: An Approximation Algorithm for Parallel Disk Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-77220-0_10openalex-snapshot
Experiments with a Parallel External Memory System
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_8openalex-snapshot
Generating SIMD Vectorized Permutations
inferred← citeshttps://doi.org/10.1007/978-3-540-89894-8_12openalex-snapshot
Efficient PDM Sorting Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02538-9_6openalex-snapshot
Algorithm Engineering: Concepts and Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_22openalex-snapshot
Algorithm Engineering – An Attempt at a Definition
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_24openalex-snapshot
Compression, Indexing, and Retrieval for Massive String Data
inferred← citeshttps://doi.org/10.1007/978-3-642-14518-6_17openalex-snapshot
Congruent Number Theta Coefficients to 1012
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_14openalex-snapshot
Unit-Time Predecessor Queries on Massive Data Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-20674-0_2openalex-snapshot
External Memory Breadth-First Search with Delayed Duplicate Detection on the GPU
inferred← citeshttps://doi.org/10.1007/978-3-642-23088-2_5openalex-snapshot
NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_137-2openalex-snapshot
External Sorting and Permuting
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_190-2openalex-snapshot
I/O-Model
inferred← citeshttps://doi.org/10.1007/978-3-642-35542-4_12openalex-snapshot
I/O Efficient Algorithms for Block Hessenberg Reduction Using Panel Approach
inferred← citeshttps://doi.org/10.1007/bf01185208openalex-snapshot
Algorithms for parallel memory, II: Hierarchical multilevel memories
inferred← citeshttps://doi.org/10.1007/bfb0015411openalex-snapshot
The I/O-complexity of Ordered Binary-Decision Diagram manipulation
inferred← citeshttps://doi.org/10.1007/bfb0054359openalex-snapshot
Worst-case efficient external-memory priority queues
inferred← citeshttps://doi.org/10.1007/bfb0055823openalex-snapshot
A parallelization of Dijkstra's shortest path algorithm
inferred← citeshttps://doi.org/10.1007/pl00008259openalex-snapshot
String Search in Coarse-Grained Parallel Computers
inferred← citeshttps://doi.org/10.1007/s00224-001-0002-1openalex-snapshot
Blocking in Parallel Multisearch Problems
inferred← citeshttps://doi.org/10.1007/s00224-002-1031-0openalex-snapshot
A Simple and Efficient Parallel Disk Mergesort
inferred← citeshttps://doi.org/10.1007/s00224-002-1066-2openalex-snapshot
Bulk Synchronous Parallel Algorithms for the External Memory Model
inferred← citeshttps://doi.org/10.1007/s002240010020openalex-snapshot
A Framework for Simple Sorting Algorithms on Parallel Disk Systems
inferred← citeshttps://doi.org/10.1007/s00287-010-0464-0openalex-snapshot
Algorithm Engineering
inferred← citeshttps://doi.org/10.1007/s00453-002-1009-yopenalex-snapshot
Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-003-1021-xopenalex-snapshot
The Buffer Tree: A Technique for Designing Batched External Data Structures
inferred← citeshttps://doi.org/10.1007/s00453-004-1129-7openalex-snapshot
Optimal Read-Once Parallel Disk Scheduling
inferred← citeshttps://doi.org/10.1007/s00453-006-1208-zopenalex-snapshot
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
inferred← citeshttps://doi.org/10.1007/s00453-006-1222-1openalex-snapshot
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
inferred← citeshttps://doi.org/10.1007/s00453-007-9131-5openalex-snapshot
I/O-Efficient Algorithms for Graphs of Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-010-9394-0openalex-snapshot
The Cost of Cache-Oblivious Searching
inferred← citeshttps://doi.org/10.1007/s00453-016-0165-4openalex-snapshot
An External-Memory Algorithm for String Graph Construction
inferred← citeshttps://doi.org/10.1007/s00778-003-0112-2openalex-snapshot
Evaluating holistic aggregators efficiently for very large datasets
inferred← citeshttps://doi.org/10.1007/s00778-005-0154-8openalex-snapshot
Practical methods for constructing suffix trees
inferred← citeshttps://doi.org/10.1007/s11227-007-0170-0openalex-snapshot
Combating I-O bottleneck using prefetching: model, algorithms, and ramifications
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.01.004openalex-snapshot
On the importance of cache tuning in a cache-aware algorithm: A case study
inferred← citeshttps://doi.org/10.1016/j.future.2013.06.020openalex-snapshot
A memory access model for highly-threaded many-core architectures
inferred← citeshttps://doi.org/10.1016/j.future.2017.02.007openalex-snapshot
Analysis of classic algorithms on highly-threaded many-core architectures
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.009openalex-snapshot
Analysis of simple randomized buffer management for parallel I/O
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.03.015openalex-snapshot
External matrix multiplication and all-pairs shortest path
inferred← citeshttps://doi.org/10.1016/j.jda.2010.08.001openalex-snapshot
ISB-tree: A new indexing scheme with efficient expected behaviour
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.08.003openalex-snapshot
Out-of-core computing on mesh connected computers
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.06.008openalex-snapshot
Translating submachine locality into locality of reference
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.06.004openalex-snapshot
Conflict-free star-access in parallel memory systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2011.07.004openalex-snapshot
Efficient out-of-core sorting algorithms for the Parallel Disks Model
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.009openalex-snapshot
Two-level main memory co-design: Multi-threaded algorithmic primitives, analysis, and simulation
inferred← citeshttps://doi.org/10.1016/j.parco.2014.12.002openalex-snapshot
Extending the BSP model for multi-core and out-of-core computing: MBSP
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00098-3openalex-snapshot
An efficient external sorting algorithm
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00225-0openalex-snapshot
Representing graphs implicitly using almost optimal space
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00217-2openalex-snapshot
An external memory data structure for shortest path queries
inferred← citeshttps://doi.org/10.1016/s0167-739x(01)00056-5openalex-snapshot
On a scheme for parallel sorting on heterogeneous clusters
inferred← citeshttps://doi.org/10.1016/s0167-739x(98)00035-1openalex-snapshot
Arranging statements and data of program instances for locality
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00092-3openalex-snapshot
Reconciling simplicity and realism in parallel disk models
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00040-1openalex-snapshot
Efficient 2D FFT implementation on mediaprocessors
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00014-8openalex-snapshot
Early experiences in evaluating the parallel disk model with the ViC∗ implementation
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00015-xopenalex-snapshot
Simple randomized mergesort on parallel disks
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00114-2openalex-snapshot
Performing out-of-core FFTs on parallel disk systems
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00025-9openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00020-5openalex-snapshot
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
inferred← citeshttps://doi.org/10.1023/a:1013940219415openalex-snapshot
inferred← citeshttps://doi.org/10.1023/b:dapd.0000018572.20283.e0openalex-snapshot
Parallel ROLAP Data Cube Construction on Shared-Nothing Multiprocessors
inferred← citeshttps://doi.org/10.1090/dimacs/050openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1090/dimacs/050/02openalex-snapshot
Synopsis data structures for massive data sets
inferred← citeshttps://doi.org/10.1090/dimacs/074/11openalex-snapshot
Breadth first search on massive graphs
inferred← citeshttps://doi.org/10.1109/12.995452openalex-snapshot
An efficient algorithm for out-of-core matrix transposition
inferred← citeshttps://doi.org/10.1109/71.755830openalex-snapshot
Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions
inferred← citeshttps://doi.org/10.1109/71.819948openalex-snapshot
Tight bounds for prefetching and buffer management algorithms for parallel I/O systems
inferred← citeshttps://doi.org/10.1109/aqtr.2014.6857846openalex-snapshot
WaterfallTree — External indexing data structure
inferred← citeshttps://doi.org/10.1109/bigdata55660.2022.10020231openalex-snapshot
On High-Latency Bowtie Data Streaming
inferred← citeshttps://doi.org/10.1109/clustr.2003.1253328openalex-snapshot
Efficient parallel out-of-core matrix transposition
inferred← citeshttps://doi.org/10.1109/clustr.2006.311857openalex-snapshot
MSSG: A Framework for Massive-Scale Semantic Graphs
inferred← citeshttps://doi.org/10.1109/fmpc.1996.558083openalex-snapshot
Disk resident arrays: an array-oriented I/O library for out-of-core computations
inferred← citeshttps://doi.org/10.1109/focs.2004.48openalex-snapshot
On the Streaming Model Augmented with a Sorting Primitive
inferred← citeshttps://doi.org/10.1109/hicss.1995.375476openalex-snapshot
Models of parallel computation: a survey and synthesis
inferred← citeshttps://doi.org/10.1109/hipc.1998.738007openalex-snapshot
Selection algorithms for parallel disk systems
inferred← citeshttps://doi.org/10.1109/hipc.1998.738012openalex-snapshot
An improved parallel disk scheduling algorithm
inferred← citeshttps://doi.org/10.1109/hipc.2012.6507492openalex-snapshot
I/O efficient QR and QZ algorithms
inferred← citeshttps://doi.org/10.1109/hips.1998.665140openalex-snapshot
ViC*: a compiler for virtual-memory C*
inferred← citeshttps://doi.org/10.1109/hpca.2000.824350openalex-snapshot
Cache-efficient matrix transposition
inferred← citeshttps://doi.org/10.1109/hpcsim.2014.6903670openalex-snapshot
Analysis of classic algorithms on GPUs
inferred← citeshttps://doi.org/10.1109/hpec.2015.7396313openalex-snapshot
A cloud-based approach to big graphs
inferred← citeshttps://doi.org/10.1109/icccn.2012.6289236openalex-snapshot
A Pipeline IP Lookup Architecture with Random Duplicate Allocation
inferred← citeshttps://doi.org/10.1109/icde.1996.492115openalex-snapshot
Parallel pointer-based join algorithms in memory mapped environments
inferred← citeshttps://doi.org/10.1109/icde.2006.47openalex-snapshot
Declarative Querying for Biological Sequences
inferred← citeshttps://doi.org/10.1109/icde.2010.5447865openalex-snapshot
Scalable distributed-memory external sorting
inferred← citeshttps://doi.org/10.1109/icpads.2012.54openalex-snapshot
A Memory Access Model for Highly-threaded Many-core Architectures
inferred← citeshttps://doi.org/10.1109/icpp.1996.537393openalex-snapshot
Synthesizing efficient out-of-core programs for block recursive algorithms using block-cyclic data distributions
inferred← citeshttps://doi.org/10.1109/icpp.1998.708495openalex-snapshot
Improving parallel-disk buffer management using randomized writeback
inferred← citeshttps://doi.org/10.1109/icpp.2000.876148openalex-snapshot
An efficient algorithm for large-scale matrix transposition
inferred← citeshttps://doi.org/10.1109/icpp.2006.9openalex-snapshot
A Parallel External-Memory Frontier Breadth-First Traversal Algorithm for Clusters of Workstations
inferred← citeshttps://doi.org/10.1109/icppw.2000.869120openalex-snapshot
A practical realization of parallel disks
inferred← citeshttps://doi.org/10.1109/icppw.2016.29openalex-snapshot
Memory-Aware Management for Heterogeneous Main Memory Using an Optimization of the Aging Paging Algorithm
inferred← citeshttps://doi.org/10.1109/ideas.2001.938081openalex-snapshot
Novel algorithms for computing medians and other quantiles of disk-resident data
inferred← citeshttps://doi.org/10.1109/ideas.2004.1319810openalex-snapshot
Building large ROLAP data cubes in parallel
inferred← citeshttps://doi.org/10.1109/ideas.2004.16openalex-snapshot
Building large ROLAP data cubes in parallel
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015508openalex-snapshot
Distribution sweeping on clustered machines with hierarchical memories
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1015576openalex-snapshot
An out-of-core sorting algorithm for clusters with processors at different speed
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213169openalex-snapshot
Parallel ROLAP data cube construction on shared-nothing multiprocessors
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213491openalex-snapshot
Accessing hardware performance counters in order to measure the influence of cache on the performance of integer sorting
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302947openalex-snapshot
Translating submachine locality into locality of reference (extended abstract)
inferred← citeshttps://doi.org/10.1109/ipdps.2005.133openalex-snapshot
Building on a Framework: Using FG for More Flexibility and Improved Performance in Parallel Programs
inferred← citeshttps://doi.org/10.1109/ipdps.2005.334openalex-snapshot
PDM Sorting Algorithms That Take A Small Number of Passes
inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639555openalex-snapshot
Cache-oblivious simulation of parallel programs
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370587openalex-snapshot
A Model and Prototype of a Resource-Efficient Storage Server for High-Bitrate Video-on-Demand
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161001openalex-snapshot
Building a parallel pipelined external memory algorithm library
inferred← citeshttps://doi.org/10.1109/ipdps.2013.72openalex-snapshot
Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory
inferred← citeshttps://doi.org/10.1109/ipdps.2015.94openalex-snapshot
Two-Level Main Memory Co-Design: Multi-threaded Algorithmic Primitives, Analysis, and Simulation
inferred← citeshttps://doi.org/10.1109/ipdpsw.2010.5470692openalex-snapshot
Out-of-core distribution sort in the FG programming environment
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.135openalex-snapshot
Performance Evaluation of Scale-Free Graph Algorithms in Low Latency Non-volatile Memory
inferred← citeshttps://doi.org/10.1109/ipps.1998.669981openalex-snapshot
Sorting on clusters of SMPs
inferred← citeshttps://doi.org/10.1109/ipps.1999.760427openalex-snapshot
Prefix computations on symmetric multiprocessors
inferred← citeshttps://doi.org/10.1109/ipps.1999.760428openalex-snapshot
Reducing I/O complexity by simulating coarse grained parallel algorithms
inferred← citeshttps://doi.org/10.1109/iscc.2013.6755015openalex-snapshot
A two-pass exact algorithm for selection on Parallel Disk Systems
inferred← citeshttps://doi.org/10.1109/ispass.2013.6557165openalex-snapshot
A mathematical hard disk timing model for full system simulation
inferred← citeshttps://doi.org/10.1109/mass.1999.829996openalex-snapshot
Adaptive disk striping for parallel input/output
inferred← citeshttps://doi.org/10.1109/sc.2005.73openalex-snapshot
The MHETA Execution Model for Heterogeneous Clusters
inferred← citeshttps://doi.org/10.1109/sc.2010.34openalex-snapshot
Multithreaded Asynchronous Graph Traversal for In-Memory and Semi-External Memory
inferred← citeshttps://doi.org/10.1109/sefm.2008.34openalex-snapshot
Flash-Efficient LTL Model Checking with Minimal Counterexamples
inferred← citeshttps://doi.org/10.1109/sequen.1997.666919openalex-snapshot
Multi-string search in BSP
inferred← citeshttps://doi.org/10.1109/sequen.1997.666927openalex-snapshot
Sequence sorting in secondary storage
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366816openalex-snapshot
External-memory computational geometry
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548476openalex-snapshot
New coding techniques for improved bandwidth utilization
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743441openalex-snapshot
Overcoming the memory bottleneck in suffix tree construction
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892128openalex-snapshot
Cache-oblivious B-trees
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238201openalex-snapshot
The cost of cache-oblivious searching
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814599openalex-snapshot
A theoretical framework for memory-adaptive algorithms
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814600openalex-snapshot
Cache-oblivious algorithms
inferred← citeshttps://doi.org/10.1109/smc.2018.00567openalex-snapshot
Memory-Restricted Routing with Tiled Map Data
inferred← citeshttps://doi.org/10.1109/spdp.1995.530667openalex-snapshot
Supporting I/O-efficient scientific computation in TPIE
inferred← citeshttps://doi.org/10.1109/spdp.1996.570330openalex-snapshot
Improved algorithms and data structures for solving graph problems in external memory
inferred← citeshttps://doi.org/10.1109/splc.1993.365587openalex-snapshot
Out of core, out of mind: practical parallel I/O
inferred← citeshttps://doi.org/10.1109/tc.2002.1047757openalex-snapshot
PC-OPT: optimal offline prefetching and caching for parallel I/O systems
inferred← citeshttps://doi.org/10.1109/tc.2007.70810openalex-snapshot
Optimal and Practical Algorithms for Sorting on the PDM
showing the first 200 of 313 · page through all 313
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.