On the public citation graph
A parallel algorithm for the maximal path problem
0 signed · 29 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/bf02579206openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1007/bf02579407openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferredcites →https://doi.org/10.1016/0020-0190(87)90105-0openalex-snapshot
Parallelism and the maximal path problem
inferredcites →https://doi.org/10.1016/0166-218x(84)90019-2openalex-snapshot
An optimal parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/s0019-9958(85)80041-3openalex-snapshot
A taxonomy of problems with fast parallel algorithms
inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferredcites →https://doi.org/10.1145/28395.383347openalex-snapshot
Matching is as easy as matrix inversion
inferredcites →https://doi.org/10.1145/4221.4226openalex-snapshot
A fast parallel algorithm for the maximal independent set problem
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
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.1995.1087openalex-snapshot
The Complexity of Selecting Maximal Solutions
inferred← citeshttps://doi.org/10.1006/jagm.1993.1009openalex-snapshot
Sublinear-Time Parallel Algorithms for Matching and Related Problems
inferred← citeshttps://doi.org/10.1006/jagm.1993.1046openalex-snapshot
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0005openalex-snapshot
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_153openalex-snapshot
An efficient NC algorithm for finding Hamiltonian cycles in dense directed graphs
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_42openalex-snapshot
Efficient parallel graph algorithms based on open ear decomposition
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_32openalex-snapshot
Randomized Parallel Algorithms for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3282-4openalex-snapshot
Advances in Randomized Parallel Computing
inferred← citeshttps://doi.org/10.1007/bf01762131openalex-snapshot
On finding optimal and near-optimal lineal spanning trees
inferred← citeshttps://doi.org/10.1007/bf02122548openalex-snapshot
A random 1-011-011-01algorithm for depth first search
inferred← citeshttps://doi.org/10.1016/0167-8191(93)90071-ropenalex-snapshot
Efficient parallel graph algorithms based on open ear decomposition
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21935openalex-snapshot
Sublinear-time parallel algorithms for matching and related problems
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21936openalex-snapshot
Optimal parallel algorithm for the Hamiltonian cycle problem on dense graphs
inferred← citeshttps://doi.org/10.1109/spdp.1991.218217openalex-snapshot
New divide-and-conquer techniques for finding disjoint paths
inferred← citeshttps://doi.org/10.1137/0219025openalex-snapshot
Parallel Depth-First Search in General Directed Graphs
inferred← citeshttps://doi.org/10.1145/28395.28430openalex-snapshot
A random NC algorithm for depth first search
inferred← citeshttps://doi.org/10.1145/73007.73035openalex-snapshot
Parallel depth-first search in general directed graphs
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.