On the public citation graph
Bounds on the costs of data encodings
0 signed · 61 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.1016/s0021-9800(66)80059-5openalex-snapshot
Optimal numberings and isoperimetric problems on graphs
inferredcites →https://doi.org/10.1137/0112012openalex-snapshot
Optimal Assignments of Numbers to Vertices
inferredcites →https://doi.org/10.1145/321892.321898openalex-snapshot
Representing Graphs by Knuth Trees
inferredcites →https://doi.org/10.1145/321978.321990openalex-snapshot
Space and Time Hierarchies for Classes of Control Structures and Data Structures
inferredcites →https://doi.org/10.1145/359361.359447openalex-snapshot
Preserving average proximity in arrays
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
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-10291-4_12openalex-snapshot
Issues in the study of graph embeddings
inferred← citeshttps://doi.org/10.1007/3-540-10843-2_4openalex-snapshot
Cost tradeoffs in graph embeddings, with applications
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_80openalex-snapshot
On embedding interconnection networks into rings of processors
inferred← citeshttps://doi.org/10.1007/978-1-4684-6357-6_8openalex-snapshot
Ensemble Architectures and their Algorithms: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-030-45715-0_14openalex-snapshot
A Study of Recombination Operators for the Cyclic Bandwidth Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-97570-7_12openalex-snapshot
Modeling the Cyclic Bandwidth Problem in QUBO for Quantum Annealing
inferred← citeshttps://doi.org/10.1007/978-3-322-80139-5_4openalex-snapshot
Vergleich von Speicherstrukturen
inferred← citeshttps://doi.org/10.1007/978-3-642-37798-3_13openalex-snapshot
A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_13openalex-snapshot
Embedding one Interconnection Network in Another
inferred← citeshttps://doi.org/10.1007/978-94-009-2411-6_7openalex-snapshot
Bandwidth in Multigrids for Random Graphs
inferred← citeshttps://doi.org/10.1007/bf01744292openalex-snapshot
Storage representations for tree-like data structures
inferred← citeshttps://doi.org/10.1007/bf01931698openalex-snapshot
A comparison of two methods of encoding arrays
inferred← citeshttps://doi.org/10.1007/bf01940645openalex-snapshot
A New combinatorial approach to optimal embeddings of rectangles
inferred← citeshttps://doi.org/10.1007/bf01940646openalex-snapshot
Blocking for external graph searching
inferred← citeshttps://doi.org/10.1007/bfb0028814openalex-snapshot
The complexity of embedding graphs into binary trees
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90088-6openalex-snapshot
Minimal storage representations for binary relations
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90080-6openalex-snapshot
Representing graph families with edge grammars
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90046-yopenalex-snapshot
Lattice bandwidth of random graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(85)90016-1openalex-snapshot
NP-completeness for minimizing maximum edge length in grid embeddings
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90050-7openalex-snapshot
Embeddings of binary trees in lines
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90081-9openalex-snapshot
Simulations among multidimensional turing machines
inferred← citeshttps://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot
On mapping parallel algorithms into parallel architectures
inferred← citeshttps://doi.org/10.1016/0743-7315(89)90057-9openalex-snapshot
Synthesizing minimum total expansion topologies for reconfigurable interconnection networks
inferred← citeshttps://doi.org/10.1016/b978-0-444-88712-2.50009-3openalex-snapshot
Applications of the “Phase Abstractions” for Portable and Scalable Parallel Programming
inferred← citeshttps://doi.org/10.1016/j.cor.2014.11.013openalex-snapshot
Tabu search for the cyclic bandwidth problem
inferred← citeshttps://doi.org/10.1016/j.knosys.2020.106136openalex-snapshot
A new iterated local search algorithm for the cyclic bandwidth problem
inferred← citeshttps://doi.org/10.1051/ita/1985190201371openalex-snapshot
Search trees and bubble memories
inferred← citeshttps://doi.org/10.1080/00207168208803285openalex-snapshot
Encoding search trees in lists†
inferred← citeshttps://doi.org/10.1109/access.2019.2929410openalex-snapshot
An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem
inferred← citeshttps://doi.org/10.1109/mppoi.1994.336643openalex-snapshot
Data motion and high performance computing
inferred← citeshttps://doi.org/10.1109/sfcs.1981.40openalex-snapshot
Simulations among multidimensional turing machines
inferred← citeshttps://doi.org/10.1109/tc.1982.1676109openalex-snapshot
On Embedding Rectangular Grids in Square Grids
inferred← citeshttps://doi.org/10.1137/0212030openalex-snapshot
Optimal Dynamic Embedding of Trees into Arrays
inferred← citeshttps://doi.org/10.1137/0908040openalex-snapshot
Solving Tridiagonal Systems on Ensemble Architectures
inferred← citeshttps://doi.org/10.1137/s0097539796308710openalex-snapshot
Tight Bounds for On-Line Tree Embeddings
inferred← citeshttps://doi.org/10.1145/12130.12157openalex-snapshot
Optimal simulations between mesh-connected arrays of processors
inferred← citeshttps://doi.org/10.1145/153850.153880openalex-snapshot
Blocking for external graph searching
inferred← citeshttps://doi.org/10.1145/2157.322401openalex-snapshot
Cost Trade-offs in Graph Embeddings, with Applications
inferred← citeshttps://doi.org/10.1145/44483.44494openalex-snapshot
Optimal simulations between mesh-connected arrays of processors
inferred← citeshttps://doi.org/10.1145/76263.76295openalex-snapshot
Dilation d embedding of a hyper-pyramid into a hypercube
inferred← citeshttps://doi.org/10.1145/800076.802481openalex-snapshot
Bounds on minimax edge length for complete binary trees
inferred← citeshttps://doi.org/10.1145/800076.802487openalex-snapshot
Graphs that are almost binary trees (Preliminary Version)
inferred← citeshttps://doi.org/10.1145/800135.804403openalex-snapshot
Storage representations for tree-like data structures
inferred← citeshttps://doi.org/10.1147/rd.381.0031openalex-snapshot
Embedding hyperpyramids into hypercubes
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5554openalex-snapshot
Interconnection Networks Embeddings and Efficient Parallel Computations.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5642openalex-snapshot
Embedding Schemes for Interconnection Networks.
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.