On the public citation graph
Succinctness of pattern-based schema languages for XML
0 signed · 24 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/inco.1997.2695openalex-snapshot
One-Unambiguous Regular Languages
inferredcites →https://doi.org/10.1016/0020-0190(96)00095-6openalex-snapshot
A lower bound technique for the size of nondeterministic finite automata
inferredcites →https://doi.org/10.1016/0304-3975(93)90287-4openalex-snapshot
Regular expressions into finite automata
inferredcites →https://doi.org/10.1145/1065167.1065182openalex-snapshot
Security analysis of cryptographically controlled access to XML documents
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/2071368.2071372openalex-snapshot
Succinctness of the Complement and Intersection of Regular Expressions
inferredcites →https://doi.org/10.1145/335168.335173openalex-snapshot
DTD inference for views of XML data
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
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-319-21500-6_29openalex-snapshot
On the Complexity of k-Piecewise Testability and the Depth of Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-44406-2_38openalex-snapshot
Simplify the Design of XML Schemas by Type Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_16openalex-snapshot
Efficient Separability of Regular Languages by Subsequences and Suffixes
inferred← citeshttps://doi.org/10.1007/s00224-012-9428-xopenalex-snapshot
Generating, Sampling and Counting Subclasses of Regular Tree Languages
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.01.009openalex-snapshot
Simplifying XML Schema: Single-type approximations of regular tree languages
inferred← citeshttps://doi.org/10.1145/1938551.1938559openalex-snapshot
Generating, sampling and counting subclasses of regular tree languages
inferred← citeshttps://doi.org/10.1145/2071368.2071372openalex-snapshot
Succinctness of the Complement and Intersection of Regular Expressions
inferred← citeshttps://doi.org/10.14778/2367502.2367556openalex-snapshot
Developing and analyzing XSDs through BonXai
inferred← citeshttps://doi.org/10.48550/arxiv.0802.2869openalex-snapshot
Succinctness of the Complement and Intersection of Regular Expressions
inferred← citeshttps://doi.org/10.48550/arxiv.1412.1641openalex-snapshot
On $k$-piecewise testability (preliminary report)
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.