On the public citation graph
On the power of probabilistic choice in synchronous parallel computations
0 signed · 63 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-09519-5_73openalex-snapshot
Probabilistic algorithms for sparse polynomials
inferredcites →https://doi.org/10.1007/3-540-09526-8_5openalex-snapshot
Fast probabilistic algorithms
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1016/0020-0190(78)90079-0openalex-snapshot
An improved parallel processor bound in fast matrix inversion
inferredcites →https://doi.org/10.1063/1.3062516openalex-snapshot
An Introduction to Probability Theory and Its Applications
inferredcites →https://doi.org/10.1090/s0025-5718-1970-0276200-xopenalex-snapshot
Factoring polynomials over large finite fields
inferredcites →https://doi.org/10.1090/s0025-5718-1983-0717715-6openalex-snapshot
Irreducibility testing and factorization of polynomials
inferredcites →https://doi.org/10.1109/9780470544242.ch54openalex-snapshot
Computability by Probabilistic Machines
inferredcites →https://doi.org/10.1109/sfcs.1975.23openalex-snapshot
On time versus space and related problems
inferredcites →https://doi.org/10.1109/sfcs.1977.18openalex-snapshot
On taking roots in finite fields
inferredcites →https://doi.org/10.1109/sfcs.1978.37openalex-snapshot
Two theorems on random polynomial time
inferredcites →https://doi.org/10.1109/sfcs.1979.34openalex-snapshot
Random walks, universal traversal sequences, and the complexity of maze problems
inferredcites →https://doi.org/10.1109/sfcs.1980.2openalex-snapshot
A distributed abstract data type implemented by a probabilistic communication scheme
inferredcites →https://doi.org/10.1109/sfcs.1980.22openalex-snapshot
Hardware complexity and parallel computation
inferredcites →https://doi.org/10.1109/sfcs.1980.26openalex-snapshot
N-process synchronization by 4.log2N-valued shared variable
inferredcites →https://doi.org/10.1109/sfcs.1980.28openalex-snapshot
On distinguishing prime numbers from composite numbers
inferredcites →https://doi.org/10.1109/sfcs.1981.20openalex-snapshot
Irreducibility testing and factorization of polynomials
inferredcites →https://doi.org/10.1109/sfcs.1981.6openalex-snapshot
A fast probabilistic parallel sorting algorithm
inferredcites →https://doi.org/10.1109/sfcs.1982.17openalex-snapshot
Fast parallel matrix and GCD computations
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0209024openalex-snapshot
Probabilistic Algorithms in Finite Fields
inferredcites →https://doi.org/10.1137/0210008openalex-snapshot
Relative to a Random Oracle A , ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
inferredcites →https://doi.org/10.1137/0211027openalex-snapshot
A Scheme for Fast Parallel Communication
inferredcites →https://doi.org/10.1145/322217.322225openalex-snapshot
Fast Probabilistic Algorithms for Verification of Polynomial Identities
inferredcites →https://doi.org/10.1145/322358.322373openalex-snapshot
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.1145/582153.582159openalex-snapshot
Unbounded speed variability in distributed communication systems
inferredcites →https://doi.org/10.1145/800076.802467openalex-snapshot
Distributed algorithms for synchronizing interprocess communication within real time
inferredcites →https://doi.org/10.1145/800105.803405openalex-snapshot
Reducibility, randomness, and intractibility (Abstract)
inferredcites →https://doi.org/10.1145/800113.803631openalex-snapshot
Parallel algorithms for the transitive closure and the connected component problems
inferredcites →https://doi.org/10.1145/800133.804336openalex-snapshot
A unified approach to models of synchronous parallel machines
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.1515/9781400882618-010openalex-snapshot
Computability by Probabilistic Machines
inferredcites →https://doi.org/10.2307/2006975openalex-snapshot
On Distinguishing Prime Numbers from Composite Numbers
inferredcites →https://doi.org/10.2307/2342907openalex-snapshot
An Introduction to Probability Theory and Its Applications.
inferredcites →https://doi.org/10.5169/seals-51742openalex-snapshot
TOWARDS A COMPLEXITY THEORY OF SYNCHRONOUS 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.1007/3-540-16078-7_66openalex-snapshot
Input sensitive, optimal parallel randomized algorithms for addition and identification
inferred← citeshttps://doi.org/10.1007/3-540-18099-0_24openalex-snapshot
Deterministic simulation of idealized parallel computers on more realistic ones
inferred← citeshttps://doi.org/10.1007/bf01758779openalex-snapshot
Expected parallel time and sequential space complexity of graph and digraph problems
inferred← citeshttps://doi.org/10.1007/bf01874396openalex-snapshot
Randomized algorithms: An annotated bibliography
inferred← citeshttps://doi.org/10.1007/bfb0016285openalex-snapshot
The parallel complexity of deadlock detection
inferred← citeshttps://doi.org/10.1007/bfb0018256openalex-snapshot
Non deterministic machines and their generalizations
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90011-xopenalex-snapshot
Speedups of deterministic machines by synchronous parallel machines
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90084-3openalex-snapshot
The parallel complexity of deadlock detection
inferred← citeshttps://doi.org/10.1016/0890-5401(88)90039-9openalex-snapshot
Optimal parallel randomized algorithms for sparse addition and identification
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1109/sfcs.1982.84openalex-snapshot
Parallel time O(log N) acceptance of deterministic CFLs
inferred← citeshttps://doi.org/10.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferred← citeshttps://doi.org/10.1109/sfcs.1985.9openalex-snapshot
An optimal parallel algorithm for integer sorting
inferred← citeshttps://doi.org/10.1137/0216053openalex-snapshot
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
inferred← citeshttps://doi.org/10.1137/0218041openalex-snapshot
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
inferred← citeshttps://doi.org/10.1145/800061.808763openalex-snapshot
Speedups of deterministic machines by synchronous parallel 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.