On the public citation graph
The input/output complexity of transitive closure
0 signed · 55 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.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1145/28395.28396openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1145/360715.360746openalex-snapshot
A modification of Warshall's algorithm for the transitive closure of binary relations
inferredcites →https://doi.org/10.1145/362248.362272openalex-snapshot
Algorithm 447: efficient algorithms for graph manipulation
inferredcites →https://doi.org/10.1145/362875.362879openalex-snapshot
Organizing matrices and matrix operations for paged memory systems
inferredcites →https://doi.org/10.2307/2003526openalex-snapshot
Mathematical Theory of Connecting Networks and Telephone Traffic
inferredcites →https://doi.org/10.2307/2343633openalex-snapshot
Mathematical Theory of Connecting Networks and Telephone Traffic.
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-44634-6_43openalex-snapshot
On External-Memory Planar Depth First Search
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_1openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/3-540-44985-x_37openalex-snapshot
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_19openalex-snapshot
LEDA-SM: Extending LEDA to Secondary Memory
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_75openalex-snapshot
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_28openalex-snapshot
A Functional Approach to External Graph Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_10openalex-snapshot
External Memory Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-0005-6_9openalex-snapshot
External Memory Data Structures
inferred← citeshttps://doi.org/10.1007/978-1-4757-9805-0_6openalex-snapshot
Graph Clustering and Caching
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_18openalex-snapshot
Turing Machines with Two-Level Memory: A Deep Look into the Input/Output Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-39930-8_29openalex-snapshot
Extended Frontiers in Optimization Techniques
inferred← citeshttps://doi.org/10.1007/bf00872109openalex-snapshot
An efficient database transitive closure algorithm
inferred← citeshttps://doi.org/10.1007/bf01940646openalex-snapshot
Blocking for external graph searching
inferred← citeshttps://doi.org/10.1007/bfb0015411openalex-snapshot
The I/O-complexity of Ordered Binary-Decision Diagram manipulation
inferred← citeshttps://doi.org/10.1007/bfb0020785openalex-snapshot
Efficient memory access in large-scale computation
inferred← citeshttps://doi.org/10.1007/s00224-002-1066-2openalex-snapshot
Bulk Synchronous Parallel Algorithms for the External Memory Model
inferred← citeshttps://doi.org/10.1007/s00453-001-0088-5openalex-snapshot
A Functional Approach to External Graph Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-006-1224-zopenalex-snapshot
R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected Networks
inferred← citeshttps://doi.org/10.1016/j.fss.2005.06.005openalex-snapshot
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.03.015openalex-snapshot
External matrix multiplication and all-pairs shortest path
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.001openalex-snapshot
On external-memory MST, SSSP and multi-way planar graph separation
inferred← citeshttps://doi.org/10.1016/j.parco.2009.12.002openalex-snapshot
Solving path problems on the GPU
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114347openalex-snapshot
Turing machines with two-level memory: New computational models for analyzing the input/output complexity
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00020-5openalex-snapshot
Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
inferred← citeshttps://doi.org/10.1109/69.243510openalex-snapshot
Extending SQL with generalized transitive closure
inferred← citeshttps://doi.org/10.1109/fuzzy.2004.1375408openalex-snapshot
Computationally efficient incremental transitive closure of sparse fuzzy binary relations
inferred← citeshttps://doi.org/10.1109/icc.2001.937037openalex-snapshot
An optimal external selection algorithm and its application in the Internet
inferred← citeshttps://doi.org/10.1109/icde.1992.213213openalex-snapshot
A spanning tree transitive closure algorithm
inferred← citeshttps://doi.org/10.1109/icde.1994.283073openalex-snapshot
A hybrid transitive closure algorithm for sequential and parallel processing
inferred← citeshttps://doi.org/10.1109/ipps.1998.669961openalex-snapshot
Experimental validation of parallel computation models on the Intel Paragon
inferred← citeshttps://doi.org/10.1142/s0219876207001102openalex-snapshot
TWO ALGORITHMS FOR FAST INCREMENTAL TRANSITIVE CLOSURE OF SPARSE FUZZY BINARY RELATIONS
inferred← citeshttps://doi.org/10.1145/153850.153880openalex-snapshot
Blocking for external graph searching
inferred← citeshttps://doi.org/10.1145/1993053.1993056openalex-snapshot
On Computing Deltas of RDF/S Knowledge Bases
inferred← citeshttps://doi.org/10.1145/290409.290412openalex-snapshot
A quantitative comparison of parallel computation models
inferred← citeshttps://doi.org/10.1145/3337821.3337852openalex-snapshot
Solving All-Pairs Shortest-Paths Problem in Large Graphs Using Apache Spark
inferred← citeshttps://doi.org/10.1145/3418356openalex-snapshot
I/O-Efficient Algorithms for Topological Sort and Related Problems
inferred← citeshttps://doi.org/10.1145/384192.384193openalex-snapshot
External memory algorithms and data structures
inferred← citeshttps://doi.org/10.1145/945394.945395openalex-snapshot
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
inferred← citeshttps://doi.org/10.1145/945394.945396openalex-snapshot
Breaking cycles for minimizing crossings
inferred← citeshttps://doi.org/10.1561/9781601981073openalex-snapshot
Algorithms and Data Structures for External Memory
inferred← citeshttps://doi.org/10.22028/d291-25687openalex-snapshot
LEDA-SM: External Memory Algorithms and Data Structures in theory and practice
inferred← citeshttps://doi.org/10.5555/313651.313681openalex-snapshot
External-memory graph algorithms
inferred← citeshttps://doi.org/10.5555/314613.315048openalex-snapshot
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
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.