On the public citation graph
A parallel search algorithm for directed acyclic graphs
0 signed · 57 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/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1016/0010-4485(77)90049-5openalex-snapshot
Fundamentals of data-structures
inferredcites →https://doi.org/10.1109/t-c.1973.223593openalex-snapshot
On the Parallel Evaluation of Polynomials
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferredcites →https://doi.org/10.1137/0207020openalex-snapshot
Parallel Computations in Graph Theory
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
inferredcites →https://doi.org/10.1137/0211024openalex-snapshot
Parallel Algorithms in Graph Theory: Planarity Testing
inferredcites →https://doi.org/10.1145/358628.358650openalex-snapshot
Efficient parallel algorithms for some graph problems
inferredcites →https://doi.org/10.1145/361020.361216openalex-snapshot
Merging with parallel processors
inferredcites →https://doi.org/10.1147/rd.182.0138openalex-snapshot
Parallel Solution of Recurrence Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119750673.ch9openalex-snapshot
Diatom Morphospaces, Tree Spaces and Lineage Crown Groups
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.1996.0820openalex-snapshot
Parallel Algorithms for Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1007/3-540-18740-5_79openalex-snapshot
Randomized parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_97openalex-snapshot
Parallel Breadth-first and Breadth-depth traversals of general trees
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-4684-5511-3_11openalex-snapshot
Randomized Parallel Computation
inferred← citeshttps://doi.org/10.1007/978-1-4684-5511-3_8openalex-snapshot
Fast Parallel Algorithms for Reducible Flow Graphs
inferred← citeshttps://doi.org/10.1007/bf01933745openalex-snapshot
A note on parallel depth first search
inferred← citeshttps://doi.org/10.1007/bf01935049openalex-snapshot
Parallel algorithms for analyzing activity networks
inferred← citeshttps://doi.org/10.1007/bf02122548openalex-snapshot
A random 1-011-011-01algorithm for depth first search
inferred← citeshttps://doi.org/10.1007/bfb0040373openalex-snapshot
All graphs have cycle separators and planar directed depth-first search is in DNC
inferred← citeshttps://doi.org/10.1007/s00605-022-01681-6openalex-snapshot
Criterion for a graph to admit a good orientation in terms of leaf blocks
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90172-xopenalex-snapshot
A parallel algorithm for recognizing unordered depth-first search
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90214-3openalex-snapshot
A unified approach to parallel depth-first traversals of general trees
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90088-4openalex-snapshot
Parallel search algorithms for graphs and trees
inferred← citeshttps://doi.org/10.1016/0167-8191(90)90151-xopenalex-snapshot
Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90033-copenalex-snapshot
A model classifying algorithms as inherently sequential with applications to graph searching
inferred← citeshttps://doi.org/10.1051/ita/2010016openalex-snapshot
Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search
inferred← citeshttps://doi.org/10.1080/00207168408803413openalex-snapshot
Parallel breadth-first search algorithms for trees and graphs
inferred← citeshttps://doi.org/10.1080/00207168608803490openalex-snapshot
Parallel algorithms for connectivity problems in graph theory
inferred← citeshttps://doi.org/10.1080/03772063.1987.11436659openalex-snapshot
Efficient Boolean Matrix and Graph Algorithms on a Bounded Parallel Computation Model
inferred← citeshttps://doi.org/10.1109/eurcon.2009.5167663openalex-snapshot
Towards truly parallel model transformations: A distributed pattern matching approach
inferred← citeshttps://doi.org/10.1109/icist.2017.7926776openalex-snapshot
A new parallel algorithm for monotone circuit value problem with bounded genus
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00095openalex-snapshot
Accelerating Sparse Linear Solvers on Intelligence Processing Units
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.18openalex-snapshot
Parallelization of Recursive Preorder Traversal Based on Building and Winding Call Stacks
inferred← citeshttps://doi.org/10.1109/secon.1991.147799openalex-snapshot
Cost-optimal parallel algorithms for traversing trees
inferred← citeshttps://doi.org/10.1109/secon.1991.147822openalex-snapshot
NC algorithms for finding depth-first-search trees in interval graphs and circular-arc graphs
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/spdp.1990.143654openalex-snapshot
The parallel complexity of queue versus stack breadth-first search
inferred← citeshttps://doi.org/10.1109/tbdata.2018.2841363openalex-snapshot
A Stack-Centric Processing Model For Iterative Processing
inferred← citeshttps://doi.org/10.1137/0219025openalex-snapshot
Parallel Depth-First Search in General Directed Graphs
inferred← citeshttps://doi.org/10.1145/1244002.1244301openalex-snapshot
Verification of web service descriptions using graph-based traversal algorithms
inferred← citeshttps://doi.org/10.1145/28395.28430openalex-snapshot
A random NC algorithm for depth first search
inferred← citeshttps://doi.org/10.1145/3087556.3087576openalex-snapshot
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3149704.3149764openalex-snapshot
Parallel Depth-First Search for Directed Acyclic Graphs
inferred← citeshttps://doi.org/10.1145/3364212openalex-snapshot
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs
inferred← citeshttps://doi.org/10.1145/3774934.3786457openalex-snapshot
DiggerBees: Depth First Search Leveraging Hierarchical Block-Level Stealing on GPUs
inferred← citeshttps://doi.org/10.1145/378741.378761openalex-snapshot
Parallel implementation of an efficient microcode compaction algorithm
inferred← citeshttps://doi.org/10.1145/73007.73035openalex-snapshot
Parallel depth-first search in general directed graphs
inferred← citeshttps://doi.org/10.17877/de290r-3335openalex-snapshot
Large scale parallel state space search utilizing graphics processing units and solid state disks
inferred← citeshttps://doi.org/10.25439/rmt.27581304openalex-snapshot
Discovery and validation for composite services on the semantic web
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.