On the public citation graph

BonXai

0 signed · 39 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.2695openalex-snapshot
One-Unambiguous Regular Languages
inferredcites →https://doi.org/10.1007/978-3-642-22321-1_12openalex-snapshot
Generalized One-Unambiguity
inferredcites →https://doi.org/10.1007/978-3-642-32589-2_56openalex-snapshot
Descriptional Complexity of Deterministic Regular Expressions
inferredcites →https://doi.org/10.1007/978-3-642-39212-2_16openalex-snapshot
Efficient Separability of Regular Languages by Subsequences and Suffixes
inferredcites →https://doi.org/10.1007/978-3-642-40313-2_64openalex-snapshot
Separating Regular Languages by Piecewise Testable and Unambiguous Languages
inferredcites →https://doi.org/10.1016/j.jcss.2006.10.021openalex-snapshot
On the minimization of XML Schemas and tree automata for unranked trees
inferredcites →https://doi.org/10.1016/j.jcss.2010.04.008openalex-snapshot
Succinctness of pattern-based schema languages for XML
inferredcites →https://doi.org/10.1016/s0022-0000(76)80034-7openalex-snapshot
Complexity measures for regular expressions
inferredcites →https://doi.org/10.1145/1017074.1017095openalex-snapshot
DTDs versus XML schema
inferredcites →https://doi.org/10.1145/1060745.1060848openalex-snapshot
Expressiveness of XSDs
inferredcites →https://doi.org/10.1145/1111627.1111631openalex-snapshot
Taxonomy of XML schema languages using formal language theory
inferredcites →https://doi.org/10.1145/1166074.1166076openalex-snapshot
Expressiveness and complexity of XML Schema
inferredcites →https://doi.org/10.1145/1265530.1265552openalex-snapshot
The complexity of reasoning about pattern-based XML schemas
inferredcites →https://doi.org/10.1145/1324185.1324188openalex-snapshot
Simple off the shelf abstractions for XML schema
inferredcites →https://doi.org/10.1145/1559845.1559922openalex-snapshot
Simplifying XML schema
inferredcites →https://doi.org/10.1145/1735886.1735890openalex-snapshot
Inference of concise regular expressions and DTDs
inferredcites →https://doi.org/10.1145/2745754.2745774openalex-snapshot
BonXai
inferredcites →https://doi.org/10.1145/2806416.2806434openalex-snapshot
Efficient Incremental Evaluation of Succinct Regular Expressions
inferredcites →https://doi.org/10.1145/3105960openalex-snapshot
BonXai
inferredcites →https://doi.org/10.1145/321239.321249openalex-snapshot
Derivatives of Regular Expressions
inferredcites →https://doi.org/10.1145/988672.988695openalex-snapshot
Schemapath, a minimal extension to xml schema for conditional constraints
inferredcites →https://doi.org/10.14778/2367502.2367556openalex-snapshot
Developing and analyzing XSDs through BonXai
inferredcites →https://doi.org/10.4230/lipics.icdt.2015.230openalex-snapshot
Separability by Short Subsequences and Subwords

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-75765-6_25openalex-snapshot
Learning Finite Automata with Shuffle
inferred← citeshttps://doi.org/10.1007/978-3-031-00123-9_41openalex-snapshot
Membership Algorithm for Single-Occurrence Regular Expressions with Shuffle and Counting
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_14openalex-snapshot
Validating Streaming JSON Documents with Learned VPAs
inferred← citeshttps://doi.org/10.1016/j.datak.2018.02.005openalex-snapshot
A hybrid logic for XML reference constraints
inferred← citeshttps://doi.org/10.1093/comjnl/bxac037openalex-snapshot
Learning Disjunctive Multiplicity Expressions and Disjunctive Generalize Multiplicity Expressions From Both Positive and Negative Examples
inferred← citeshttps://doi.org/10.1145/3184558.3186963openalex-snapshot
Chisel
inferred← citeshttps://doi.org/10.1145/3331076.3331100openalex-snapshot
An effective algorithm for learning single occurrence regular expressions with interleaving
inferred← citeshttps://doi.org/10.1145/3331446openalex-snapshot
Dichotomies for Evaluating Simple Regular Path Queries
inferred← citeshttps://doi.org/10.1145/3448016.3457561openalex-snapshot
PG-Keys: Keys for Property Graphs
inferred← citeshttps://doi.org/10.1145/3517804.3526066openalex-snapshot
Towards Theory for Real-World Data
inferred← citeshttps://doi.org/10.1145/3696410.3714694openalex-snapshot
Common Foundations for SHACL, ShEx, and PG-Schema
inferred← citeshttps://doi.org/10.14778/3750601.3750617openalex-snapshot
When Entity/Relationship Models Meet Graph Databases
inferred← citeshttps://doi.org/10.1520/jte20200179openalex-snapshot
RETRACTED: Multimedia Teaching in Teaching of College English Reading
inferred← citeshttps://doi.org/10.20537/vm190311openalex-snapshot
An approach to designing a substitution language for generating electronic documents containing complex tables
inferred← citeshttps://doi.org/10.6007/ijarped/v9-i2/7183openalex-snapshot
Model-View-Controller based Context Visualization Method for Multimedia English Teaching System: A Case Study of Multimedia Technology Teaching
showing the first 15 of 16 · page through all 16
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.