On the public citation graph
Relational e-matching
0 signed · 38 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/jcss.1999.1626openalex-snapshot
On the Complexity of Database Queries
inferredcites →https://doi.org/10.1007/978-3-540-73595-3_13openalex-snapshot
Efficient E-Matching for SMT Solvers
inferredcites →https://doi.org/10.1007/978-3-642-28717-6_28openalex-snapshot
E-Matching with Free Variables
inferredcites →https://doi.org/10.1016/j.entcs.2008.04.078openalex-snapshot
E-matching for Fun and Profit
inferredcites →https://doi.org/10.1109/focs.2008.43openalex-snapshot
Size Bounds and Query Plans for Relational Joins
inferredcites →https://doi.org/10.1109/pact.2019.00015openalex-snapshot
Fast Parallel Equivalence Relations in a Datalog Compiler
inferredcites →https://doi.org/10.1145/1066100.1066102openalex-snapshot
Simplify: a theorem prover for program checking
inferredcites →https://doi.org/10.1145/2213556.2213565openalex-snapshot
Worst-Case Optimal Join Algorithms
inferredcites →https://doi.org/10.1145/223784.223848openalex-snapshot
View maintenance in a warehousing environment
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/3385412.3386012openalex-snapshot
Synthesizing structured CAD models with equality saturation and inverse transformations
inferredcites →https://doi.org/10.1145/3434304openalex-snapshot
egg: Fast and extensible equality saturation
inferredcites →https://doi.org/10.1145/3815481openalex-snapshot
egg: Fast and Extensible Equality Saturation
inferredcites →https://doi.org/10.1145/800105.803406openalex-snapshot
Complexity of finitely presented algebras
inferredcites →https://doi.org/10.14778/3342263.3342643openalex-snapshot
Optimizing subgraph queries by combining binary and worst-case optimal joins
inferredcites →https://doi.org/10.14778/3407790.3407797openalex-snapshot
Adopting worst-case optimal joins in relational database systems
inferredcites →https://doi.org/10.48550/arxiv.2101.01332openalex-snapshot
Equality Saturation for Tensor Graph Superoptimization
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-032-40374-2_10openalex-snapshot
PEG for Information Flow: Analysis and Incremental Reasoning
inferred← citeshttps://doi.org/10.1145/3583131.3590346openalex-snapshot
Reducing Overparameterization of Symbolic Regression Models with Equality Saturation
inferred← citeshttps://doi.org/10.1145/3588717openalex-snapshot
Optimizing Tensor Programs on Flexible Storage
inferred← citeshttps://doi.org/10.1145/3591239openalex-snapshot
Better Together: Unifying Datalog and Equality Saturation
inferred← citeshttps://doi.org/10.1145/3623278.3624768openalex-snapshot
Fast Instruction Selection for Fast Digital Signal Processing
inferred← citeshttps://doi.org/10.1145/3632928openalex-snapshot
Flan: An Expressive and Efficient Datalog Compiler for Program Analysis
inferred← citeshttps://doi.org/10.1145/3689801openalex-snapshot
Fast and Optimal Extraction for Sparse Equality Graphs
inferred← citeshttps://doi.org/10.1145/3763050openalex-snapshot
Exploring the Theory and Practice of Concurrency in the Entity-Component-System Pattern
inferred← citeshttps://doi.org/10.1145/3763093openalex-snapshot
Validating SMT Rewriters via Rewrite Space Exploration Supported by Generative Equality Saturation
inferred← citeshttps://doi.org/10.1145/3771775.3786266openalex-snapshot
Parallel and Customizable Equality Saturation
inferred← citeshttps://doi.org/10.1145/3774883openalex-snapshot
Efficient and Effective E-graph-based Logic Optimization
inferred← citeshttps://doi.org/10.14778/3712221.3712232openalex-snapshot
Datalog with First-Class Facts
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.