On the public citation graph

On the time and space complexity of computation using write-once memory or is pen really much worse than pencil?

https://doi.org/10.1007/bf02835833
0 signed · 27 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-08353-7_135openalex-snapshot
Graph-theoretic arguments in low-level complexity
inferredcites →https://doi.org/10.1007/3-540-10003-2_89openalex-snapshot
Pebbling mountain ranges and its application to DCFL-recognition
inferredcites →https://doi.org/10.1007/3-540-13345-3_46openalex-snapshot
Computational complexity of an optical disk interface
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1016/s0019-9958(82)90344-8openalex-snapshot
How to reuse a “write-once≓ memory
inferredcites →https://doi.org/10.1109/sfcs.1987.31openalex-snapshot
Hierarchical memory with block transfer
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0211022openalex-snapshot
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferredcites →https://doi.org/10.1145/1344551.1344563openalex-snapshot
Comparative schematology
inferredcites →https://doi.org/10.1145/321812.321815openalex-snapshot
The Parallel Evaluation of General Arithmetic Expressions
inferredcites →https://doi.org/10.1145/3857.3862openalex-snapshot
An efficient I/O interface for optical disks
inferredcites →https://doi.org/10.1145/44546.44559openalex-snapshot
Are applicative languages inefficient?
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/69558.69562openalex-snapshot
I-structures: data structures for parallel computing
inferredcites →https://doi.org/10.1145/800057.808685openalex-snapshot
Correcting faults in write-once memory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-07959-2_14openalex-snapshot
Wear Minimization for Cuckoo Hashing: How Not to Throw a Lot of Eggs into One Basket
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_38openalex-snapshot
Computability and Complexity in Self-assembly
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_28openalex-snapshot
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.106042openalex-snapshot
A competitive analysis for the Start-Gap algorithm for online memory wear leveling
inferred← citeshttps://doi.org/10.1093/logcom/exq002openalex-snapshot
Monotonicity Constraints in Characterizations of PSPACE
inferred← citeshttps://doi.org/10.1109/sp.2006.39openalex-snapshot
Tamper-evident, history-independent, subliminal-free data structures on PROM storage -or- how to store ballots on a voting machine
inferred← citeshttps://doi.org/10.1145/3651145openalex-snapshot
Streaming Algorithms with Few State Changes
inferred← citeshttps://doi.org/10.31274/etd-180810-905openalex-snapshot
Toward a molecular programming language for algorithmic self-assembly
inferred← citeshttps://doi.org/10.4086/toc.2009.v005a002openalex-snapshot
inferred← citeshttps://doi.org/10.48550/arxiv.1407.7592openalex-snapshot
On multiply-exponential write-once Turing machines
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.