On the public citation graph
Designing checkers for programs that run in parallel
0 signed · 45 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.1006/inco.1995.1125openalex-snapshot
Efficient Checkers for Number-Theoretic Computations
inferredcites →https://doi.org/10.1007/bf01744431openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1007/bf02122548openalex-snapshot
A random 1-011-011-01algorithm for depth first search
inferredcites →https://doi.org/10.1007/bf02242355openalex-snapshot
Schnelle Multiplikation großer Zahlen
inferredcites →https://doi.org/10.1007/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1007/bf02579264openalex-snapshot
A las vegas rnc algorithm for maximum matching
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1016/0022-0000(85)90015-7openalex-snapshot
Unbounded fan-in circuits and associative functions
inferredcites →https://doi.org/10.1016/0022-0000(88)90027-xopenalex-snapshot
The complexity of parallel search
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/0196-6774(86)90019-2openalex-snapshot
A fast and simple randomized parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1016/0890-5401(89)90036-9openalex-snapshot
Faster optimal parallel prefix sums and list ranking
inferredcites →https://doi.org/10.1109/sfcs.1986.9openalex-snapshot
An optimal randomized parallel algorithm for finding connected components in a graph
inferredcites →https://doi.org/10.1109/sfcs.1987.2openalex-snapshot
A new parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/0217079openalex-snapshot
On Finding Lowest Common Ancestors: Simplification and Parallelization
inferredcites →https://doi.org/10.1145/100216.100225openalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1145/103418.103453openalex-snapshot
Converting high probability into nearly-constant time---with applications to parallel hashing
inferredcites →https://doi.org/10.1145/141914.990672openalex-snapshot
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
inferredcites →https://doi.org/10.1145/160985.161152openalex-snapshot
An NC parallel 3D convex hull algorithm
inferredcites →https://doi.org/10.1145/28395.28430openalex-snapshot
A random NC algorithm for depth first search
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/65950.65958openalex-snapshot
Optimal bounds for decision problems on the CRCW PRAM
inferredcites →https://doi.org/10.1145/72935.72978openalex-snapshot
Optimal parallel algorithms for transitive closure and point location in planar structures
inferredcites →https://doi.org/10.1145/73007.73015openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.2307/2008200openalex-snapshot
Computational Geometry--An Introduction.
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-46632-0_13openalex-snapshot
The Query Complexity of Program Checking by Constant-Depth Circuits
inferred← citeshttps://doi.org/10.1007/3-540-48169-9_19openalex-snapshot
Self-Testing/Correcting Protocols
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_14openalex-snapshot
From Secrecy to Soundness: Efficient Verification via Secure Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_34openalex-snapshot
Locality and Checkability in Wait-Free Computing
inferred← citeshttps://doi.org/10.1007/bfb0054130openalex-snapshot
Fast batch verification for modular exponentiation and digital signatures
inferred← citeshttps://doi.org/10.1007/bfb0054320openalex-snapshot
Batch verification with applications to cryptography and checking
inferred← citeshttps://doi.org/10.1007/s00224-002-1046-6openalex-snapshot
Black-Box Correctness Tests for Basic Parallel Data Structures
inferred← citeshttps://doi.org/10.1007/s00446-013-0188-xopenalex-snapshot
Locality and checkability in wait-free computing
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferred← citeshttps://doi.org/10.1016/j.dam.2003.11.005openalex-snapshot
Problem identification using program checking
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.08.008openalex-snapshot
Pipelined algorithms to detect cheating in long-term grid computations
inferred← citeshttps://doi.org/10.1109/dsn.2004.1311909openalex-snapshot
Does your result checker really check?
inferred← citeshttps://doi.org/10.1109/tse.2002.1027797openalex-snapshot
Watermarking, tamper-proofing, and obfuscation - tools for software protection
inferred← citeshttps://doi.org/10.1145/1374376.1374399openalex-snapshot
A (de)constructive approach to program checking
inferred← citeshttps://doi.org/10.1145/200836.200880openalex-snapshot
Designing programs that check their work
inferred← citeshttps://doi.org/10.1145/237218.237344openalex-snapshot
Checking geometric programs or verification of geometric 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.