On the public citation graph

Extending the Hong-Kung model to memory hierarchies

0 signed · 81 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/bf01693976openalex-snapshot

Application of separability and independence notions for proving lower bounds of circuit complexity

inferredcites →https://doi.org/10.1016/0022-0000(80)90056-2openalex-snapshot

Time-space tradeoffs for computing functions, using connectivity properties of their circuits

inferredcites →https://doi.org/10.1016/c2013-0-08299-0openalex-snapshot

Introduction to Parallel Algorithms and Architectures

inferredcites →https://doi.org/10.1109/fscs.1990.89581openalex-snapshot

Uniform memory hierarchies

inferredcites →https://doi.org/10.1109/sfcs.1987.31openalex-snapshot

Hierarchical memory with block transfer

inferredcites →https://doi.org/10.1109/tc.1981.1675790openalex-snapshot

The Universality of the Shuffle-Exchange Network

inferredcites →https://doi.org/10.1109/tc.1983.1676281openalex-snapshot

Time-Space Tradeoffs on Back-to-Back FFT Algorithms

inferredcites →https://doi.org/10.1145/100216.100234openalex-snapshot

Optimal disk I/O with parallel block transfer

inferredcites →https://doi.org/10.1145/113379.113382openalex-snapshot

Large-scale sorting in parallel memories (extended abstract)

inferredcites →https://doi.org/10.1145/1344551.1344563openalex-snapshot

Comparative schematology

inferredcites →https://doi.org/10.1145/140901.140908openalex-snapshot

Layered cross product—a technique to construct interconnection networks

inferredcites →https://doi.org/10.1145/28395.28428openalex-snapshot

A model for hierarchical memory

inferredcites →https://doi.org/10.1145/48529.48535openalex-snapshot

The input/output complexity of sorting and related problems

inferredcites →https://doi.org/10.1145/800076.802486openalex-snapshot

I/O complexity

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45545-0_21openalex-snapshot

Statistical Models for Automatic Performance Tuning

inferred← citeshttps://doi.org/10.1007/978-3-031-91736-3_7openalex-snapshot

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs

inferred← citeshttps://doi.org/10.1007/978-3-032-35412-9_16openalex-snapshot

Graeffe-Based Attacks on Poseidon and NTT Lower Bounds

inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_16openalex-snapshot

The I/O Complexity of Strassen’s Matrix Multiplication with Recomputation

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-87744-8_2openalex-snapshot

A Bridging Model for Multi-core Computing

inferred← citeshttps://doi.org/10.1007/978-3-642-19222-7_12openalex-snapshot

Upper and Lower I/O Bounds for Pebbling r-Pyramids

inferred← citeshttps://doi.org/10.1007/978-3-642-22685-4_12openalex-snapshot

Strong I/O Lower Bounds for Binomial and FFT Computation Graphs

inferred← citeshttps://doi.org/10.1007/s00453-010-9394-0openalex-snapshot

The Cost of Cache-Oblivious Searching

inferred← citeshttps://doi.org/10.1007/s11227-013-1018-4openalex-snapshot

Measurement of the latency parameters of the Multi-BSP model: a multicore benchmarking approach

inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.014openalex-snapshot

A locality-preserving cache-oblivious dynamic dictionary

inferred← citeshttps://doi.org/10.1016/j.jcss.2010.06.012openalex-snapshot

A bridging model for multi-core computing

inferred← citeshttps://doi.org/10.1016/j.jda.2011.12.005openalex-snapshot

Upper and lower I/O bounds for pebbling r-pyramids

inferred← citeshttps://doi.org/10.1017/s0962492914000038openalex-snapshot

Communication lower bounds and optimal algorithms for numerical linear algebra

inferred← citeshttps://doi.org/10.1090/dimacs/050openalex-snapshot

External Memory Algorithms

inferred← citeshttps://doi.org/10.1109/comhpc.2016.010openalex-snapshot

Network Topologies and Inevitable Contention

inferred← citeshttps://doi.org/10.1109/hpca.1999.744320openalex-snapshot

Memory hierarchy considerations for fast transpose and bit-reversals

inferred← citeshttps://doi.org/10.1109/ipdps.2019.00058openalex-snapshot

Revisiting the I/O-Complexity of Fast Matrix Multiplication with Recomputations

inferred← citeshttps://doi.org/10.1109/paap.2012.41openalex-snapshot

A Bridging Model for Branch-and-Bound Algorithms on Multi-core Architectures

inferred← citeshttps://doi.org/10.1109/sc41404.2022.00030openalex-snapshot

Deinsum: Practically I/O Optimal Multi-Linear Algebra

inferred← citeshttps://doi.org/10.1109/sfcs.1998.743505openalex-snapshot

Towards an optimal bit-reversal permutation program

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.814600openalex-snapshot

Cache-oblivious algorithms

inferred← citeshttps://doi.org/10.1137/090769156openalex-snapshot

Minimizing Communication in Numerical Linear Algebra

inferred← citeshttps://doi.org/10.1137/s0097539703428324openalex-snapshot

An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms

inferred← citeshttps://doi.org/10.1142/s0129054112500128openalex-snapshot

VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH

inferred← citeshttps://doi.org/10.1145/1463768.1463780openalex-snapshot

A unified model for multicore architectures

inferred← citeshttps://doi.org/10.1145/1644001.1644008openalex-snapshot

Cache-optimal algorithms for option pricing

inferred← citeshttps://doi.org/10.1145/2071379.2071383openalex-snapshot

Cache-Oblivious Algorithms

inferred← citeshttps://doi.org/10.1145/2103736.2103743openalex-snapshot

Multi-DaC programming model

inferred← citeshttps://doi.org/10.1145/2312005.2312049openalex-snapshot

Cache-conscious scheduling of streaming applications

inferred← citeshttps://doi.org/10.1145/2395116.2395121openalex-snapshot

Graph expansion and communication costs of fast matrix multiplication

inferred← citeshttps://doi.org/10.1145/2612669.2612694openalex-snapshot

On characterizing the data movement complexity of computational DAGs for parallel execution

inferred← citeshttps://doi.org/10.1145/2676726.2677010openalex-snapshot

On Characterizing the Data Access Complexity of Programs

inferred← citeshttps://doi.org/10.1145/2693656openalex-snapshot

On Using the Roofline Model with Lower Bounds on Data Movement

inferred← citeshttps://doi.org/10.1145/275487.275501openalex-snapshot

External memory algorithms

inferred← citeshttps://doi.org/10.1145/2935764.2935807openalex-snapshot

Brief Announcement

inferred← citeshttps://doi.org/10.1145/3181776openalex-snapshot

A Lower Bound Technique for Communication in BSP

inferred← citeshttps://doi.org/10.1145/3350755.3400267openalex-snapshot

Communication Lower Bounds of Convolutions in CNNs

inferred← citeshttps://doi.org/10.1145/3362694openalex-snapshot

A Tight I/O Lower Bound for Matrix Multiplication

inferred← citeshttps://doi.org/10.1145/3385412.3385989openalex-snapshot

Automated derivation of parametric data movement lower bounds for affine programs

inferred← citeshttps://doi.org/10.1145/3409964.3461796openalex-snapshot

Pebbles, Graphs, and a Pinch of Combinatorics

inferred← citeshttps://doi.org/10.1145/3437801.3441609openalex-snapshot

I/O lower bounds for auto-tuning of convolutions in CNNs

inferred← citeshttps://doi.org/10.1145/3453483openalex-snapshot

Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation

inferred← citeshttps://doi.org/10.1145/3453483.3454103openalex-snapshot

IOOpt: automatic derivation of I/O complexity bounds for affine programs

inferred← citeshttps://doi.org/10.1145/3458817.3476204openalex-snapshot

Accelerating XOR-based erasure coding using program optimization techniques

inferred← citeshttps://doi.org/10.1145/3626183.3660269openalex-snapshot

Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs

inferred← citeshttps://doi.org/10.1145/3694906.3743320openalex-snapshot

The Impact of Partial Computations on the Red-Blue Pebble Game

inferred← citeshttps://doi.org/10.1145/3767110.3767118openalex-snapshot

Revisiting Pebble Games for Modeling and Efficient Use of Disaggregated Memory Systems

inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot

External memory algorithms and data structures

inferred← citeshttps://doi.org/10.1145/509907.509950openalex-snapshot

Cache-oblivious priority queue and graph algorithm applications

inferred← citeshttps://doi.org/10.1145/602220.602225openalex-snapshot

Towards a theory of cache-efficient algorithms

inferred← citeshttps://doi.org/10.1155/2009/681708openalex-snapshot

Evaluating Multicore Algorithms on the Unified Memory Model

inferred← citeshttps://doi.org/10.1177/1094342004041293openalex-snapshot

Statistical Models for Empirical Search-Based Performance Tuning

inferred← citeshttps://doi.org/10.1561/0400000014openalex-snapshot

Algorithms and Data Structures for External Memory

inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot

Algorithms and Data Structures for External Memory

inferred← citeshttps://doi.org/10.15803/ijnc.9.1_70openalex-snapshot

A Shared Memory Parallel Block Streaming Model for Irregular Applications

inferred← citeshttps://doi.org/10.4230/lipics.isaac.2019.33openalex-snapshot

The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication

inferred← citeshttps://doi.org/10.48550/arxiv.1307.1805openalex-snapshot

Communication Lower Bounds for Distributed-Memory Computations

inferred← citeshttps://doi.org/10.48550/arxiv.1912.08045openalex-snapshot

On the I/O complexity of hybrid algorithms for Integer Multiplication

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0010007openalex-snapshot

Towards a Theory of Cache-Efficient Algorithms

inferred← citeshttps://doi.org/10.5555/2634074.2634145openalex-snapshot

Cache-adaptive algorithms

inferred← citeshttps://doi.org/10.5555/3018058.3018063openalex-snapshot

Network topologies and inevitable contention

inferred← citeshttps://doi.org/10.5555/338219.338646openalex-snapshot

Towards a theory of cache-efficient algorithms

inferred← citeshttps://doi.org/10.5555/545381.545385openalex-snapshot

A locality-preserving cache-oblivious dynamic dictionary

inferred← citeshttps://doi.org/10.7936/k7s46q5zopenalex-snapshot

Hierarchical Scheduling for Multicores with Multilevel Cache Hierarchies

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.