On the public citation graph
LCA Queries in Directed Acyclic Graphs
0 signed · 35 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/jcom.1993.1014openalex-snapshot
Witnesses for Boolean Matrix Multiplication and for Transitive Closure
inferredcites →https://doi.org/10.1007/bf01940874openalex-snapshot
Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
inferredcites →https://doi.org/10.1016/0020-0190(94)00050-6openalex-snapshot
Finding lowest common ancestors in arbitrarily directed trees
inferredcites →https://doi.org/10.1109/sfcs.1992.267748openalex-snapshot
Witnesses for Boolean matrix multiplication and for shortest paths
inferredcites →https://doi.org/10.1145/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1159/000154222openalex-snapshot
Avoiding Recomputation in Linkage Analysis
inferredcites →https://doi.org/10.2307/1523704openalex-snapshot
The American Journal of Human Genetics
inferredcites →https://doi.org/10.5555/365411.365795openalex-snapshot
Finding least common ancestors in directed acyclic graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11786986_24openalex-snapshot
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_21openalex-snapshot
A Path Cover Technique for LCAs in Dags
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_10openalex-snapshot
A New Combinatorial Approach for Sparse Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_26openalex-snapshot
All-Pairs Ancestor Problems in Weighted Dags
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_25openalex-snapshot
Unique Lowest Common Ancestors in Dags Are Almost as Easy as Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_62openalex-snapshot
Fast Lowest Common Ancestor Computations in Dags
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_37openalex-snapshot
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/s00453-009-9328-xopenalex-snapshot
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9441-xopenalex-snapshot
A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/s00453-012-9742-3openalex-snapshot
On Minimum Witnesses for Boolean Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/s10489-015-0755-xopenalex-snapshot
Taxonomy-based information content and wordnet-wiktionary-wikipedia glosses for semantic relatedness
inferred← citeshttps://doi.org/10.1007/s10489-023-05265-1openalex-snapshot
An effective algorithm for genealogical graph partitioning
inferred← citeshttps://doi.org/10.1007/s11538-025-01419-zopenalex-snapshot
Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.053openalex-snapshot
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.032openalex-snapshot
All-pairs disjoint paths from a common ancestor in O(nω) time
inferred← citeshttps://doi.org/10.1145/1250790.1250876openalex-snapshot
All-pairs bottleneck paths for general graphs in truly sub-cubic time
inferred← citeshttps://doi.org/10.1145/1798596.1798597openalex-snapshot
Finding heaviest H -subgraphs in real weighted graphs, with applications
inferred← citeshttps://doi.org/10.1145/1824777.1824790openalex-snapshot
Nondecreasing paths in a weighted graph or
inferred← citeshttps://doi.org/10.1145/3564246.3585237openalex-snapshot
Fredman’s Trick Meets Dominance Product: Fine-Grained Complexity of Unweighted APSP, 3SUM Counting, and More
inferred← citeshttps://doi.org/10.1145/3717823.3718240openalex-snapshot
All-Pairs Shortest Paths with Few Weights per Node
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2021.76openalex-snapshot
Constructing a Distance Sensitivity Oracle in $O(n^{2.5794}M)$ Time
inferred← citeshttps://doi.org/10.48550/arxiv.2007.08914openalex-snapshot
All-Pairs LCA in DAGs: Breaking through the $O(n^{2.5})$ barrier
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0609009openalex-snapshot
Finding heaviest H-subgraphs in real weighted graphs, with applications
inferred← citeshttps://doi.org/10.5555/1283383.1283488openalex-snapshot
All-pairs bottleneck paths in vertex weighted graphs
inferred← citeshttps://doi.org/10.70675/18ce7a23z98c1z4e42z8548zb14f02e6965bopenalex-snapshot
Recherche de similarité dans du code source
inferred← citeshttps://doi.org/10.82444/warw.33495880openalex-snapshot
Finding a heaviest triangle is not harder than matrix multiplication
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.