On the public citation graph
Parallel speedup of sequential machines: a defense of parallel computation thesis
0 signed · 41 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/3-540-16486-3_105openalex-snapshot
Parallel computation with threshold functions
inferredcites →https://doi.org/10.1007/bf00289308openalex-snapshot
?-productions in context-free grammars
inferredcites →https://doi.org/10.1007/bf01786979openalex-snapshot
Parallel random access machines with powerful instruction sets
inferredcites →https://doi.org/10.1016/0020-0190(83)90041-8openalex-snapshot
A note on the ‘parallel computation thesis’
inferredcites →https://doi.org/10.1016/0022-0000(85)90011-xopenalex-snapshot
Speedups of deterministic machines by synchronous parallel machines
inferredcites →https://doi.org/10.1016/0022-0000(88)90030-xopenalex-snapshot
Parallel computation with threshold functions
inferredcites →https://doi.org/10.1016/0167-8191(87)90065-2openalex-snapshot
Some practical simulations of impractical parallel computers
inferredcites →https://doi.org/10.1016/0196-6774(81)90010-9openalex-snapshot
Finding the maximum, merging, and sorting in a parallel computation model
inferredcites →https://doi.org/10.1016/0304-3975(76)90068-2openalex-snapshot
Complete problems for deterministic polynomial time
inferredcites →https://doi.org/10.1016/0304-3975(82)90092-5openalex-snapshot
The maximum flow problem is log space complete for P
inferredcites →https://doi.org/10.1016/0304-3975(86)90165-9openalex-snapshot
On the construction of parallel computers from various bases of boolean functions
inferredcites →https://doi.org/10.1016/s0022-0000(76)80037-2openalex-snapshot
A characterization of the power of vector machines
inferredcites →https://doi.org/10.1137/0206054openalex-snapshot
On Relating Time and Space to Size and Depth
inferredcites →https://doi.org/10.1145/1008354.1008356openalex-snapshot
The monotone and planar circuit value problems are log space complete for P
inferredcites →https://doi.org/10.1145/322344.322353openalex-snapshot
A universal interconnection pattern for parallel computers
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1145/990518.990519openalex-snapshot
The circuit value problem is log space complete for P
inferredcites →https://doi.org/10.82444/warw.33772975openalex-snapshot
A complexity theory of parallel computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1082openalex-snapshot
2 Fast Parallel Prime Number Sieves
inferred← citeshttps://doi.org/10.1007/3-540-16486-3_105openalex-snapshot
Parallel computation with threshold functions
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_27openalex-snapshot
On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_137openalex-snapshot
Are parallel machines always faster than sequential machines?
inferred← citeshttps://doi.org/10.1007/978-3-030-77799-9_9openalex-snapshot
What is the Church-Turing Thesis?
inferred← citeshttps://doi.org/10.1007/s41965-022-00114-5openalex-snapshot
Programmable and parallel water computing
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90030-xopenalex-snapshot
Parallel computation with threshold functions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50006-0openalex-snapshot
Machine Models and Simulations
inferred← citeshttps://doi.org/10.1088/2515-7647/ab87fcopenalex-snapshot
Degenerate squeezing in waveguides: a unified theoretical approach
inferred← citeshttps://doi.org/10.1093/jigpal/jzw008openalex-snapshot
On the parallel computation thesis
inferred← citeshttps://doi.org/10.1103/physrevlett.115.098701openalex-snapshot
Space-Bounded Church-Turing Thesis and Computational Tractability of Closed Systems
inferred← citeshttps://doi.org/10.1109/cisis.2009.109openalex-snapshot
Distributed Parallel Groebner Bases Computation
inferred← citeshttps://doi.org/10.1126/science.1252319openalex-snapshot
Defining and detecting quantum speedup
inferred← citeshttps://doi.org/10.1137/0220005openalex-snapshot
Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
inferred← citeshttps://doi.org/10.1145/57669.57674openalex-snapshot
Time space tradeoffs in vector algorithms for APL functions
inferred← citeshttps://doi.org/10.31234/osf.io/mksx2openalex-snapshot
Tractable embodied computation needs embeddedness
inferred← citeshttps://doi.org/10.3390/universe8010040openalex-snapshot
Fundamental Physics and Computation: The Computer-Theoretic Framework
inferred← citeshttps://doi.org/10.4204/eptcs.88.6openalex-snapshot
A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
inferred← citeshttps://doi.org/10.48550/arxiv.1709.04699openalex-snapshot
Levelable Sets and the Algebraic Structure of Parameterizations
inferred← citeshttps://doi.org/10.5860/choice.33-3959openalex-snapshot
Limits to parallel computation: P-completeness theory
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.