On the public citation graph
Efficient memory access in large-scale computation
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-19422-3_7openalex-snapshot
Priority search trees in secondary memory (extended abstract)
inferredcites →https://doi.org/10.1007/3-540-53504-7_108openalex-snapshot
I/O overhead and parallel VLSI architectures for lattice computations
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/bf01530929openalex-snapshot
The input/output complexity of transitive closure
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.1093/comjnl/17.4.324openalex-snapshot
The Art of Computer Programming, Volume 3, Sorting and Searching
inferredcites →https://doi.org/10.1109/sfcs.1987.31openalex-snapshot
Hierarchical memory with block transfer
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.5009385openalex-snapshot
Tight Bounds on the Complexity of Parallel Sorting
inferredcites →https://doi.org/10.1109/visual.1990.146371openalex-snapshot
Visualizing computer memory architectures
inferredcites →https://doi.org/10.1145/100216.100234openalex-snapshot
Optimal disk I/O with parallel block transfer
inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.1145/7531.7532openalex-snapshot
A logarithmic time sort for linear size networks
inferredcites →https://doi.org/10.1145/93597.93620openalex-snapshot
The input/output complexity of transitive closure
inferredcites →https://doi.org/10.5555/949531.949548openalex-snapshot
Visualizing computer memory architectures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10704054_3openalex-snapshot
Improving Cache Utilization of Linear Relaxation Methods: Theory and Practice
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-48523-6_10openalex-snapshot
Online Data Structures in External Memory
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_238openalex-snapshot
A general lower bound on the I/O-complexity of comparison-based algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_78openalex-snapshot
Topology B-trees and their applications
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/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/s007780050028openalex-snapshot
An asymptotically optimal multiversion B-tree
inferred← citeshttps://doi.org/10.1016/j.vlsi.2008.06.005openalex-snapshot
Incremental analysis of large VLSI Layouts
inferred← citeshttps://doi.org/10.1016/s0925-7721(96)00025-9openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferred← citeshttps://doi.org/10.1109/hicss.1995.375476openalex-snapshot
Models of parallel computation: a survey and synthesis
inferred← citeshttps://doi.org/10.1109/sct.1995.514727openalex-snapshot
On superlinear lower bounds in complexity theory
inferred← citeshttps://doi.org/10.1109/sfcs.1993.366816openalex-snapshot
External-memory computational geometry
inferred← citeshttps://doi.org/10.1145/153850.153884openalex-snapshot
Indexing for data models with constraints and classes (extended abstract)
inferred← citeshttps://doi.org/10.1145/220279.220286openalex-snapshot
A comparison of sequential Delaunay triangulation algorithms
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.7146/brics.v3i28.20009openalex-snapshot
The Buffer Tree: A New Technique for Optimal I/O Algorithms
inferred← citeshttps://doi.org/10.7146/brics.v3i29.20010openalex-snapshot
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
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.