On the public citation graph

Bandwidth and pebbling

https://doi.org/10.1007/bf02259908
0 signed · 39 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/3-540-08860-1_22openalex-snapshot
A pspace complete problem related to a pebble game
inferredcites →https://doi.org/10.1007/3-540-10854-8_41openalex-snapshot
Pebbling and bandwidth
inferredcites →https://doi.org/10.1007/bf00288886openalex-snapshot
Data encodings and their costs
inferredcites →https://doi.org/10.1007/bf01776564openalex-snapshot
Bounds on the costs of data encodings
inferredcites →https://doi.org/10.1007/bf02239468openalex-snapshot
Note on minimizing the bandwidth of sparse, symmetric matrices
inferredcites →https://doi.org/10.1007/bf02252900openalex-snapshot
Minimizing the bandwidth of sparse symmetric matrices
inferredcites →https://doi.org/10.1007/bf02280884openalex-snapshot
The NP-Completeness of the bandwidth minimization problem
inferredcites →https://doi.org/10.1016/b978-1-4832-3187-7.50018-0openalex-snapshot
A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
inferredcites →https://doi.org/10.1016/s0022-0000(74)80046-2openalex-snapshot
An observation on time-storage trade off
inferredcites →https://doi.org/10.1016/s0304-3975(81)80004-7openalex-snapshot
A comparison of two variations of a pebble game on graphs
inferredcites →https://doi.org/10.1137/0134037openalex-snapshot
Complexity Results for Bandwidth Minimization
inferredcites →https://doi.org/10.1137/0204020openalex-snapshot
Complete Register Allocation Problems
inferredcites →https://doi.org/10.1137/0209038openalex-snapshot
The Pebbling Problem is Complete in Polynomial Space
inferredcites →https://doi.org/10.1137/0601042openalex-snapshot
Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time
inferredcites →https://doi.org/10.1145/1344551.1344563openalex-snapshot
Comparative schematology
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/322003.322015openalex-snapshot
On Time Versus Space
inferredcites →https://doi.org/10.1145/800076.802474openalex-snapshot
Bandwidth constrained NP-Complete problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-27705-6_1openalex-snapshot
Changing Challenges for Collaborative Algorithmics
inferred← citeshttps://doi.org/10.1007/11549468_31openalex-snapshot
Batch-Scheduling Dags for Internet-Based Computing
inferred← citeshttps://doi.org/10.1007/11685654_13openalex-snapshot
A Pebble Game for Internet-Based Computing
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_19openalex-snapshot
Topological Bandwidth
inferred← citeshttps://doi.org/10.1007/3-540-40064-8_6openalex-snapshot
On the Space and Access Complexity of Computation DAGs
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_8openalex-snapshot
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
inferred← citeshttps://doi.org/10.1007/bf00288774openalex-snapshot
Complete problems for space bounded subclasses of NP
inferred← citeshttps://doi.org/10.1007/s00453-004-1117-yopenalex-snapshot
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90146-5openalex-snapshot
Searching and pebbling
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90028-xopenalex-snapshot
Min cut is NP-complete for edge weighted trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.06.001openalex-snapshot
Lower bounds on treespan
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.12.022openalex-snapshot
Maximum vertex occupation time and inert fugitive: Recontamination does help
inferred← citeshttps://doi.org/10.1109/43.85742openalex-snapshot
Circuit width, register allocation, and ordered binary decision diagrams
inferred← citeshttps://doi.org/10.1109/iccd.1989.63394openalex-snapshot
Ordered binary decision diagrams and circuit structure
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213078openalex-snapshot
On scheduling collaborative computations on the Internet, I: mesh-DAGs and their close relatives
inferred← citeshttps://doi.org/10.1109/ipdps.2005.304openalex-snapshot
On Scheduling Complex Dags for Internet-Based Computing
inferred← citeshttps://doi.org/10.1109/tc.2004.64openalex-snapshot
On scheduling mesh-structured computations for Internet-based computing
inferred← citeshttps://doi.org/10.1109/tc.2005.65openalex-snapshot
Guidelines for Scheduling Some Common Computation-Dags for Internet-Based Computing
inferred← citeshttps://doi.org/10.1109/tc.2006.91openalex-snapshot
Toward a theory for scheduling dags in Internet-based computing
inferred← citeshttps://doi.org/10.1145/1073970.1073981openalex-snapshot
Parallel scheduling of complex dags under uncertainty
inferred← citeshttps://doi.org/10.48456/tr-704openalex-snapshot
Complexity and infinite games on finite graphs
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.