On the public citation graph

https://doi.org/10.4086/toc.2012.v008a004

0 signed · 90 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1997.2620openalex-snapshot
All Pairs Shortest Distances for Graphs with Small Integer Length Edges
inferredcites →https://doi.org/10.1006/jagm.1994.1005openalex-snapshot
The Algorithmic Aspects of the Regularity Lemma
inferredcites →https://doi.org/10.1006/jcss.1995.1065openalex-snapshot
Clique Partitions, Graph Compression and Speeding-Up Algorithms
inferredcites →https://doi.org/10.1006/jcss.1995.1078openalex-snapshot
On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs
inferredcites →https://doi.org/10.1007/3-540-13866-8openalex-snapshot
How to Multiply Matrices Faster
inferredcites →https://doi.org/10.1007/3-540-36136-7openalex-snapshot
Algorithms and Computation
inferredcites →https://doi.org/10.1007/3-540-36136-7_44openalex-snapshot
A Geometric Approach to Boolean Matrix Multiplication
inferredcites →https://doi.org/10.1007/3-540-49543-6_18openalex-snapshot
Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract)
inferredcites →https://doi.org/10.1007/978-3-540-70575-8openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_10openalex-snapshot
A New Combinatorial Approach for Sparse Graph Problems
inferredcites →https://doi.org/10.1007/bf02165411openalex-snapshot
Gaussian elimination is not optimal
inferredcites →https://doi.org/10.1007/pl00001621openalex-snapshot
Lower bounds of tower type for Szemerédi's uniformity lemma
inferredcites →https://doi.org/10.1007/s00039-005-0509-8openalex-snapshot
A Szemerédi-type regularity lemma in abelian groups, with applications
inferredcites →https://doi.org/10.1007/s00039-007-0599-6openalex-snapshot
Szemerédi’s Lemma for the Analyst
inferredcites →https://doi.org/10.1007/s00453-010-9401-5openalex-snapshot
On Dynamic Shortest Paths Problems
inferredcites →https://doi.org/10.1007/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferredcites →https://doi.org/10.1007/s004930070001openalex-snapshot
Efficient Testing of Large Graphs
inferredcites →https://doi.org/10.1007/s11856-011-0061-1openalex-snapshot
An improved construction of progression-free sets
inferredcites →https://doi.org/10.1007/s11856-011-0080-yopenalex-snapshot
A removal lemma for systems of linear equations over finite fields
inferredcites →https://doi.org/10.1016/0020-0190(88)90130-5openalex-snapshot
A practical algorithm for boolean matrix multiplication
inferredcites →https://doi.org/10.1016/0925-7721(95)00022-2openalex-snapshot
On a class of O(n2) problems in computational geometry
inferredcites →https://doi.org/10.1016/s0019-9958(73)90228-3openalex-snapshot
A fast expected time algorithm for Boolean matrix multiplication and transitive closure
inferredcites →https://doi.org/10.1016/s0019-9958(85)80024-3openalex-snapshot
Fast recognition of pushdown automaton and context-free languages
inferredcites →https://doi.org/10.1016/s0022-0000(75)80046-8openalex-snapshot
General context-free recognition in less than cubic time
inferredcites →https://doi.org/10.1090/s0025-5718-66-99935-2openalex-snapshot
A Matrix Reduction Problem
inferredcites →https://doi.org/10.1109/focs.2010.67openalex-snapshot
Subcubic Equivalences between Path, Matrix and Triangle Problems
inferredcites →https://doi.org/10.1109/sfcs.1996.548459openalex-snapshot
The regularity lemma and approximation schemes for dense problems
inferredcites →https://doi.org/10.1109/sfcs.1996.548504openalex-snapshot
All pairs almost shortest paths
inferredcites →https://doi.org/10.1109/sfcs.2003.1238217openalex-snapshot
A group-theoretic approach to fast matrix multiplication
inferredcites →https://doi.org/10.1109/sfcs.2005.39openalex-snapshot
Group-theoretic Algorithms for Matrix Multiplication
inferredcites →https://doi.org/10.1109/sffcs.1999.814635openalex-snapshot
All pairs shortest paths in undirected graphs with integer weights
inferredcites →https://doi.org/10.1109/swat.1971.4openalex-snapshot
Boolean matrix multiplication and transitive closure
inferredcites →https://doi.org/10.1109/tpds.2002.1058095openalex-snapshot
Recursive array layouts and fast matrix multiplication
inferredcites →https://doi.org/10.1137/0203011openalex-snapshot
An Algorithm for the Computation of Linear Forms
inferredcites →https://doi.org/10.1137/0207033openalex-snapshot
Finding a Minimum Circuit in a Graph
inferredcites →https://doi.org/10.1137/060667177openalex-snapshot
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
inferredcites →https://doi.org/10.1137/080730160openalex-snapshot
An Efficient Sparse Regularity Concept
inferredcites →https://doi.org/10.1137/s0097539702408223openalex-snapshot
An Optimal Algorithm for Checking Regularity
inferredcites →https://doi.org/10.1137/s0097539704441629openalex-snapshot
Approximating the Cut-Norm via Grothendieck's Inequality
inferredcites →https://doi.org/10.1137/s0097539793247634openalex-snapshot
A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph
inferredcites →https://doi.org/10.1137/s0097539796303421openalex-snapshot
Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
inferredcites →https://doi.org/10.1145/1008591.1008593openalex-snapshot
The four Russians' algorithm for boolean matrix multiplication is optimal in its class
inferredcites →https://doi.org/10.1145/1132516.1132556openalex-snapshot
Graph limits and parameter testing
inferredcites →https://doi.org/10.1145/1250790.1250862openalex-snapshot
Property testing in hypergraphs and the removal lemma
inferredcites →https://doi.org/10.1145/1250790.1250877openalex-snapshot
More algorithms for all-pairs shortest paths in weighted graphs
inferredcites →https://doi.org/10.1145/1536414.1536438openalex-snapshot
Green's conjecture and testing linear-invariant properties
inferredcites →https://doi.org/10.1145/1644001.1644010openalex-snapshot
Algorithm 898
inferredcites →https://doi.org/10.1145/1806689.1806772openalex-snapshot
Towards polynomial lower bounds for dynamic problems
inferredcites →https://doi.org/10.1145/2213977.2214056openalex-snapshot
Multiplying matrices faster than coppersmith-winograd
inferredcites →https://doi.org/10.1145/505241.505242openalex-snapshot
Fast context-free grammar parsing requires fast boolean matrix multiplication
inferredcites →https://doi.org/10.1145/62212.62228openalex-snapshot
On the communication complexity of graph properties
inferredcites →https://doi.org/10.4007/annals.2011.174.1.17openalex-snapshot
A new proof of the graph removal lemma
inferredcites →https://doi.org/10.4086/toc.2011.v007a006openalex-snapshot
inferredcites →https://doi.org/10.48550/arxiv.math/0310476openalex-snapshot
A Szemeredi-type regularity lemma in abelian groups, with applications
inferredcites →https://doi.org/10.5555/1283383.1283490openalex-snapshot
Matrix-vector multiplication in sub-quadratic time: (some preprocessing required)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-18126-0_14openalex-snapshot
Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases
inferred← citeshttps://doi.org/10.1007/978-3-031-20643-6_16openalex-snapshot
Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries
inferred← citeshttps://doi.org/10.1007/978-3-031-55598-5_13openalex-snapshot
Faster Combinatorial k-Clique Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_5openalex-snapshot
Self-assembly of Strings and Languages Revisited: Efficiently Deciding Closure Under Self-assembly
inferred← citeshttps://doi.org/10.1007/978-3-032-31348-5_26openalex-snapshot
Self-assembly of Strings and Languages Revisited: Efficient Membership Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-07566-2_25openalex-snapshot
On Hardness of Several String Indexing Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_6openalex-snapshot
3D Rectangulations and Geometric Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_13openalex-snapshot
Quantum Complexity of Boolean Matrix Multiplication and Related Problems
inferred← citeshttps://doi.org/10.1007/s00446-020-00373-4openalex-snapshot
Fooling views: a new lower bound technique for distributed computations under congestion
inferred← citeshttps://doi.org/10.1007/s00453-016-0247-3openalex-snapshot
3D Rectangulations and Geometric Matrix Multiplication
inferred← citeshttps://doi.org/10.1007/s00453-018-0526-2openalex-snapshot
Mind the Gap!
inferred← citeshttps://doi.org/10.1007/s00453-021-00851-6openalex-snapshot
A Comparative Study of Dictionary Matching with Gaps: Limitations, Techniques and Challenges
inferred← citeshttps://doi.org/10.1016/j.jcss.2020.12.004openalex-snapshot
Pushing the Online Boolean Matrix-vector Multiplication conjecture off-line and identifying its easy cases
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.03.026openalex-snapshot
On hardness of several string indexing problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.10.011openalex-snapshot
Data structures for categorical path counting queries
inferred← citeshttps://doi.org/10.1109/focs.2014.31openalex-snapshot
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
inferred← citeshttps://doi.org/10.1137/1.9781611975482.1openalex-snapshot
Fine-grained Complexity Meets IP = PSPACE
inferred← citeshttps://doi.org/10.1137/15m1024524openalex-snapshot
Faster All-Pairs Shortest Paths via Circuit Complexity
inferred← citeshttps://doi.org/10.1137/21m1418654openalex-snapshot
From Circuit Complexity to Faster All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1137/25m1806855openalex-snapshot
Spreadness Implies Mixing: A New Variant of Structure vs. Randomness
inferred← citeshttps://doi.org/10.1145/2591796.2591811openalex-snapshot
Faster all-pairs shortest paths via circuit complexity
inferred← citeshttps://doi.org/10.1145/2746539.2746568openalex-snapshot
Clustered Integer 3SUM via Additive Combinatorics
inferred← citeshttps://doi.org/10.1145/2746539.2746609openalex-snapshot
Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
inferred← citeshttps://doi.org/10.1145/3087801.3087811openalex-snapshot
Triangle Finding and Listing in CONGEST Networks
inferred← citeshttps://doi.org/10.1145/3186893openalex-snapshot
Subcubic Equivalences Between Path, Matrix, and Triangle Problems
inferred← citeshttps://doi.org/10.1145/3519935.3520036openalex-snapshot
Tight dynamic problem lower bounds from generalized BMM and OMv
inferred← citeshttps://doi.org/10.1145/3519935.3520066openalex-snapshot
Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond
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/3618260.3649696openalex-snapshot
New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1145/3717823.3718244openalex-snapshot
Error-Correction of Matrix Multiplication Algorithms
inferred← citeshttps://doi.org/10.1145/3798129.3800854openalex-snapshot
Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2018.23openalex-snapshot
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication
inferred← citeshttps://doi.org/10.48550/arxiv.1312.6680openalex-snapshot
Faster all-pairs shortest paths via circuit complexity
inferred← citeshttps://doi.org/10.48550/arxiv.1909.01554openalex-snapshot
Engineering Boolean Matrix Multiplication for Multiple-Accelerator Shared-Memory Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.2004.13086openalex-snapshot
Computing the Boolean product of two n\times n Boolean matrices using O(n^2) mechanical operation
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.