On the public citation graph
Data encodings and their costs
0 signed · 60 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/bf00991070openalex-snapshot
Toward a theory of encoded data structures and data translation
inferredcites →https://doi.org/10.1007/bf01776564openalex-snapshot
Bounds on the costs of data encodings
inferredcites →https://doi.org/10.1007/bf02280884openalex-snapshot
The NP-Completeness of the bandwidth minimization problem
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/s0019-9958(65)90399-2openalex-snapshot
One-tape, off-line Turing machine computations
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.1137/0134037openalex-snapshot
Complexity Results for Bandwidth Minimization
inferredcites →https://doi.org/10.1145/321724.321726openalex-snapshot
Real-Time Simulation of Multihead Tape Units
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/322123.322138openalex-snapshot
Relations Among Complexity Measures
inferredcites →https://doi.org/10.1145/359361.359447openalex-snapshot
Preserving average proximity in arrays
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
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-52698-6_1openalex-snapshot
Nice drawings of graphs are computationally hard
inferred← citeshttps://doi.org/10.1007/978-0-387-35491-0_10openalex-snapshot
Optical Packet Switching over Arbitrary Physical Topologies using the Manhattan Street Network: An Evolutionary Approach
inferred← citeshttps://doi.org/10.1007/978-0-387-35670-9_22openalex-snapshot
A Study on the Efficacy of Regular Virtual Topology Design Heuristics for Optical Packet Switching
inferred← citeshttps://doi.org/10.1007/bf01744292openalex-snapshot
Storage representations for tree-like data structures
inferred← citeshttps://doi.org/10.1007/bf01776564openalex-snapshot
Bounds on the costs of data encodings
inferred← citeshttps://doi.org/10.1007/bf01931698openalex-snapshot
A comparison of two methods of encoding arrays
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/0196-6774(82)90011-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90037-8openalex-snapshot
A fast implementation of a multidimensional storage into a tree storage
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(85)90026-7openalex-snapshot
Embedding of tree networks into hypercubes
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.1051/ita/1985190201371openalex-snapshot
Search trees and bubble memories
inferred← citeshttps://doi.org/10.1080/00207168008803215openalex-snapshot
On computing distances between leaves in a complete tree
inferred← citeshttps://doi.org/10.1080/00207168208803285openalex-snapshot
Encoding search trees in lists†
inferred← citeshttps://doi.org/10.1109/12.2207openalex-snapshot
A synthesis algorithm for reconfigurable interconnection networks
inferred← citeshttps://doi.org/10.1109/12.392850openalex-snapshot
Embedding binary trees into crossed cubes
inferred← citeshttps://doi.org/10.1109/71.503774openalex-snapshot
Embedding of complete binary trees into meshes with row-column routing
inferred← citeshttps://doi.org/10.1109/icc.2001.936988openalex-snapshot
Ultrafast optical packet switching over arbitrary physical topologies using the Manhattan Street Network
inferred← citeshttps://doi.org/10.1109/icc.2002.997358openalex-snapshot
Impact of graph theoretic network parameters on the design of regular virtual topologies for optical packet switching
inferred← citeshttps://doi.org/10.1109/icpp.1999.797412openalex-snapshot
Contention free embedding of complete binary trees into 3D meshes in half and full-duplexed network models
inferred← citeshttps://doi.org/10.1109/jlt.2002.800258openalex-snapshot
Impact of non-uniform traffic on the design of multi-hop regular virtual topologies for optical packet switching over arbitrary physical topologies
inferred← citeshttps://doi.org/10.1109/memocode57689.2022.9954596openalex-snapshot
Real-Time Scheduling of Machine Learning Operations on Heterogeneous Neuromorphic SoC
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.1109/tnet.2007.899067openalex-snapshot
An Holistic Framework for Regular Virtual Topology Design
inferred← citeshttps://doi.org/10.1137/0212030openalex-snapshot
Optimal Dynamic Embedding of Trees into Arrays
inferred← citeshttps://doi.org/10.1137/0604055openalex-snapshot
Perfect Storage Representations for Families of Data Structures
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/322154.322160openalex-snapshot
Encoding Data Structures in Trees
inferred← citeshttps://doi.org/10.1145/44483.44494openalex-snapshot
Optimal simulations between mesh-connected arrays of processors
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
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.